@article{Steele-Yao/82,
AUTHOR = {Steele, J. Michael and Yao, Andrew C.},
TITLE = {Lower bounds for algebraic decision trees},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {1-8},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Akl-Meijer/82,
AUTHOR = {Akl, Selim G. and Meijer, Henk},
TITLE = {On the average-case complexity of ``bucketing'' algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {9-13},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Dolev/82,
AUTHOR = {Dolev, Danny},
TITLE = {The byzantine generals strike again},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {14-30},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Tolimieri/82,
AUTHOR = {Tolimieri, R.},
TITLE = {A nonquadratic minimal algorithm for a system of quadratic forms},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {31-40},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Klingsberg/82,
AUTHOR = {Klingsberg, Paul},
TITLE = {A Gray code for compositions},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {41-44},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ibarra-Moran-Hui/82,
AUTHOR = {Ibarra, Oscar H. and Moran, Shlomo and Hui, Roger},
TITLE = {A generalization of the fast LUP matrix decomposition algorithm and applications},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {45-56},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Shiloach-Vishkin/82,
AUTHOR = {Shiloach, Y. and Vishkin, U.},
TITLE = {An $O(\log n)$ parallel connectivity algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {1},
PAGES = {57-67},
YEAR = {1982},
}
@article{Fredman-Volper/82,
AUTHOR = {Fredman, Micheal L. and Volper, Dennis J.},
TITLE = {The complexity of partial match retrieval in a dynamic setting},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {68-78},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Aigner/82,
AUTHOR = {Aigner, Martin},
TITLE = {Parallel complexity of sorting problems},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {79-88},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Johnson/82a,
AUTHOR = {Johnson, David S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {89-99},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Schnorr/82,
AUTHOR = {Schnorr, C.P.},
TITLE = {Refined analysis and improvements on some factoring algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {101-127},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Shiloach-Vishkin/82a,
AUTHOR = {Shiloach, Y. and Vishkin, U.},
TITLE = {An $O(n^2\log n)$ parallel max-flow algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {2},
PAGES = {128-146},
YEAR = {1982},
}
@article{Goldberg/82,
AUTHOR = {Goldberg, Robert N.},
TITLE = {Minimal string difference encodings},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {147-156},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Iliopoulos/82,
AUTHOR = {Iliopoulos, Costas S.},
TITLE = {Analysis of an algorithm for composition of binary quadratic forms},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {157-159},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Vaishnavi-Wood/82,
AUTHOR = {Vaishnavi, V.K. and Wood, D.},
TITLE = {Rectilinear line segment intersection, layered segment trees, and dynamization},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {160-176},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Johnson/82b,
AUTHOR = {Johnson, David S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {182-195},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Mignotte/82,
AUTHOR = {Mignotte, M.},
TITLE = {Identification of algebraic numbers},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {197-204},
YEAR = {1982, September},
INSTITUTION = {Centre de Calcul, Univ. Louis Pasteur, Strasbourg, France},
}
@article{Rosen/82,
AUTHOR = {Rosen, B.K.},
TITLE = {Robust linear algorithms for cutsets},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {205-217},
YEAR = {1982, September},
INSTITUTION = {Math. Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA},
}
@article{Lee-Preparata/82,
AUTHOR = {Lee, D.T. and Preparata, F.P.},
TITLE = {An improved algorithm for the rectangle enclosure problem},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {218-224},
YEAR = {1982, September},
INSTITUTION = {Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA},
}
@article{Lieberherr/82,
AUTHOR = {Lieberherr, K.J.},
TITLE = {Algorithmic extremal problems in combinatorial optimization},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {225-244},
YEAR = {1982, September},
INSTITUTION = {Dept. of Electrical Engng. and Computer Sci., Princeton Univ., Princeton, NJ, USA},
}
@article{Dolev-Klawe-Rodeh/82,
AUTHOR = {Dolev, D. and Klawe, M. and Rodeh, M.},
TITLE = {An $O(n\log n)$ unidirectional distributed algorithm for extrema finding in a circle},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {245-260},
YEAR = {1982, September},
INSTITUTION = {IBM Res., San Jose, CA, USA},
}
@article{Vitter/82,
AUTHOR = {Vitter, J.S.},
TITLE = {Deletion algorithms for hashing that preserve randomness},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {261-275},
YEAR = {1982, September},
INSTITUTION = {Dept. of Computer Sci., Brown Univ., Providence, RI, USA},
}
@article{Knott/82,
AUTHOR = {Knott, G.D.},
TITLE = {Fixed-bucket binary storage trees},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {3},
PAGES = {276-287},
YEAR = {1982, September},
INSTITUTION = {Div. of Computer Res. and Technol., Nat. Inst. of Health, Bethesda, MD, USA},
}
@article{Johnson/82c,
AUTHOR = {Johnson, David S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {288-300},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Baker-Coffman/82,
AUTHOR = {Baker, B.S. and Coffman, E.G., Jr.},
TITLE = {A two-dimensional bin-packing model of preemptive, FIFO storage allocation},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {4},
PAGES = {303-316},
YEAR = {1982, December},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
}
@article{Franzblau-Zeilberger/82,
AUTHOR = {Franzblau, D.S. and Zeilberger, Doron},
TITLE = {A bijective proof of the Hook-length formula},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {317-343},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Nakajima-Hakimi/82,
AUTHOR = {Nakajima, K. and Hakimi, S.L.},
TITLE = {Complexity results for scheduling tasks with discrete starting times},
JOURNAL = {J. Algorithms},
VOLUME = {3},
NUMBER = {4},
PAGES = {344-361},
YEAR = {1982, December},
INSTITUTION = {Dept. of Electrical Engng., Texas Tech. Univ., Lubbock, TX, USA},
}
@article{Johnson/82d,
AUTHOR = {Johnson, David S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {3},
PAGES = {381-395},
YEAR = {1982},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}