@article{Chor-Goldreich/90,
AUTHOR = {Chor, Benny and Goldreich, Oded},
TITLE = {An improved parallel algorithm for integer GCD},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {1-10},
YEAR = {1990},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=5&spage=1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gonzalez-Zheng/90,
AUTHOR = {Gonzalez, Teofilo and Zheng, Si-Qing},
TITLE = {Approximation algorithms for partitioning a rectangle with interior points},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {11-42},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kruskal-Rudolph-Snir/90,
AUTHOR = {Kruskal, Clyde P. and Rudolph, Larry and Snir, Marc},
TITLE = {Efficient parallel algorithms for graph problems},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {43-64},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Orlowski/90,
AUTHOR = {Orlowski, M.},
TITLE = {A new algorithm for the largest empty rectangle problem},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {65-73},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Paterson/90,
AUTHOR = {Paterson, M.S.},
TITLE = {Improved sorting networks with $O(\log N)$ depth},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {75-92},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bienstock-Monma/90,
AUTHOR = {Bienstock, Daniel and Monma, Clyde L.},
TITLE = {On the complexity of embedding planar graphs to minimize certain distance measures},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {93-109},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Du-Zhang/90,
AUTHOR = {Du, Dingzhu and Zhang, Yanjun},
TITLE = {On heuristics for minimum length rectilinear partitions},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {111-128},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{He-Yesha/90,
AUTHOR = {He, Xin and Yesha, Yaacov},
TITLE = {Efficient parallel algorithms for $r$-dominating set and $p$-center problems on trees},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {129-145},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chou-Schelter-Yang/90,
AUTHOR = {Chou, Shang-Ching and Schelter, William F. and Yang, Jin-Gen},
TITLE = {An algorithm for constructing Gr{\"o}bner bases from characteristic sets and its application to geometry},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {147-154},
YEAR = {1990},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=5&spage=147},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jeong-Lee/90,
AUTHOR = {Jeong, C.S. and Lee, D.T.},
TITLE = {Parallel geometric algorithms on a mesh-connected computer},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {155-177},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Savage-Stallmann-Perry/90,
AUTHOR = {Savage, Carla D. and Stallmann, Matthias and Perry, Jo Ellen},
TITLE = {Solving some combinatorial problems on arrays with one-way dataflow},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {179-199},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sudarshan-Rangan/90,
AUTHOR = {Sudarshan, S. and Rangan, C. Pandu},
TITLE = {A fast algorithm for computing sparse visibility graphs},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {201-214},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mehlhorn-Naher/90,
AUTHOR = {Mehlhorn, Kurt and N{\"a}her, Stefan},
TITLE = {Dynamic fractional cascading},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {215-241},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Parberry/90,
AUTHOR = {Parberry, Ian},
TITLE = {An optimal time bound for oblivious routing},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {243-250},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Blankenagel-Guting/90,
AUTHOR = {Blankenagel, Gabriele and G{\"u}ting, Ralf Hartmut},
TITLE = {Internal and external algorithms for the points-in-regions problem --- the INSIDE join of geo-relational algebra},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {251-276},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cidon-Gopal/90,
AUTHOR = {Cidon, Israel and Gopal, Inder S.},
TITLE = {Dynamic detection of subgraphs in computer networks},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {277-294},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Culberson-Munro/90,
AUTHOR = {Culberson, Joseph and Munro, J. Ian},
TITLE = {Analysis of the standard deletion algorithms in exact fit domain binary search trees},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {295-311},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ukkonen/90,
AUTHOR = {Ukkonen, Esko},
TITLE = {A linear-time algorithm for finding approximate shortest common superstrings},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {313-323},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mattern/90,
AUTHOR = {Mattern, Friedemann},
TITLE = {Asynchronous distributed termination --- Parallel and symmetric solutions with echo algorithm},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {325-340},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ko-Lee-Chang/90,
AUTHOR = {Ko, M.T. and Lee, R.C.T. and Chang, J.S.},
TITLE = {An optimal approximation algorithm for the rectilinear $m$-center problem},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {341-352},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Donald/90,
AUTHOR = {Donald, Bruce R.},
TITLE = {The complexity of planar compliant motion planning under uncertainty},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {353-382},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wu-Loui/90,
AUTHOR = {Wu, Michael M. and Loui, Michael C.},
TITLE = {An efficient distributed algorithm for maximum matching in general graphs},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {383-406},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Monma-Paterson-Suri-Yao/90,
AUTHOR = {Monma, Clyde and Paterson, Michael and Suri, Subhash and Yao, Frances},
TITLE = {Computing Euclidean maximum spanning trees},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {407-419},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dobkin-Souvaine/90,
AUTHOR = {Dobkin, David P. and Souvaine, Diane L.},
TITLE = {Computational geometry in a curved world},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {421-457},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berger-Rompel/90,
AUTHOR = {Berger, Bonnie and Rompel, John},
TITLE = {A better performance guarantee for approximate graph coloring},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {459-466},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lai-Leinwand/90,
AUTHOR = {Lai, Yen-Ten and Leinwand, Sany M.},
TITLE = {A theory of rectangular dual graphs},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {467-483},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lee-Chwa/90,
AUTHOR = {Lee, Sang-Ho and Chwa, Kyung-Yong},
TITLE = {Some chain visibility problems in a simple polygon},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {485-507},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tamassia-Preparata/90,
AUTHOR = {Tamassia, Roberto and Preparata, Franco P.},
TITLE = {Dynamic maintenance of planar digraphs, with applications},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {509-527},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Luccio-Pietracaprina-Pucci/90,
AUTHOR = {Luccio, F. and Pietracaprina, A. and Pucci, G.},
TITLE = {A new scheme for the deterministic simulation of PRAMs in VLSI},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {529-544},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{He/90,
AUTHOR = {He, Xin},
TITLE = {Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {545-559},
YEAR = {1990},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=5&spage=545},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dobkin-Edelsbrunner-Overmars/90,
AUTHOR = {Dobkin, David P. and Edelsbrunner, Herbert and Overmars, Mark H.},
TITLE = {Searching for empty convex polygons},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {561-571},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alevizos-Boissonnat-Preparata/90,
AUTHOR = {Alevizos, Panagiotis and Boissonnat, Jean-Daniel and Preparata, Franco P.},
TITLE = {An optimal algorithm for the boundary of a cell in a union of rays},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {573-590},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hwang-Yao/90,
AUTHOR = {Hwang, F.K. and Yao, Y.C.},
TITLE = {Comments on Bern's probabilistic results on rectilinear Steiner trees},
JOURNAL = {Algorithmica},
VOLUME = {5},
PAGES = {591-598},
YEAR = {1990},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}