Остановите войну!
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 28 matches
- 2001
- George E. Andrews, Arnold Knopfmacher:
An Algorithmic Approach to Discovering and Proving q-Series Identities. Algorithmica 29(1): 34-43 (2001) - Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas:
A Randomized Algorithm for Approximate String Matching. Algorithmica 29(3): 468-486 (2001) - Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Algorithms for the On-Line Travelling Salesman. Algorithmica 29(4): 560-581 (2001) - Adi Avidor, Yossi Azar, Jirí Sgall:
Ancient and New Algorithms for Load Balancing in the lp Norm. Algorithmica 29(3): 422-441 (2001) - Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint. Algorithmica 29(4): 595-609 (2001) - Roberto Battiti, Marco Protasi:
Reactive Local Search for the Maximum Clique Problem. Algorithmica 29(4): 610-637 (2001) - Hans L. Bodlaender, Babette van Antwerpen-de Fluiter:
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. Algorithmica 29(4): 534-559 (2001) - Hua-Huai Chern, Hsien-Kuei Hwang:
Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1). Algorithmica 29(1): 44-69 (2001) - Julien Clément, Philippe Flajolet, Brigitte Vallée:
Dynamical Sources in Information Theory: A General Analysis of Trie Structures. Algorithmica 29(1): 307-369 (2001) - Edward G. Coffman Jr., Alexander L. Stolyar:
Bandwidth Packing. Algorithmica 29(1): 70-88 (2001) - Michael Drmota:
An Analytic Approach to the Height of Binary Search Trees. Algorithmica 29(1): 89-119 (2001) - Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
A Unified Presentation of Some Urn Models. Algorithmica 29(1): 120-147 (2001) - Uriel Feige, Guy Kortsarz, David Peleg:
The Dense k-Subgraph Problem. Algorithmica 29(3): 410-421 (2001) - Teofilo F. Gonzalez:
Simple Algorithms for Multimessage Multicasting with Forwarding. Algorithmica 29(4): 511-533 (2001) - Jennie C. Hansen, Eric Schmutz:
Near-Optimal Bounded-Degree Spanning Trees. Algorithmica 29(1): 148-180 (2001) - Santosh N. Kabadi, Yash P. Aneja:
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. Algorithmica 29(4): 582-594 (2001) - Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam:
Solving Some Discrepancy Problems in NC. Algorithmica 29(3): 371-395 (2001) - Conrado Martinez, Alois Panholzer, Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees. Algorithmica 29(1): 181-204 (2001) - Lata Narayanan, Sunil M. Shende:
Static Frequency Assignment in Cellular Networks. Algorithmica 29(3): 396-409 (2001) - Daniel Panario, L. Bruce Richmond:
Smallest Components in Decomposable Structures: Exp-Log Class. Algorithmica 29(1): 205-226 (2001) - Patricio V. Poblete:
Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors. Algorithmica 29(1): 227-237 (2001) - Helmut Prodinger, Wojciech Szpankowski:
Average-Case Analysis of Algorithms - Preface. Algorithmica 29(1): 1-2 (2001) - John H. Reif:
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. Algorithmica 29(3): 487-510 (2001) - Uwe Rösler:
On the Analysis of Stochastic Divide and Conquer Algorithms. Algorithmica 29(1): 238-261 (2001) - Uwe Rösler, Ludger Rüschendorf:
The Contraction Method for Recursive Algorithms. Algorithmica 29(1): 3-33 (2001) - Hadas Shachnai, Tami Tamir:
On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica 29(3): 442-467 (2001) - Brigitte Vallée:
Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes. Algorithmica 29(1): 262-306 (2001) - J. F. Weng, J. MacGregor Smith:
Steiner Minimal Trees with One Polygonal Obstacle. Algorithmica 29(4): 638-648 (2001)
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-02 09:32 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