@article{Kantor-Taylor/88,
AUTHOR = {Kantor, W.M. and Taylor, D.E.},
TITLE = {Polynomial-time versions of Sylow's theorem},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {1-17},
YEAR = {1988, March},
INSTITUTION = {Oregon Univ., Eugene, OR, USA},
}
@article{Hershberger-Guibas/88,
AUTHOR = {Hershberger, J. and Guibas, L.J.},
TITLE = {An $O(n^2)$ shortest path algorithm for a non-rotating convex body},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {18-46},
YEAR = {1988, March},
INSTITUTION = {Dept. of Comput. Sci., Stanford Univ., CA, USA},
}
@article{Schnorr/88,
AUTHOR = {Schnorr, C.P.},
TITLE = {A more efficient algorithm for lattice basis reduction},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {47-62},
YEAR = {1988, March},
INSTITUTION = {Fachbereich Math./Info. Frankfurt Univ., Germany},
}
@article{Turner/88,
AUTHOR = {Turner, J.S.},
TITLE = {Almost all $k$-colorable graphs are easy to color},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {63-82},
YEAR = {1988, March},
INSTITUTION = {Dept. of Comput. Sci., Washington Univ., St. Louis, MO, USA},
}
@article{Karchmer-Naor/88,
AUTHOR = {Karchmer, M. and Naor, J.},
TITLE = {A fast parallel algorithm to color a graph with $\Delta$ colors},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {83-91},
YEAR = {1988, March},
INSTITUTION = {Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel},
}
@article{He-Yesha/88,
AUTHOR = {He, Xin and Yesha, Y.},
TITLE = {Binary tree algebraic computation and parallel algorithms for simple graphs},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {92-113},
YEAR = {1988, March},
INSTITUTION = {Dept. of Comput. \& Info. Sci., Ohio State Univ., Columbus, OH, USA},
}
@article{Leiserson-Saxe/88,
AUTHOR = {Leiserson, C.E. and Saxe, J.B.},
TITLE = {A mixed-integer linear programming problem which is efficiently solvable},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {114-128},
YEAR = {1988, March},
INSTITUTION = {Lab. for Comput. Sci., MIT, Cambridge, MA, USA},
}
@article{Kingston/88,
AUTHOR = {Kingston, J.H.},
TITLE = {A new proof of the Garsia-Wachs algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {129-136},
YEAR = {1988, March},
INSTITUTION = {Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA},
}
@article{Kaminski/88,
AUTHOR = {Kaminski, M.},
TITLE = {An algorithm for polynomial multiplication that does not depend on the ring constants},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {1},
PAGES = {137-147},
YEAR = {1988, March},
INSTITUTION = {Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel},
}
@article{Aurenhammer/88,
AUTHOR = {Aurenhammer, F.},
TITLE = {Improved algorithms for discs and balls using power diagrams},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {151-161},
YEAR = {1988, June},
INSTITUTION = {Inst. for Inf. Process., Tech. Univ. Graz, Austria},
}
@article{Ruskey/88,
AUTHOR = {Ruskey, F.},
TITLE = {Adjacent interchange generation of combinations},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {162-180},
YEAR = {1988, June},
INSTITUTION = {Dept. of Comput. Sci., Victoria Univ., BC, Canada},
}
@article{Frieze/88,
AUTHOR = {Frieze, A.M.},
TITLE = {An algorithm for finding hamilton cycles in random directed graphs},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {181-204},
YEAR = {1988, June},
INSTITUTION = {Dept. of Comput. Sci. \& Stat., Queen Mary Coll., London, UK},
}
@article{Soroker/88,
AUTHOR = {Soroker, D.},
TITLE = {Fast parallel strong orientation of mixed graphs and related augmentation problems},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {205-223},
YEAR = {1988, June},
INSTITUTION = {Div. of Comput. Sci., California Univ., Berkeley, CA, USA},
}
@article{Szpankowski/88,
AUTHOR = {Szpankowski, W.},
TITLE = {Some results on V-ary asymmetric tries},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {224-244},
YEAR = {1988, June},
INSTITUTION = {Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA},
}
@article{Hester-Hirschberg-Larmore/88,
AUTHOR = {Hester, J.H. and Hirschberg, D.S. and Larmore, L.L.},
TITLE = {Construction of optimal binary split trees in the presence of bounded access probabilities},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {245-253},
YEAR = {1988, June},
INSTITUTION = {Dept. of Inf. \& Comput. Sci., California Univ., Irvine, CA, USA},
}
@article{Overmars/88,
AUTHOR = {Overmars, M.H.},
TITLE = {Efficient data structures for range searching on a grid},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {254-275},
YEAR = {1988, June},
INSTITUTION = {Dept. of Comput. Sci., Utrecht Univ., Netherlands},
}
@article{Soroker/88a,
AUTHOR = {Soroker, D.},
TITLE = {Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {276-286},
YEAR = {1988, June},
INSTITUTION = {Div. of Comput. Sci., California Univ., Berkeley, CA, USA},
}
@article{Kunde-Langston-Liu/88,
AUTHOR = {Kunde, M. and Langston, M.A. and Liu, Jin-Ming},
TITLE = {On a special case of uniform processor scheduling},
JOURNAL = {J. Algorithms},
VOLUME = {9},
NUMBER = {2},
PAGES = {287-296},
YEAR = {1988, June},
INSTITUTION = {Inst. for Inf., Tech. Univ. M{\"u}nchen, Germany;},
}
@article{Ramachandran/88a,
AUTHOR = {Ramachandran, Vijaya},
TITLE = {Finding a minimum feedback arc set in reducible flow graphs},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {299-313},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Golumbic-Hammer/88,
AUTHOR = {Golumbic, Martin Charles and Hammer, Peter L.},
TITLE = {Stability in circular arc graphs},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {314-320},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Schaffer/88a,
AUTHOR = {Sch{\"a}ffer, Alejandro A.},
TITLE = {A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {321-342},
YEAR = {1988},
}
@article{Greenberg/88,
AUTHOR = {Greenberg, Harold},
TITLE = {Solution to a linear diophantine equation for nonnegative integers},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {343-353},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Kaminski-Kirkpatrick-Bshouty/88,
AUTHOR = {Kaminski, Michael and Kirkpatrick, David G. and Bshouty, Nader H.},
TITLE = {Addition requirements for matrix and transposed matrix products},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {354-364},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Schonhage/88,
AUTHOR = {Sch{\"o}nhage, A.},
TITLE = {Probabilistic computation of integer polynomial GCDs},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {365-371},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Overmars-Wood/88,
AUTHOR = {Overmars, Mark H. and Wood, Derick},
TITLE = {On rectangular visibility},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {372-390},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ronyai/88,
AUTHOR = {R{\'o}nyai, Lajos},
TITLE = {Factoring polynomials over finite fields},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {391-400},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Cheng-Hwang/88,
AUTHOR = {Cheng, Ying and Hwang, Frank K.},
TITLE = {Diameters of weighted double loop networks},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {401-410},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Gabow-Tarjan/88b,
AUTHOR = {Gabow, Harold N. and Tarjan, Robert E.},
TITLE = {Algorithms for two bottleneck optimization problems},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {411-417},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Wilber/88,
AUTHOR = {Wilber, Robert},
TITLE = {The concave least-weight subsequence problem revisited},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {418-425},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Johnson/88,
AUTHOR = {Johnson, David S.},
TITLE = {The $NP$-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {426-444},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bhattacharya-Zorbas/88,
AUTHOR = {Bhattacharya, B.K. and Zorbas, J.},
TITLE = {Solving the two-dimensional findpath problem using a line-triangle representation of the robot},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {449-469},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Levy-Low/88,
AUTHOR = {Levy, Hanoch and Low, David W.},
TITLE = {A contraction algorithm for finding small cycle cutsets},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {470-493},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ronyai/88a,
AUTHOR = {R{\'o}nyai, Lajos},
TITLE = {Zero divisors in quaternion algebras},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {494-506},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Cheriyan-Maheshwari/88,
AUTHOR = {Cheriyan, J. and Maheshwari, S.N.},
TITLE = {Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {507-537},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Althofer/88,
AUTHOR = {Alth{\"o}fer, Ingo},
TITLE = {On the complexity of searching game trees and other recursion trees},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {538-567},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bar-Yehuda-Kutten/88,
AUTHOR = {Bar-Yehuda, Reuven and Kutten, Shay},
TITLE = {Fault tolerant distributed majority commitment},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {568-582},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Maimon/88,
AUTHOR = {Maimon, Oded},
TITLE = {An algorithm for the Lorenz measure in locational decisions on trees},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {583-596},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Olariu-Toida-Zubair/88,
AUTHOR = {Olariu, S. and Toida, S. and Zubair, M.},
TITLE = {On a conjecture by Plaisted and Hong},
JOURNAL = {J. Algorithms},
VOLUME = {9},
PAGES = {597-598},
YEAR = {1988},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}