| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126242 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147393 | 2024-01-15 | Paper |
| Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs | 2023-12-19 | Paper |
| Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs | 2023-04-28 | Paper |
| Counting Subgraphs in Degenerate Graphs | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875738 | 2023-02-03 | Paper |
| Correction to: ``Avoiding the global sort: a faster contour tree algorithm | 2023-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090393 | 2022-07-18 | Paper |
| Self-Improving Algorithms | 2022-02-04 | Paper |
| Distribution-Free Models of Social Networks | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002730 | 2021-07-28 | Paper |
| Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? | 2021-04-26 | Paper |
| Faster sublinear approximation of the number of k-cliques in low-arboricity graphs | 2021-02-02 | Paper |
| Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions | 2021-02-02 | Paper |
| Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs | 2021-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140837 | 2020-12-17 | Paper |
| Wedge sampling for computing clustering coefficients and triangle counts on large graphs† | 2020-10-14 | Paper |
| On Approximating the Number of $k$-Cliques in Sublinear Time | 2020-08-18 | Paper |
| Finding Cliques in Social Networks: A New Distribution-Free Model | 2020-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111334 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111336 | 2020-05-27 | Paper |
| Random walks and forbidden minors II | 2020-01-30 | Paper |
| Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection | 2019-11-25 | Paper |
| On approximating the number of k-cliques in sublinear time | 2019-08-22 | Paper |
| Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance | 2019-05-15 | Paper |
| Property Testing on Product Distributions | 2018-11-05 | Paper |
| A stopping criterion for Markov chains when generating independent random graphs | 2018-10-16 | Paper |
| Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608033 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132893 | 2018-01-30 | Paper |
| Avoiding the global sort: a faster contour tree algorithm | 2018-01-11 | Paper |
| Approximately Counting Triangles in Sublinear Time | 2017-11-22 | Paper |
| Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties | 2017-10-05 | Paper |
| Estimating the Longest Increasing Sequence in Polylogarithmic Time | 2017-05-30 | Paper |
| Decompositions of Triangle-Dense Graphs | 2017-05-19 | Paper |
| Why do simple algorithms for triangle enumeration work in the real world? | 2017-05-19 | Paper |
| Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling | 2016-10-28 | Paper |
| An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube | 2016-05-12 | Paper |
| Decompositions of Triangle-Dense Graphs | 2016-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5497118 | 2015-02-03 | Paper |
| A Scalable Generative Graph Model with Community Structure | 2015-01-23 | Paper |
| Counting Triangles in Massive Graphs with MapReduce | 2015-01-23 | Paper |
| Is submodularity testable? | 2014-11-19 | Paper |
| Finding cycles and trees in sublinear time | 2014-10-16 | Paper |
| Self-improving algorithms for coordinate-wise maxima | 2014-08-07 | Paper |
| A o(n) monotonicity tester for boolean functions over the hypercube | 2014-08-07 | Paper |
| Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids | 2014-08-07 | Paper |
| Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls | 2014-07-30 | Paper |
| Blackbox identity testing for bounded top fanin depth-3 circuits | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417730 | 2014-05-22 | Paper |
| Online geometric reconstruction | 2014-02-17 | Paper |
| An in-depth analysis of stochastic Kronecker graphs | 2014-02-17 | Paper |
| From sylvester-gallai configurations to rank bounds | 2014-02-17 | Paper |
| An Optimal Lower Bound for Monotonicity Testing over Hypergrids | 2013-10-04 | Paper |
| Noise Tolerance of Expanders and Sublinear Expansion Reconstruction | 2013-07-04 | Paper |
| Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter | 2013-02-04 | Paper |
| Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs | 2012-07-23 | Paper |
| An Expansion Tester for Bounded Degree Graphs | 2011-10-18 | Paper |
| Self-Improving Algorithms | 2011-07-29 | Paper |
| An Almost Optimal Rank Bound for Depth-3 Identities | 2011-05-17 | Paper |
| Local Monotonicity Reconstruction | 2011-04-04 | Paper |
| Local Property Reconstruction and Monotonicity | 2010-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579388 | 2010-08-06 | Paper |
| Self-improving algorithms for delaunay triangulations | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601563 | 2009-02-10 | Paper |
| An Expansion Tester for Bounded Degree Graphs | 2008-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294162 | 2007-07-24 | Paper |
