Sign in
WAE
1997
1998
2000
2001
1997
2001
Keyphrases
Publications
2001
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)
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)
Kazuo Iwama
,
Suguru Tamaki
Exploiting Partial Knowledge of Satisfying Assignments.
WAE
(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)
Boris Goldengorin
,
Diptesh Ghosh
,
Gerard Sierksma
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.
WAE
(2001)
Gianfranco Bilardi
,
Paolo D'Alberto
,
Alexandru Nicolau
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance.
WAE
(2001)
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)
Gonzalo Navarro
,
Mathieu Raffinot
Compact DFA Representation for Fast Regular Expression Search.
WAE
(2001)
Arne Andersson
,
Per Carlsson
,
Fredrik Ygge
Efficient Resource Allocation with Noisy Functions.
WAE
(2001)
Hervé Brönnimann
Designing and Implementing a General Purpose Halfedge Data Structure.
WAE
(2001)
Matthias Müller-Hannemann
,
Karsten Weihe
Pareto Shortest Paths is Often Feasible in Practice.
WAE
(2001)
Naila Rahman
,
Richard Cole
,
Rajeev Raman
Optimised Predecessor Data Structures for Internal Memory.
WAE
(2001)
Susan Hert
,
Michael Hoffmann
,
Lutz Kettner
,
Sylvain Pion
,
Michael Seel
An Adaptable and Extensible Geometry Kernel.
WAE
(2001)
Costas S. Iliopoulos
,
Laurent Mouchard
,
Yoan J. Pinzón
The Max-Shift Algorithm for Approximate String Matching.
WAE
(2001)
Jyrki Katajainen
,
Bjarke Buur Mortensen
Experiences with the Design and Implementation of Space-Efficient Deques.
WAE
(2001)
2000
Thomas Erlebach
,
Klaus Jansen
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
WAE
(2000)
Stefan Edelkamp
,
Patrick Stiegeler
Pushing the Limits in Sequential Sorting.
WAE
(2000)
Karsten Weihe
On the Differences between "Practical" and "Applied".
WAE
(2000)
Annegret Liebers
,
Karsten Weihe
Recognizing Bundles in Time Table Graphs - A Structural Approach.
WAE
(2000)
Jan Vahrenhold
,
Klaus H. Hinrichs
Planar Point Location for Large Data Sets: To Seek or Not to Seek.
WAE
(2000)
Peter Sanders
,
Rudolf Fleischer
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
WAE
(2000)
Camil Demetrescu
,
Irene Finocchi
,
Giuseppe Liotta
Visualizing Algorithms over the Web with the Publication-Driven Approach.
WAE
(2000)
Kazuo Iwama
,
Daisuke Kawai
,
Shuichi Miyazaki
,
Yasuo Okabe
,
Jun Umemoto
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
WAE
(2000)
Guido Proietti
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.
WAE
(2000)
Jesper Bojesen
,
Jyrki Katajainen
Interchanging Two Segments of an Array in a Hierarchical Memory System.
WAE
(2000)
Iddo Hanniel
,
Dan Halperin
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.
WAE
(2000)
Javed A. Aslam
,
Alain Leblanc
,
Clifford Stein
Clustering Data without Prior Knowledge.
WAE
(2000)
Susanne Albers
,
Bianca Schröder
An Experimental Study of Online Scheduling Algorithms.
WAE
(2000)
Kurt Mehlhorn
,
Guido Schäfer
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures.
WAE
(2000)
Isabelle Guérin Lassous
,
Jens Gustedt
Portable List Ranking: An Experimental Study.
WAE
(2000)
Lars Arge
,
Jeffrey S. Chase
,
Jeffrey Scott Vitter
,
Rajiv Wickremesinghe
Efficient Sorting Using Registers and Caches.
WAE
(2000)
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)
Massimiliano Caramia
,
Paolo Dell'Olmo
,
Giuseppe F. Italiano
New Algorithms for Examination Timetabling.
WAE
(2000)
Camil Demetrescu
,
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.
WAE
(2000)
Werner Backes
,
Susanne Wetzel
Lattice Basis Reduction with Dynamic Approximation.
WAE
(2000)
1999
Eyal Flato
,
Dan Halperin
,
Iddo Hanniel
,
Oren Nechushtan
The Design and Implementation of Planar Maps in CGAL.
WAE
(1999)
Bill McColl
BSP Algorithms - Write Once, Run Anywhere.
WAE
(1999)
Naila Rahman
,
Rajeev Raman
Analysing Cache Effects in Distribution Sorting.
WAE
(1999)
Panagiota Fatourou
,
Paul G. Spirakis
,
Panagiotis Zarafidis
,
Anna Zoura
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.
WAE
(1999)
Gonzalo Navarro
,
Mathieu Raffinot
Fast Regular Expression Search.
WAE
(1999)
Dimitris J. Kavvadias
,
Elias C. Stavropoulos
Evaluation of an Algorithm for the Transversal Hypergraph Problem.
WAE
(1999)
Daniel H. Huson
,
Kelly Ann Smith
,
Tandy J. Warnow
Estimating Large Distances in Phylogenetic Reconstruction.
WAE
(1999)
Jesper Bojesen
,
Jyrki Katajainen
,
Maz Spork
Performance Engineering Case Study: Heap Construction.
WAE
(1999)
Robert Giegerich
,
Stefan Kurtz
,
Jens Stoye
Efficient Implementation of Lazy Suffix Trees.
WAE
(1999)
Frank Schulz
,
Dorothea Wagner
,
Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
WAE
(1999)
Sabine Hanke
The Performance of Concurrent Red-Black Tree Algorithms.
WAE
(1999)
Michael L. Fredman
A Priority Queue Transform.
WAE
(1999)
Andrew V. Goldberg
Selecting Problems for Algorithm Evaluation.
WAE
(1999)
Víctor M. Jiménez
,
Andrés Marzal
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison.
WAE
(1999)
Shlomit Dascal
,
Uzi Vishkin
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism.
WAE
(1999)