Остановите войну!
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 22 matches
- 2000
- Vikraman Arvind, N. V. Vinodchandran:
The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000) - Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil:
PSPACE-complete problems for subgroups of free groups and inverse finite automata. Theor. Comput. Sci. 242(1-2): 247-281 (2000) - Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Finite nondeterministic automata: Simulation and minimality. Theor. Comput. Sci. 242(1-2): 219-235 (2000) - Pascal Caron:
Families of locally testable languages. Theor. Comput. Sci. 242(1-2): 361-376 (2000) - Martha Escobar-Molano, Shahram Ghandeharizadeh:
On the complexity of coordinated display of multimedia objects. Theor. Comput. Sci. 242(1-2): 169-197 (2000) - Pál Gyenizse, Sándor Vágvölgyi:
A property of left-linear rewrite systems preserving recognizability. Theor. Comput. Sci. 242(1-2): 477-498 (2000) - Friedrich Hubalek:
On the variance of the internal path length of generalized digital trees - The Mellin convolution approach. Theor. Comput. Sci. 242(1-2): 143-168 (2000) - Pascal Hubert:
Suites équilibrées. Theor. Comput. Sci. 242(1-2): 91-108 (2000) - Hsien-Kuei Hwang, Bo-Yin Yang, Yeong-Nan Yeh:
Presorting algorithms: An average-case point of view. Theor. Comput. Sci. 242(1-2): 29-40 (2000) - Lucian Ilie:
On lengths of words in context-free languages. Theor. Comput. Sci. 242(1-2): 327-359 (2000) - Samir Khuller, Robert Pless, Yoram J. Sussmann:
Fault tolerant K-center problems. Theor. Comput. Sci. 242(1-2): 237-245 (2000) - Sarit Kraus, Tatjana L. Plotkin:
Algorithms of distributed task allocation for cooperative agents. Theor. Comput. Sci. 242(1-2): 1-27 (2000) - Antonín Kucera:
Effective decomposability of sequential behaviours. Theor. Comput. Sci. 242(1-2): 71-89 (2000) - Hing Leung, Detlef Wotschke:
On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242(1-2): 59-69 (2000) - G. S. Makanin, Tatiana A. Makanina:
Parametrisation of solutions of parametric equation in free monoid. Theor. Comput. Sci. 242(1-2): 403-475 (2000) - Conrado Martínez, Salvador Roura:
On the competitiveness of the move-to-front rule. Theor. Comput. Sci. 242(1-2): 313-325 (2000) - Klaus Meer:
Counting problems over the reals. Theor. Comput. Sci. 242(1-2): 41-58 (2000) - Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Strip tiling and regular grammars. Theor. Comput. Sci. 242(1-2): 109-124 (2000) - Martin Mundhenk:
On hard instances. Theor. Comput. Sci. 242(1-2): 301-311 (2000) - Priti Shankar, Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan:
A new algorithm for linear regular tree pattern matching. Theor. Comput. Sci. 242(1-2): 125-142 (2000) - Drew Vandeth:
Sturmian words and words with a critical exponent. Theor. Comput. Sci. 242(1-2): 283-300 (2000) - Biing-Feng Wang:
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. Theor. Comput. Sci. 242(1-2): 377-401 (2000)
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-06-01 04:40 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