| Publication | Date of Publication | Type |
|---|
Spectral triadic decompositions of real-world networks
SIAM Journal on Mathematics of Data Science | 2024-10-10 | Paper |
| Some vignettes on subgraph counting using graph orientations (invited talk) | 2024-10-08 | Paper |
| The complexity of testing all properties of planar graphs, and the role of isomorphism | 2024-07-19 | Paper |
| Directed isoperimetric theorems for Boolean functions on the hypergrid and an \(\widetilde{O}(n\sqrt{d})\) monotonicity tester | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829249 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788476 (Why is no real title available?)
(available as arXiv preprint) | 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
SIAM Journal on Computing | 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
SIAM Journal on Computing | 2023-04-28 | Paper |
Counting Subgraphs in Degenerate Graphs
Journal of the ACM | 2023-04-27 | Paper |
scientific article; zbMATH DE number 7650386 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Correction to: ``Avoiding the global sort: a faster contour tree algorithm
Discrete & Computational Geometry | 2023-01-23 | Paper |
Adaptive Boolean Monotonicity Testing in Total Influence Time
(available as arXiv preprint) | 2022-07-18 | Paper |
Distribution-Free Models of Social Networks
(available as arXiv preprint) | 2022-02-04 | Paper |
| Distribution-Free Models of Social Networks | 2022-02-04 | Paper |
| Self-Improving Algorithms | 2022-02-04 | Paper |
| Finding cliques in social networks: a new distribution-free model | 2021-07-28 | Paper |
Why do simple algorithms for triangle enumeration work in the real world?
Internet Mathematics | 2021-04-26 | Paper |
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 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
SIAM Journal on Computing | 2021-01-13 | Paper |
Optimal unateness testers for real-valued functions: adaptivity helps
Theory of Computing | 2020-12-17 | Paper |
Wedge sampling for computing clustering coefficients and triangle counts on large graphs†
Statistical Analysis and Data Mining: The ASA Data Science Journal | 2020-10-14 | Paper |
On approximating the number of \(k\)-cliques in sublinear time
SIAM Journal on Computing | 2020-08-18 | Paper |
Finding cliques in social networks: a new distribution-free model
SIAM Journal on Computing | 2020-05-28 | Paper |
Optimal unateness testers for real-valued functions: Adaptivity helps
(available as arXiv preprint) | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7204459 (Why is no real title available?) | 2020-05-27 | Paper |
Random walks and forbidden minors II
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 | 2020-01-30 | Paper |
Sublinear time estimation of degree distribution moments: the arboricity connection
SIAM Journal on Discrete Mathematics | 2019-11-25 | Paper |
On approximating the number of k-cliques in sublinear time
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Property Testing on Product Distributions
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A stopping criterion for Markov chains when generating independent random graphs
Journal of Complex Networks | 2018-10-16 | Paper |
Accurate and nearly optimal sublinear approximations to Ulam distance
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| A \(o(d) \cdot \operatorname{polylog} n\) monotonicity tester for Boolean functions over the hypergrid \([n^d\)] | 2018-03-15 | Paper |
A \(o(d) \cdot \operatorname{polylog} n\) monotonicity tester for Boolean functions over the hypergrid \([n^d\)]
(available as arXiv preprint) | 2018-03-15 | Paper |
| Avoiding the global sort: a faster contour tree algorithm | 2018-01-30 | Paper |
Avoiding the global sort: a faster contour tree algorithm
Discrete & Computational Geometry | 2018-01-11 | Paper |
Avoiding the global sort: a faster contour tree algorithm
Discrete & Computational Geometry | 2018-01-11 | Paper |
Approximately counting triangles in sublinear time
SIAM Journal on Computing | 2017-11-22 | Paper |
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Estimating the longest increasing sequence in polylogarithmic time
SIAM Journal on Computing | 2017-05-30 | Paper |
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Decompositions of triangle-dense graphs
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Trigger detection for adaptive scientific workflows using percentile sampling
SIAM Journal on Scientific Computing | 2016-10-28 | Paper |
An \(o(n)\) monotonicity tester for Boolean functions over the hypercube
SIAM Journal on Computing | 2016-05-12 | Paper |
Decompositions of triangle-dense graphs
SIAM Journal on Computing | 2016-03-23 | Paper |
scientific article; zbMATH DE number 6395191 (Why is no real title available?)
Theory of Computing | 2015-02-03 | Paper |
Counting triangles in massive graphs with MapReduce
SIAM Journal on Scientific Computing | 2015-01-23 | Paper |
A Scalable Generative Graph Model with Community Structure
SIAM Journal on Scientific Computing | 2015-01-23 | Paper |
Is submodularity testable?
Algorithmica | 2014-11-19 | Paper |
Finding cycles and trees in sublinear time
Random Structures & Algorithms | 2014-10-16 | Paper |
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
A \(o(n)\) monotonicity tester for Boolean functions over the hypercube
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Self-improving algorithms for coordinatewise maxima and convex hulls
SIAM Journal on Computing | 2014-07-30 | Paper |
Blackbox identity testing for bounded top fanin depth-3 circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Self-improving algorithms for convex hulls | 2014-05-22 | Paper |
From sylvester-gallai configurations to rank bounds
Journal of the ACM | 2014-02-17 | Paper |
Online geometric reconstruction
Journal of the ACM | 2014-02-17 | Paper |
An in-depth analysis of stochastic Kronecker graphs
Journal of the ACM | 2014-02-17 | Paper |
An optimal lower bound for monotonicity testing over hypergrids
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Noise tolerance of expanders and sublinear expansion reconstruction
SIAM Journal on Computing | 2013-07-04 | Paper |
Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn't matter
SIAM Journal on Computing | 2013-02-04 | Paper |
Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs
Lecture Notes in Computer Science | 2012-07-23 | Paper |
An expansion tester for bounded degree graphs
SIAM Journal on Computing | 2011-10-18 | Paper |
Self-improving algorithms
SIAM Journal on Computing | 2011-07-29 | Paper |
An almost optimal rank bound for depth-3 identities
SIAM Journal on Computing | 2011-05-17 | Paper |
Local monotonicity reconstruction
SIAM Journal on Computing | 2011-04-04 | Paper |
Local property reconstruction and monotonicity
Property Testing | 2010-10-12 | Paper |
| scientific article; zbMATH DE number 5764799 (Why is no real title available?) | 2010-08-06 | Paper |
Self-improving algorithms for delaunay triangulations
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506230 (Why is no real title available?) | 2009-02-10 | Paper |
An Expansion Tester for Bounded Degree Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
| scientific article; zbMATH DE number 5173926 (Why is no real title available?) | 2007-07-24 | Paper |
