Остановите войну!
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
- 2003
- Andris Ambainis, Arnolds Kikusts:
Exact results for accepting probabilities of quantum automata. Theor. Comput. Sci. 295: 3-25 (2003) - Albert Atserias:
Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. Theor. Comput. Sci. 295: 27-39 (2003) - Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Reachability problems for sequential dynamical systems with threshold functions. Theor. Comput. Sci. 295: 41-64 (2003) - Markus Bläser:
The complexity of bivariate power series arithmetic. Theor. Comput. Sci. 295: 65-83 (2003) - Ahmed Bouajjani, Peter Habermehl, Richard Mayr:
Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295: 85-106 (2003) - Sabin Cautis, Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang, Soroosh Yazdani:
Periodicity, morphisms, and matrices. Theor. Comput. Sci. 295: 107-121 (2003) - Giovanni Di Crescenzo:
Sharing one secret vs. sharing many secrets. Theor. Comput. Sci. 295: 123-140 (2003) - Pavol Duris, Ján Manuch:
On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003) - Hervé Fournier:
Quantifier rank for parity of embedded finite models. Theor. Comput. Sci. 295: 153-169 (2003) - Viliam Geffert:
Space hierarchy theorem revised. Theor. Comput. Sci. 295: 171-187 (2003) - Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295: 189-203 (2003) - Thanh Minh Hoang, Thomas Thierauf:
The complexity of the characteristic and the minimal polynomial. Theor. Comput. Sci. 295: 205-222 (2003) - Jarkko Kari:
Synchronizing finite automata on Eulerian digraphs. Theor. Comput. Sci. 295: 223-232 (2003) - Andreas Klein, Martin Kutrib:
Fast one-way cellular automata. Theor. Comput. Sci. 295: 233-250 (2003) - Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To:
On-line scheduling with tight deadlines. Theor. Comput. Sci. 295: 251-261 (2003) - Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. 295: 263-278 (2003) - Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie:
News from the online traveling repairman. Theor. Comput. Sci. 295: 279-294 (2003) - Nir Piterman, Moshe Y. Vardi:
From bidirectionality to alternation. Theor. Comput. Sci. 295: 295-321 (2003) - Pavel Pudlák:
On reducibility and symmetry of disjoint NP pairs. Theor. Comput. Sci. 295: 323-339 (2003) - Luigi Santocanale:
On the equational definition of the least prefixed point. Theor. Comput. Sci. 295: 341-370 (2003) - Klaus Sutner:
The size of power automata. Theor. Comput. Sci. 295: 371-386 (2003) - Martin Thimm:
On the approximability of the Steiner tree problem. Theor. Comput. Sci. 295: 387-402 (2003)
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-28 04:15 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