Остановите войну!
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 29 matches
- 2002
- Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia:
Computing Approximate Shortest Paths on Convex Polytopes. Algorithmica 33(2): 227-242 (2002) - Pankaj K. Agarwal, Cecilia Magdalena Procopiuc:
Exact and Approximation Algorithms for Clustering. Algorithmica 33(2): 201-226 (2002) - Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002) - Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002) - Béchir el Ayeb:
Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(n2sqrt(tau/log n) Algorithm. Algorithmica 33(2): 129-149 (2002) - Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger:
An Experimental Study of Algorithms for Weighted Completion Time Scheduling. Algorithmica 33(1): 34-51 (2002) - Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002) - Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang:
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. Algorithmica 33(3): 272-286 (2002) - Roberto Battiti, Alan A. Bertossi:
Foreword. Algorithmica 33(1): 1-2 (2002) - Alberto Bertoni, Paola Campadelli, Giuliano Grossi:
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation. Algorithmica 33(1): 71-88 (2002) - Sergei Bespamyatnikh, Michael Segal:
Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002) - Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint:
Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002) - Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
Optimal Solutions for the Temporal Precedence Problem. Algorithmica 33(4): 494-510 (2002) - Victor Chepoi, Yann Vaxès:
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33(2): 243-262 (2002) - Edith Cohen, Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33(3): 300-334 (2002) - Edith Cohen, Haim Kaplan, Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33(4): 511-516 (2002) - Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato:
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica 33(2): 183-200 (2002) - Ashish Goel, Kamesh Munagala:
Extending Greedy Multicast Routing to Delay Sensitive Applications. Algorithmica 33(3): 335-352 (2002) - Michael T. Goodrich:
Guest Editor's Foreword. Algorithmica 33(3): 271 (2002) - Sandy Irani:
Page Replacement with Multi-Size Pages and Applications to Web Caching. Algorithmica 33(3): 384-409 (2002) - Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. Algorithmica 33(3): 353-370 (2002) - Vikas Kapoor, Dietmar Kühl, Alexander Wolff:
A Tutorial for Designing Flexible Geometric Algorithms. Algorithmica 33(1): 52-70 (2002) - Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal Online Algorithms for an Electronic Commerce Money Distribution System. Algorithmica 33(3): 287-299 (2002) - Madhukar R. Korupolu, Vijaya Ramachandran:
Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. Algorithmica 33(2): 168-182 (2002) - Stefan Nilsson, Matti Tikkanen:
An Experimental Study of Compression Methods for Dynamic Tries. Algorithmica 33(1): 19-33 (2002) - Sanguthevar Rajasekaran, Suneeta Ramaswami:
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane. Algorithmica 33(4): 436-460 (2002) - Laura A. Sanchis:
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem. Algorithmica 33(1): 3-18 (2002) - Rebecca N. Wright, Sara Spalding:
Experimental Performance of Shared RSA Modulus Generation. Algorithmica 33(1): 89-103 (2002) - Neal E. Young:
On-Line File Caching. Algorithmica 33(3): 371-383 (2002)
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-19 17:22 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