Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Fast deterministic processor allocation
Torben Hagerup
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 1-10
Finding connected components in O(\log n \log\log n) time on the EREW PRAM
Ka Wong Chong, Tak Wah Lam
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 11-20
Global min-cuts in {\cal RNC}, and other ramifications of a simple min-cut algorithm
David R. Karger
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 21-30
Random weighted Laplacians, Lovász minimum digraphs and finding minimum separators
Joseph Cheriyan
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 31-40
The Stanford GraphBase: A platform for combinatorial algorithms
Donald E. Knuth
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 41-43
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 44-53
A pedestrian approach to ray shooting: Shoot a ray, take a walk
John Hershberger, Subhash Suri
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 54-63
Iterated nearest neighbors and finding minimal polytopes
David Eppstein, Jeff Erickson
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 64-73
Efficient randomized algorithms for the repeated median line estimator
Jiȓí Matous̑ek, David M. Mount, Nathan S. Netanyahu
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 74-82
A new and simple algorithm for quality 2-dimensional mesh generation
Jim Ruppert
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 83-92
Polygonal approximations that minimize the number of inflections
John D. Hobby
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 93-102
Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques
Naveen Garg, Vempala S. Santosh, Aman Singla
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 103-111
The vertex-disjoint Menger problem in planar graphs
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 112-119
Triangulating vertex colored graphs
F.R. McMorris, Tandy J. Warnow, Thomas Wimer
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 120-127
An O(n^2) algorithm for circular-arc graph recognition
Elaine M. Eschen, Jeremy P. Spinrad
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 128-137
Optimal edge ranking of trees in polynomial time
Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 138-144
Data structures for traveling salesmen
M.L. Fredman, D.S. Johnson, L.A. McGeoch, G. Ostheimer
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 145-154
Confluently persistent deques via data structural bootstrapping
Adam L. Buchsbaum, Robert E. Tarjan
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 155-164
Scapegoat trees
Igal Galperin, Ronald L. Rivest
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 165-174
A data structure for dynamically maintaining rooted trees
Greg N. Frederickson
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 175-184
Upper and lower bounds on constructing alphabetic binary trees
Maria Klawe, Brendan Mumey
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 185-193
Lower bounds for set intersection queries
Paul Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 194-201
A representation for crossing set families with applications to submodular flow problems
Harold N. Gabow
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 202-211
Finding near-optimal cuts: An empirical evaluation
Kevin Lang, Satish Rao
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 212-221
Scaling algorithms for the shortest paths problem
Andrew V. Goldberg
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993), 1993, pp. 222-231

Seiten 1 2 3 >