default search action
ACM Journal of Experimental Algorithmics, Volume 5
Volume 5, 2000
- David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. 1 - Kyunrak Chong, Sartaj Sahni:
Correspondence-Based Data Structures for Double-Ended Priority Queues. 2 - Li Xiao, Xiaodong Zhang, Stefan A. Kubricht:
Improving Memory Performance of Sorting Algorithms. 3
- Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov:
Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning. 5 - Matthew S. Levine:
Finding the Right Cutting Planes for the TSP. 6 - Peter Sanders:
Fast Priority Queues for Cached Memory. 7 - Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. 8 - Tetsuo Shibuya:
Computing the nxm Shortest Paths Efficiently. 9
- Shlomit Dascal, Uzi Vishkin:
Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. 10 - Renato Fonseca F. Werneck, João C. Setubal:
Finding Minimum Congestion Spanning Trees. 11 - Frank Schulz, Dorothea Wagner, Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. 12 - Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra:
The Design and Implementation of Planar Maps in CGAL. 13 - Naila Rahman, Rajeev Raman:
Analysing Cache Effects in Distribution Sorting. 14 - Jesper Bojesen, Jyrki Katajainen, Maz Spork:
Performance Engineering Case Study: Heap Construction. 15 - Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof:
Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL). 16 - Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory. 17
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.