@article{Ramachandran/97,
AUTHOR = {Ramachandran, Vijaya},
TITLE = {Parallel algorithms for reducible flow graphs},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {1-31},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Kranakis-Krizanc/97,
AUTHOR = {Kranakis, Evangelos and Krizanc, Danny},
TITLE = {Distributed computing on anonymous hypercube networks},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {32-50},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Goodrich-Tamassia/97,
AUTHOR = {Goodrich, Michael T. and Tamassia, Roberto},
TITLE = {Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {51-73},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Czumaj-Gasieniec-Piotrow-Rytter/97,
AUTHOR = {Czumaj, Artur and G{\c{a}}sieniec, Leszek and Piotr{\'{o}}w, Marek and Rytter, Wojciech},
TITLE = {Sequential and parallel approximation of shortest superstrings},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {74-100},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Aroya-Newman-Schuster/97,
AUTHOR = {Aroya, Ishai Ben and Newman, Ilan and Schuster, Assaf},
TITLE = {Randomized single-target hot-potato routing},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {101-120},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Weihe/97a,
AUTHOR = {Weihe, Karsten},
TITLE = {Edge-disjoint $(s,t)$-paths in undirected planar graphs in linear time},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {121-138},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Thorup/97a,
AUTHOR = {Thorup, Mikkel},
TITLE = {Parallel shortcutting of rooted trees},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {139-159},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Thurimella/97,
AUTHOR = {Thurimella, Ramakrishna},
TITLE = {Sub-linear distributed algorithms for sparse certificates and biconnected components},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {160-179},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Garay-Gopal-Kutten-Mansour-Yung/97,
AUTHOR = {Garay, Juan A. and Gopal, Inder S. and Kutten, Shay and Mansour, Yishay and Yung, Moti},
TITLE = {Efficient on-line call control algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {180-194},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Pittel-Weishaar/97,
AUTHOR = {Pittel, Boris and Weishaar, Robert S.},
TITLE = {On-line coloring of sparse random graphs and random trees},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {195-205},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Loebl-Nesetril/97,
AUTHOR = {Loebl, Martin and Ne{\u{s}}et{\u{r}}il, Jaroslav},
TITLE = {Linearity and unprovability of set union problem strategies --- I. Linearity of strong postorder},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {207-220},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Plaxton-Suel/97,
AUTHOR = {Plaxton, C. Greg and Suel, Torsten},
TITLE = {Lower bounds for Shellsort},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {221-240},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bartal-Rosen/97,
AUTHOR = {Bartal, Yair and Ros{\'{e}}n, Adi},
TITLE = {The distributed $k$-server problem --- A competitive distributed translator for $k$-server algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {241-264},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Halldorsson/97,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M.},
TITLE = {Parallel and on-line graph coloring},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {265-280},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Shioura-Uno/97,
AUTHOR = {Shioura, Akiyoshi and Uno, Takeaki},
TITLE = {A linear time algorithm for finding a $k$-tree core},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {281-290},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Higham-Kirkpatrick-Abrahamson-Adler/97,
AUTHOR = {Higham, Lisa and Kirkpatrick, David and Abrahamson, Karl and Adler, Andrew},
TITLE = {Optimal algorithms for probabilistic solitude detection on anonymous rings},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {291-328},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Wang/97d,
AUTHOR = {Wang, Biing-Feng},
TITLE = {Tighter bounds on the solution of a divide-and-conquer maximin recurrence},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {329-344},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Brinkmann-Dress/97,
AUTHOR = {Brinkmann, Gunnar and Dress, Andreas W.M.},
TITLE = {A constructive enumeration of fullerenes},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {345-358},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Zhou-Suzuki-Nishizeki/97,
AUTHOR = {Zhou, Xiao and Suzuki, Hitoshi and Nishizeki, Takao},
TITLE = {An $NC$ parallel algorithm for edge-coloring series ---- Parallel multigraphs},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {359-374},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Eppstein/97a,
AUTHOR = {Eppstein, David},
TITLE = {Minimum range balanced cuts via dynamic subset sums},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {375-385},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bradford-Fleischer-Smid/97,
AUTHOR = {Bradford, Phillip G. and Fleischer, Rudolf and Smid, Michiel},
TITLE = {More efficient parallel totally monotone matrix searching},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {386-400},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}