ACM Journal of Experimental Algorithms, Volume 3

Volume 3, 1998

• Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand:
  Power Balance and Apportionment Algorithms for the United States Congress. 1
  Electronic Edition (link) BibTeX
• Seonghun Cho, Sartaj Sahni:
  Weight-Biased Leftist Trees and Modified Skip Lists. 2
  Electronic Edition (link) BibTeX
• Yong Yan, Xiaodong Zhang:
  Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heaps. 3
  Electronic Edition (link) BibTeX
• David R. Helman, Joseph JáJá, David A. Bader:
  A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation. 4
  Electronic Edition (link) BibTeX

• Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasquale:
  Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. 5
  Electronic Edition (link) BibTeX
• Jacob Magun:
  Greedy Matching Algorithms: An Experimental Study. 6
  Electronic Edition (link) BibTeX
• Arne Andersson, Stefan Nilsson:
  Implementing Radixsort. 7
  Electronic Edition (link) BibTeX
• Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin:
  Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. 8
  Electronic Edition (link) BibTeX
• Tomasz Radzik:
  Implementation of Dynamic Trees with In-Subtree Operations. 9
  Electronic Edition (link) BibTeX