 | The ACM Journal of Experimental Algorithmics |
| The ACM Journal of Experimental Algorithmics |
Please Note: The articles in this volume now appear in the ACM Digital Library. You can find the table of contents, together with browsing and indexing services, at the ACM Digital Library, Journal of Experimental Algorithmics, Volume 3.
Article 1:
Power Balance and Apportionment Algorithms
for the United States Congress, by Lane A. Hemaspaandra, University of
Rochester, Kulathur S. Rajasethupathy, SUNY-Brockport, Prasanna Sethupathy,
Stanford University, and Marius Zimand, Georgia Southwestern State University
Article 2:
Weight-Biased Leftist Trees and Modified Skip Lists, by
Seonghun Cho and Sartaj Sahni, University of Florida
Article 3:
Lock Bypassing: An Efficient Algorithm for Concurrently
Accessing Priority Heaps, by Yong Yan and Xiaodong Zhang,
College of William and Mary
Article 4:
A New Deterministic Parallel Sorting Algorithm
with an Experimental Evaluation, by David R. Helman, University of Maryland,
Joseph JáJá, University of Maryland, and David A. Bader,
University of New Mexico
The guest editors for this special issue are
Article 5:
Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem,
by Daniele Frigioni, Mario Ioffreda, Umberto Nanni, and Giulio Pasqualone,
Università di Roma "La Sapienza"
Article 6:
Greedy Matching Algorithms: An Experimental
Study, by Jacob Magun, Swiss Federal Institute of Technology, Zürich
Article 7:
Implementing Radixsort,
by Arne Andersson, Lund University, and Stefan Nilsson,
Helsinki Institute of Technology
Article 8:
Augment or Push: A Computational Study
of Bipartite Matching and Unit-Capacity Flow Algorithms,
by Boris V. Cherkassky, Central Institute for Economics and
Mathematics (Moscow), Andrew V. Goldberg and Paul Martin, NEC Research
Institute, Joao C. Setubal and Jorge Stolfi, University of Campinas (Brazil)
Article 9:
Implementation of Dynamic Trees with In-Subtree Operations,
by Tomasz Radzik, King's College, London
Please note that the source text and Postscript/PDF versions are the
definitive versions; the HTML version is provided for quick online perusal only.
Last updated and validated January 8, 1999, by editor@jea.acm.org