| Publication | Date of Publication | Type |
|---|
| A reducibility concept for problems defined in terms of ordered binary decision diagrams | 2022-11-09 | Paper |
| Separating counting communication complexity classes | 2022-08-18 | Paper |
| On the complexity of constructing optimal ordered binary decision diagrams | 2022-08-18 | Paper |
| Lower bounds for the modular communication complexity of various graph accessibility problems | 2022-08-16 | Paper |
| The “log rank” conjecture for modular communication complexity | 2017-11-16 | Paper |
| Mathematische Grundlagen der Informatik | 2015-10-27 | Paper |
| Digitale Kommunikation | 2014-05-15 | Paper |
| Digital Communication | 2014-04-01 | Paper |
| IPv6 Stateless Address Autoconfiguration: Balancing between Security, Privacy and Usability | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2995546 | 2011-04-26 | Paper |
| Remodeling Vulnerability Information | 2010-11-23 | Paper |
| Lower bounds for the majority communication complexity of various graph accessibility problems | 2010-06-17 | Paper |
| An Operator for Removal of Subsumed Clauses | 2009-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5479656 | 2006-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673623 | 2005-05-06 | Paper |
| On relations between counting communication complexity classes | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473391 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431225 | 2003-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417676 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417677 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542178 | 2002-08-04 | Paper |
| The log rank conjecture for modular communication complexity | 2002-02-28 | Paper |
| Local encoding transformations for optimizing OBDD-representations of finite state machines | 2001-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938158 | 2000-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699317 | 2000-02-01 | Paper |
| On the Influence of the State Encoding on OBDD-Representations of Finite State Machines | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268446 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268481 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4255560 | 1999-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219538 | 1998-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390872 | 1998-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4388806 | 1998-05-10 | Paper |
| Ordered binary design graphs and their signification in computer aided design of high-integrated circuits | 1997-12-10 | Paper |
| A reducibility concept for problems defined in terms of ordered binary decision diagrams | 1997-08-24 | Paper |
| Lower bounds for the majority communication complexity of various graph accessibility problems | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858953 | 1996-05-27 | Paper |
| Separating complexity classes related to bounded alternating ?-branching programs | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281560 | 1994-09-26 | Paper |
| On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs | 1994-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281500 | 1994-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281654 | 1994-05-09 | Paper |
| Efficient Boolean manipulation with OBDD's can be extended to FBDD's | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035256 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035684 | 1993-05-18 | Paper |
| Separating complexity classes related to \(\Omega\)-decision trees | 1993-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023845 | 1993-01-23 | Paper |
| Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005192 | 1992-09-27 | Paper |
| Structure and importance of logspace-MOD class | 1992-09-27 | Paper |
| Modified branching programs and their computational power | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3994391 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3991212 | 1992-06-28 | Paper |
| Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974860 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975159 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976028 | 1992-06-26 | Paper |
| Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree | 1990-01-01 | Paper |
| Polynomial size \(\Omega\)-branching programs and their computational power | 1990-01-01 | Paper |
| Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3476311 | 1990-01-01 | Paper |
| The power of nondeterminism in polynomial-size bounded-width branching programs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787493 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790655 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804193 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357532 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779737 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783568 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751569 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761701 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771596 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714464 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334080 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691062 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043126 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313261 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318115 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318116 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3667951 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942404 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960124 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3953178 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870317 | 1980-01-01 | Paper |
