Остановите войну!
for scientists:
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 27 matches
- 1994
- Ilan Adler, Peter A. Beling:
Polynomial Algorithms for Linear Programming over the Algebraic Numbers. Algorithmica 12(6): 436-457 (1994) - Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker:
The Uniform Memory Hierarchy Model of Computation. Algorithmica 12(2/3): 72-109 (1994) - Alberto Apostolico:
Guest Editor's Foreword: Special Issue on String Algorithmics and Its Applications. Algorithmica 12(4/5): 245-246 (1994) - Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet:
On Boyer-Moore Automata. Algorithmica 12(4/5): 268-292 (1994) - Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994) - Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino:
Upward Drawings of Triconnected Digraphs. Algorithmica 12(6): 476-497 (1994) - Gabriele Blankenagel, Ralf Hartmut Güting:
External Segment Trees. Algorithmica 12(6): 498-532 (1994) - Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994) - William I. Chang, Eugene L. Lawler:
Sublinear Approximate String Matching and Biological Applications. Algorithmica 12(4/5): 327-344 (1994) - Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) - Pang-Chieh Chen:
Heuristic Sampling on DAGs. Algorithmica 12(6): 458-475 (1994) - A. Chin:
Locality-Preserving Hash Functions for General Purpose Parallel Computation. Algorithmica 12(2/3): 170-181 (1994) - Francis Y. L. Chin, Chung Keung Poon:
Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences. Algorithmica 12(4/5): 293-311 (1994) - Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. Algorithmica 12(4/5): 247-267 (1994) - Aviezri S. Fraenkel, Shmuel T. Klein:
Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994) - Dan Gusfield, K. Balasubramanian, Dalit Naor:
Parametric Optimization of Sequence Alignment. Algorithmica 12(4/5): 312-326 (1994) - Lenwood S. Heath, Sriram V. Pemmaraju:
New Results for the Minimum Weight Triangulation Problem. Algorithmica 12(6): 533-552 (1994) - Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson:
Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica 12(2/3): 182-208 (1994) - Gad M. Landau, Uzi Vishkin:
Pattern Matching in a Digitized Image. Algorithmica 12(4/5): 375-408 (1994) - Eugene W. Myers:
A Sublinear Algorithm for Approximate Keyword Searching. Algorithmica 12(4/5): 345-374 (1994) - Lee R. Nackman, Vijay Srinivasan:
Point Placement Algorithms for Delaunay Triangulation of Polygonal Domains. Algorithmica 12(1): 1-17 (1994) - Lee Aaron Newberg, David S. Wolfe:
String Layouts for a Redundant Array of Inexpensive Disks. Algorithmica 12(2/3): 209-224 (1994) - Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994) - Jeffrey Scott Vitter:
Guest Editor's Introduction: Special Issue on Large-Scale Memories. Algorithmica 12(2/3): 69-71 (1994) - Jeffrey Scott Vitter, Elizabeth A. M. Shriver:
Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica 12(2/3): 110-147 (1994) - Jeffrey Scott Vitter, Elizabeth A. M. Shriver:
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories. Algorithmica 12(2/3): 148-169 (1994) - Young C. Wee, Seth Chaiken, S. S. Ravi:
Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. Algorithmica 12(6): 421-435 (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-04-20 02: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