| Publication | Date of Publication | Type |
|---|
| On efficient range-summability of IID random variables in two or higher dimensions | 2024-10-08 | Paper |
| A dyadic simulation approach to efficient range-summability | 2024-04-25 | Paper |
| A dyadic simulation approach to efficient range-summability | 2024-04-23 | Paper |
Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
Theory of Computing Systems | 2023-07-26 | Paper |
In memoriam: Alan L. Selman (1941--2021)
Theory of Computing Systems | 2023-07-26 | Paper |
Properties of probabilistic pushdown automata
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions | 2022-07-18 | Paper |
| Generalized predecessor existence problems for Boolean finite dynamical systems | 2020-05-26 | Paper |
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
Theoretical Computer Science | 2019-02-28 | Paper |
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
Information and Computation | 2017-09-28 | Paper |
A hierarchical model of data locality
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-08-21 | Paper |
Computational complexity studies of synchronous Boolean finite dynamical systems
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Time and space complexity for splicing systems
Theory of Computing Systems | 2010-10-06 | Paper |
On the autoreducibility of functions
Theory of Computing Systems | 2010-05-10 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Complexity Theory for Splicing Systems
Developments in Language Theory | 2007-11-28 | Paper |
Complexity theory for splicing systems
Theoretical Computer Science | 2007-10-25 | Paper |
Very Sparse Leaf Languages
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences | 2007-05-30 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The complexity of finding top-Toda-equivalence-class members
Theory of Computing Systems | 2006-10-16 | Paper |
The enumerability of P collapses P to NC
Theoretical Computer Science | 2005-12-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Competing provers yield improved Karp-Lipton collapse results
Information and Computation | 2005-05-04 | Paper |
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2112095 (Why is no real title available?) | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2013796 (Why is no real title available?) | 2003-12-07 | Paper |
The (Non)enumerability of the determinant and the rank
Theory of Computing Systems | 2003-08-26 | Paper |
A note on square rooting of time functions of Turing machines
Theory of Computing Systems | 2003-08-26 | Paper |
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962842 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1945788 (Why is no real title available?) | 2003-07-03 | Paper |
| scientific article; zbMATH DE number 1945786 (Why is no real title available?) | 2003-07-03 | Paper |
Tally NP sets and easy census functions.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1834679 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1759426 (Why is no real title available?) | 2002-11-04 | Paper |
Reducing the number of solutions of NP functions
Journal of Computer and System Sciences | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1746684 (Why is no real title available?) | 2002-06-09 | Paper |
PlanMine: Prediction plan failures using sequence mining
Artificial Intelligence Review | 2002-05-02 | Paper |
The complexity theory companion
Texts in Theoretical Computer Science. An EATCS Series | 2001-02-19 | Paper |
| scientific article; zbMATH DE number 1555921 (Why is no real title available?) | 2001-01-24 | Paper |
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity | 2000-12-05 | Paper |
| scientific article; zbMATH DE number 1306868 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1342109 (Why is no real title available?) | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1256722 (Why is no real title available?) | 1999-10-14 | Paper |
| scientific article; zbMATH DE number 1332663 (Why is no real title available?) | 1999-09-08 | Paper |
| scientific article; zbMATH DE number 1222583 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1256731 (Why is no real title available?) | 1999-05-18 | Paper |
Properties of probabilistic pushdown automata
Theoretical Computer Science | 1999-01-12 | Paper |
The PL Hierarchy Collapses
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1189120 (Why is no real title available?) | 1998-08-13 | Paper |
Universally serializable computation
Journal of Computer and System Sciences | 1998-08-04 | Paper |
Oracles That Compute Values
SIAM Journal on Computing | 1998-02-10 | Paper |
| scientific article; zbMATH DE number 1072529 (Why is no real title available?) | 1997-10-08 | Paper |
| scientific article; zbMATH DE number 1008513 (Why is no real title available?) | 1997-08-11 | Paper |
On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)
Journal of Computer and System Sciences | 1997-03-31 | Paper |
\(p\)-Selective sets and reducing search to decision vs. self-reducibility
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Functions computable with limited access to NP
Information Processing Letters | 1997-02-27 | Paper |
Reducibility classes of P-selective sets
Theoretical Computer Science | 1997-02-27 | Paper |
On helping by parity-like languages
Information Processing Letters | 1997-02-27 | Paper |
Relationships among $PL$, $\#L$, and the determinant
RAIRO - Theoretical Informatics and Applications | 1996-11-10 | Paper |
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
SIAM Journal on Computing | 1996-10-16 | Paper |
Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes
Information and Computation | 1996-09-15 | Paper |
NONDETERMINISTICALLY SELECTIVE SETS
International Journal of Foundations of Computer Science | 1996-08-13 | Paper |
ON SERIALIZABLE LANGUAGES
International Journal of Foundations of Computer Science | 1996-01-28 | Paper |
Polynomial-Time Membership Comparable Sets
SIAM Journal on Computing | 1995-11-29 | Paper |
Space-efficient recognition of sparse self-reducible languages
Computational Complexity | 1995-05-14 | Paper |
