default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 51 matches
- 2013
- Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan:
On the Complexity of Shortest Path Problems on Discounted Cost Graphs. LATA 2013: 44-55 - Takahito Aoto, Munehiro Iwami:
Termination of Rule-Based Calculi for Uniform Semi-Unification. LATA 2013: 56-67 - Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
Deciding WQO for Factorial Languages. LATA 2013: 68-79 - Parisa Babaali, Christopher Knaplund:
On the Construction of a Family of Automata That Are Generically Non-minimal. LATA 2013: 80-91 - Sebastian Bala, Dariusz Jackowski:
Limited Non-determinism Hierarchy of Counter Automata. LATA 2013: 92-103 - Sebastian Bala, Artur Koninski:
Unambiguous Automata Denoting Finitely Sequential Functions. LATA 2013: 104-115 - Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk:
Duplication-Loss Genome Alignment: Complexity and Algorithm. LATA 2013: 116-127 - Fabrizio Biondi, Axel Legay, Bo Friis Nielsen
, Andrzej Wasowski:
Maximizing Entropy over Markov Processes. LATA 2013: 128-140 - Johanna Björklund, Henning Fernau, Anna Kasprzik:
MAT Learning of Universal Automata. LATA 2013: 141-152 - Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu:
A Graph Polynomial Approach to Primitivity. LATA 2013: 153-164 - Francine Blanchet-Sadri, Justin Lazarow:
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem. LATA 2013: 165-176 - Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick:
Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013: 177-189 - Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Visibly Pushdown Automata: Universality and Inclusion via Antichains. LATA 2013: 190-201 - Jin-Yi Cai:
Complexity Dichotomy for Counting Problems. LATA 2013: 1-11 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot:
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. LATA 2013: 202-213 - Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin:
How to Travel between Languages. LATA 2013: 214-225 - Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution Information Rate for Some Classes of Automata. LATA 2013: 226-237 - Giorgio Delzanno, Riccardo Traverso:
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks. LATA 2013: 238-249 - Xiaojie Deng, Yu Zhang, Yuxin Deng, Farong Zhong:
The Buffered π-Calculus: A Model for Concurrent Languages. LATA 2013: 250-261 - Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Mix-Automatic Sequences. LATA 2013: 262-274 - Kousha Etessami:
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. LATA 2013: 12 - Henning Fernau, Pinar Heggernes, Yngve Villanger:
A Multivariate Analysis of Some DFA Problems. LATA 2013: 275-286 - Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan:
On the Size Complexity of Deterministic Frequency Automata. LATA 2013: 287-298 - Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit:
On the Number of Unbordered Factors. LATA 2013: 299-310 - Daniel Goc, Kalle Saari, Jeffrey O. Shallit:
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. LATA 2013: 311-322 - Stuart Haber, William G. Horne, Pratyusa K. Manadhata, Miranda Mowbray, Prasad Rao:
Efficient Submatch Extraction for Practical Regular Expressions. LATA 2013: 323-334 - Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki, Toru Fujiwara:
Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers. LATA 2013: 335-346 - Milka Hutagalung, Martin Lange, Étienne Lozes:
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. LATA 2013: 347-358 - Oscar H. Ibarra, Bala Ravikumar:
On Bounded Languages and Reversal-Bounded Automata. LATA 2013: 359-370 - Florent Jacquemard, Michaël Rusinowitch:
Rewrite Closure and CF Hedge Automata. LATA 2013: 371-382
skipping 21 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-11-14 08:14 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
