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 32 matches
- 1996
- Pankaj K. Agarwal, Marc J. van Kreveld:
Connected Component and Simple Polygon Intersection Searching. Algorithmica 15(6): 626-660 (1996) - Richard J. Anderson, Paul Beame, Erik Brisson:
Parallel Algorithms for Arrangements. Algorithmica 15(2): 104-125 (1996) - Alberto Apostolico, Franco P. Preparata:
Data Structures and Algorithms for the String Statistics Problem. Algorithmica 15(5): 481-494 (1996) - Egon Balas, Jue Xue:
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. Algorithmica 15(5): 397-412 (1996) - Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel:
Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15(6): 600-625 (1996) - Giuseppe Di Battista, Roberto Tamassia:
On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4): 302-318 (1996) - Yang Cai, M. C. Kong:
Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems. Algorithmica 15(6): 572-599 (1996) - Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi:
Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996) - Joseph Cheriyan, Kurt Mehlhorn:
Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica 15(6): 521-549 (1996) - Michael B. Dillencourt, Hanan Samet:
Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. Algorithmica 15(1): 82-102 (1996) - K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri:
Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph. Algorithmica 15(3): 242-255 (1996) - Herbert Edelsbrunner, Nimish R. Shah:
Incremental Topological Flipping Works for Regular Triangulations. Algorithmica 15(3): 223-241 (1996) - Greg N. Frederickson:
Searching Among Intervals and Compact Routing Tables. Algorithmica 15(5): 448-466 (1996) - Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright:
Sweep Methods for Parallel Computational Geometry. Algorithmica 15(2): 126-153 (1996) - Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka:
Strongly Adaptive Token Distribution. Algorithmica 15(5): 413-427 (1996) - Konstantinos Kalpakis, Yelena Yesha:
Scheduling Tree DAGs on Parallel Architectures. Algorithmica 15(4): 373-396 (1996) - David G. Kirkpatrick, Teresa M. Przytycka:
Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. Algorithmica 15(2): 172-192 (1996) - Danny Krizanc, Lata Narayanan, Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays. Algorithmica 15(4): 319-331 (1996) - Ruth Kuchem, Dorothea Wagner, Frank Wagner:
Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996) - Björn Lisper:
Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling. Algorithmica 15(2): 193-203 (1996) - F. Miller Maley:
Testing Homotopic Routability Under Polygonal Wiring Rules. Algorithmica 15(1): 1-16 (1996) - Bhubaneswar Mishra:
Bidirectional Edges Problem: Part I-A Simple Algorithm. Algorithmica 15(3): 256-286 (1996) - John L. Nazareth:
The Implementation of Linear Programming Algorithms Bases on Homotopies. Algorithmica 15(4): 332-350 (1996) - Peichen Pan, Weiping Shi, C. L. Liu:
Area Minimization for Hierarchical Floorplans. Algorithmica 15(6): 550-571 (1996) - G. N. Srinivasa Prasanna, Bruce R. Musicus:
The Optimal Control Approach to Generalized Multiprocessor Scheduling. Algorithmica 15(1): 17-49 (1996) - J. Scott Provan, Douglas R. Shier:
A Paradigm for Listing (s, t)-Cuts in Graphs. Algorithmica 15(4): 351-372 (1996) - Ronitt Rubinfeld:
Designing Checkers for Programs that Run in Parallel. Algorithmica 15(4): 287-301 (1996) - Renzo Sprugnoli:
Recurrence Relations on Heaps. Algorithmica 15(5): 467-480 (1996) - Roberto Tamassia, Jeffrey Scott Vitter:
Optimal Cooperative Search in Fractional Cascaded Data Structures. Algorithmica 15(2): 154-171 (1996) - Shouwen Tang, Kaizhong Zhang, Xiaolin Wu:
Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics. Algorithmica 15(1): 68-81 (1996)
skipping 2 more matches
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-12-24 23:25 CET 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