J. L. Balcázar and A. Lozano, The complexity of graph problems for succinctly represented graphs, Proc. of WG, pp.277-285, 1989.

B. Bollig, On the OBDD complexity of the most significant bit of integer multiplication, Proc. of TAMC, pp.306-317, 2008.

B. Bollig, Symbolic OBDD-Based Reachability Analysis Needs Exponential Space, Proc. of SOFSEM, pp.224-234, 2010.
DOI : 10.1007/978-3-642-11266-9_19

B. Bollig, M. Löbbing, and I. Wegener, On the effect of local changes in the variable ordering of ordered decision diagrams, Information Processing Letters, vol.59, issue.5, pp.233-239, 1996.
DOI : 10.1016/0020-0190(96)00119-6

B. Bollig, M. Löbbing, M. Sauerhoff, and I. Wegener, On the Complexity of the Hidden Weighted Bit Function for Various BDD Models, Theoretical Informatics and Applications, pp.103-115, 1999.
DOI : 10.1051/ita:1999108

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

R. E. Bryant, On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication, IEEE Transactions on Computers, vol.40, issue.2, pp.205-213, 1991.
DOI : 10.1109/12.73590

J. Feigenbaum, S. Kannan, M. V. Vardi, and M. Viswanathan, Complexity of problems on graphs represented as OBDDs, Proc. of STACS, pp.216-226, 1998.
DOI : 10.1007/BFb0028563

K. Fisler and M. Y. Vardi, Bisimulation, minimization, and symbolic model checking, Formal Methods in System Design, vol.21, issue.1, pp.39-78, 2002.
DOI : 10.1023/A:1016091902809
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.399

H. Galperin and A. Wigderson, Succinct representations of graphs, Information and Control, vol.56, issue.3, pp.183-198, 1983.
DOI : 10.1016/S0019-9958(83)80004-7

R. Gentilini, C. Piazza, and A. Policriti, Computing strongly connected components in a linear number of symbolic steps, Proc. of SODA, pp.573-582, 2003.

R. Gentilini, C. Piazza, and A. Policriti, Symbolic Graphs: Linear Solutions to Connectivity Related Problems, Algorithmica, vol.19, issue.1, pp.120-158, 2008.
DOI : 10.1007/s00453-007-9079-5

G. D. Hachtel and F. Somenzi, A symbolic algorithm for maximum flow in 0-1 networks, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), pp.207-219, 1997.
DOI : 10.1109/ICCAD.1993.580088

J. Jain, J. Bitner, D. S. Fussell, A. , and J. A. , Functional partitioning for verification and related problems, MIT VLSI Conference, pp.210-226, 1992.

S. Jukna, The effect of null-chains on the complexity of contact schemes, Proc. of FCT, pp.246-256, 1989.
DOI : 10.1007/3-540-51498-8_24

S. Kannan, M. Naor, R. , and S. , Implicit representation of graphs, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.596-603, 1992.
DOI : 10.1145/62212.62244

M. Krause, C. Meinel, and S. Waack, Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe, Theoretical Computer Science, vol.86, issue.2, pp.267-294, 1991.
DOI : 10.1016/0304-3975(91)90021-S

K. Meer and D. Rautenbach, On the OBDD size for graphs of bounded tree- and clique-width, Discrete Mathematics, vol.309, issue.4, pp.843-851, 2009.
DOI : 10.1016/j.disc.2008.01.022

R. Nunkesser and P. Woelfel, Representation of graphs by OBDDs, Discrete Applied Mathematics, vol.157, issue.2, pp.247-261, 2009.
DOI : 10.1016/j.dam.2008.02.012

C. H. Papadimitriou and M. Yannakakis, A note on succinct representations of graphs, Information and Control, vol.71, issue.3, pp.181-185, 1986.
DOI : 10.1016/S0019-9958(86)80009-2

D. Sawitzki, Implicit Flow Maximization by Iterative Squaring, Proc. of SOFSEM, pp.301-313, 2004.
DOI : 10.1007/978-3-540-24618-3_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.1907

D. Sawitzki, Algorithmik und Komplexität OBDD-repräsentierter Graphen, 2006.

D. Sawitzki, Exponential lower bounds on the space complexity of OBDDbased graph algorithms, Proc. of LATIN, pp.781-792, 2006.

D. Sawitzki, The Complexity of Problems on Implicitly Represented Inputs, Proc. of SOFSEM, pp.471-482, 2006.
DOI : 10.1007/11611257_45

D. Sieling and I. Wegener, NC-ALGORITHMS FOR OPERATIONS ON BINARY DECISION DIAGRAMS, Parallel Processing Letters, vol.03, issue.01, pp.139-144, 1993.
DOI : 10.1142/S0129626493000022

M. Talamo and P. Vocca, Representing graphs implicitly using almost optimal space, Discrete Applied Mathematics, vol.108, issue.1-2, pp.193-210, 2001.
DOI : 10.1016/S0166-218X(00)00225-0
URL : http://doi.org/10.1016/s0166-218x(00)00225-0

I. Wegener, Branching Programs and Binary Decision Diagrams -Theory and Applications, SIAM Monographs on Discrete Mathematics and Applications, 2000.
DOI : 10.1137/1.9780898719789

P. Woelfel, Symbolic topological sorting with OBDDs, Journal of Discrete Algorithms, vol.4, issue.1, pp.51-71, 2006.
DOI : 10.1016/j.jda.2005.01.008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.7516