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 26 matches
- 2003
- Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
On the number of occurrences of a symbol in words of regular languages. Theor. Comput. Sci. 302(1-3): 431-456 (2003) - Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar:
Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003) - Srecko Brlek, A. Ladouceur:
A note on differentiable palindromes. Theor. Comput. Sci. 302(1-3): 167-178 (2003) - Jingchao Chen:
Optimizing stable in-place merging. Theor. Comput. Sci. 302(1-3): 191-210 (2003) - Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1-3): 337-364 (2003) - Nadia Creignou, Hervé Daudé:
Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302(1-3): 417-430 (2003) - Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito:
On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302(1-3): 489-495 (2003) - Peter Damaschke:
Nearly optimal strategies for special cases of on-line capital investment. Theor. Comput. Sci. 302(1-3): 35-44 (2003) - Zhe Dang:
Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci. 302(1-3): 93-121 (2003) - Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes:
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. Theor. Comput. Sci. 302(1-3): 295-317 (2003) - Aleksei V. Fishkin, Guochuan Zhang:
On maximizing the throughput of multiprocessor tasks. Theor. Comput. Sci. 302(1-3): 319-335 (2003) - Lane A. Hemaspaandra, Harald Hempel:
P-immune sets with holes lack self-reducibility properties. Theor. Comput. Sci. 302(1-3): 457-466 (2003) - Juha Honkala:
Decidability results for Watson-Crick D0L systems with nonregular triggers. Theor. Comput. Sci. 302(1-3): 481-488 (2003) - Klaus Jansen:
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Theor. Comput. Sci. 302(1-3): 239-256 (2003) - Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow:
Unification and extension of weighted finite automata applicable to image compression. Theor. Comput. Sci. 302(1-3): 275-294 (2003) - George Karakostas, Richard J. Lipton, Anastasios Viglas:
On the complexity of intersecting finite state automata and N L versus N P. Theor. Comput. Sci. 302(1-3): 257-274 (2003) - Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
Generalizations of suffix arrays to multi-dimensional matrices. Theor. Comput. Sci. 302(1-3): 223-238 (2003) - Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
Generalizations of suffix arrays to multi-dimensional matrices. Theor. Comput. Sci. 302(1-3): 401-416 (2003) - Jerzy Mycka:
mu -Recursion and infinite limits. Theor. Comput. Sci. 302(1-3): 123-133 (2003) - Rocco De Nicola, Anna Labella:
Nondeterministic regular expressions as solutions of equational systems. Theor. Comput. Sci. 302(1-3): 179-189 (2003) - Alexander Okhotin:
A recognition and parsing algorithm for arbitrary conjunctive grammars. Theor. Comput. Sci. 302(1-3): 365-399 (2003) - Alois Panholzer:
Analysis of multiple quickselect variants. Theor. Comput. Sci. 302(1-3): 45-91 (2003) - Gwénaël Richomme:
Conjugacy and episturmian morphisms. Theor. Comput. Sci. 302(1-3): 1-34 (2003) - Wojciech Rytter:
Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3): 211-222 (2003) - Till Tantau:
Query complexity of membership comparable sets. Theor. Comput. Sci. 302(1-3): 467-474 (2003) - Sándor Vágvölgyi:
Term rewriting restricted to ground terms. Theor. Comput. Sci. 302(1-3): 135-165 (2003)
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-30 05:28 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