| 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
Theoretical Computer Science | 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 |
scientific article; zbMATH DE number 7759286 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Almost Optimal Testers for Concise Representations.
(available as arXiv preprint) | 2023-10-31 | Paper |
On one-sided testing affine subspaces
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Almost optimal proper learning and testing polynomials
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Optimal deterministic group testing algorithms to estimate the number of defectives
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
An optimal tester for \(k\)-Linear
Theoretical Computer Science | 2023-03-17 | Paper |
| scientific article; zbMATH DE number 7650235 (Why is no real title available?) | 2023-02-03 | Paper |
Almost optimal distribution-free junta testing
(available as arXiv preprint) | 2022-07-27 | Paper |
On Polynomial Time Constructions of Minimum Height Decision Tree
(available as arXiv preprint) | 2022-07-21 | Paper |
An optimal tester for \(k\)-linear
(available as arXiv preprint) | 2022-07-13 | Paper |
Optimal deterministic group testing algorithms to estimate the number of defectives
Theoretical Computer Science | 2021-06-22 | Paper |
Bounds for the number of tests in non-adaptive randomized algorithms for group testing
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
| Adaptive group testing algorithms to estimate the number of defectives | 2019-02-06 | Paper |
Adaptive group testing algorithms to estimate the number of defectives
(available as arXiv preprint) | 2019-02-06 | Paper |
| Non-adaptive randomized algorithm for group testing | 2019-01-10 | Paper |
Non-adaptive randomized algorithm for group testing
(available as arXiv preprint) | 2019-01-10 | Paper |
Exact learning of juntas from membership queries
Theoretical Computer Science | 2018-08-22 | Paper |
Exact learning from an honest teacher that answers membership queries
Theoretical Computer Science | 2018-06-05 | Paper |
Non-adaptive learning of a hidden hypergraph
Theoretical Computer Science | 2018-03-12 | Paper |
| Elementary Proofs of Some Stirling Bounds | 2018-02-20 | Paper |
| On parity check \((0, 1)\)-matrix over \(\mathbb{Z}_p\) | 2017-09-29 | Paper |
Almost optimal cover-free families
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Non-adaptive learning of a hidden hypergraph
Lecture Notes in Computer Science | 2016-11-30 | Paper |
The maximum cosine framework for deriving perceptron based linear classifiers
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Exact learning of juntas from membership queries
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Learning Boolean halfspaces with small weights from membership queries
Theoretical Computer Science | 2016-10-21 | Paper |
Lower bounds for cover-free families
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Lower bounds for cover-free families
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Meeting times of random walks on graphs
Information Processing Letters | 2016-06-16 | Paper |
On learning width two branching programs
Information Processing Letters | 2016-06-09 | Paper |
On learning multivariate polynomials under the uniform distribution
Information Processing Letters | 2016-06-01 | Paper |
A tight bound for approximating the square root
Information Processing Letters | 2016-05-26 | Paper |
Linear Time Constructions of Some $$d$$-Restriction Problems
Lecture Notes in Computer Science | 2015-09-21 | Paper |
On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Learning Boolean halfspaces with small weights from membership queries
Lecture Notes in Computer Science | 2015-01-14 | Paper |
On Exact Learning Monotone DNF from Membership Queries
Lecture Notes in Computer Science | 2015-01-14 | Paper |
On r-Simple k-Path
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| A Simple Algorithm for Hamiltonicity | 2014-04-10 | Paper |
Exact learning from membership queries: some techniques, results and new directions
Lecture Notes in Computer Science | 2013-11-06 | Paper |
On the coin weighing problem with the presence of noise
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Linear classifiers are nearly optimal when hidden variables have diverse effects
Machine Learning | 2012-05-23 | Paper |
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Theoretical Computer Science | 2012-03-13 | Paper |
| Optimal query complexity for reconstructing hypergraphs | 2012-01-23 | Paper |
Reconstructing weighted graphs with minimal query complexity
Theoretical Computer Science | 2011-04-14 | Paper |
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Reconstructing weighted graphs with minimal query complexity
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Using the doubling dimension to analyze the generalization of learning algorithms
Journal of Computer and System Sciences | 2009-07-24 | Paper |
On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle
Lecture Notes in Computer Science | 2008-09-04 | Paper |
On Exact Learning from Random Walk
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Learning attribute-efficiently with corrupt oracles
Theoretical Computer Science | 2007-12-19 | Paper |
Learning with errors in answers to membership queries
Journal of Computer and System Sciences | 2007-11-30 | Paper |
On Optimal Learning Algorithms for Multiplicity Automata
Learning Theory | 2007-09-14 | Paper |
Exact Learning Composed Classes with a Small Number of Mistakes
Learning Theory | 2007-09-14 | Paper |
Polynomial multiplication over finite fields: from quadratic to straight-line complexity
Computational Complexity | 2007-01-24 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Exact learning Boolean functions via the monotone theory
Information and Computation | 2006-10-10 | Paper |
Maximizing agreements and coagnostic learning
Theoretical Computer Science | 2006-03-20 | Paper |
Maximizing agreements with one-sided error with applications to heuristic learning
Machine Learning | 2005-11-07 | Paper |
Learning DNF from random walks
Journal of Computer and System Sciences | 2005-10-10 | Paper |
Maximizing agreements with one-sided error with applications to heuristic learning
Machine Learning | 2005-06-17 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Exploring learnability between exact and PAC
Journal of Computer and System Sciences | 2005-06-13 | Paper |
10.1162/153244304322972676
CrossRef Listing of Deleted DOIs | 2005-02-16 | Paper |
Noise-tolerant distribution-free learning of general geometric concepts
Journal of the ACM | 2005-01-25 | Paper |
10.1162/153244303321897708
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences | 2004-09-08 | Paper |
Uniform-distribution attribute noise learnability
Information and Computation | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2089369 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089368 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089366 (Why is no real title available?) | 2004-08-12 | Paper |
10.1162/153244303768966094
CrossRef Listing of Deleted DOIs | 2004-08-10 | Paper |
The monotone theory for the PAC-model.
Information and Computation | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1775447 (Why is no real title available?) | 2004-01-27 | Paper |
| scientific article; zbMATH DE number 1966608 (Why is no real title available?) | 2003-08-18 | Paper |
Learning functions represented as multiplicity automata
Journal of the ACM | 2003-06-25 | Paper |
A subexponential exact learning algorithm for DNF using equivalence queries
Information Processing Letters | 2003-06-24 | Paper |
PAC learning with nasty noise.
Theoretical Computer Science | 2003-01-21 | Paper |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
SIAM Journal on Computing | 2003-01-05 | Paper |
10.1162/153244302760200669
CrossRef Listing of Deleted DOIs | 2002-11-27 | Paper |
| scientific article; zbMATH DE number 1804124 (Why is no real title available?) | 2002-09-22 | Paper |
| scientific article; zbMATH DE number 1804123 (Why is no real title available?) | 2002-09-22 | Paper |
| scientific article; zbMATH DE number 1804126 (Why is no real title available?) | 2002-09-22 | Paper |
| scientific article; zbMATH DE number 1804120 (Why is no real title available?) | 2002-09-22 | Paper |
| scientific article; zbMATH DE number 1256689 (Why is no real title available?) | 2002-01-20 | Paper |
| scientific article; zbMATH DE number 1263197 (Why is no real title available?) | 2001-08-27 | Paper |
| scientific article; zbMATH DE number 1559548 (Why is no real title available?) | 2001-02-28 | Paper |
Attribute-efficient learning in query and mistake-bound models
Journal of Computer and System Sciences | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1453040 (Why is no real title available?) | 2000-07-24 | Paper |
| scientific article; zbMATH DE number 1306863 (Why is no real title available?) | 2000-04-26 | Paper |
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
Journal of Algorithms | 2000-02-01 | Paper |
Noise-tolerant parallel learning of geometric concepts
Information and Computation | 1999-11-29 | Paper |
On interpolating arithmetic read-once formulas with exponentiation
Journal of Computer and System Sciences | 1999-08-17 | Paper |
A note on prime \(n\)-tuples
Rocky Mountain Journal of Mathematics | 1999-05-20 | Paper |
| scientific article; zbMATH DE number 1256730 (Why is no real title available?) | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1256728 (Why is no real title available?) | 1999-03-01 | Paper |
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
SIAM Journal on Computing | 1999-02-22 | Paper |
Learning matrix functions over rings
Algorithmica | 1998-11-11 | Paper |
Exact Learning of Discretized Geometric Concepts
SIAM Journal on Computing | 1998-09-21 | Paper |
On learning decision trees with large output domains
Algorithmica | 1998-09-20 | Paper |
Interpolating Arithmetic Read-Once Formulas in Parallel
SIAM Journal on Computing | 1998-05-10 | Paper |
On the Fourier spectrum of monotone functions
Journal of the ACM | 1998-01-22 | Paper |
On the Fourier spectrum of monotone functions
Journal of the ACM | 1998-01-22 | Paper |
On the direct sum conjecture in the straight line model
Journal of Complexity | 1998-01-01 | Paper |
Simple learning algorithms using divide and conquer
Computational Complexity | 1997-08-17 | Paper |
Exact learning of formulas in parallel
Machine Learning | 1997-04-09 | Paper |
On the additive complexity of 2 \(\times 2\) matrix multiplication
Information Processing Letters | 1997-02-28 | Paper |
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences | 1996-11-26 | Paper |
Asking questions to minimize errors
Journal of Computer and System Sciences | 1996-07-08 | Paper |
Learning Arithmetic Read-Once Formulas
SIAM Journal on Computing | 1996-01-28 | Paper |
Size-Depth Tradeoffs for Algebraic Formulas
SIAM Journal on Computing | 1995-11-01 | Paper |
Learning Boolean read-once formulas over generalized bases
Journal of Computer and System Sciences | 1995-08-21 | Paper |
On the Complexity of Bilinear Forms over Associative Algebras
SIAM Journal on Computing | 1995-05-01 | Paper |
Multiplicative complexity of direct sums of quadratic systems
Linear Algebra and its Applications | 1995-04-04 | Paper |
An algorithm to learn read-once threshold formulas, and transformations between learning models
Computational Complexity | 1994-06-19 | Paper |
Fast exponentiation using the truncation operation
Computational Complexity | 1993-06-29 | Paper |
On the complexity of functions for random access machines
Journal of the ACM | 1993-06-29 | Paper |
A lower bound for the multiplication of polynomials modulo a polynomial
Information Processing Letters | 1993-01-16 | Paper |
A classification of algorithms for multiplying polynomials of small degree over finite fields
Journal of Algorithms | 1993-01-12 | Paper |
Multiplication of Polynomials over Finite Fields
SIAM Journal on Computing | 1990-01-01 | Paper |
Generalizations of the Normal Basis Theorem of Finite Fields
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Maximal Rank of $m\times n\times(mn-k)$ Tensors
SIAM Journal on Computing | 1990-01-01 | Paper |
Multiplicative complexity of polynomial multiplication over finite fields
Journal of the ACM | 1989-01-01 | Paper |
A Lower Bound for Matrix Multiplication
SIAM Journal on Computing | 1989-01-01 | Paper |
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Addition requirements for matrix and transposed matrix products
Journal of Algorithms | 1988-01-01 | Paper |
