| Publication | Date of Publication | Type |
|---|
| Graph sketching against adaptive adversaries applied to the minimum degree algorithm | 2025-08-12 | Paper |
| Iterative row sampling | 2025-05-20 | Paper |
| Approaching optimality for solving SDD linear systems | 2025-04-29 | Paper |
| Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser | 2023-05-10 | Paper |
A generalized Cheeger inequality
Linear Algebra and its Applications | 2023-03-24 | Paper |
scientific article; zbMATH DE number 7650075 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle | 2020-11-23 | Paper |
Solving 1-Laplacians in nearly linear time: collapsing and expanding a topological ball
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Approximate maximum flow on separable undirected graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Size complexity of volume meshes vs. surface meshes | 2019-05-06 | Paper |
Approximate center points with proofs
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Approximate dynamic programming using halfspace queries and multiscale Monge decomposition | 2017-09-29 | Paper |
A Bézier-based approach to unstructured moving meshes
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Geometric median in nearly linear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Routing under balance
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Exact Computation of a Manifold Metric, via Lipschitz Embeddings and Shortest Paths on a Graph
(available as arXiv preprint) | 2017-09-22 | Paper |
Runtime guarantees for regression problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Approximating nearest neighbor distances
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| scientific article; zbMATH DE number 6472630 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472594 (Why is no real title available?) | 2015-08-14 | Paper |
| A time efficient Delaunay refinement algorithm | 2015-08-03 | Paper |
Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
A fast algorithm for well-spaced points and approximate Delaunay graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
A new approach to output-sensitive Voronoi diagrams and Delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Theory of Computing Systems | 2015-01-19 | Paper |
| A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians | 2014-12-18 | Paper |
A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations
Discrete & Computational Geometry | 2014-11-14 | Paper |
Smoothing and cleaning up slivers
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A Nearly-m log n Time Solver for SDD Linear Systems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Approaching optimality for solving SDD linear systems
SIAM Journal on Computing | 2014-06-04 | Paper |
Faster approximate multicommodity flow using quadratically coupled flows
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Topological inference via meshing
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Approximation algorithms for speeding up dynamic programming and denoising acgh data
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Beating the spread, time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
On the \(n\log{n}\) isomorphism technique (preliminary report)
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Triangle sparsifiers
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Efficient triangle counting in large graphs via degree-based vertex partitioning
Internet Mathematics | 2012-08-29 | Paper |
Efficient triangle counting in large graphs via degree-based vertex partitioning
Algorithms and Models for the Web-Graph | 2011-01-21 | Paper |
Approximate centerpoints with proofs
Computational Geometry | 2010-09-02 | Paper |
| SVR: Practical engineering of a fast 3D meshing algorithm | 2008-02-22 | Paper |
Size Competitive Meshing Without Large Angles
Automata, Languages and Programming | 2007-11-28 | Paper |
Representing Topological Structures Using Cell-Chains
Geometric Modeling and Processing - GMP 2006 | 2007-09-06 | Paper |
DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK
International Journal of Computational Geometry & Applications | 2005-05-03 | Paper |
| scientific article; zbMATH DE number 1263247 (Why is no real title available?) | 2002-01-30 | Paper |
Persistent triangulations
Journal of Functional Programming | 2001-11-21 | Paper |
Design and implementation of a practical parallel Delaunay algorithm
Algorithmica | 2000-07-17 | Paper |
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing | 2000-06-04 | Paper |
Graph Embeddings and Laplacian Eigenvalues
SIAM Journal on Matrix Analysis and Applications | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305430 (Why is no real title available?) | 2000-02-09 | Paper |
Optimal Coarsening of Unstructured Meshes
Journal of Algorithms | 2000-01-27 | Paper |
On the Radius-Edge Condition in the Control Volume Method
SIAM Journal on Numerical Analysis | 1999-11-22 | Paper |
The Dynamic Parallel Complexity of Computational Circuits
SIAM Journal on Computing | 1999-10-28 | Paper |
Geometric Mesh Partitioning: Implementation and Experiments
SIAM Journal on Scientific Computing | 1998-09-21 | Paper |
Tree-based parallel algorithm design
Algorithmica | 1998-05-26 | Paper |
Geometric Separators for Finite-Element Meshes
SIAM Journal on Scientific Computing | 1998-05-12 | Paper |
On the Quality of Spectral Separators
SIAM Journal on Matrix Analysis and Applications | 1998-05-11 | Paper |
Moments of inertia and graph separators
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM | 1998-01-22 | Paper |
| scientific article; zbMATH DE number 1003277 (Why is no real title available?) | 1997-04-23 | Paper |
APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
International Journal of Computational Geometry & Applications | 1996-12-16 | Paper |
| scientific article; zbMATH DE number 910879 (Why is no real title available?) | 1996-07-28 | Paper |
Flow in Planar Graphs with Multiple Sources and Sinks
SIAM Journal on Computing | 1996-04-11 | Paper |
| scientific article; zbMATH DE number 741006 (Why is no real title available?) | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 554764 (Why is no real title available?) | 1995-01-02 | Paper |
| scientific article; zbMATH DE number 432835 (Why is no real title available?) | 1993-10-20 | Paper |
A new graph triconnectivity algorithm and its parallelization
Combinatorica | 1992-09-27 | Paper |
Parallel Tree Contraction Part 2: Further Applications
SIAM Journal on Computing | 1992-06-27 | Paper |
Deterministic parallel list ranking
Algorithmica | 1991-01-01 | Paper |
A simple randomized parallel algorithm for list-ranking
Information Processing Letters | 1990-01-01 | Paper |
Subtree isomorphism is in random NC
Discrete Applied Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4064468 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4064509 (Why is no real title available?) | 1988-01-01 | Paper |
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
SIAM Journal on Computing | 1988-01-01 | Paper |
An improved parallel algorithm that computes the BFS numbering of a directed graph
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4068901 (Why is no real title available?) | 1987-01-01 | Paper |
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
SIAM Journal on Computing | 1987-01-01 | Paper |
An additivity theorem for the genus of a graph
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3958731 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982512 (Why is no real title available?) | 1986-01-01 | Paper |
Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Sums of Divisors, Perfect Numbers and Factoring
SIAM Journal on Computing | 1986-01-01 | Paper |
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
Lecture Notes in Computer Science | 1986-01-01 | Paper |
Solvability by radicals is in polynomial time
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825202 (Why is no real title available?) | 1983-01-01 | Paper |
Isomorphism of graphs which are pairwise k-separable
Information and Control | 1983-01-01 | Paper |
Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
Information and Control | 1983-01-01 | Paper |
An asymptotically optimal layout for the shuffle-exchange graph
Journal of Computer and System Sciences | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3709507 (Why is no real title available?) | 1981-01-01 | Paper |
The Complexity of Coloring Circular Arcs and Chords
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
Regular groups of automorphisms of cubic graphs
Journal of Combinatorial Theory. Series B | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3719183 (Why is no real title available?) | 1979-01-01 | Paper |
Graph isomorphism, general remarks
Journal of Computer and System Sciences | 1979-01-01 | Paper |
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3569835 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3578903 (Why is no real title available?) | 1975-01-01 | Paper |
