@article{Krizanc/96,
AUTHOR = {Krizanc, Danny},
TITLE = {Time-randomness trade-offs in parallel computation},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {1-19},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Lagergren/96,
AUTHOR = {Lagergren, Jens},
TITLE = {Efficient parallel algorithms for graphs of bounded tree-width},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {20-44},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Buss-Kanellakis-Ragde-Shvartsman/96,
AUTHOR = {Buss, Jonathan F. and Kanellakis, Paris C. and Ragde, Prabhakar L. and Shvartsman, Alex Allister},
TITLE = {Parallel algorithms with processor failures and delays},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {45-86},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Cohen-Fredman/96,
AUTHOR = {Cohen, David and Fredman, Michael L.},
TITLE = {Weighted binary trees for concurrent searching},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {87-112},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{van_Vliet/96,
AUTHOR = {van Vliet, Andr{\'{e}}},
TITLE = {On the asymptotic worst case behavior of harmonic fit},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {113-136},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Caro-Sebo-Tarsi/96,
AUTHOR = {Caro, Yair and Seb{\"o}, Andr{\'{a}}s and Tarsi, Michael},
TITLE = {Recognizing greedy structures},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {137-156},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Lenstra-Veldhorst-Veltman/96,
AUTHOR = {Lenstra, Jan Karel and Veldhorst, Marinus and Veltman, Bart},
TITLE = {The complexity of scheduling trees with communication delays},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {157-173},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Zhou-Suzuki-Nishizeki/96,
AUTHOR = {Zhou, Xiao and Suzuki, Hitoshi and Nishizeki, Takao},
TITLE = {A linear algorithm for edge-coloring series--parallel multigraphs},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {1},
PAGES = {174-201},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bollobas-Fenner-Frieze/96,
AUTHOR = {Bollob{\'{a}}s, B. and Fenner, T.I. and Frieze, A.M.},
TITLE = {On the best case of Heapsort},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {205-217},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Itai-Shachnai/96,
AUTHOR = {Itai, Alon and Shachnai, Hadas},
TITLE = {Adaptive source routing in high-speed networks},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {218-243},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Jadhav-Mukhopadhyay-Bhattacharya/96,
AUTHOR = {Jadhav, Shreesh and Mukhopadhyay, Asish and Bhattacharya, Binay},
TITLE = {An optimal algorithm for the intersection radius of a set of convex polygons},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {244-267},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Colbourn-Myrvold-Neufeld/96,
AUTHOR = {Colbourn, Charles J. and Myrvold, Wendy J. and Neufeld, Eugene},
TITLE = {Two algorithms for unranking arborescences},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {268-281},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Dasgupta-Chakrabarti-DeSarkar/96a,
AUTHOR = {Dasgupta, Pallab and Chakrabarti, P.P. and DeSarkar, S.C.},
TITLE = {Multiobjective heuristic search in AND/OR graphs},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {282-311},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Frieze-Suen/96,
AUTHOR = {Frieze, Alan and Suen, Stephen},
TITLE = {Analysis of two simple heuristics on a random instance of $k$-SAT},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {312-355},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Panconesi-Srinivasan/96,
AUTHOR = {Panconesi, Alessandro and Srinivasan, Aravind},
TITLE = {On the complexity of distributed network decomposition},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {356-374},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Heun-Mayr/96,
AUTHOR = {Heun, Volker and Mayr, Ernst W.},
TITLE = {A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {375-399},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Karger-Phillips-Torng/96,
AUTHOR = {Karger, David R. and Phillips, Steven J. and Torng, Eric},
TITLE = {A better algorithm for an ancient scheduling problem},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {400-430},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Knuth/96,
AUTHOR = {Knuth, Donald E.},
TITLE = {An exact analysis of stable allocation},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {431-442},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Peng-Lo/96,
AUTHOR = {Peng, Shietung and Lo, Win-tsung},
TITLE = {Efficient algorithms for finding a core of a tree with a specified length},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {445-458},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Chen/96c,
AUTHOR = {Chen, Danny Z.},
TITLE = {Optimally computing the shortest weakly visible subedge of a simple polygon},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {459-478},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Burley/96,
AUTHOR = {Burley, William R.},
TITLE = {Traversing layered graphs using the work function algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {479-511},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Subramanian/96,
AUTHOR = {Subramanian, Ashok},
TITLE = {An explanation of splaying},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {512-525},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Iwama-Iwamoto/96a,
AUTHOR = {Iwama, Kazuo and Iwamoto, Chuzo},
TITLE = {$\alpha$-connectivity: A gradually nonparallel graph problem},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {526-544},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Matousek/96,
AUTHOR = {Matou{\v{s}}ek, Ji{\v{r}}{\'{i}}},
TITLE = {Derandomization in computational geometry},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {545-580},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Agarwal-Sen/96,
AUTHOR = {Agarwal, Pankaj K. and Sen, Sandeep},
TITLE = {Selection in monotone matrices and computing $k$th nearest neighbors},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {581-601},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Thorup/96a,
AUTHOR = {Thorup, Mikkel},
TITLE = {Efficient preprocessing of simple binary pattern forests},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {602-612},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Iwama-Miyano-Kambayashi/96,
AUTHOR = {Iwama, Kazuo and Miyano, Eiji and Kambayashi, Yahiko},
TITLE = {Routing problems on the mesh of buses},
JOURNAL = {J. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {613-631},
YEAR = {1996},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}