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 30 matches
- 2017
- Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Picture codes and deciphering delay. Inf. Comput. 253: 358-370 (2017) - Fernando Arroyo, Sandra Gómez Canaval, Victor Mitrana, Stefan Popescu:
On the computational power of networks of polarized evolutionary processors. Inf. Comput. 253: 371-380 (2017) - Zuzana Bednárová, Viliam Geffert:
Two double-exponential gaps for automata with a limited pushdown. Inf. Comput. 253: 381-398 (2017) - Eike Best, Raymond R. Devillers:
Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. 253: 399-410 (2017) - Laurent Bienvenu, Ludovic Patey:
Diagonally non-computable functions and fireworks. Inf. Comput. 253: 64-77 (2017) - Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Automata for unordered trees. Inf. Comput. 253: 304-335 (2017) - Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the list update problem with advice. Inf. Comput. 253: 411-423 (2017) - Daniel Bundala, Joël Ouaknine:
On parametric timed automata and one-counter machines. Inf. Comput. 253: 272-303 (2017) - Yixin Cao:
Unit interval editing is fixed-parameter tractable. Inf. Comput. 253: 109-126 (2017) - Anton Cerný:
Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms. Inf. Comput. 253: 424-435 (2017) - Ilaria De Crescenzo, Salvatore La Torre, Yaron Velner:
Visibly pushdown modular games, . Inf. Comput. 253: 204-223 (2017) - Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
CNF and DNF succinct graph encodings. Inf. Comput. 253: 436-447 (2017) - Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe:
Selected papers of the 8th International Conference on Language and Automata Theory and Applications (LATA 2014). Inf. Comput. 253: 355-357 (2017) - Manfred Droste, Stefan Dück:
Weighted automata and logics for infinite nested words. Inf. Comput. 253: 448-466 (2017) - Éric Duchêne, Aline Parreau, Michel Rigo:
Deciding game invariance. Inf. Comput. 253: 127-142 (2017) - Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Further remarks on DNA overlap assembly. Inf. Comput. 253: 143-154 (2017) - Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato:
On the path-width of integer linear programming. Inf. Comput. 253: 257-271 (2017) - Peter Faymonville, Martin Zimmermann:
Parametric Linear Dynamic Logic. Inf. Comput. 253: 237-256 (2017) - Bertram Felgenhauer, René Thiemann:
Reachability, confluence, and termination analysis with state-compatible automata. Inf. Comput. 253: 467-483 (2017) - Bernd Finkbeiner, Ernst-Rüdiger Olderog:
Petri games: Synthesis of distributed systems with causal memory. Inf. Comput. 253: 181-203 (2017) - Toru Fuda, Miho Tonozaki:
Brudno's theorem for Zd (or ) subshifts. Inf. Comput. 253: 155-162 (2017) - Viliam Geffert:
Alternating space is closed under complement and other simulations for sublogarithmic space. Inf. Comput. 253: 163-178 (2017) - Ryszard Janicki, Xiang Yin:
Modeling concurrency with interval traces. Inf. Comput. 253: 78-108 (2017) - Galina Jirásková, Alexander Okhotin:
On the state complexity of operations on two-way finite automata. Inf. Comput. 253: 36-63 (2017) - Marius Konitzer, Hans Ulrich Simon:
Regular languages viewed from a graph-theoretic perspective. Inf. Comput. 253: 484-496 (2017) - Christof Löding, Sarah Winter:
Synthesis of deterministic top-down tree transducers from automatic tree relations. Inf. Comput. 253: 336-354 (2017) - Adriano Peron, Carla Piazza:
Games, Automata, Logics and Formal Verification (GandALF 2014) - Preface. Inf. Comput. 253: 179-180 (2017) - Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate:
Quantitative model-checking of controlled discrete-time Markov processes. Inf. Comput. 253: 1-35 (2017) - Jonni Virtema:
Complexity of validity for propositional dependence logics. Inf. Comput. 253: 224-236 (2017) - Vojtech Vorel:
Complexity of a problem concerning reset words for Eulerian binary automata. Inf. Comput. 253: 497-509 (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-10-03 13:37 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