| Publication | Date of Publication | Type |
|---|
| Superpolynomial lower bounds for learning monotone classes | 2025-01-14 | Paper |
| On property testing of the binary rank | 2024-12-03 | Paper |
| Non-adaptive proper learning polynomials | 2024-10-08 | Paper |
| On one-sided testing affine subspaces | 2024-10-01 | Paper |
| Improved lower bound for estimating the number of defective items | 2024-09-16 | Paper |
| On detecting some defective items in group testing | 2024-08-22 | Paper |
| On testing decision tree | 2024-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059182 | 2023-11-02 | Paper |
| Almost Optimal Testers for Concise Representations. | 2023-10-31 | Paper |
| On one-sided testing affine subspaces | 2023-10-04 | Paper |
| Almost optimal proper learning and testing polynomials | 2023-07-26 | Paper |
| Optimal deterministic group testing algorithms to estimate the number of defectives | 2023-03-21 | Paper |
| An optimal tester for \(k\)-Linear | 2023-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875562 | 2023-02-03 | Paper |
| Almost optimal distribution-free junta testing | 2022-07-27 | Paper |
| On Polynomial Time Constructions of Minimum Height Decision Tree | 2022-07-21 | Paper |
| An optimal tester for \(k\)-linear | 2022-07-13 | Paper |
| Optimal deterministic group testing algorithms to estimate the number of defectives | 2021-06-22 | Paper |
| Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing | 2020-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617597 | 2019-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645641 | 2019-01-10 | Paper |
| Exact learning of juntas from membership queries | 2018-08-22 | Paper |
| Exact learning from an honest teacher that answers membership queries | 2018-06-05 | Paper |
| Non-adaptive learning of a hidden hypergraph | 2018-03-12 | Paper |
| Elementary Proofs of Some Stirling Bounds | 2018-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365125 | 2017-09-29 | Paper |
| Almost Optimal Cover-Free Families | 2017-07-21 | Paper |
| Testers and their applications | 2017-05-19 | Paper |
| Non-adaptive Learning of a Hidden Hypergraph | 2016-11-30 | Paper |
| The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers | 2016-11-09 | Paper |
| Exact learning of juntas from membership queries | 2016-11-09 | Paper |
| Learning Boolean halfspaces with small weights from membership queries | 2016-10-21 | Paper |
| Lower bounds for cover-free families | 2016-07-06 | Paper |
| Meeting times of random walks on graphs | 2016-06-16 | Paper |
| On learning width two branching programs | 2016-06-09 | Paper |
| On learning multivariate polynomials under the uniform distribution | 2016-06-01 | Paper |
| A tight bound for approximating the square root | 2016-05-26 | Paper |
| Linear Time Constructions of Some $$d$$-Restriction Problems | 2015-09-21 | Paper |
| On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ | 2015-05-20 | Paper |
| Learning Boolean Halfspaces with Small Weights from Membership Queries | 2015-01-14 | Paper |
| On Exact Learning Monotone DNF from Membership Queries | 2015-01-14 | Paper |
| On r-Simple k-Path | 2014-10-14 | Paper |
| A Simple Algorithm for Hamiltonicity | 2014-04-10 | Paper |
| Exact Learning from Membership Queries: Some Techniques, Results and New Directions | 2013-11-06 | Paper |
| On the Coin Weighing Problem with the Presence of Noise | 2012-11-02 | Paper |
| Linear classifiers are nearly optimal when hidden variables have diverse effects | 2012-05-23 | Paper |
| Toward a deterministic polynomial time algorithm with optimal additive query complexity | 2012-03-13 | Paper |
| Optimal Query Complexity for Reconstructing Hypergraphs | 2012-01-23 | Paper |
| Reconstructing weighted graphs with minimal query complexity | 2011-04-14 | Paper |
| Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity | 2010-09-03 | Paper |
| Reconstructing Weighted Graphs with Minimal Query Complexity | 2009-12-01 | Paper |
| Using the doubling dimension to analyze the generalization of learning algorithms | 2009-07-24 | Paper |
| On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle | 2008-09-04 | Paper |
| On Exact Learning from Random Walk | 2008-09-04 | Paper |
| Learning attribute-efficiently with corrupt oracles | 2007-12-19 | Paper |
| Learning with errors in answers to membership queries | 2007-11-30 | Paper |
| On Optimal Learning Algorithms for Multiplicity Automata | 2007-09-14 | Paper |
| Exact Learning Composed Classes with a Small Number of Mistakes | 2007-09-14 | Paper |
| Polynomial multiplication over finite fields: from quadratic to straight-line complexity | 2007-01-24 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Exact learning Boolean functions via the monotone theory | 2006-10-10 | Paper |
| Maximizing agreements and coagnostic learning | 2006-03-20 | Paper |
| Maximizing agreements with one-sided error with applications to heuristic learning | 2005-11-07 | Paper |
| Learning DNF from random walks | 2005-10-10 | Paper |
| Maximizing agreements with one-sided error with applications to heuristic learning | 2005-06-17 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Exploring learnability between exact and PAC | 2005-06-13 | Paper |
| 10.1162/153244304322972676 | 2005-02-16 | Paper |
| Noise-tolerant distribution-free learning of general geometric concepts | 2005-01-25 | Paper |
| 10.1162/153244303321897708 | 2004-10-28 | Paper |
| More efficient PAC-learning of DNF with membership queries under the uniform distribution | 2004-09-08 | Paper |
| Uniform-distribution attribute noise learnability | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046713 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046712 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046710 | 2004-08-12 | Paper |
| 10.1162/153244303768966094 | 2004-08-10 | Paper |
| The monotone theory for the PAC-model. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542579 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420742 | 2003-08-18 | Paper |
| Learning functions represented as multiplicity automata | 2003-06-25 | Paper |
| A subexponential exact learning algorithm for DNF using equivalence queries | 2003-06-24 | Paper |
| PAC learning with nasty noise. | 2003-01-21 | Paper |
| Simple Learning Algorithms for Decision Trees and Multivariate Polynomials | 2003-01-05 | Paper |
| 10.1162/153244302760200669 | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148826 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148825 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148829 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148822 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230376 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234068 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526997 | 2001-02-28 | Paper |
| Attribute-efficient learning in query and mistake-bound models | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955313 | 2000-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252715 | 2000-04-26 | Paper |
| Lower Bounds for the Complexity of Functions in a Realistic RAM Model | 2000-02-01 | Paper |
| Noise-tolerant parallel learning of geometric concepts | 1999-11-29 | Paper |
| On interpolating arithmetic read-once formulas with exponentiation | 1999-08-17 | Paper |
| A note on prime \(n\)-tuples | 1999-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228465 | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228463 | 1999-03-01 | Paper |
| Learning DNF over the Uniform Distribution Using a Quantum Example Oracle | 1999-02-22 | Paper |
| Learning matrix functions over rings | 1998-11-11 | Paper |
| Exact Learning of Discretized Geometric Concepts | 1998-09-21 | Paper |
| On learning decision trees with large output domains | 1998-09-20 | Paper |
| Interpolating Arithmetic Read-Once Formulas in Parallel | 1998-05-10 | Paper |
| On the Fourier spectrum of monotone functions | 1998-01-22 | Paper |
| On the direct sum conjecture in the straight line model | 1998-01-01 | Paper |
| Simple learning algorithms using divide and conquer | 1997-08-17 | Paper |
| Exact learning of formulas in parallel | 1997-04-09 | Paper |
| On the additive complexity of 2 \(\times 2\) matrix multiplication | 1997-02-28 | Paper |
| Oracles and queries that are sufficient for exact learning | 1996-11-26 | Paper |
| Asking questions to minimize errors | 1996-07-08 | Paper |
| Learning Arithmetic Read-Once Formulas | 1996-01-28 | Paper |
| Size-Depth Tradeoffs for Algebraic Formulas | 1995-11-01 | Paper |
| Learning Boolean read-once formulas over generalized bases | 1995-08-21 | Paper |
| On the Complexity of Bilinear Forms over Associative Algebras | 1995-05-01 | Paper |
| Multiplicative complexity of direct sums of quadratic systems | 1995-04-04 | Paper |
| An algorithm to learn read-once threshold formulas, and transformations between learning models | 1994-06-19 | Paper |
| Fast exponentiation using the truncation operation | 1993-06-29 | Paper |
| On the complexity of functions for random access machines | 1993-06-29 | Paper |
| A lower bound for the multiplication of polynomials modulo a polynomial | 1993-01-16 | Paper |
| A classification of algorithms for multiplying polynomials of small degree over finite fields | 1993-01-12 | Paper |
| Multiplication of Polynomials over Finite Fields | 1990-01-01 | Paper |
| Generalizations of the Normal Basis Theorem of Finite Fields | 1990-01-01 | Paper |
| Maximal Rank of $m\times n\times(mn-k)$ Tensors | 1990-01-01 | Paper |
| Multiplicative complexity of polynomial multiplication over finite fields | 1989-01-01 | Paper |
| A Lower Bound for Matrix Multiplication | 1989-01-01 | Paper |
| Vector sets for exhaustive testing of logic circuits | 1988-01-01 | Paper |
| Addition requirements for matrix and transposed matrix products | 1988-01-01 | Paper |
