| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7799586 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
Fractional cascading simplified
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Selection in monotone matrices and computing k th nearest neighbors
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Distribution-sensitive algorithms
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
| A unified approach to tail estimates for randomized incremental construction | 2022-07-18 | Paper |
| Design and analysis of algorithms. A contemporary perspective | 2019-01-21 | Paper |
Faster coreset construction for projective clustering via low-rank approximation
(available as arXiv preprint) | 2018-09-06 | Paper |
| scientific article; zbMATH DE number 6876095 (Why is no real title available?) | 2018-05-29 | Paper |
Fully dynamic maximal matching in \(O(\log n)\) update time (corrected version)
SIAM Journal on Computing | 2018-05-18 | Paper |
| scientific article; zbMATH DE number 6863608 (Why is no real title available?) | 2018-04-23 | Paper |
Optimal and Practical Algorithms for Sorting on the PDM
IEEE Transactions on Computers | 2017-11-10 | Paper |
| On density, threshold and emptiness queries for intervals in the streaming model | 2017-07-13 | Paper |
Maintaining approximate maximum weighted matching in fully dynamic graphs
(available as arXiv preprint) | 2017-01-26 | Paper |
The robust knapsack problem with queries
Computers & Operations Research | 2016-11-10 | Paper |
The update complexity of selection and related problems
Theory of Computing Systems | 2016-09-21 | Paper |
The update complexity of selection and related problems
Theory of Computing Systems | 2016-09-21 | Paper |
Towards a theory of cache-efficient algorithms
Journal of the ACM | 2015-12-07 | Paper |
Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6469155 (Why is no real title available?) | 2015-08-03 | Paper |
Fully dynamic maximal matching in \(O(\log n)\) update time
SIAM Journal on Computing | 2015-06-02 | Paper |
A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
Algorithmica | 2015-01-19 | Paper |
Fully Dynamic Maximal Matching in O (log n) Update Time
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Approximation algorithms for the weight-reducible knapsack problem
Lecture Notes in Computer Science | 2014-04-16 | Paper |
A simple \(D ^{2}\)-sampling based PTAS for \(k\)-means and other clustering problems
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| The update complexity of selection and related problems | 2012-08-31 | Paper |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM | 2010-07-14 | Paper |
A linear time deterministic algorithm to find a small subset that approximates the centroid
Information Processing Letters | 2010-03-24 | Paper |
The covert set-cover problem with application to network discovery
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
A generalization of the 0-1 principle for sorting
Information Processing Letters | 2009-12-04 | Paper |
Improvements on the Johnson bound for Reed-Solomon codes
Discrete Applied Mathematics | 2009-06-30 | Paper |
Approximating Shortest Paths in Graphs
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
Theoretical Computer Science | 2009-02-19 | Paper |
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
Automata, Languages and Programming | 2008-08-28 | Paper |
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography
Lecture Notes in Computer Science | 2008-04-11 | Paper |
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms | 2007-07-18 | Paper |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Journal of Algorithms | 2007-06-08 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
Journal of Computer and System Sciences | 2006-10-05 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
A linear time algorithm for approximate 2-means clustering
Computational Geometry | 2005-11-07 | Paper |
Fair adaptive bandwidth allocation: a rate control based active queue management discipline
Computer Networks | 2004-10-13 | Paper |
| scientific article; zbMATH DE number 2088584 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080207 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081104 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079363 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2077121 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2038725 (Why is no real title available?) | 2004-02-08 | Paper |
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
| scientific article; zbMATH DE number 1954394 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1857642 (Why is no real title available?) | 2003-06-02 | Paper |
Planar graph blocking for external searching
Algorithmica | 2002-12-01 | Paper |
Improved algorithms for uniform partitions of points
Algorithmica | 2002-05-21 | Paper |
An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
Algorithmica | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1424306 (Why is no real title available?) | 2001-10-07 | Paper |
Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1522945 (Why is no real title available?) | 2001-03-06 | Paper |
| scientific article; zbMATH DE number 1857639 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1383711 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1445384 (Why is no real title available?) | 2000-05-10 | Paper |
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
Journal of Algorithms | 1998-09-27 | Paper |
Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
Theoretical Computer Science | 1998-06-30 | Paper |
Parallel searching in generalized Monge arrays
Algorithmica | 1998-05-24 | Paper |
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
Computational Geometry | 1998-02-16 | Paper |
Selection in Monotone Matrices and Computingkth Nearest Neighbors
Journal of Algorithms | 1996-09-15 | Paper |
Fractional Cascading Revisited
Journal of Algorithms | 1996-06-25 | Paper |
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
Mathematical and Computer Modelling | 1995-08-15 | Paper |
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
SIAM Journal on Computing | 1994-08-14 | Paper |
Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
SIAM Journal on Computing | 1994-07-28 | Paper |
IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
International Journal of Computational Geometry & Applications | 1993-10-24 | Paper |
Dynamic point location in arrangements of hyperplanes
Discrete & Computational Geometry | 1993-01-16 | Paper |
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
SIAM Journal on Computing | 1993-01-16 | Paper |
Optimal randomized parallel algorithms for computational geometry
Algorithmica | 1992-06-28 | Paper |
Some observations on skip-lists
Information Processing Letters | 1992-06-27 | Paper |
On parallel integer sorting
Acta Informatica | 1992-01-01 | Paper |
Finding an approximate median with high probability in constant parallel time
Information Processing Letters | 1990-01-01 | Paper |
Parallel sorting in two-dimensional VLSI models of computation
IEEE Transactions on Computers | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4155888 (Why is no real title available?) | 1989-01-01 | Paper |
