Henrik Brosenne Matthias Homeister Stephan Waack Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. 290-299 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2747&spage=290 2003 conf/mfcs/2003 MFCS db/conf/mfcs/mfcs2003.html#BrosenneHW03