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:

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs

Henrik Brosenne, Matthias Homeister, Stephan Waack

RAIRO-Theor. Inf. Appl., 36 3 (2002) 229-247

Published online: 2002-12-15

DOI: https://doi.org/10.1051/ita:2002011

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

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)
https://doi.org/10.1016/j.tcs.2006.05.035