| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126319 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147270 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147353 | 2024-01-15 | Paper |
| A lower bound on the complexity of testing grained distributions | 2023-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062150 | 2023-10-31 | Paper |
| Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error | 2022-09-24 | Paper |
| A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy | 2022-08-30 | Paper |
| On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition) | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091207 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090414 | 2022-07-18 | Paper |
| The Subgraph Testing Model | 2022-03-07 | Paper |
| Sublinear-time algorithms for approximating graph parameters | 2022-02-16 | Paper |
| Property testing of the Boolean and binary rank | 2021-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009551 | 2021-08-04 | Paper |
| Testing Bounded Arboricity | 2021-05-03 | Paper |
| Property testing of planarity in the \textsf{CONGEST} model | 2021-03-12 | Paper |
| Faster sublinear approximation of the number of k-cliques in low-arboricity graphs | 2021-02-02 | Paper |
| On Approximating the Number of $k$-Cliques in Sublinear Time | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111336 | 2020-05-27 | Paper |
| Local algorithms for sparse spanning graphs | 2020-02-28 | Paper |
| Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism | 2019-12-16 | Paper |
| On Sample-Based Testers | 2019-12-06 | Paper |
| The Power of an Example | 2019-12-06 | Paper |
| Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection | 2019-11-25 | Paper |
| Property Testing of Planarity in the CONGEST model | 2019-09-19 | Paper |
| On approximating the number of k-cliques in sublinear time | 2019-08-22 | Paper |
| Testing equivalence between distributions using conditional samples | 2019-06-20 | Paper |
| The Boolean rank of the uniform intersection matrix and a family of its submatrices | 2019-05-29 | Paper |
| Exponentially improved algorithms and lower bounds for testing signed majorities | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743463 | 2019-05-10 | Paper |
| Approximating the distance to properties in bounded-degree and general sparse graphs | 2018-11-05 | Paper |
| Testing Properties of Sparse Images | 2018-10-30 | Paper |
| A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor | 2018-10-30 | Paper |
| Best of two local models: centralized local and distributed local algorithms | 2018-09-27 | Paper |
| On Learning and Testing Dynamic Environments | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636471 | 2018-04-19 | Paper |
| Testing Bounded Arboricity | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608031 | 2018-03-15 | Paper |
| Approximately Counting Triangles in Sublinear Time | 2017-11-22 | Paper |
| On Sample-Based Testers | 2017-05-19 | Paper |
| On the possibilities and limitations of pseudodeterministic algorithms | 2017-05-16 | Paper |
| Constructing near spanning trees with few local inspections | 2017-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969665 | 2017-03-22 | Paper |
| Chinese remaindering with errors | 2016-09-29 | Paper |
| On the learnability of discrete distributions | 2016-09-01 | Paper |
| On universal learning algorithms | 2016-05-26 | Paper |
| On Approximating the Number of Relevant Variables in a Function | 2015-09-24 | Paper |
| Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity | 2015-09-24 | Paper |
| Exponentially improved algorithms and lower bounds for testing signed majorities | 2015-07-10 | Paper |
| Testing Probability Distributions using Conditional Samples | 2015-06-11 | Paper |
| Efficient learning of typical finite automata from random walks | 2015-05-07 | Paper |
| Testing Similar Means | 2015-04-17 | Paper |
| Testing metric properties | 2015-02-27 | Paper |
| On proximity oblivious testing | 2015-02-04 | Paper |
| Approximating the distance to monotonicity in high dimensions | 2014-11-18 | Paper |
| Finding cycles and trees in sublinear time | 2014-10-16 | Paper |
| Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs | 2014-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191576 | 2014-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417610 | 2014-05-22 | Paper |
| Testing Similar Means | 2013-08-12 | Paper |
| A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor | 2013-08-06 | Paper |
| Comparing the strength of query types in property testing: the case of \(k\)-colorability | 2013-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913798 | 2012-09-27 | Paper |
| Counting Stars and Other Small Subgraphs in Sublinear-Time | 2012-03-15 | Paper |
| Testing computability by width-two OBDDs | 2012-03-13 | Paper |
| Testing Eulerianity and connectivity in directed sparse graphs | 2012-01-09 | Paper |
| On Testing Expansion in Bounded-Degree Graphs | 2011-08-19 | Paper |
| On Approximating the Number of Relevant Variables in a Function | 2011-08-17 | Paper |
| Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity | 2011-08-17 | Paper |
| Algorithmic Aspects of Property Testing in the Dense Graphs Model | 2011-07-29 | Paper |
| On Proximity-Oblivious Testing | 2011-07-29 | Paper |
| On the benefits of adaptivity in property testing of dense graphs | 2010-11-08 | Paper |
| Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability | 2010-10-12 | Paper |
| Algorithmic Aspects of Property Testing in the Dense Graphs Model | 2010-10-12 | Paper |
| Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries | 2010-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579435 | 2010-08-06 | Paper |
| Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown | 2010-05-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| lgorithmic and Analysis Techniques in Property Testing | 2010-03-12 | Paper |
| The hardness of the expected decision depth problem | 2010-01-29 | Paper |
| Algorithmic Aspects of Property Testing in the Dense Graphs Model | 2009-10-28 | Paper |
| Testing Computability by Width Two OBDDs | 2009-10-28 | Paper |
| Scheduling with conflicts: Online and offline algorithms | 2009-09-25 | Paper |
| Testing Triangle-Freeness in General Graphs | 2009-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615896 | 2009-03-24 | Paper |
| On the Benefits of Adaptivity in Property Testing of Dense Graphs | 2009-02-17 | Paper |
| Finding a dense-core in jellyfish graphs | 2009-01-20 | Paper |
| Testing Reed–Muller Codes | 2008-12-21 | Paper |
| A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes | 2008-12-21 | Paper |
| Approximating average parameters of graphs | 2008-07-21 | Paper |
| Finding a Dense-Core in Jellyfish Graphs | 2008-04-11 | Paper |
| Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms | 2007-09-03 | Paper |
| Distance Approximation in Bounded-Degree and General Sparse Graphs | 2007-08-28 | Paper |
| Approximating Average Parameters of Graphs | 2007-08-28 | Paper |
| Testing Polynomials over General Fields | 2007-06-26 | Paper |
| Tolerant property testing and distance approximation | 2006-10-05 | Paper |
| Testing of Clustering | 2005-02-25 | Paper |
| Tight Bounds for Testing Bipartiteness in General Graphs | 2005-02-21 | Paper |
| Property testing and its connection to learning and approximation | 2005-01-25 | Paper |
| A new conceptual clustering framework | 2005-01-19 | Paper |
| Testing metric properties | 2004-08-19 | Paper |
| Testing juntas | 2004-08-06 | Paper |
| Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks | 2004-01-08 | Paper |
| Testing of Clustering | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440424 | 2003-12-17 | Paper |
| On Testing Convexity and Submodularity | 2003-09-28 | Paper |
| Errata for: ``On randomized one-round communication complexity | 2003-08-26 | Paper |
| Testing membership in parenthesis languages | 2003-03-19 | Paper |
| Testing Basic Boolean Formulae | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780800 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780801 | 2002-11-21 | Paper |
| Testing the diameter of graphs | 2002-08-08 | Paper |
| Testing properties of directed graphs: acyclicity and connectivity* | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542547 | 2002-08-01 | Paper |
| On disjoint chains of subsets | 2002-07-14 | Paper |
| Property testing in bounded degree graphs | 2002-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754198 | 2001-11-11 | Paper |
| Testing monotonicity | 2001-06-12 | Paper |
| Testing problems with sublearning sample complexity | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527008 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788610 | 2001-01-01 | Paper |
| Chinese remaindering with errors | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941828 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941829 | 2000-03-19 | Paper |
| Computational Sample Complexity | 2000-03-19 | Paper |
| A sublinear bipartiteness tester for bounded degree graphs | 2000-02-21 | Paper |
| On randomized one-round communication complexity | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234109 | 1999-03-16 | Paper |
| On the learnability and usage of acyclic probabilistic finite automata | 1998-11-10 | Paper |
| Efficient learning of typical finite automata from random walks | 1998-06-02 | Paper |
| The power of amnesia: Learning probabilistic automata with variable memory length | 1997-08-20 | Paper |
| Agreement in the presence of faults, on networks of bounded degree | 1997-02-27 | Paper |
| Learning fallible deterministic finite automata | 1995-10-29 | Paper |
