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 109 matches
- 2001
- Eric J. Anderson, Joseph Hall, Jason D. Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes:
An Experimental Study of Data Migration Algorithms. WAE 2001: 145-158 - Arne Andersson, Per Carlsson, Fredrik Ygge:
Efficient Resource Allocation with Noisy Functions. WAE 2001: 91-105 - David A. Bader, Ajith K. Illendula, Bernard M. E. Moret, Nina R. Weisse-Bernstein:
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture. WAE 2001: 129-144 - Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist:
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. WAE 2001: 172-184 - Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau:
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. WAE 2001: 26-38 - Hervé Brönnimann:
Designing and Implementing a General Purpose Halfedge Data Structure. WAE 2001: 51-66 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Nearchos Paspallis, Paul G. Spirakis, Christos D. Zaroliagis:
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. WAE 2001: 159-171 - Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE 2001: 106-117 - Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel:
An Adaptable and Extensible Geometry Kernel. WAE 2001: 79-90 - Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón:
The Max-Shift Algorithm for Approximate String Matching. WAE 2001: 13-25 - Kazuo Iwama, Suguru Tamaki:
Exploiting Partial Knowledge of Satisfying Assignments. WAE 2001: 118-128 - Jyrki Katajainen, Bjarke Buur Mortensen:
Experiences with the Design and Implementation of Space-Efficient Deques. WAE 2001: 39-50 - Matthias Müller-Hannemann, Karsten Weihe:
Pareto Shortest Paths is Often Feasible in Practice. WAE 2001: 185-198 - Gonzalo Navarro, Mathieu Raffinot:
Compact DFA Representation for Fast Regular Expression Search. WAE 2001: 1-12 - Naila Rahman, Richard Cole, Rajeev Raman:
Optimised Predecessor Data Structures for Internal Memory. WAE 2001: 67-78 - Stefan Näher, Dorothea Wagner:
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1982, Springer 2001, ISBN 3-540-42512-8 [contents] - Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela:
Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2141, Springer 2001, ISBN 3-540-42500-4 [contents] - 2000
- Susanne Albers, Bianca Schröder:
An Experimental Study of Online Scheduling Algorithms. WAE 2000: 11-22 - Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe:
Efficient Sorting Using Registers and Caches. WAE 2000: 51-62 - Javed A. Aslam, Alain Leblanc, Clifford Stein:
Clustering Data without Prior Knowledge. WAE 2000: 74-86 - Werner Backes, Susanne Wetzel:
Lattice Basis Reduction with Dynamic Approximation. WAE 2000: 63-73 - Jesper Bojesen, Jyrki Katajainen:
Interchanging Two Segments of an Array in a Hierarchical Memory System. WAE 2000: 159-170 - Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. WAE 2000: 230-242 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. WAE 2000: 99-110 - Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE 2000: 147-158 - Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE 2000: 218-229 - Stefan Edelkamp, Patrick Stiegeler:
Pushing the Limits in Sequential Sorting. WAE 2000: 39-50 - Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. WAE 2000: 195-206 - Iddo Hanniel, Dan Halperin:
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. WAE 2000: 171-182 - Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. WAE 2000: 123-134
skipping 79 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-10-22 14:36 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