The SCEAS System
Navigation Menu

Journals in DBLP

ACM Journal of Experimental Algorithms
2000, volume: 5, number:

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002