| Publication | Date of Publication | Type |
|---|
Mathematical foundations of computer science. Mathematical thinking and proof -- an introduction
| 2024-02-06 | Paper |
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Lecture Notes in Computer Science | 2022-11-09 | Paper |
On the complexity of constructing optimal ordered binary decision diagrams
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | 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 |
Mathematische Grundlagen der Informatik
| 2015-10-27 | Paper |
Digitale Kommunikation
X.media.press | 2014-05-15 | Paper |
Digital communication. Communication, multimedia, security. Transl. from the German edition by the authors
X.media.publishing | 2014-04-01 | Paper |
IPv6 stateless address autoconfiguration: balancing between security, privacy and usability
Foundations and Practice of Security | 2013-08-07 | Paper |
Mathematical foundations of computer science. Mathematical thinking and proving. An introduction.
| 2011-04-26 | Paper |
Remodeling Vulnerability Information
Information Security and Cryptology | 2010-11-23 | Paper |
Lower bounds for the majority communication complexity of various graph accessibility problems
Lecture Notes in Computer Science | 2010-06-17 | Paper |
An Operator for Removal of Subsumed Clauses
Communications in Computer and Information Science | 2009-05-20 | Paper |
scientific article; zbMATH DE number 5039778 (Why is no real title available?)
| 2006-07-11 | Paper |
scientific article; zbMATH DE number 2166294 (Why is no real title available?)
| 2005-05-06 | Paper |
On relations between counting communication complexity classes
Journal of Computer and System Sciences | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2080558 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1993583 (Why is no real title available?)
| 2003-10-21 | Paper |
scientific article; zbMATH DE number 1956213 (Why is no real title available?)
| 2003-07-29 | Paper |
scientific article; zbMATH DE number 1956214 (Why is no real title available?)
| 2003-07-29 | Paper |
scientific article; zbMATH DE number 1775052 (Why is no real title available?)
| 2002-08-04 | Paper |
The log rank conjecture for modular communication complexity
Computational Complexity | 2002-02-28 | Paper |
Local encoding transformations for optimizing OBDD-representations of finite state machines
Formal Methods in System Design | 2001-09-09 | Paper |
scientific article; zbMATH DE number 1404756 (Why is no real title available?)
| 2000-02-22 | Paper |
scientific article; zbMATH DE number 1361498 (Why is no real title available?)
| 2000-02-01 | Paper |
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
RAIRO - Theoretical Informatics and Applications | 1999-12-19 | Paper |
scientific article; zbMATH DE number 1354132 (Why is no real title available?)
| 1999-10-31 | Paper |
scientific article; zbMATH DE number 1354166 (Why is no real title available?)
| 1999-10-28 | Paper |
scientific article; zbMATH DE number 1324659 (Why is no real title available?)
| 1999-08-17 | Paper |
scientific article; zbMATH DE number 1220670 (Why is no real title available?)
| 1998-11-10 | Paper |
scientific article; zbMATH DE number 1156875 (Why is no real title available?)
| 1998-05-26 | Paper |
scientific article; zbMATH DE number 1150567 (Why is no real title available?)
| 1998-05-10 | Paper |
Ordered binary design graphs and their signification in computer aided design of high-integrated circuits
Informatik Spektrum | 1997-12-10 | Paper |
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Theory of Computing Systems | 1997-08-24 | 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 512863 (Why is no real title available?)
| 1994-09-26 | Paper |
On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
Information Processing Letters | 1994-07-21 | Paper |
scientific article; zbMATH DE number 512807 (Why is no real title available?)
| 1994-05-29 | Paper |
scientific article; zbMATH DE number 512939 (Why is no real title available?)
| 1994-05-09 | Paper |
Efficient Boolean manipulation with OBDD's can be extended to FBDD's
IEEE Transactions on Computers | 1994-01-01 | Paper |
scientific article; zbMATH DE number 176154 (Why is no real title available?)
| 1993-05-18 | 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 |
scientific article; zbMATH DE number 108385 (Why is no real title available?)
| 1993-01-23 | Paper |
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
RAIRO - Theoretical Informatics and Applications | 1993-01-16 | Paper |
Structure and importance of logspace-MOD class
Mathematical Systems Theory | 1992-09-27 | Paper |
scientific article; zbMATH DE number 58305 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 41082 (Why is no real title available?)
| 1992-09-17 | Paper |
Modified branching programs and their computational power
Lecture Notes in Computer Science | 1992-09-17 | Paper |
scientific article; zbMATH DE number 36617 (Why is no real title available?)
| 1992-06-28 | Paper |
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
Theoretical Computer Science | 1992-06-26 | Paper |
scientific article; zbMATH DE number 17815 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 18624 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 17536 (Why is no real title available?)
| 1992-06-26 | Paper |
Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
Information and Computation | 1990-01-01 | Paper |
Polynomial size \(\Omega\)-branching programs and their computational power
Information and Computation | 1990-01-01 | Paper |
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
Information Processing Letters | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4145380 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4072383 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4051004 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4055051 (Why is no real title available?)
| 1988-01-01 | Paper |
The power of nondeterminism in polynomial-size bounded-width branching programs
Theoretical Computer Science | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4041256 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4047115 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4209586 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4011943 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3987266 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4030957 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3943033 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3915626 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3866584 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3848615 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3848616 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3821108 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3836010 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3843139 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3759556 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3782390 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3772961 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3673536 (Why is no real title available?)
| 1980-01-01 | Paper |
