Publications

Search
Export 10 results:
[ Author(Desc)] Title Type Year
Filters: Keyword is randomized algorithms  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
A
Arya S, Malamatos T, Mount D.  2007.  A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
Arya S, Mount D, Smid M.  1994.  Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.
B
Baveja A, Srinivasan A.  2000.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.
C
Cho M, Mount D.  2008.  Embedding and similarity search for point sets under translation. Proceedings of the twenty-fourth annual symposium on Computational geometry. :320-327.
M
Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY.  1997.  A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.
Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY.  2007.  A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
Mount D, Netanyahu NS.  2001.  Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
S
Shachnai H, Srinivasan A.  2001.  Finding large independent sets of hypergraphs in parallel. Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. :163-168.
Srinivasan A.  2008.  A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
Srinivasan A, Teo C-P.  1997.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :636-643.