@article{Moran-Taubenfeld/97,
AUTHOR = {Moran, Shlomo and Taubenfeld, Gadi},
TITLE = {A lower bound on wait-free counting},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {1-19},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Haldar/97,
AUTHOR = {Haldar, S.},
TITLE = {An ``All pairs shortest paths'' distributed algorithm using $2n^2$ messages},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {20-36},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Frederickson/97,
AUTHOR = {Frederickson, Greg N.},
TITLE = {A data structure for dynamically maintaining rooted trees},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {37-65},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hambrusch-Tu/97a,
AUTHOR = {Hambrusch, Susanne E. and Tu, Hung-Yi},
TITLE = {Edge weight reduction problems in directed acyclic graphs},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {66-93},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bodlaender-Engelfriet/97,
AUTHOR = {Bodlaender, Hans L. and Engelfriet, Joost},
TITLE = {Domino treewidth},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {94-123},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Chrobak-Larmore-Reingold-Westbrook/97,
AUTHOR = {Chrobak, Marek and Larmore, Lawrence L. and Reingold, Nick and Westbrook, Jeffery},
TITLE = {Page migration algorithms using work functions},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {124-157},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Even-Litman-Winkler/97,
AUTHOR = {Even, Shimon and Litman, Ami and Winkler, Peter},
TITLE = {Computing with snakes in directed networks of automata},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {158-170},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Broder-Mayr/97,
AUTHOR = {Broder, Andrei Z. and Mayr, Ernst W.},
TITLE = {Counting minimum weight spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {171-176},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Eppstein-Hirschberg/97,
AUTHOR = {Eppstein, David and Hirschberg, Daniel S.},
TITLE = {Choosing subsets with maximum weighted average},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {177-193},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Rauch_Henzinger/97,
AUTHOR = {Rauch Henzinger, Monika},
TITLE = {A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {194-220},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Giancarlo-Grossi/97,
AUTHOR = {Giancarlo, Raffaele and Grossi, Roberto},
TITLE = {Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {223-265},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Guttmann-Beck-Hassin/97,
AUTHOR = {Guttmann-Beck, Nili and Hassin, Refael},
TITLE = {Approximation algorithms for min-max tree partition},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {266-286},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fingerhut-Suri-Turner/97,
AUTHOR = {Fingerhut, J. Andrew and Suri, Subhash and Turner, Jonathan S.},
TITLE = {Designing least-cost nonblocking broadband networks},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {287-309},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fekete-Khuller-Klemmstein-Raghavachari-Young/97,
AUTHOR = {Fekete, S{\'{a}}ndor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal},
TITLE = {A network-flow technique for finding low-weight bounded-degree spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {310-324},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Amir-Apostolico-Lewenstein/97,
AUTHOR = {Amir, Amihood and Apostolico, Alberto and Lewenstein, Moshe},
TITLE = {Inverse pattern matching},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {325-339},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Breslauer-Jiang-Jiang/97,
AUTHOR = {Breslauer, Dany and Jiang, Tao and Jiang, Zhigen},
TITLE = {Rotations of periodic strings and short superstrings},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {340-353},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Amir-Benson-Farach/97,
AUTHOR = {Amir, Amihood and Benson, Gary and Farach, Martin},
TITLE = {Optimal two-dimensional compressed matching},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {354-379},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Balasubramanian-Raman-Srinivasaragavan/97,
AUTHOR = {Balasubramanian, R. and Raman, Venkatesh and Srinivasaragavan, G.},
TITLE = {Finding scores in tournaments},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {380-394},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Dubois-Boufkhad/97,
AUTHOR = {Dubois, O. and Boufkhad, Y.},
TITLE = {A general upper bound for the satisfiability threshold of random $r$-SAT formulae},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {395-420},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}