Остановите войну!
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 23 matches
- 2002
- Vincent Bouchitté, Ioan Todinca:
Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1-2): 17-32 (2002) - Gruia Calinescu, Peng-Jun Wan:
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theor. Comput. Sci. 276(1-2): 33-50 (2002) - Chiuyuan Chen:
A necessary condition for a graph to be the visibility graph of a simple polygon. Theor. Comput. Sci. 276(1-2): 417-424 (2002) - Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276(1-2): 315-354 (2002) - Robert Cori, Dominique Rossin, Bruno Salvy:
Polynomial ideals for sandpiles and their Gröbner bases. Theor. Comput. Sci. 276(1-2): 1-15 (2002) - Erzsébet Csuhaj-Varjú, György Vaszil:
Parallel communicating grammar systems with bounded resources. Theor. Comput. Sci. 276(1-2): 205-219 (2002) - Stefan Droste, Thomas Jansen, Ingo Wegener:
On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2): 51-81 (2002) - Henning Fernau, Ralf Stiebe:
Sequential grammars and automata with valences. Theor. Comput. Sci. 276(1-2): 377-405 (2002) - Zoltán Fülöp, Alain Terlutte:
Iterated relabeling tree transducers. Theor. Comput. Sci. 276(1-2): 221-244 (2002) - Vesa Halava, Tero Harju, Mika Hirvensalo:
Binary (generalized) Post Correspondence Problem. Theor. Comput. Sci. 276(1-2): 183-204 (2002) - Jacques Justin, Giuseppe Pirillo:
Episturmian words and episturmian morphisms. Theor. Comput. Sci. 276(1-2): 281-313 (2002) - Stavros Konstantinidis, Amber O'Hearn:
Error-detecting properties of languages. Theor. Comput. Sci. 276(1-2): 355-375 (2002) - Bin Ma, Lusheng Wang, Kaizhong Zhang:
Computing similarity between RNA structures. Theor. Comput. Sci. 276(1-2): 111-132 (2002) - Subhamoy Maitra, Palash Sarkar:
Cryptographically significant Boolean functions with five valued Walsh spectra. Theor. Comput. Sci. 276(1-2): 133-146 (2002) - Gregorio Malajovich:
Lower bounds for some decision problems over C. Theor. Comput. Sci. 276(1-2): 425-434 (2002) - David F. Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Hard variants of stable marriage. Theor. Comput. Sci. 276(1-2): 261-279 (2002) - Harumichi Nishimura, Masanao Ozawa:
Computational complexity of uniform quantum circuit families and quantum Turing machines. Theor. Comput. Sci. 276(1-2): 147-181 (2002) - Christophe Prieur:
How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 276(1-2): 445-447 (2002) - J. M. Robson:
Constant bounds on the moments of the height of binary search trees. Theor. Comput. Sci. 276(1-2): 435-444 (2002) - Kai Salomaa, Sheng Yu:
Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276(1-2): 245-259 (2002) - Amber Settle, Janos Simon:
Smaller solutions for the firing squad. Theor. Comput. Sci. 276(1-2): 83-109 (2002) - Vladimir V. V'yugin:
Does snooping help? Theor. Comput. Sci. 276(1-2): 407-415 (2002) - Yongge Wang:
A comparison of two approaches to pseudorandomness. Theor. Comput. Sci. 276(1-2): 449-459 (2002)
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-04-25 09:16 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