ACM Journal of Experimental Algorithms
2002
- Heuristics on Lattice Basis Reduction in Practiceby: Werner Backes, Susanne Wetzel v. 7 p. 1 - 1
- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVMby: Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto v. 7 p. 2 - 2
- An Experimental Study of Online Scheduling Algorithmsby: Susanne Albers, Bianca Schröder v. 7 p. 3 - 3
- Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structuresby: Kurt Mehlhorn, Guido Schäfer v. 7 p. 4 - 4
- Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisonsby: Stefan Edelkamp, Patrick Stiegeler v. 7 p. 5 - 5
- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Treesby: Thomas Erlebach, Klaus Jansen v. 7 p. 6 - 6
- Portable List Ranking: An Experimental Studyby: Isabelle Guérin Lassous, Jens Gustedt v. 7 p. 7 - 7
- Planar Point Location For Large Data Sets: To Seek Or Not To Seekby: Jan Vahrenhold, Klaus Hinrichs v. 7 p. 8 - 8
- Efficient Sorting Using Registers and Cachesby: Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter v. 7 p. 9 - 9
- Finding the Chromatic Number by Means of Critical Graphsby: Francine Herrmann, Alain Hertz v. 7 p. 10 - 10
- Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problemsby: Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze v. 7 p. 11 - 11
- Relational Concept Learning by Cooperative Evolutionby: Filippo Neri v. 7 p. 12 - 12
- I/O-Efficient Algorithms for Problems on Grid-Based Terrainsby: Lars Arge, Laura Toma, Jeffrey Scott Vitter v. 6 p. 1 - 1
- Rwmoving Cycles for Minimizing Crossingsby: Camil Demetrescu, Irene Finocchi v. 6 p. 2
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysisby: Harold N. Gabow, Tadayoshi Kohno v. 6 p. 3 - 3
- An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithmsby: Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup v. 6 p. 4 - 4
- Caching and Scheduling for Broadcast Disk Systemsby: Vincenzo Liberatore v. 6 p. 5 - 5
- Geometric Minimum Spanning Trees via Well-Separated Pair Decompositionsby: Giri Narasimhan, Martin Zachariasen v. 6 p. 6 - 6
- Adapting Radix Sort to the Memory Hierarchyby: Naila Rahman, Rajeev Raman v. 6 p. 7 - 7
- Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimizationby: Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh v. 6 p. 8 - 8
- An Experimental Study of Dynamic Algorithms for Transitive Closureby: Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis v. 6 p. 9 - 9
- The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compressionby: Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sahinalp v. 6 p. 10 - 10
- Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairsby: David Eppstein v. 5 p. 1 - 1
- Correspondence-Based Data Structures for Double-Ended Priority Queuesby: Kyunrak Chong, Sartaj Sahni v. 5 p. 2 - 2
- Improving Memory Performance of Sorting Algorithmsby: Li Xiao, Xiaodong Zhang, Stefan A. Kubricht v. 5 p. 3 - 3
- Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automataby: Gonzalo Navarro, Mathieu Raffinot v. 5 p. 4 - 4
- Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioningby: Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov v. 5 p. 5 - 5
- Finding the Right Cutting Planes for the TSPby: Matthew S. Levine v. 5 p. 6 - 6
- Fast Priority Queues for Cached Memoryby: Peter Sanders v. 5 p. 7 - 7
- Implementing Weighted b-Matching Algorithms: Insights from a Computational Studyby: Matthias Müller-Hannemann, Alexander Schwartz v. 5 p. 8 - 8
- Computing the nxm Shortest Paths Efficientlyby: Tetsuo Shibuya v. 5 p. 9 - 9
- Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelismby: Shlomit Dascal, Uzi Vishkin v. 5 p. 10 - 10
- Finding Minimum Congestion Spanning Treesby: Renato Fonseca F. Werneck, João C. Setubal v. 5 p. 11 - 11
- Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transportby: Frank Schulz, Dorothea Wagner, Karsten Weihe v. 5 p. 12 - 12
- The Design and Implementation of Planar Maps in CGALby: Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra v. 5 p. 13 - 13
- Analysing Cache Effects in Distribution Sortingby: Naila Rahman, Rajeev Raman v. 5 p. 14 - 14
- Performance Engineering Case Study: Heap Constructionby: Jesper Bojesen, Jyrki Katajainen, Maz Spork v. 5 p. 15 - 15
- Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL)by: Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof v. 5 p. 16 - 16
- An Experimental Study of Priority Queues in External Memoryby: Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer v. 5 p. 17 - 17
- A Memetic Algorithm to Schedule Planned Maintenance for the National Gridby: Edmund K. Burke, James Smith v. 4 p. 1 - 1
- A New String-Pattern Matching Algorithm Using Partitioning and Hashing Efficientlyby: Sun Kim v. 4 p. 2 - 2
- Matrix Multiplication: A Case Study of Enhanced Data Cache Utilizationby: Nadav Eiron, Michael Rodeh, Iris Steinwarts v. 4 p. 3 - 3
- Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networksby: Thomas Erlebach, Klaus Jansen v. 4 p. 4 - 4
- Hybrid Tree Reconstruction Methodsby: Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph v. 4 p. 5 - 5
- A Computational Study of Routing Algorithms for Realistic Transportation Networksby: Riko Jacob, Madhav V. Marathe, Kai Nagel v. 4 p. 6 - 6
- Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Designby: Matthias Müller-Hannemann, Alexander Schwartz v. 4 p. 7 - 7
- Computing the Width of a Three-Dimensional Point Set: An Experimental Studyby: Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan v. 4 p. 8 - 8
- Power Balance and Apportionment Algorithms for the United States Congressby: Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand v. 3 p. 1 - 1
- Weight-Biased Leftist Trees and Modified Skip Listsby: Seonghun Cho, Sartaj Sahni v. 3 p. 2 - 2
- Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heapsby: Yong Yan, Xiaodong Zhang v. 3 p. 3 - 3
- A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluationby: David R. Helman, Joseph JáJá, David A. Bader v. 3 p. 4 - 4
- Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problemby: Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasquale v. 3 p. 5 - 5
- Greedy Matching Algorithms: An Experimental Studyby: Jacob Magun v. 3 p. 6 - 6
- Implementing Radixsortby: Arne Andersson, Stefan Nilsson v. 3 p. 7 - 7
- Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithmsby: Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin v. 3 p. 8 - 8
- Implementation of Dynamic Trees with In-Subtree Operationsby: Tomasz Radzik v. 3 p. 9 - 9
- Algorithmic Aspects in Speech Recognition: An Introductionby: Adam L. Buchsbaum, Raffaele Giancarlo v. 2 p. 1 - 1
- Reactive Search, a History-Sensitive Heuristic for MAX-SATby: Roberto Battiti, Marco Protasi v. 2 p. 2 - 2
- The Exponential Hash Functionby: Bradley J. Smith, Gregory L. Heileman, Chaouki T. Abdallah v. 2 p. 3 - 3
- An Experimental Study of the Basis for Graph Drawing Algorithmsby: Helen C. Purchase, Robert F. Cohen, M. I. James v. 2 p. 4 - 4
- An Empirical Study of Dynamic Graph Algorithmsby: David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano v. 2 p. 5 - 5
- Irredundant Intervalsby: Donald E. Knuth v. 1 p. 1 - 1
- Predicting String Search Speedby: Arthur Gittelman v. 1 p. 2 - 2
- Practical Parallel Algorithms for Personalized Communication and Integer Sortingby: David A. Bader, David R. Helman, Joseph JáJá v. 1 p. 3 - 3
- The Influence of Caches on the Performance of Heapsby: Anthony LaMarca, Richard E. Ladner v. 1 p. 4 - 4
![[SWISH++]](/docis/swish-powered.gif){kind=small}
