%0 Conference Paper %1 conf/mfcs/MeinelW91 %A Meinel, Christoph %A Waack, Stephan %B MFCS %D 1991 %E Tarlecki, Andrzej %I Springer %K dblp %P 337-345 %T Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs91.html#MeinelW91 %V 520 %@ 3-540-54345-7

@inproceedings{conf/mfcs/MeinelW91, added-at = {2017-03-20T00:00:00.000+0100}, author = {Meinel, Christoph and Waack, Stephan}, biburl = {https://www.bibsonomy.org/bibtex/2fe641316fe600d597f3b31a317004cdd/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/1991}, editor = {Tarlecki, Andrzej}, ee = {http://dx.doi.org/10.1007/3-540-54345-7_77}, interhash = {d6766fad81843fb2dfa139a516cc5133}, intrahash = {fe641316fe600d597f3b31a317004cdd}, isbn = {3-540-54345-7}, keywords = {dblp}, pages = {337-345}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2017-03-21T11:39:35.000+0100}, title = {Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs91.html#MeinelW91}, volume = 520, year = 1991 }