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 20 matches
- 2004
- Cyril Allauzen, Mehryar Mohri:
An optimal pre-determinization algorithm for weighted transducers. Theor. Comput. Sci. 328(1-2): 3-18 (2004) - Maurizio Alvarez-Manilla, Achim Jung, Klaus Keimel:
The probabilistic powerdomain for stably compact spaces. Theor. Comput. Sci. 328(3): 221-244 (2004) - Patrick Baillot:
Type inference for light affine logic via constraints on words. Theor. Comput. Sci. 328(3): 289-323 (2004) - Manuel Vilares Ferro, Victor M. Darriba, Jesús Vilares, Francisco J. Ribadas:
A formal frame for robust parsing. Theor. Comput. Sci. 328(1-2): 171-186 (2004) - John Foy:
A dynamical system which must be stable whose stability cannot be proved. Theor. Comput. Sci. 328(3): 355-361 (2004) - Xiang Fu, Tevfik Bultan, Jianwen Su:
Conversation protocols: a formalism for specification and verification of reactive electronic services. Theor. Comput. Sci. 328(1-2): 19-37 (2004) - Franck Guingne, Florent Nicart, André Kempe:
Acyclic networks maximizing the printing complexity. Theor. Comput. Sci. 328(1-2): 39-51 (2004) - Reiner Hähnle, Neil V. Murray, Erik Rosenthal:
Linearity and regularity with negation normal form. Theor. Comput. Sci. 328(3): 325-354 (2004) - Hejiao Huang, To-Yat Cheung, Wai Ming Mak:
Structure and behavior preservation by Petri-net-based refinements in system design. Theor. Comput. Sci. 328(3): 245-269 (2004) - Oscar H. Ibarra:
Editorial. Theor. Comput. Sci. 328(1-2): 1 (2004) - Dietrich Kuske, Ingmar Meinecke:
Branching automata with costs - a way of reflecting parallelism in costs star. Theor. Comput. Sci. 328(1-2): 53-75 (2004) - Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. Theor. Comput. Sci. 328(1-2): 77-96 (2004) - Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004) - Bala Ravikumar, Gerry Eisman:
Weak minimization of DFA - an algorithm and applications. Theor. Comput. Sci. 328(1-2): 113-133 (2004) - Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan:
Enhancing global SLS-resolution with loop cutting and tabling mechanisms. Theor. Comput. Sci. 328(3): 271-287 (2004) - Hellis Tamm, Esko Ukkonen:
Bideterministic automata and minimal representations of regular languages. Theor. Comput. Sci. 328(1-2): 135-149 (2004) - A. N. Trahtman:
Reducing the time complexity of testing for local threshold testability. Theor. Comput. Sci. 328(1-2): 151-160 (2004) - Farn Wang, Hsu-Chun Yen:
Reachability solution characterization of parametric real-time systems. Theor. Comput. Sci. 328(1-2): 187-201 (2004) - Gaoyan Xie, Cheng Li, Zhe Dang:
Linear reachability problems and minimal solutions to linear Diophantine equation systems. Theor. Comput. Sci. 328(1-2): 203-219 (2004) - Lynette van Zijl:
On binary ⊕-NFAs and succinct descriptions of regular languages. Theor. Comput. Sci. 328(1-2): 161-170 (2004)
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-19 21:07 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