skip to main content
10.5555/314464acmconferencesBook PagePublication PagessodaConference Proceedingsconference-collections
SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
1994 Proceeding
Publisher:
  • Society for Industrial and Applied Mathematics
  • 3600 University City Science Center Philadelphia, PA
  • United States
Conference:
SODA94: Conference on Discrete Algorithms Arlington Virginia USA January 23 - 25, 1994
ISBN:
978-0-89871-329-9
Published:
23 January 1994
Sponsors:
SIGACT, SIAM

Bibliometrics
Abstract

No abstract available.

Article
Free
Comparing point sets under projection
pp 1–7
Article
Free
On-line search in a simple polygon
pp 8–15
Article
Free
On degeneracy in geometric computations
pp 16–23
Article
Free
Surface approximation and geometric partitions
pp 24–33
Article
Free
Reliable benchmarks using numerical instability
pp 34–43
Article
Free
An effective additive basis for the integers
pp 44–47
Article
Free
Exact analysis of a priority queue algorithm for random variate generation
pp 48–56
Article
Free
Low-degree tests
pp 57–64
Article
Free
Average case analysis of dynamic geometric optimization
pp 77–86
Article
Free
A near-linear algorithm for the planar segment center problem
pp 87–97
Article
Free
Maximal empty ellipsoids
pp 98–102
Article
Free
Recognizing balanced 0,±matrices
pp 103–111
Article
Free
Article
Free
Minimizing channel density by lateral shifting of components
pp 122–131
Article
Free
A better algorithm for an ancient scheduling problem
pp 132–140
Article
Free
On the greedy heuristic for matchings
pp 141–149
Article
Free
New results on the old k-opt algorithm for the TSP
pp 150–159
Article
Free
Clustering for faster network simplex pivots
pp 160–166
Article
Free
Scheduling malleable and nonmalleable parallel tasks
pp 167–176
Article
Free
Approximating the minimum equivalent digraph
pp 177–186
Article
Free
Approximate data structures with applications
pp 187–194
Article
Free
An optimal RAM implementation of catenable min double-ended queues
pp 195–203
Article
Free
Dynamic two-connectivity with backtracking
pp 204–212
Article
Free
Maintaining dynamic sequences under equality-tests in polylogarithmic time
pp 213–222
Article
Free
A scaling technique for better network design
pp 233–240
Article
Free
Article
Free
Article
Free
New techniques for approximating complex polynomial zeros
pp 260–270
Contributors
  • Carnegie Mellon University

Index Terms

  1. Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

        Recommendations

        Acceptance Rates

        Overall Acceptance Rate411of1,322submissions,31%
        YearSubmittedAcceptedRate
        SODA '1549513728%
        SODA '1044513530%
        SODA '0738213936%
        Overall1,32241131%