| Publication | Date of Publication | Type |
|---|
Pinpointing computation with modular queries in the Boolean hierarchy
| 2024-07-05 | Paper |
Sorting n objects with a k-sorter
IEEE Transactions on Computers | 2018-09-14 | Paper |
Molecular computing, bounded nondeterminism, and efficient recursion
Automata, Languages and Programming | 2018-07-04 | Paper |
On the sizes of DPDAs, PDAs, LBAs
Theoretical Computer Science | 2016-06-16 | Paper |
A note on the polynomial representation of Boolean functions over \(\mathrm{GF}(2)\)
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
A dense hierarchy of sublinear time approximation schemes for bin packing
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Square-Difference-Free Sets of Size Omega(n^{0.7334...})
| 2008-04-30 | Paper |
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Infinitely‐Often Autoreducible Sets
SIAM Journal on Computing | 2007-06-26 | Paper |
A tight lower bound for restricted PIR protocols
Computational Complexity | 2006-09-28 | Paper |
Enumerations of the Kolmogorov function
Journal of Symbolic Logic | 2006-08-03 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
3-coloring in time
Journal of Algorithms | 2005-02-22 | Paper |
Learning a Hidden Matching
SIAM Journal on Computing | 2005-02-21 | Paper |
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science | 2004-08-10 | Paper |
Some connections between bounded query classes and non-uniform complexity.
Information and Computation | 2004-03-14 | Paper |
Commutative queries
Information and Computation | 2003-01-14 | Paper |
Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1775396 (Why is no real title available?)
| 2002-08-01 | Paper |
scientific article; zbMATH DE number 1775405 (Why is no real title available?)
| 2002-08-01 | Paper |
scientific article; zbMATH DE number 1678392 (Why is no real title available?)
| 2001-12-04 | Paper |
The complexity of modular graph automorphism
SIAM Journal on Computing | 2001-03-19 | Paper |
Circuits over PP and PL
Journal of Computer and System Sciences | 2001-03-12 | Paper |
The complexity of ODDnA
Journal of Symbolic Logic | 2000-06-22 | Paper |
scientific article; zbMATH DE number 1306889 (Why is no real title available?)
| 2000-06-21 | Paper |
scientific article; zbMATH DE number 1306877 (Why is no real title available?)
| 2000-04-26 | Paper |
A comparison of resource-bounded molecular computation models
Algorithmica | 2000-04-25 | Paper |
scientific article; zbMATH DE number 1342107 (Why is no real title available?)
| 1999-09-22 | Paper |
scientific article; zbMATH DE number 1335890 (Why is no real title available?)
| 1999-09-13 | Paper |
scientific article; zbMATH DE number 1305487 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1301088 (Why is no real title available?)
| 1999-06-15 | Paper |
Molecular computing, bounded nondeterminism, and efficient recursion
Algorithmica | 1999-01-01 | Paper |
Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis
Theoretical Computer Science | 1998-08-13 | Paper |
scientific article; zbMATH DE number 1136076 (Why is no real title available?)
| 1998-07-16 | Paper |
Upper and lower bounds for some depth-3 circuit classes
Computational Complexity | 1998-07-06 | Paper |
scientific article; zbMATH DE number 1114037 (Why is no real title available?)
| 1998-05-10 | Paper |
scientific article; zbMATH DE number 1003303 (Why is no real title available?)
| 1997-04-23 | Paper |
Frequency computation and bounded queries
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 946432 (Why is no real title available?)
| 1996-11-17 | Paper |
Approximable sets
Information and Computation | 1996-04-16 | Paper |
PP is closed under intersection
Journal of Computer and System Sciences | 1995-06-08 | Paper |
Quantifying the amount of verboseness
Information and Computation | 1995-05-28 | Paper |
Representing Boolean functions as polynomials modulo composite numbers
Computational Complexity | 1995-04-06 | Paper |
On ACC
Computational Complexity | 1995-04-06 | Paper |
Perceptrons, PP, and the polynomial hierarchy
Computational Complexity | 1995-04-06 | Paper |
When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
Computational Complexity | 1995-04-06 | Paper |
The expressive power of voting polynomials
Combinatorica | 1994-08-11 | Paper |
Almost-everywhere complexity hierarchies for nondeterministic time
Theoretical Computer Science | 1993-09-16 | Paper |
A relationship between difference hierarchies and relativized polynomial hierarchies
Mathematical Systems Theory | 1993-08-22 | Paper |
Terse, superterse, and verbose sets
Information and Computation | 1993-06-29 | Paper |
Counting classes: Thresholds, parity, mods, and fewness
Theoretical Computer Science | 1993-01-16 | Paper |
On being incoherent without being very hard
Computational Complexity | 1993-01-16 | Paper |
The Mapmaker's dilemma
Discrete Applied Mathematics | 1992-06-28 | Paper |
Irrationality Without Number Theory
The American Mathematical Monthly | 1992-06-27 | Paper |
Bounded queries to SAT and the Boolean hierarchy
Theoretical Computer Science | 1992-06-26 | Paper |
Probabilistic polynomial time is closed under parity reductions
Information Processing Letters | 1991-01-01 | Paper |
Relativized counting classes: Relations among thresholds, parity, and mods
Journal of Computer and System Sciences | 1991-01-01 | Paper |
Counting classes: Thresholds, parity, mods, and fewness
STACS 90 | 1990-01-01 | Paper |
Unbounded Searching Algorithms
SIAM Journal on Computing | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4205978 (Why is no real title available?)
| 1990-01-01 | Paper |
Bi-immunity results for cheatable sets
Theoretical Computer Science | 1990-01-01 | Paper |
Bounded query classes and the difference hierarchy
Archive for Mathematical Logic | 1989-01-01 | Paper |
On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Nondeterministic bounded query reducibilities
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Rearranging Terms in Alternating Series
| 1981-01-01 | Paper |
