| Publication | Date of Publication | Type |
|---|
| Fully-scalable MPC algorithms for clustering in high dimension | 2026-01-14 | Paper |
Log-diameter MST verification and sensitivity in MPC
Algorithmica | 2025-10-10 | Paper |
| Streaming facility location in high dimension via geometric hashing | 2025-08-15 | Paper |
| A characterization of graph properties testable for general planar graphs with one-sided error (it's all about forbidden subgraphs) | 2025-08-12 | Paper |
| Streaming graph algorithms in the massively parallel computation model | 2025-06-13 | Paper |
Streaming algorithms for geometric Steiner forest
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Modern parallel algorithms (invited talk) | 2024-12-03 | Paper |
| Optimal (degree\(+1\))-coloring in congested clique | 2024-11-14 | Paper |
| Streaming algorithms for geometric Steiner forest | 2024-06-24 | Paper |
Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph
SIAM Journal on Computing | 2024-04-24 | Paper |
scientific article; zbMATH DE number 7832752 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
Component stability in low-space massively parallel computation
Distributed Computing | 2024-04-09 | Paper |
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Component Stability in Low-Space Massively Parallel Computation
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Routing schemes for hybrid communication networks
Lecture Notes in Computer Science | 2024-01-11 | Paper |
Routing schemes for hybrid communication networks
Theoretical Computer Science | 2024-01-08 | Paper |
Deterministic massively parallel connectivity
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Deterministic massively parallel connectivity
SIAM Journal on Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758318 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Haystack hunting hints and locker room communication
Random Structures & Algorithms | 2023-10-23 | Paper |
Haystack hunting hints and locker room communication
Random Structures & Algorithms | 2023-10-23 | Paper |
Shared memory simulations with triple-logarithmic delay
Lecture Notes in Computer Science | 2023-05-08 | Paper |
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Parallel and sequential approximation of shortest superstrings
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
Journal of the ACM | 2022-12-08 | Paper |
On parallel time in population protocols
Information Processing Letters | 2022-10-28 | Paper |
Speeding up two string-matching algorithms
STACS 92 | 2022-08-18 | Paper |
| Detecting cliques in CONGEST networks | 2022-07-21 | Paper |
Deterministic blind radio networks
(available as arXiv preprint) | 2022-07-21 | Paper |
Almost Tight Bounds for Reordering Buffer Management
SIAM Journal on Computing | 2022-06-08 | Paper |
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
ACM Transactions on Algorithms | 2022-02-16 | Paper |
| Bounded degree spanning trees (extended abstract) | 2021-12-20 | Paper |
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
SIAM Journal on Computing | 2021-11-19 | Paper |
Online facility location with deletions
(available as arXiv preprint) | 2021-08-04 | Paper |
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Sublinear time approximation of the cost of a metric <i>k</i>-nearest neighbor graph
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Detecting cliques in CONGEST networks
Distributed Computing | 2021-01-22 | Paper |
Round compression for parallel matching algorithms
SIAM Journal on Computing | 2020-10-29 | Paper |
Planar graphs: random walks and bipartiteness testing
Random Structures & Algorithms | 2019-10-16 | Paper |
Leader election in multi-hop radio networks
Theoretical Computer Science | 2019-10-07 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
\((1 + \varepsilon)\)-approximation for facility location in data streams
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| An \(O(\log k)\)-competitive algorithm for generalized caching | 2019-05-10 | Paper |
Problems on pairs of trees and the four colour problem of planar graphs (extended abstract)
Automata, Languages and Programming | 2019-03-29 | Paper |
An \(O(\log k)\)-competitive algorithm for generalized caching
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Distributed methods for computing approximate equilibria
Algorithmica | 2019-03-11 | Paper |
| Sublinear graph augmentation for fast query implementation | 2019-01-15 | Paper |
Approximation schemes for capacitated geometric network design
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Deterministic communication in radio networks
SIAM Journal on Computing | 2018-02-22 | Paper |
| Faster deterministic communication in radio networks | 2017-12-19 | Paper |
Fast generation of random permutations via networks simulation
Algorithms — ESA '96 | 2017-12-05 | Paper |
Exploiting spontaneous transmissions for broadcasting and leader election in radio networks
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Exploiting spontaneous transmissions for broadcasting and leader election in radio networks
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Communicating with beeps
(available as arXiv preprint) | 2017-09-29 | Paper |
Brief announcement: Optimal leader election in multi-hop radio networks
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Relating two property testing models for bounded degree directed graphs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Distributed Methods for Computing Approximate Equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Distributed Methods for Computing Approximate Equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Transforming comparison model lower bounds to the parallel-random-access-machine
Information Processing Letters | 2016-05-26 | Paper |
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Computing equilibria for a service provider game with (im)perfect information
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Random permutations using switching networks
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Testing cluster structure of graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs | 2015-08-03 | Paper |
| Computing equilibria for congestion games with (im)perfect information | 2015-08-03 | Paper |
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Approximate well-supported Nash equilibria in symmetric bimatrix games
Algorithmic Game Theory | 2015-01-14 | Paper |
| On testable properties in bounded degree graphs | 2014-12-18 | Paper |
| Finding a heaviest triangle is not harder than matrix multiplication | 2014-12-18 | Paper |
Finding cycles and trees in sublinear time
Random Structures & Algorithms | 2014-10-16 | Paper |
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Balanced allocations: the heavily loaded case
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Planar Graphs: Random Walks and Bipartiteness Testing
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Thorp shuffling, butterflies, and non-Markovian couplings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Almost tight bounds for reordering buffer management
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Testing monotone continuous distributions on high-dimensional real cubes | 2014-05-22 | Paper |
Optimal online buffer scheduling for block devices
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Fast message dissemination in random geometric networks
Distributed Computing | 2013-06-25 | Paper |
Testing Expansion in Bounded-Degree Graphs
Combinatorics, Probability and Computing | 2013-03-13 | Paper |
Multiple-choice balanced allocation in (almost) parallel
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Approximation algorithms for buy-at-bulk geometric network design
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Approximation schemes for capacitated geometric network design
Automata, Languages and Programming | 2011-07-06 | Paper |
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\)
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing | 2010-11-04 | Paper |
Sublinear-time Algorithms
Property Testing | 2010-10-12 | Paper |
Testing monotone continuous distributions on high-dimensional real cubes
Property Testing | 2010-10-12 | Paper |
Local Graph Exploration and Fast Property Testing
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Estimating the weight of metric minimum spanning trees in sublinear-time
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Selfish traffic allocation for server farms
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
SIAM Journal on Computing | 2010-07-07 | Paper |
Perfectly balanced allocation
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Small space representations for metric min-sum k-clustering and their applications
Theory of Computing Systems | 2010-05-05 | Paper |
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
SIAM Journal on Computing | 2010-04-29 | Paper |
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing | 2010-01-06 | Paper |
PTAS for k-tour cover problem on the plane for moderately large values of k
Algorithms and Computation | 2009-12-17 | Paper |
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters | 2009-12-04 | Paper |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Lecture Notes in Computer Science | 2009-10-20 | Paper |
| scientific article; zbMATH DE number 5605086 (Why is no real title available?) | 2009-09-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
Algorithms and Computation | 2008-05-27 | Paper |
Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
STACS 2007 | 2007-09-03 | Paper |
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science | 2007-07-16 | Paper |
Sublinear‐time approximation algorithms for clustering via random sampling
Random Structures & Algorithms | 2007-02-07 | Paper |
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms | 2006-10-05 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Balanced Allocations: The Heavily Loaded Case
SIAM Journal on Computing | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
SIAM Journal on Computing | 2005-10-28 | Paper |
Abstract Combinatorial Programs and Efficient Property Testers
SIAM Journal on Computing | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Testing hypergraph colorability
Theoretical Computer Science | 2005-04-06 | Paper |
Fault-tolerant geometric spanners
Discrete & Computational Geometry | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2119691 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2086687 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079416 (Why is no real title available?) | 2004-07-28 | Paper |
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1875421 (Why is no real title available?) | 2003-03-02 | Paper |
Fast practical multi-pattern matching
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1760014 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1754615 (Why is no real title available?) | 2002-06-12 | Paper |
Efficient web searching using temporal factors
Theoretical Computer Science | 2002-03-03 | Paper |
| Soft kinetic data structures | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1263250 (Why is no real title available?) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1305417 (Why is no real title available?) | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1670876 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1670655 (Why is no real title available?) | 2001-11-11 | Paper |
Randomized allocation processes
Random Structures & Algorithms | 2001-10-10 | Paper |
| scientific article; zbMATH DE number 1615297 (Why is no real title available?) | 2001-07-08 | Paper |
| Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma | 2001-07-08 | Paper |
Recovery time of dynamic allocation processes
Theory of Computing Systems | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1445282 (Why is no real title available?) | 2001-02-05 | Paper |
| Delayed path coupling and generating random permutations | 2000-12-19 | Paper |
Algorithms for the parallel alternating direction access machine
Theoretical Computer Science | 2000-08-21 | Paper |
Contention Resolution in Hashing Based Shared Memory Simulations
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305416 (Why is no real title available?) | 1999-07-08 | Paper |
| scientific article; zbMATH DE number 1223730 (Why is no real title available?) | 1999-06-08 | Paper |
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Simulating shared memory in real time: On the computation power of reconfigurable architectures
Information and Computation | 1998-01-13 | Paper |
Sequential and Parallel Approximation of Shortest Superstrings
Journal of Algorithms | 1997-07-06 | Paper |
Guthrie's problem: new equivalences and rapid reductions
Theoretical Computer Science | 1997-02-28 | Paper |
Parallel maximum independent set in convex bipartite graphs
Information Processing Letters | 1997-02-27 | Paper |
Very Fast Approximation of the Matrix Chain Product Problem
Journal of Algorithms | 1996-10-16 | Paper |
Speeding up two string-matching algorithms
Algorithmica | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 512836 (Why is no real title available?) | 1994-03-10 | Paper |
