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 24 matches
- 2003
- Ali Akhavi:
The optimal LLL algorithm is still polynomial in fixed dimension. Theor. Comput. Sci. 297(1-3): 3-23 (2003) - Pedro Berrizbeitia, Mauricio Odremán Vera, Juan Tena Ayuso:
Primality test for numbers M with a large power of 5 dividing M4-1. Theor. Comput. Sci. 297(1-3): 25-36 (2003) - Olivier Carton, Max Michel:
Unambiguous Büchi automata. Theor. Comput. Sci. 297(1-3): 37-81 (2003) - Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni:
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003) - Myra B. Cohen, Charles J. Colbourn:
Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theor. Comput. Sci. 297(1-3): 103-117 (2003) - Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise:
The permutation-path coloring problem on trees. Theor. Comput. Sci. 297(1-3): 119-143 (2003) - David Fernández-Baca:
Decomposable multi-parameter matroid optimization problems. Theor. Comput. Sci. 297(1-3): 183-198 (2003) - Maribel Fernández, Ian Mackie:
Operational equivalence for interaction nets. Theor. Comput. Sci. 297(1-3): 157-181 (2003) - Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz:
Decompositions for the edge colouring of reduced indifference graphs. Theor. Comput. Sci. 297(1-3): 145-155 (2003) - Joachim von zur Gathen, Thomas Lücking:
Subresultants revisited. Theor. Comput. Sci. 297(1-3): 199-239 (2003) - Andreas Goerdt, Michael Molloy:
Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. 297(1-3): 241-260 (2003) - Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger:
Combinatorics of geometrically distributed random variables: run statistics. Theor. Comput. Sci. 297(1-3): 261-270 (2003) - Claudio Gutierrez:
Equations in free semigroups with involution and their relation to equations in free groups. Theor. Comput. Sci. 297(1-3): 271-280 (2003) - Valentine Kabanets:
Almost k-wise independence and hard Boolean functions. Theor. Comput. Sci. 297(1-3): 281-295 (2003) - François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1-3): 297-315 (2003) - Guy Louchard, John W. Turner:
Generalized covariances of multi-dimensional Brownian excursion local times. Theor. Comput. Sci. 297(1-3): 317-336 (2003) - Richard Mayr:
Undecidable problems in unreliable computations. Theor. Comput. Sci. 297(1-3): 337-354 (2003) - Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Cube packing. Theor. Comput. Sci. 297(1-3): 355-366 (2003) - Lucia Moura:
Rank inequalities and separation algorithms for packing designs and sparse triple systems. Theor. Comput. Sci. 297(1-3): 367-384 (2003) - Jaroslav Opatrny:
Uniform multi-hop all-to-all optical routings in rings. Theor. Comput. Sci. 297(1-3): 385-397 (2003) - Brett Stevens:
The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs. Theor. Comput. Sci. 297(1-3): 399-424 (2003) - Stephen Taylor, Marianne Durand:
Emerging behavior as binary search trees are symmetrically updated. Theor. Comput. Sci. 297(1-3): 425-445 (2003) - Brigitte Vallée:
Dynamical analysis of a class of Euclidean algorithms. Theor. Comput. Sci. 297(1-3): 447-486 (2003) - Michele Zito:
Small maximal matchings in random graphs. Theor. Comput. Sci. 297(1-3): 487-507 (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-24 21:58 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