Stephan Waack

Available identifiers

zbMath Open waack.stephanMaRDI QIDQ233005

List of research outcomes

Publication	Date of Publication	Type
On the descriptive and algorithmic power of parity ordered binary decision diagrams	2022-11-09	Paper
Separating counting communication complexity classes	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
A Generalized Model of PAC Learning and its Applicability	2014-06-27	Paper
Lower bounds for the majority communication complexity of various graph accessibility problems	2010-06-17	Paper
On approximation by \(^{\oplus}\)-OBDDs	2010-01-29	Paper
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance	2010-01-18	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication	2006-10-20	Paper
On relations between counting communication complexity classes	2004-10-01	Paper
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs	2003-07-15	Paper
On the descriptive and algorithmic power of parity ordered binary decision diagrams	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4779145	2002-11-25	Paper
The log rank conjecture for modular communication complexity	2002-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4268446	1999-10-31	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/Q4281500	1994-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q4035256	1993-05-18	Paper
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q3994391	1992-09-17	Paper
On the parallel complexity of linear groups	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/Q3974873	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3976049	1992-06-26	Paper
On oblivious branching programs of linear length	1991-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/Q3476278	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3804193	1988-01-01	Paper
Lower bounds on the complexity of real-time branching programs	1988-01-01	Paper
On dissections of the n-cube	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3783566	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3710469	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3673111	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3914970	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3921207	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3962990	1981-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stephan Waack