ALENEX A

16 papers

YearTitle / Authors
2002A Compressed Breadth-First Search for Satisfiability.
DoRon B. Motter, Igor L. Markov
2002A Time-Sensitive System for Black-Box Combinatorial Optimization.
Vinhthuy T. Phan, Pavel Sumazin, Steven Skiena
2002Acceleration of K-Means and Related Clustering Algorithms.
Steven J. Phillips
2002Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers
David M. Mount, Clifford Stein
2002An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web.
Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti
2002An Improvement on Tree Selection Sort.
Jingchao Chen
2002Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation.
Kirk Pruhs, Eric Wiewiora
2002Experimental Evaluation of a New Shortest Path Algorithm.
Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
2002Getting More from Out-of-Core Columnsort.
Geeta Chaudhry, Thomas H. Cormen
2002Maintaining Dynamic Minimum Spanning Trees: An Experimental Study.
Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
2002On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.
Marcus Poggi de Aragão, Renato Fonseca F. Werneck
2002Partitioning Planar Graphs with Costs and Weights.
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
2002STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects.
Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled
2002The Treewidth of Java Programs.
Jens Gustedt, Ole A. Mæhle, Jan Arne Telle
2002Topological Sweep in Degenerate Cases.
Eynat Rafalin, Diane L. Souvaine, Ileana Streinu
2002Using Multi-level Graphs for Timetable Information in Railway Systems.
Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis