Остановите войну!
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 19 matches
- 1998
- Susanne Albers, Michael Mitzenmacher:
Average Case Analyses of List Update Algorithms, with Applications to Data Compression. Algorithmica 21(3): 312-329 (1998) - Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica 21(1): 104-118 (1998) - Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica 21(1): 89-103 (1998) - Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang:
On Minimum-Area Hulls. Algorithmica 21(1): 119-136 (1998) - Ishai Ben-Aroya, Donald D. Chinn, Assaf Schuster:
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms. Algorithmica 21(4): 347-376 (1998) - Liang-Fang Chao, Andrea S. LaPaugh:
Finding All Minimal Shapes in a Routing Channel. Algorithmica 21(2): 211-244 (1998) - Ka Wong Chong, Tak Wah Lam:
Approximating Biconnectivity in Parallel. Algorithmica 21(4): 395-410 (1998) - Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations Via Networks Simulation. Algorithmica 21(1): 2-20 (1998) - Pierre Fraigniaud, Cyril Gavoille:
Interval Routing Schemes. Algorithmica 21(2): 155-182 (1998) - Joel Friedman:
Computing Betti Numbers via Combinatiorial Laplacians. Algorithmica 21(4): 331-346 (1998) - Alan M. Frieze, Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica 21(1): 21-36 (1998) - Arvind Gupta, Naomi Nishimura:
Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21(2): 183-210 (1998) - Tao Jiang, Richard M. Karp:
Mapping Clones with a Given Ordering or Interleaving. Algorithmica 21(3): 262-284 (1998) - Juha Kärkkäinen, Erkki Sutinen:
Lempel-Ziv Index for q-Grams. Algorithmica 21(1): 137-154 (1998) - Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson:
On Certificates and Lookahead in Dynamic Graph Problems. Algorithmica 21(4): 377-394 (1998) - Christos Levcopoulos, Drago Krznaric:
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. Algorithmica 21(3): 285-311 (1998) - Steven J. Phillips, Jeffery R. Westbrook:
On-Line Load Balancing and Network Flow. Algorithmica 21(3): 245-261 (1998) - Luca Trevisan:
Parallel Approximation Algorithms by Positive Linear Programming. Algorithmica 21(1): 72-88 (1998) - Alfredo Viola, Patricio V. Poblete:
The Analysis of Linear Probing Hashing with Buckets. Algorithmica 21(1): 37-71 (1998)
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-06-01 05:24 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