| 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 | 2024-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147352 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084359 | 2023-10-31 | Paper |
| Sublinear time approximation of the cost of a metric k-nearest neighbor graph | 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 | 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 | 2019-11-07 | Paper |
| Planar graphs: Random walks and bipartiteness testing | 2019-10-16 | Paper |
| Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty | 2019-10-15 | Paper |
| StreamKM++: A Clustering Algorithm for Data Streams | 2019-09-11 | Paper |
| Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering | 2019-05-15 | Paper |
| (1 + ε)-Approximation for Facility Location in Data Streams | 2019-05-15 | Paper |
| Testing Euclidean minimum spanning trees in the plane | 2018-11-05 | Paper |
| Dissection-BKW | 2018-09-26 | Paper |
| Testing for Forbidden Order Patterns in an Array | 2018-07-16 | Paper |
| Clustering time series under the Fréchet distance | 2018-07-16 | Paper |
| Smallest enclosing ball for probabilistic data | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608052 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598152 | 2017-12-19 | Paper |
| Sampling in dynamic data streams and applications | 2017-10-20 | Paper |
| Relating two property testing models for bounded degree directed graphs | 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 | 2017-05-17 | Paper |
| Random projections for Bayesian regression | 2017-03-23 | Paper |
| Random projections for Bayesian regression | 2015-11-19 | Paper |
| Testing Cluster Structure of Graphs | 2015-08-21 | Paper |
| Probabilistic \(k\)-median clustering in data streams | 2015-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934631 | 2014-12-18 | Paper |
| Analysis of agglomerative clustering | 2014-11-19 | Paper |
| Clustering for metric and nonmetric distance measures | 2014-11-18 | Paper |
| Finding cycles and trees in sublinear time | 2014-10-16 | Paper |
| What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure? | 2014-10-14 | Paper |
| Smoothed analysis of left-to-right maxima with applications | 2014-09-09 | Paper |
| Planar Graphs: Random Walks and Bipartiteness Testing | 2014-07-30 | Paper |
| Every property of hyperfinite graphs is testable | 2014-06-05 | Paper |
| Subspace embeddings for the L 1 -norm with applications | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417655 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417606 | 2014-05-22 | Paper |
| StreamKM++ | 2014-04-01 | Paper |
| Every property of hyperfinite graphs is testable | 2013-09-25 | Paper |
| BICO: BIRCH Meets Coresets for k-Means Clustering | 2013-09-17 | Paper |
| Probabilistic k-Median Clustering in Data Streams | 2013-09-13 | Paper |
| Testing Expansion in Bounded-Degree Graphs | 2013-03-13 | Paper |
| Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness | 2012-09-25 | Paper |
| Analysis of Agglomerative Clustering | 2012-01-23 | Paper |
| Tolerant Algorithms | 2011-09-16 | Paper |
| Sublinear-time Algorithms | 2010-10-12 | Paper |
| Testing Euclidean Spanners | 2010-10-12 | Paper |
| Testing Monotone Continuous Distributions on High-Dimensional Real Cubes | 2010-10-12 | Paper |
| Testing Euclidean Spanners | 2010-09-06 | Paper |
| Coresets in dynamic geometric data streams | 2010-08-16 | Paper |
| Estimating the weight of metric minimum spanning trees in sublinear-time | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579409 | 2010-08-06 | Paper |
| Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time | 2010-07-07 | Paper |
| Small space representations for metric min-sum \(k\)-clustering and their applications | 2010-05-05 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs | 2010-01-06 | Paper |
| A sublinear-time approximation scheme for bin packing | 2009-11-06 | Paper |
| d-Dimensional Knapsack in the Streaming Model | 2009-10-29 | Paper |
| Streaming Embeddings with Slack | 2009-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396583 | 2009-09-19 | Paper |
| A FAST k-MEANS IMPLEMENTATION USING CORESETS | 2009-02-24 | Paper |
| A PTAS for k-means clustering based on weak coresets | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601532 | 2009-02-10 | Paper |
| Facility Location in Dynamic Geometric Data Streams | 2008-11-25 | Paper |
| Estimating Clustering Indexes in Data Streams | 2008-09-25 | Paper |
| SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS | 2008-08-26 | Paper |
| Small Space Representations for Metric Min-Sum k-Clustering and Their Applications | 2007-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3443153 | 2007-05-31 | Paper |
| A Distributed Algorithm for the Facility Location Problem | 2007-05-29 | Paper |
| Sublinear‐time approximation algorithms for clustering via random sampling | 2007-02-07 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time | 2005-10-28 | Paper |
| Abstract Combinatorial Programs and Efficient Property Testers | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Fast reconstruction of Delaunay triangulations | 2005-08-05 | Paper |
| Testing hypergraph colorability | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737218 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471376 | 2004-07-28 | Paper |
| Randomized Pursuit-Evasion in Graphs | 2004-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411413 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796180 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535042 | 2002-06-12 | Paper |
| Soft kinetic data structures | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753932 | 2001-11-11 | Paper |
