| Publication | Date of Publication | Type |
|---|
Parallel complexity of iterated morphisms and the arithmetic of small numbers
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Separating counting communication complexity classes
STACS 92 | 2022-08-18 | Paper |
Inductive counting below LOGSPACE
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Some bounds on multiparty communication complexity of pointer jumping
STACS 96 | 2017-11-16 | Paper |
Automata that take advice
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On approximation by \(^{\oplus}\)-OBDDs
Information Processing Letters | 2010-01-29 | Paper |
| An introductory course on communication complexity | 2008-09-25 | Paper |
Complexity of some arithmetic problems for binary polynomials
Computational Complexity | 2004-12-13 | Paper |
On relations between counting communication complexity classes
Journal of Computer and System Sciences | 2004-10-01 | Paper |
The complexity of tensor calculus
Computational Complexity | 2003-11-17 | Paper |
The average sensitivity of square-freeness
Computational Complexity | 2003-06-09 | Paper |
Circuit and decision tree complexity of some number theoretic problems
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1405679 (Why is no real title available?) | 2000-07-05 | Paper |
On the Average Sensitivity of Testing Square-Free Numbers
Lecture Notes in Computer Science | 2000-04-03 | Paper |
Some bounds on multiparty communication complexity of pointer jumping
Computational Complexity | 1999-05-18 | Paper |
Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
Information Processing Letters | 1999-04-28 | Paper |
| scientific article; zbMATH DE number 1179978 (Why is no real title available?) | 1998-07-28 | Paper |
Expressing uniformity via oracles
Theory of Computing Systems | 1997-07-28 | Paper |
Inductive counting for width-restricted branching programs
Information and Computation | 1997-03-06 | Paper |
| scientific article; zbMATH DE number 827986 (Why is no real title available?) | 1996-05-27 | Paper |
| scientific article; zbMATH DE number 176518 (Why is no real title available?) | 1993-05-18 | Paper |
Separating complexity classes related to \(\Omega\)-decision trees
Theoretical Computer Science | 1993-04-22 | Paper |
Structure and importance of logspace-MOD class
Mathematical Systems Theory | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 17536 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 18630 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 19766 (Why is no real title available?) | 1992-06-26 | Paper |
Problems complete for \(\oplus L\)
Information Processing Letters | 1990-01-01 | Paper |
