A new polynomial-time algorithm for linear programming
Combinatorica
Linear programming in O(n × 3d2) time
Information Processing Letters
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
An optimal convex hull algorithm and new results on cuttings (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Discrepancy and &egr; approximations for bounded VC-dimension
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A class of convex programs with applications to computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Almost tight bounds for &egr;-nets
Discrete & Computational Geometry
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Helly theorems and generalized linear programming
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Improved bounds on weak &egr;-nets for convex sets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved algorithms via approximations of probability distributions (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A parallel algorithm for linear programming in fixed dimension
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of Semidefinite Programs
Journal of Global Optimization
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Discrete Applied Mathematics
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
A meeting scheduling problem respecting time and space
Geoinformatica
Catching elephants with mice: Sparse sampling for monitoring sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |