Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2006
- Fredrick Arnold, Benjamin Steinberg:
Synchronizing groups and automata. Theor. Comput. Sci. 359(1-3): 101-110 (2006) - József Balogh, Dhruv Mubayi, András Pluhár:
On the edge-bandwidth of graph products. Theor. Comput. Sci. 359(1-3): 43-57 (2006) - André Barbé, Fritz von Haeseler:
Averages of automatic sequences. Theor. Comput. Sci. 359(1-3): 255-281 (2006) - Anders Björner, Bruce E. Sagan:
Rationality of the Möbius function of a composition poset. Theor. Comput. Sci. 359(1-3): 282-298 (2006) - Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong:
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. Theor. Comput. Sci. 359(1-3): 430-439 (2006) - Chiuyuan Chen, James K. Lan, Wen-Shiang Tang:
An efficient algorithm to find a double-loop network that realizes a given L-shape. Theor. Comput. Sci. 359(1-3): 69-76 (2006) - Liviu Petrisor Dinu, Florin Manea:
An efficient approach for the rank aggregation problem. Theor. Comput. Sci. 359(1-3): 455-461 (2006) - Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. 359(1-3): 123-132 (2006) - Pavlos S. Efraimidis, Paul G. Spirakis:
Approximation schemes for scheduling and covering on unrelated machines. Theor. Comput. Sci. 359(1-3): 400-417 (2006) - Leah Epstein, Asaf Levin:
The conference call search problem in wireless networks. Theor. Comput. Sci. 359(1-3): 418-429 (2006) - Bruno Escoffier, Vangelis Th. Paschos:
Completeness in approximation classes beyond APX. Theor. Comput. Sci. 359(1-3): 369-377 (2006) - Gabriele Fici, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1-3): 214-230 (2006) - Vijay K. Garg:
Algorithmic combinatorics based on slicing posets. Theor. Comput. Sci. 359(1-3): 200-213 (2006) - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) - Pawel Górecki, Jerzy Tiuryn:
DLS-trees: A model of evolutionary scenarios. Theor. Comput. Sci. 359(1-3): 378-399 (2006) - Xiaoyang Gu:
A note on dimensions of polynomial size circuits. Theor. Comput. Sci. 359(1-3): 176-187 (2006) - Frank Gurski, Egon Wanke:
Vertex disjoint paths on clique-width bounded graphs. Theor. Comput. Sci. 359(1-3): 188-199 (2006) - Peter M. Higgins, Christopher J. Saker:
Unavoidable sets. Theor. Comput. Sci. 359(1-3): 231-238 (2006) - Matthias Homeister:
Lower bounds for restricted read-once parity branching programs. Theor. Comput. Sci. 359(1-3): 1-14 (2006) - Teturo Kamae, Hui Rao, Yu-Mei Xue:
Maximal pattern complexity of two-dimensional words. Theor. Comput. Sci. 359(1-3): 15-27 (2006) - Christian Lavault, Guy Louchard:
Asymptotic analysis of a leader election algorithm. Theor. Comput. Sci. 359(1-3): 239-254 (2006) - Anton Leykin, Jan Verschelde, Ailing Zhao:
Newton's method with deflation for isolated singularities of polynomial systems. Theor. Comput. Sci. 359(1-3): 111-122 (2006) - Carl S. McTague, James P. Crutchfield:
Automated pattern detection - An algorithm for constructing optimally synchronizing multi-regular language filters. Theor. Comput. Sci. 359(1-3): 306-328 (2006) - Markus E. Nebel:
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci. 359(1-3): 329-343 (2006) - Sonia Pérez-Díaz, Juana Sendra, J. Rafael Sendra:
Distance bounds of epsilon-points on hypersurfaces. Theor. Comput. Sci. 359(1-3): 344-368 (2006) - Boris Ryabko, Jaakko Astola, Alex Gammerman:
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series. Theor. Comput. Sci. 359(1-3): 440-448 (2006) - Taizo Sadahiro:
Multiple points of tilings associated with Pisot numeration systems. Theor. Comput. Sci. 359(1-3): 133-147 (2006) - Sándor Szabó:
Completing codes and the Rédei property of groups. Theor. Comput. Sci. 359(1-3): 449-454 (2006) - Ferucio Laurentiu Tiplea, Aurora Tiplea:
Petri net reactive modules. Theor. Comput. Sci. 359(1-3): 77-100 (2006) - Yves F. Verhoeven:
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem. Theor. Comput. Sci. 359(1-3): 58-68 (2006)
skipping 2 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-04 05:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint