| Publication | Date of Publication | Type |
|---|
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Separating counting communication complexity classes
STACS 92 | 2022-08-18 | Paper |
Lower bounds for the modular communication complexity of various graph accessibility problems
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
The ``log rank'' conjecture for modular communication complexity
STACS 96 | 2017-11-16 | Paper |
A generalized model of PAC learning and its applicability
RAIRO - Theoretical Informatics and Applications | 2014-06-27 | Paper |
Lower bounds for the majority communication complexity of various graph accessibility problems
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On approximation by \(^{\oplus}\)-OBDDs
Information Processing Letters | 2010-01-29 | Paper |
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
Information Processing Letters | 2010-01-18 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Theoretical Computer Science | 2006-10-20 | Paper |
On relations between counting communication complexity classes
Journal of Computer and System Sciences | 2004-10-01 | Paper |
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
RAIRO - Theoretical Informatics and Applications | 2003-07-15 | Paper |
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
RAIRO - Theoretical Informatics and Applications | 2003-07-15 | Paper |
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
RAIRO - Theoretical Informatics and Applications | 2003-07-15 | Paper |
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1834649 (Why is no real title available?) | 2002-11-25 | Paper |
The ''log rank'' conjecture for modular communication complexity
Computational Complexity | 2002-02-28 | Paper |
| scientific article; zbMATH DE number 1354132 (Why is no real title available?) | 1999-10-31 | Paper |
Lower bounds for the majority communication complexity of various graph accessibility problems
Mathematical Systems Theory | 1996-12-01 | Paper |
| scientific article; zbMATH DE number 827986 (Why is no real title available?) | 1996-05-27 | Paper |
Separating complexity classes related to bounded alternating ?-branching programs
Mathematical Systems Theory | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 512807 (Why is no real title available?) | 1994-05-29 | Paper |
| scientific article; zbMATH DE number 176154 (Why is no real title available?) | 1993-05-18 | Paper |
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
RAIRO - Theoretical Informatics and Applications | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 41082 (Why is no real title available?) | 1992-09-17 | Paper |
On the parallel complexity of linear groups
RAIRO - Theoretical Informatics and Applications | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 18644 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17548 (Why is no real title available?) | 1992-06-26 | Paper |
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
Theoretical Computer Science | 1992-06-26 | Paper |
On oblivious branching programs of linear length
Information and Computation | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4145340 (Why is no real title available?) | 1990-01-01 | Paper |
Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
Information and Computation | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4072383 (Why is no real title available?) | 1988-01-01 | Paper |
Lower bounds on the complexity of real-time branching programs
RAIRO - Theoretical Informatics and Applications | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4047113 (Why is no real title available?) | 1987-01-01 | Paper |
On dissections of the n-cube
Beiträge zur Algebra und Geometrie | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3937107 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3827208 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3784868 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3726323 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3733890 (Why is no real title available?) | 1981-01-01 | Paper |
