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 68 matches
- 2007
- Nir Ailon, Noga Alon:
Hardness of fully dense problems. Inf. Comput. 205(8): 1117-1129 (2007) - Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. Inf. Comput. 205(7): 1114-1116 (2007) - Roberto M. Amadio:
A synchronous pi-calculus. Inf. Comput. 205(9): 1470-1490 (2007) - Alberto Apostolico:
Fast gapped variants for Lempel-Ziv-Welch compression. Inf. Comput. 205(7): 1012-1026 (2007) - Michael Backes, Birgit Pfitzmann, Michael Waidner:
The reactive simulatability (RSIM) framework for asynchronous systems. Inf. Comput. 205(12): 1685-1720 (2007) - Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema:
Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007) - Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro:
Unfolding semantics of graph transformation. Inf. Comput. 205(5): 733-782 (2007) - Jason P. Bell, Teow Lim Goh:
Exponential lower bounds for the number of words of uniform length avoiding a pattern. Inf. Comput. 205(9): 1295-1306 (2007) - Ahmed Bouajjani, Anca Muscholl, Tayssir Touili:
Permutation rewriting and algorithmic verification. Inf. Comput. 205(2): 199-224 (2007) - Andrei A. Bulatov, Víctor Dalmau:
Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205(5): 651-678 (2007) - Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Results on memory-limited U-shaped learning. Inf. Comput. 205(10): 1551-1573 (2007) - Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber:
Algorithmic complexity bounds on future prediction errors. Inf. Comput. 205(2): 242-261 (2007) - Jan Chomicki, David Toman:
Special Issue: TIME 2005. Inf. Comput. 205(1): 1 (2007) - Rance Cleaveland, Gerald Lüttgen, V. Natarajan:
Priority and abstraction in process algebra. Inf. Comput. 205(9): 1426-1458 (2007) - Silvia Crafa, Sabina Rossi:
Controlling information release in the pi-calculus. Inf. Comput. 205(8): 1235-1273 (2007) - Anuj Dawar, Philippa Gardner, Giorgio Ghelli:
Expressiveness and complexity of graph logic. Inf. Comput. 205(3): 263-310 (2007) - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon:
The perfectly synchronized round-based model of distributed computing. Inf. Comput. 205(5): 783-815 (2007) - Stéphane Demri, Deepak D'Souza:
An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3): 380-415 (2007) - Stéphane Demri, Ranko Lazic, David Nowak:
On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. 205(1): 2-24 (2007) - Nachum Dershowitz, E. Castedo Ellerman:
Leanest quasi-orderings. Inf. Comput. 205(4): 535-556 (2007) - David Doty, Jack H. Lutz, Satyadev Nandakumar:
Finite-state dimension and real arithmetic. Inf. Comput. 205(11): 1640-1651 (2007) - Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
Probabilistic bisimulations for quantum processes. Inf. Comput. 205(11): 1608-1639 (2007) - Maribel Fernández, Murdoch Gabbay:
Nominal rewriting. Inf. Comput. 205(6): 917-965 (2007) - Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi:
Task automata: Schedulability, decidability and undecidability. Inf. Comput. 205(8): 1149-1172 (2007) - Nicoletta De Francesco, Luca Martini:
Instruction-level security analysis for information flow in stack-based assembly languages. Inf. Comput. 205(9): 1334-1370 (2007) - Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Rotation and lighting invariant template matching. Inf. Comput. 205(7): 1096-1113 (2007) - Murdoch Gabbay:
A general mathematics of names. Inf. Comput. 205(7): 982-1011 (2007) - Hui Gao, Wim H. Hesselink:
A general lock-free algorithm using compare-and-swap. Inf. Comput. 205(2): 225-241 (2007) - Philippa Gardner, Cosimo Laneve, Lucian Wischik:
Linear forwarders. Inf. Comput. 205(10): 1526-1550 (2007) - Viliam Geffert:
Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205(11): 1652-1670 (2007)
skipping 38 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-28 13:06 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