| Publication | Date of Publication | Type |
|---|
Integer complexity and mixed binary-ternary representation
| 2024-09-11 | Paper |
Escape from the room
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Depth two majority circuits for majority and list expanders
| 2021-08-04 | Paper |
scientific article; zbMATH DE number 7278010 (Why is no real title available?)
| 2020-11-25 | Paper |
On the size of depth-two threshold circuits for the inner product mod 2 function
| 2020-07-27 | Paper |
On XOR lemmas for the weight of polynomial threshold functions
Information and Computation | 2019-12-18 | Paper |
On the number of p4-tilings by an \(n\)-omino
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
How to solve the torus puzzle
Algorithms | 2019-03-26 | Paper |
Bounding the randomized decision tree complexity of read-once Boolean functions
| 2017-09-29 | Paper |
On XOR lemma for polynomial threshold weight and length
Language and Automata Theory and Applications | 2016-04-13 | Paper |
A nonuniform circuit class with multilayer of threshold gates having super quasi polynomial size lower bounds against NEXP
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Ordered biclique partitions and communication complexity problems
Discrete Applied Mathematics | 2015-04-28 | Paper |
On extremal \(k\)-CNF formulas
European Journal of Combinatorics | 2014-07-29 | Paper |
On directional vs. general randomized decision tree complexity for read-once formulas
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Some improved bounds on communication complexity via new decomposition of cliques
Discrete Applied Mathematics | 2014-02-18 | Paper |
On extremal \(k\)-CNF formulas
| 2013-11-01 | Paper |
Minterm-transitive functions with asymptotically smallest block sensitivity
Information Processing Letters | 2013-04-04 | Paper |
Tight bounds on the average sensitivity of k-CNF
Theory of Computing | 2011-05-24 | Paper |
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
Theoretical Computer Science | 2011-04-05 | Paper |
\(k\)-subgraph isomorphism on \(\text{AC}^{0}\) circuits
Computational Complexity | 2011-02-18 | Paper |
New upper bounds on the average PTF density of Boolean functions
Algorithms and Computation | 2010-12-09 | Paper |
scientific article; zbMATH DE number 5823842 (Why is no real title available?)
| 2010-12-08 | Paper |
Monotone Boolean functions with s zeros farthest from threshold functions
| 2010-07-30 | Paper |
Bounds on the Size of Small Depth Circuits for Approximating Majority
Automata, Languages and Programming | 2009-07-14 | Paper |
Inclusion-exclusion for \(k\)-CNF formulas
Information Processing Letters | 2009-04-28 | Paper |
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
Lecture Notes in Computer Science | 2008-07-10 | Paper |
A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Better upper bounds on the QOBDD size of integer multiplication
Discrete Applied Mathematics | 2007-06-26 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The monotone circuit complexity of quadratic Boolean functions
Algorithmica | 2006-10-16 | Paper |
On learning monotone Boolean functions under the uniform distribution
Theoretical Computer Science | 2006-03-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
SIAM Journal on Computing | 2005-10-28 | Paper |
The Potential of the Approximation Method
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2011859 (Why is no real title available?)
| 2003-12-02 | Paper |
scientific article; zbMATH DE number 1966606 (Why is no real title available?)
| 2003-08-18 | Paper |
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics | 2003-03-09 | Paper |
scientific article; zbMATH DE number 1834644 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1833412 (Why is no real title available?)
| 2002-11-21 | Paper |
scientific article; zbMATH DE number 1511701 (Why is no real title available?)
| 2000-09-27 | Paper |
scientific article; zbMATH DE number 1405685 (Why is no real title available?)
| 2000-02-23 | Paper |
scientific article; zbMATH DE number 1379105 (Why is no real title available?)
| 1999-12-15 | Paper |
scientific article; zbMATH DE number 1372659 (Why is no real title available?)
| 1999-12-01 | Paper |
scientific article; zbMATH DE number 1322345 (Why is no real title available?)
| 1999-11-08 | Paper |
scientific article; zbMATH DE number 1222575 (Why is no real title available?)
| 1999-06-27 | Paper |
Approximation algorithm for DNF under distributions with limited independence
Theory of Computing Systems | 1997-09-15 | Paper |
