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 20 matches
- 2013
- Luca Aceto, Monika Henzinger, Jirí Sgall:
38th International Colloquium on Automata, Languages and Programming. Inf. Comput. 222: 1 (2013) - Kook Jin Ahn, Sudipto Guha:
Linear programming in the semi-streaming model with application to the maximum matching problem. Inf. Comput. 222: 59-79 (2013) - Eric Allender, Luke Friedman, William I. Gasarch:
Limits on the computational power of random strings. Inf. Comput. 222: 80-92 (2013) - Malte Beecken, Johannes Mittmann, Nitin Saxena:
Algebraic independence and blackbox identity testing. Inf. Comput. 222: 2-19 (2013) - Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Approximation algorithms for spanner problems and Directed Steiner Forest. Inf. Comput. 222: 93-107 (2013) - Simone Bova, Hubie Chen, Matthew Valeriote:
Generic expression hardness results for primitive positive formula comparison. Inf. Comput. 222: 108-120 (2013) - Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the termination value of one-counter MDPs and stochastic games. Inf. Comput. 222: 121-138 (2013) - Shiri Chechik:
Fault-tolerant compact routing schemes for general graphs. Inf. Comput. 222: 36-44 (2013) - Yuxin Deng, Matthew Hennessy:
On the semantics of Markov automata. Inf. Comput. 222: 139-168 (2013) - Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013) - Martin Hoefer:
Local matching dynamics in social networks. Inf. Comput. 222: 20-35 (2013) - Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings in the stable marriage problem. Inf. Comput. 222: 180-194 (2013) - Maurice J. Jansen, Rahul Santhanam:
Permanent does not have succinct polynomial size arithmetic circuits of constant depth. Inf. Comput. 222: 195-207 (2013) - Christos A. Kapoutsis:
Nondeterminism is essential in small two-way finite automata with few reversals. Inf. Comput. 222: 208-227 (2013) - Shin-ya Katsumata:
Relating computational effects by ⊤⊤-lifting. Inf. Comput. 222: 228-246 (2013) - Fabian Kuhn, Monaldo Mastrolilli:
Vertex cover in graphs with locally few colors. Inf. Comput. 222: 265-277 (2013) - Jim Laird, Giulio Manzonetto, Guy McCusker:
Constructing differential categories and deconstructing categories of games. Inf. Comput. 222: 247-264 (2013) - Shi Li:
A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222: 45-58 (2013) - Daniel Lokshtanov, Dániel Marx:
Clustering with local restrictions. Inf. Comput. 222: 278-292 (2013) - Carsten Moldenhauer:
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs. Inf. Comput. 222: 293-306 (2013)
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-12-13 04:52 CET 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