Остановите войну!
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 33 matches
- 2017
- Matthew Anderson, Anuj Dawar:
On Symmetric Circuits and Fixed-Point Logics. Theory Comput. Syst. 60(3): 521-551 (2017) - Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz:
Multi-processor Search and Scheduling Problems with Setup Cost. Theory Comput. Syst. 60(4): 637-670 (2017) - Luis Filipe Coelho Antunes, Bruno Bauwens, André Souto, Andreia Teixeira:
Sophistication vs Logical Depth. Theory Comput. Syst. 60(2): 280-298 (2017) - Bruno Bauwens:
Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness. Theory Comput. Syst. 60(2): 314-323 (2017) - Louay Bazzi, Nagi Nahas:
Small-Bias is Not Enough to Hit Read-Once CNF. Theory Comput. Syst. 60(2): 324-345 (2017) - Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory Comput. Syst. 60(4): 581-614 (2017) - Siddharth Bhaskar:
A Difference in Complexity Between Recursion and Tail Recursion. Theory Comput. Syst. 60(2): 299-313 (2017) - Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle:
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. Theory Comput. Syst. 60(3): 473-497 (2017) - Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-Stack Systems. Theory Comput. Syst. 60(4): 695-736 (2017) - Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. Theory Comput. Syst. 60(2): 253-279 (2017) - Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017) - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. 60(4): 615-636 (2017) - Joost Engelfriet, Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60(2): 129-171 (2017) - Niloofar Fazlollahi, David Starobinski:
Distance Vector-based Advance Reservation with Delay Performance Guarantees. Theory Comput. Syst. 60(2): 194-221 (2017) - Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. Theory Comput. Syst. 60(3): 378-395 (2017) - Frank Gurski:
The Behavior of Clique-Width under Graph Operations and Graph Transformations. Theory Comput. Syst. 60(2): 346-376 (2017) - Mathieu Hoyrup:
Genericity of Weakly Computable Objects. Theory Comput. Syst. 60(3): 396-420 (2017) - Timo Kötzing:
A Solution to Wiehagen's Thesis. Theory Comput. Syst. 60(3): 498-520 (2017) - Fabrizio Luccio:
Arithmetic for Rooted Trees. Theory Comput. Syst. 60(1): 33-52 (2017) - Bernard Mans, Luke Mathieson:
Incremental Problems in the Parameterized Complexity Setting. Theory Comput. Syst. 60(1): 3-19 (2017) - Benoit Monin:
Higher Randomness and Forcing with Closed Sets. Theory Comput. Syst. 60(3): 421-437 (2017) - Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard:
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. Theory Comput. Syst. 60(4): 677-694 (2017) - Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Chromatic Number of Non-Sparse Random Intersection Graphs. Theory Comput. Syst. 60(1): 112-127 (2017) - Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is Polynomial. Theory Comput. Syst. 60(3): 552-579 (2017) - Michelle Porter, Adam Day, Rodney G. Downey:
Notes on Computable Analysis. Theory Comput. Syst. 60(1): 53-111 (2017) - Anja Rey, Jörg Rothe, Adrian Marple:
Path-Disruption Games: Bribery and a Probabilistic Model. Theory Comput. Syst. 60(2): 222-252 (2017) - Alexander N. Rybalov:
On the Generic Undecidability of the Halting Problem for Normalized Turing Machines. Theory Comput. Syst. 60(4): 671-676 (2017) - Marcus Schaefer, Daniel Stefankovic:
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. Theory Comput. Syst. 60(2): 172-193 (2017) - Alan L. Selman, Arnold L. Rosenberg:
50 Years of TOCS. Theory Comput. Syst. 60(1): 1-2 (2017) - Suguru Tamaki, Osamu Watanabe:
Local Restrictions from the Furst-Saxe-Sipser Paper. Theory Comput. Syst. 60(1): 20-32 (2017)
skipping 3 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-26 08:34 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