External Links

    Journal: ACM Transactions on Algorithms

    Volume 1, Issue 2

    177 -- 213Svante Janson. Individual displacements for linear probing hashing with different insertion policies
    214 -- 242Alfredo Viola. Exact distribution of individual displacements in linear probing hashing
    243 -- 264Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. Maintaining information in fully dynamic trees with top trees
    265 -- 282Raja Jothi, Balaji Raghavachari. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
    283 -- 323Michael Elkin. Computing almost shortest paths
    324 -- 337Marcelo H. de Carvalho, Joseph Cheriyan. An ::::O::::(::::VE::::) algorithm for ear decompositions of matching-covered graphs
    338 -- 349Ashish Goel, Adam Meyerson, Serge A. Plotkin. Approximate majorization and fair online load balancing
    350 -- 366Marek Chrobak, Petr Kolman, Jiri Sgall. The greedy algorithm for the minimum common string partition problem
    runs on