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
- 2017
- Samy Abbes:
Synchronization of Bernoulli sequences on shared letters. Inf. Comput. 255: 1-26 (2017) - Sergio Abriola, María Emilia Descotte, Santiago Figueira:
Model theory of XPath on data trees. Part II: Binary bisimulation and definability. Inf. Comput. 255: 195-223 (2017) - Beniamino Accattoli, Claudio Sacerdoti Coen:
On the value of variables. Inf. Comput. 255: 224-242 (2017) - Carlos Areces, Hans van Ditmarsch, Raul Fervari, François Schwarzentruber:
The modal logic of copy and remove. Inf. Comput. 255: 243-261 (2017) - Alexander Baumgartner, Temur Kutsia:
Unranked second-order anti-unification. Inf. Comput. 255: 262-286 (2017) - Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - Gustavo Adrian Bodanza, Claudio A. Alessio:
Rethinking specificity in defeasible reasoning and its effect in argument reinstatement. Inf. Comput. 255: 287-310 (2017) - Quentin Bramas, Sébastien Tixeuil:
The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255: 369-383 (2017) - Dan Brownstein, Shlomi Dolev, Niv Gilboa:
Functional encryption for cascade automata. Inf. Comput. 255: 384-407 (2017) - Alan J. Cain, Robert D. Gray, António Malheiro:
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids. Inf. Comput. 255: 68-93 (2017) - Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune:
A procedure for deciding symbolic equivalence between sets of constraint systems. Inf. Comput. 255: 94-125 (2017) - Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255: 336-351 (2017) - Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted automata on infinite words in the context of Attacker-Defender games. Inf. Comput. 255: 27-44 (2017) - Sanjay Jain, Efim B. Kinber, Frank Stephan:
Automatic learning from positive data and negative counterexamples. Inf. Comput. 255: 45-67 (2017) - Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz:
21st Workshop on Logic, Language, Information and Computation - WoLLIC 2014. Inf. Comput. 255: 193-194 (2017) - Andreas Koutsopoulos, Christian Scheideler, Thim Strothmann:
Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput. 255: 408-424 (2017) - Markus Krötzsch, Tomás Masopust, Michaël Thomazo:
Complexity of universality and related problems for partially ordered NFAs. Inf. Comput. 255: 177-192 (2017) - Moritz Müller, Stefan Szeider:
The treewidth of proofs. Inf. Comput. 255: 147-164 (2017) - Andrzej Pelc, Alexander A. Schwarzmann:
Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015). Inf. Comput. 255: 335 (2017) - Lili Su, Nitin H. Vaidya:
Reaching approximate Byzantine consensus with multi-hop communication. Inf. Comput. 255: 352-368 (2017) - Luca Viganò, Marco Volpe, Margherita Zorzi:
A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations. Inf. Comput. 255: 311-333 (2017) - Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for maximum independent set. Inf. Comput. 255: 126-146 (2017)
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-09-21 10:47 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