| Publication | Date of Publication | Type |
|---|
A sublinear local access implementation for the Chinese restaurant process
| 2024-08-22 | 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 7788435 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7758318 (Why is no real title available?)
| 2023-10-31 | Paper |
Sublinear time approximation of the cost of a metric k-nearest neighbor graph
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Fair coresets and streaming algorithms for fair \(k\)-means
| 2020-08-24 | Paper |
Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
SIAM Journal on Computing | 2020-08-03 | Paper |
Distributed monitoring of network properties: the power of hybrid networks
| 2020-05-27 | Paper |
Testing for forbidden order patterns in an array
Random Structures & Algorithms | 2019-11-07 | Paper |
Planar graphs: random walks and bipartiteness testing
Random Structures & Algorithms | 2019-10-16 | Paper |
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
StreamKM++: a clustering algorithm for data streams
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA and projective clustering
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | 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 |
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Dissection-BKW
| 2018-09-26 | Paper |
Testing for forbidden order patterns in an array
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Clustering time series under the Fréchet distance
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Smallest enclosing ball for probabilistic data
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Estimating graph parameters from random order streams
| 2018-03-15 | Paper |
scientific article; zbMATH DE number 6820208 (Why is no real title available?)
| 2017-12-19 | Paper |
Sampling in dynamic data streams and applications
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | 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 |
On constant-size graphs that preserve the local structure of high-girth graphs
| 2017-08-31 | Paper |
A distributed O(1)-approximation algorithm for the uniform facility location problem
Algorithmica | 2017-05-17 | Paper |
Random projections for Bayesian regression
Statistics and Computing | 2017-03-23 | Paper |
Random projections for Bayesian regression
Statistics and Computing | 2015-11-19 | Paper |
Testing cluster structure of graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Probabilistic \(k\)-median clustering in data streams
Theory of Computing Systems | 2015-05-12 | Paper |
On testable properties in bounded degree graphs
| 2014-12-18 | Paper |
Analysis of agglomerative clustering
Algorithmica | 2014-11-19 | Paper |
Clustering for metric and nonmetric distance measures
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Finding cycles and trees in sublinear time
Random Structures & Algorithms | 2014-10-16 | Paper |
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Planar Graphs: Random Walks and Bipartiteness Testing
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Every property of hyperfinite graphs is testable
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Subspace embeddings for the L 1 -norm with applications
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Coresets and sketches for high dimensional subspace approximation problems
| 2014-05-22 | Paper |
Testing monotone continuous distributions on high-dimensional real cubes
| 2014-05-22 | Paper |
StreamKM++, a clustering algorithm for data streams
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Every property of hyperfinite graphs is testable
SIAM Journal on Computing | 2013-09-25 | Paper |
BICO: BIRCH meets coresets for \(k\)-means clustering
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Probabilistic \(k\)-median clustering in data streams
Approximation and Online Algorithms | 2013-09-13 | Paper |
Testing Expansion in Bounded-Degree Graphs
Combinatorics, Probability and Computing | 2013-03-13 | Paper |
Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Analysis of agglomerative clustering
| 2012-01-23 | Paper |
Tolerant algorithms
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Sublinear-time Algorithms
Property Testing | 2010-10-12 | Paper |
Testing Euclidean Spanners
Property Testing | 2010-10-12 | Paper |
Testing monotone continuous distributions on high-dimensional real cubes
Property Testing | 2010-10-12 | Paper |
Testing Euclidean Spanners
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | 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 |
scientific article; zbMATH DE number 5764820 (Why is no real title available?)
| 2010-08-06 | Paper |
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
SIAM Journal on Computing | 2010-07-07 | Paper |
Small space representations for metric min-sum \(k\)-clustering and their applications
Theory of Computing Systems | 2010-05-05 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing | 2010-01-06 | Paper |
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science | 2009-11-06 | Paper |
d-Dimensional Knapsack in the Streaming Model
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Streaming Embeddings with Slack
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 |
A FAST k-MEANS IMPLEMENTATION USING CORESETS
International Journal of Computational Geometry & Applications | 2009-02-24 | Paper |
A PTAS for k-means clustering based on weak coresets
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506202 (Why is no real title available?)
| 2009-02-10 | Paper |
Facility Location in Dynamic Geometric Data Streams
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Estimating Clustering Indexes in Data Streams
Algorithms – ESA 2007 | 2008-09-25 | Paper |
SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
STACS 2007 | 2007-09-03 | Paper |
Labeling smart dust
| 2007-05-31 | Paper |
A Distributed Algorithm for the Facility Location Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Sublinear‐time approximation algorithms for clustering via random sampling
Random Structures & Algorithms | 2007-02-07 | 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 |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Fast reconstruction of Delaunay triangulations
Computational Geometry | 2005-08-05 | Paper |
Testing hypergraph colorability
Theoretical Computer Science | 2005-04-06 | Paper |
scientific article; zbMATH DE number 2086681 (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 |
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing | 2004-06-18 | Paper |
scientific article; zbMATH DE number 1947443 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1875421 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1754615 (Why is no real title available?)
| 2002-06-12 | Paper |
Soft kinetic data structures
| 2002-01-30 | Paper |
scientific article; zbMATH DE number 1670655 (Why is no real title available?)
| 2001-11-11 | Paper |
