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