| Publication | Date of Publication | Type |
|---|
| Testing juntas [combinatorial property testing] | 2026-05-29 | Paper |
| Testing random variables for independence and identity | 2026-05-08 | Paper |
| Efficient testing of large graphs | 2026-05-06 | Paper |
| Pixelating relations and functions without adding substructures | 2026-04-29 | Paper |
| Ordered graph limits and their applications | 2026-04-15 | Paper |
| Extensions and limits of the Specker-Blatter theorem | 2026-02-19 | Paper |
| Improved bounds for high-dimensional equivalence and product testing using subcube queries | 2025-10-06 | Paper |
| Support testing in the huge object model | 2025-10-06 | Paper |
| Refining the adaptivity notion in the huge object model | 2025-10-06 | Paper |
| Testing hereditary properties of ordered graphs and matrices | 2025-08-06 | Paper |
| Trading query complexity for sample-based testing and multi-testing scalability | 2025-08-05 | Paper |
Exploring the gap between tolerant and non-tolerant distribution testing
IEEE Transactions on Information Theory | 2025-02-27 | Paper |
Counting finite topologies
Enumerative Combinatorics and Applications | 2025-02-01 | Paper |
Extensions and limits of the Specker-Blatter theorem
Journal of Symbolic Logic | 2024-11-25 | Paper |
| Exploring the gap between tolerant and non-tolerant distribution testing | 2024-08-22 | Paper |
MC-finiteness of restricted set partition functions
(available as arXiv preprint) | 2023-08-28 | Paper |
| MC-finiteness of restricted set partition functions | 2023-08-28 | Paper |
scientific article; zbMATH DE number 7650357 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Extensions and Limits of the Specker-Blatter Theorem | 2022-06-24 | Paper |
Earthmover Resilience and Testing in Ordered Structures
(available as arXiv preprint) | 2020-09-22 | Paper |
Testing Read-Once Formula Satisfaction
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Testing Read-Once Formula Satisfaction
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Improving and extending the testing of distributions for shape-restricted properties
Algorithmica | 2019-08-20 | Paper |
Testing low complexity affine-invariant properties
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Fast distributed algorithms for testing graph properties
Distributed Computing | 2019-03-21 | Paper |
| Longest paths in 2-edge-connected cubic graphs | 2019-03-06 | Paper |
| Ordered Graph Limits and Their Applications | 2018-11-05 | Paper |
Fast distributed algorithms for testing graph properties
Lecture Notes in Computer Science | 2018-08-16 | Paper |
Improving and extending the testing of distributions for shape-restricted properties
(available as arXiv preprint) | 2018-04-19 | Paper |
| Improved bounds for testing Dyck languages | 2018-03-15 | Paper |
Improved bounds for testing Dyck languages
(available as arXiv preprint) | 2018-03-15 | Paper |
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
On the power of conditional samples in distribution testing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Testing hereditary properties of ordered graphs and matrices | 2017-04-07 | Paper |
PCP characterizations of NP: towards a polynomially-small error-probability
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
On the power of conditional samples in distribution testing
SIAM Journal on Computing | 2016-08-16 | Paper |
Hardness and algorithms for rainbow connection
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Testing of matrix properties
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Query complexity lower bounds for reconstruction of codes
Theory of Computing | 2015-02-03 | Paper |
A combinatorial characterization of the testable graph properties, it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Every locally characterized affine-invariant property is testable
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| New results on quantum property testing | 2012-08-29 | Paper |
Testing formula satisfaction
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
| Hardness and Algorithms for Rainbow Connectivity | 2012-04-24 | Paper |
| Application of logic to combinatorial sequences and their recurrence relations | 2012-03-02 | Paper |
| Two-phase algorithms for the parametric shortest path problem | 2012-01-23 | Paper |
PCP characterizations of NP: toward a polynomially-small error-probability
Computational Complexity | 2011-11-30 | Paper |
Inflatable graph properties and natural property tests
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Testing convexity properties of tree colorings
Algorithmica | 2011-07-01 | Paper |
Tolerant versus intolerant testing for Boolean properties
Theory of Computing | 2011-05-24 | Paper |
Approximate hypergraph partitioning and applications
SIAM Journal on Computing | 2011-04-04 | Paper |
The Specker-Blatter theorem revisited
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Approximate satisfiability and equivalence
SIAM Journal on Computing | 2011-01-17 | Paper |
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Testing graph isomorphism
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The difficulty of testing for isomorphism against a graph that is given in advance
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Monotonicity testing over general poset domains
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing | 2010-03-17 | Paper |
Testing Graph Isomorphism
SIAM Journal on Computing | 2009-03-16 | Paper |
Testing st-Connectivity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
On the Query Complexity of Testing Orientations for Being Eulerian
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
SIAM Journal on Computing | 2008-06-19 | Paper |
Testing versus Estimation of Graph Properties
SIAM Journal on Computing | 2008-04-22 | Paper |
Linear Recurrence Relations for Graph Polynomials
Pillars of Computer Science | 2008-03-25 | Paper |
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics | 2008-02-26 | Paper |
Testing of matrix-poset properties
Combinatorica | 2007-11-12 | Paper |
Testing Convexity Properties of Tree Colorings
STACS 2007 | 2007-09-03 | Paper |
The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
SIAM Journal on Computing | 2005-09-16 | Paper |
On spectra of sentences of monadic second order logic with counting
Journal of Symbolic Logic | 2005-08-29 | Paper |
Testing graphs for colorability properties*
Random Structures & Algorithms | 2005-06-01 | Paper |
| scientific article; zbMATH DE number 2156274 (Why is no real title available?) | 2005-04-15 | Paper |
On the strength of comparisons in property testing
Information and Computation | 2004-11-23 | Paper |
Testing juntas
Journal of Computer and System Sciences | 2004-08-06 | Paper |
Functions that have read‐twice constant width branching programs are not necessarily testable
Random Structures & Algorithms | 2004-03-29 | Paper |
| Testing graphs for colorability properties | 2003-10-26 | Paper |
The Specker-Blatter theorem does not hold for quaternary relations
Journal of Combinatorial Theory. Series A | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1819631 (Why is no real title available?) | 2002-10-23 | Paper |
Parent-identifying codes
Journal of Combinatorial Theory. Series A | 2002-03-06 | Paper |
Refining the graph density condition for the existence of almost K-factors
Ars Combinatoria | 2001-12-17 | Paper |
Efficient testing of large graphs
Combinatorica | 2001-06-13 | Paper |
| Variants of the Hajnal-Szemer�di Theorem | 2000-06-04 | Paper |
Cycle factors in dense graphs
Discrete Mathematics | 2000-01-30 | Paper |
Induced complete \(h\)-partite graphs in dense clique-less graphs
The Electronic Journal of Combinatorics | 1999-12-14 | Paper |
Induced complete \(h\)-partite graphs in dense clique-less graphs
The Electronic Journal of Combinatorics | 1999-12-14 | Paper |
2-factors in dense graphs
Discrete Mathematics | 1996-07-07 | Paper |
Counting Finite Topologies
(available as arXiv preprint) | N/A | Paper |
Pixelating Relations and Functions Without Adding Substructures
(available as arXiv preprint) | N/A | Paper |
