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 35 matches
- 2018
- Dimitris Achlioptas, Paris Siminelakis:
Symmetric graph properties have independent edges. Inf. Comput. 261: 446-463 (2018) - James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate:
Short proofs of the Kneser-Lovász coloring principle. Inf. Comput. 261: 296-310 (2018) - Rajeev Alur, Salar Moarref, Ufuk Topcu:
Compositional and symbolic synthesis of reactive controllers for multi-agent systems. Inf. Comput. 261: 616-633 (2018) - Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Graded modalities in Strategy Logic. Inf. Comput. 261: 634-649 (2018) - Martin Avanzini, Ugo Dal Lago:
On sharing, memoization, and polynomial time. Inf. Comput. 261: 3-22 (2018) - Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Inf. Comput. 261: 55-77 (2018) - Nicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche:
Compositional strategy synthesis for stochastic games with multiple objectives. Inf. Comput. 261: 536-587 (2018) - Johan van Benthem:
Computation as social agency: What, how and who. Inf. Comput. 261: 519-535 (2018) - Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Dynamic algorithms via the primal-dual method. Inf. Comput. 261: 219-239 (2018) - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On reducing linearizability to state reachability. Inf. Comput. 261: 383-400 (2018) - Petr Cermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano:
Practical verification of multi-agent systems against Slk specifications. Inf. Comput. 261: 588-614 (2018) - Radu Curticapean:
Block interpolation: A framework for tight exponential-time counting complexity. Inf. Comput. 261: 265-280 (2018) - Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young:
Interactive communication with unknown noise rate. Inf. Comput. 261: 464-486 (2018) - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput. 261: 355-382 (2018) - Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision problems of tree transducers with origin. Inf. Comput. 261: 311-335 (2018) - Marco Gaboardi, Ulrich Schöpp:
Special issue - Developments in implicit computational complexity, 2014 and 2015. Inf. Comput. 261: 1-2 (2018) - Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-vertex connectivity in directed graphs. Inf. Comput. 261: 248-264 (2018) - Yiannis Giannakopoulos, Elias Koutsoupias:
Selling two goods optimally. Inf. Comput. 261: 432-445 (2018) - Oded Goldreich, Tom Gur, Ron D. Rothblum:
Proofs of proximity for context-free languages and read-once branching programs. Inf. Comput. 261: 175-201 (2018) - Julian Gutierrez, Giuseppe Perelli, Michael J. Wooldridge:
Imperfect information in Reactive Modules games. Inf. Comput. 261: 650-675 (2018) - Julian Gutierrez, Michael J. Wooldridge:
Preface to the SR-2015 special issue. Inf. Comput. 261: 487 (2018) - Emmanuel Hainry, Romain Péchoux:
A type-based complexity analysis of Object Oriented programs. Inf. Comput. 261: 78-115 (2018) - Magnús M. Halldórsson, Naoki Kobayashi, Bettina Speckmann:
Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan. Inf. Comput. 261: 159 (2018) - Brett Hemenway, Mary Wootters:
Linear-time list recovery of high-rate expander codes. Inf. Comput. 261: 202-218 (2018) - Egor Ianovski, Luke Ong:
Simulating cardinal preferences in Boolean games: A proof technique. Inf. Comput. 261: 488-518 (2018) - Hamidreza Jahanjou, Eric Miles, Emanuele Viola:
Local reduction. Inf. Comput. 261: 281-295 (2018) - Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. Inf. Comput. 261: 160-174 (2018) - Alessio R. Lomuscio, Moshe Y. Vardi:
4th International Workshop on Strategic Reasoning (SR 2016). Inf. Comput. 261: 615 (2018) - Georg Moser, Michael Schaper:
From Jinja bytecode to term rewriting: A complexity reflecting transformation. Inf. Comput. 261: 116-143 (2018) - Dominic A. Orchard:
Complexity bounds for container functors and comonads. Inf. Comput. 261: 144-158 (2018)
skipping 5 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-10-18 13:59 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