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 22 matches
- 1994
- Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma. J. Algorithms 16(1): 80-109 (1994) - Marek Chrobak, Lawrence L. Larmore:
Generosity Helps or an 11-Competitive Algorithm for Three Servers. J. Algorithms 16(2): 234-263 (1994) - Livio Colussi:
Fastest Pattern Matching in Strings. J. Algorithms 16(2): 163-189 (1994) - Jean-Paul Doignon, Jean-Claude Falmagne:
A Polynomial Time Algorithm for Unidimensional Unfolding Representations. J. Algorithms 16(2): 218-233 (1994) - Wayne Eberly:
Logarithmic Depth Circuits for Hermite Interpolation. J. Algorithms 16(3): 335-360 (1994) - Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan:
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms 16(2): 283-294 (1994) - David Fernández-Baca, Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width. J. Algorithms 16(3): 408-430 (1994) - Michael Filaseta, M. L. Robinson, Ferrell S. Wheeler:
The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable. J. Algorithms 16(2): 309-333 (1994) - Tal Goldberg, Uri Zwick:
Faster Parallel String Matching via Larger Deterministic Samples. J. Algorithms 16(2): 295-308 (1994) - Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei:
Minimizing Maximum Weighted Error for Imprecise Computation Tasks. J. Algorithms 16(3): 431-452 (1994) - Oscar H. Ibarra, Qi Zheng:
Some Efficient Algorithms for Permutation Graphs. J. Algorithms 16(3): 453-469 (1994) - Kazuo Iwama, Yahiko Kambayashi:
A Simpler Parallel Algorithm for Graph Conectivity. J. Algorithms 16(2): 190-217 (1994) - Tze-Heng Ma, Jeremy P. Spinrad:
An O(n²) Algorithm for Undirected Split Decompositon. J. Algorithms 16(1): 154-160 (1994) - Charles U. Martel, Ramesh Subramonian:
On the Complexity of Certified Write-All Algorithms. J. Algorithms 16(3): 361-387 (1994) - Lajos Rónyai:
A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q. J. Algorithms 16(1): 24-32 (1994) - U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Improving Greedy Algorithms by Lookahead-Search. J. Algorithms 16(1): 1-23 (1994) - Jonathan Sorenson:
Two Fast GCD Algorithms. J. Algorithms 16(1): 110-144 (1994) - Jeremy P. Spinrad:
Recognition of Circle Graphs. J. Algorithms 16(2): 264-282 (1994) - Rakesh M. Verma:
A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications. J. Algorithms 16(1): 67-79 (1994) - Egon Wanke:
Bounded Tree-Width and LOGCFL. J. Algorithms 16(3): 470-491 (1994) - Tandy J. Warnow:
Tree Compatibility and Inferring Evolutionary History. J. Algorithms 16(3): 388-407 (1994) - Kaizhong Zhang, Dennis E. Shasha, Jason Tsong-Li Wang:
Approximate Tree Matching in the Presence of Variable Length Don't Cares. J. Algorithms 16(1): 33-66 (1994)
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-26 20:11 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