Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

On the OBDD complexity of the most significant bit of integer multiplication

Beate Bollig
Theoretical Computer Science 412 (18) 1686 (2011)
DOI: 10.1016/j.tcs.2010.12.043
See this article

Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

Beate Bollig
RAIRO - Theoretical Informatics and Applications 37 (1) 51 (2003)
DOI: 10.1051/ita:2003010
See this article

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

Beate Bollig
Information Processing Letters 86 (3) 143 (2003)
DOI: 10.1016/S0020-0190(02)00486-6
See this article

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication

Beate Bollig, Stephan Waack and Philipp Woelfel
Theoretical Computer Science 362 (1-3) 86 (2006)
DOI: 10.1016/j.tcs.2006.05.035
See this article

Foundations of Information Technology in the Era of Network and Mobile Computing

Beate Bollig, Stephan Waack and Philipp Woelfel
Foundations of Information Technology in the Era of Network and Mobile Computing 83 (2002)
DOI: 10.1007/978-0-387-35608-2_8
See this article

STACS 2003

Beate Bollig
Lecture Notes in Computer Science, STACS 2003 2607 295 (2003)
DOI: 10.1007/3-540-36494-3_27
See this article

Theory and Applications of Models of Computation

Beate Bollig
Lecture Notes in Computer Science, Theory and Applications of Models of Computation 4978 306 (2008)
DOI: 10.1007/978-3-540-79228-4_27
See this article