Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar4. WAE 2000: Saarbrücken, Germany
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
Invited Lecture
Karsten Weihe:
On the Differences between "Practical" and "Applied". 1-10
Contributed Papers
Susanne Albers, Bianca Schröder:
An Experimental Study of Online Scheduling Algorithms. 11-22Kurt Mehlhorn, Guido Schäfer:
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. 23-38Stefan Edelkamp, Patrick Stiegeler:
Pushing the Limits in Sequential Sorting. 39-50Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe:
Efficient Sorting Using Registers and Caches. 51-62Werner Backes, Susanne Wetzel:
Lattice Basis Reduction with Dynamic Approximation. 63-73Javed A. Aslam, Alain Leblanc, Clifford Stein:
Clustering Data without Prior Knowledge. 74-86Annegret Liebers, Karsten Weihe:
Recognizing Bundles in Time Table Graphs - A Structural Approach. 87-98Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. 99-110Isabelle Guérin Lassous, Jens Gustedt:
Portable List Ranking: An Experimental Study. 111-122Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. 123-134Peter Sanders, Rudolf Fleischer:
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. 135-146Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach. 147-158Jesper Bojesen, Jyrki Katajainen:
Interchanging Two Segments of an Array in a Hierarchical Memory System. 159-170Iddo Hanniel, Dan Halperin:
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. 171-182Jan Vahrenhold, Klaus H. Hinrichs:
Planar Point Location for Large Data Sets: To Seek or Not to Seek. 183-194Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. 195-206Guido Proietti:
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. 207-217Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. 218-229Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. 230-242
last updated on 2019-10-23 23:37 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
