Andrade de Melo, Alexsander; de Oliveira Oliveira, Mateus On the width of regular classes of finite structures. (English) Zbl 07178967 Fontaine, Pascal (ed.), Automated deduction – CADE 27. 27th international conference on automated deduction, Natal, Brazil, August 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11716, 18-34 (2019). MSC: 03B35 68V15 PDFBibTeX XMLCite \textit{A. Andrade de Melo} and \textit{M. de Oliveira Oliveira}, Lect. Notes Comput. Sci. 11716, 18--34 (2019; Zbl 07178967) Full Text: DOI arXiv
Bury, Marc Randomized OBDD-based graph algorithms. (English) Zbl 1407.68533 Theor. Comput. Sci. 751, 24-45 (2018). MSC: 68W20 05C85 68P05 PDFBibTeX XMLCite \textit{M. Bury}, Theor. Comput. Sci. 751, 24--45 (2018; Zbl 1407.68533) Full Text: DOI
Bollig, Beate On the minimization of (complete) ordered binary decision diagrams. (English) Zbl 1401.68051 Theory Comput. Syst. 59, No. 3, 532-559 (2016). MSC: 68P05 68Q17 PDFBibTeX XMLCite \textit{B. Bollig}, Theory Comput. Syst. 59, No. 3, 532--559 (2016; Zbl 1401.68051) Full Text: DOI
Bollig, Beate; Bury, Marc On the OBDD representation of some graph classes. (English) Zbl 1346.05193 Discrete Appl. Math. 214, 34-53 (2016). MSC: 05C62 68P05 PDFBibTeX XMLCite \textit{B. Bollig} and \textit{M. Bury}, Discrete Appl. Math. 214, 34--53 (2016; Zbl 1346.05193) Full Text: DOI
Bury, Marc Randomized OBDD-based graph algorithms. (English) Zbl 1407.68532 Scheideler, Christian (ed.), Structural information and communication complexity. 22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015. Post-proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9439, 254-269 (2015). MSC: 68W20 05C85 68P05 PDFBibTeX XMLCite \textit{M. Bury}, Lect. Notes Comput. Sci. 9439, 254--269 (2015; Zbl 1407.68532) Full Text: DOI
Bollig, Beate; Gillé, Marc; Pröger, Tobias Implicit computation of maximum bipartite matchings by sublinear functional operations. (English) Zbl 1303.68065 Theor. Comput. Sci. 560, Part 2, 131-146 (2014). MSC: 68Q25 05C70 05C85 68P05 90C27 PDFBibTeX XMLCite \textit{B. Bollig} et al., Theor. Comput. Sci. 560, Part 2, 131--146 (2014; Zbl 1303.68065) Full Text: DOI
Bollig, Beate; Pröger, Tobias On efficient implicit OBDD-based algorithms for maximal matchings. (English) Zbl 1309.68056 Inf. Comput. 239, 29-43 (2014). MSC: 68P05 05C70 05C85 PDFBibTeX XMLCite \textit{B. Bollig} and \textit{T. Pröger}, Inf. Comput. 239, 29--43 (2014; Zbl 1309.68056) Full Text: DOI
Bollig, Beate; Capelle, Michael Priority functions for the approximation of the metric TSP. (English) Zbl 1296.68193 Inf. Process. Lett. 113, No. 14-16, 584-591 (2013). MSC: 68W25 05C85 68R10 90C27 PDFBibTeX XMLCite \textit{B. Bollig} and \textit{M. Capelle}, Inf. Process. Lett. 113, No. 14--16, 584--591 (2013; Zbl 1296.68193) Full Text: DOI
Bollig, Beate On symbolic OBDD-based algorithms for the minimum spanning tree problem. (English) Zbl 1245.05125 Theor. Comput. Sci. 447, 2-12 (2012). MSC: 05C85 05C05 68R10 68P05 PDFBibTeX XMLCite \textit{B. Bollig}, Theor. Comput. Sci. 447, 2--12 (2012; Zbl 1245.05125) Full Text: DOI
Bollig, Beate; Gillé, Marc; Pröger, Tobias Implicit computation of maximum bipartite matchings by sublinear functional operations. (English) Zbl 1354.05128 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 473-486 (2012). MSC: 05C85 05C70 68P05 68W05 PDFBibTeX XMLCite \textit{B. Bollig} et al., Lect. Notes Comput. Sci. 7287, 473--486 (2012; Zbl 1354.05128) Full Text: DOI
Bollig, Beate Larger lower bounds on the OBDD complexity of integer multiplication. (English) Zbl 1217.68111 Inf. Comput. 209, No. 3, 333-343 (2011). MSC: 68Q25 68Q17 06E30 PDFBibTeX XMLCite \textit{B. Bollig}, Inf. Comput. 209, No. 3, 333--343 (2011; Zbl 1217.68111) Full Text: DOI
Bollig, Beate Exponential space complexity for OBDD-based reachability analysis. (English) Zbl 1379.68147 Inf. Process. Lett. 110, No. 21, 924-927 (2010). MSC: 68Q17 68P05 68R10 PDFBibTeX XMLCite \textit{B. Bollig}, Inf. Process. Lett. 110, No. 21, 924--927 (2010; Zbl 1379.68147) Full Text: DOI
Bollig, Beate On the size of (generalized) OBDDs for threshold functions. (English) Zbl 1209.68151 Inf. Process. Lett. 109, No. 10, 499-503 (2009). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{B. Bollig}, Inf. Process. Lett. 109, No. 10, 499--503 (2009; Zbl 1209.68151) Full Text: DOI
Meer, Klaus; Rautenbach, Dieter On the OBDD size for graphs of bounded tree- and clique-width. (English) Zbl 1177.68100 Discrete Math. 309, No. 4, 843-851 (2009). MSC: 68Q25 05C35 05C85 68R10 PDFBibTeX XMLCite \textit{K. Meer} and \textit{D. Rautenbach}, Discrete Math. 309, No. 4, 843--851 (2009; Zbl 1177.68100) Full Text: DOI
Bollig, Beate Larger lower bounds on the OBDD complexity of integer multiplication. (English) Zbl 1234.68085 Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 212-223 (2009). MSC: 68P05 68Q17 PDFBibTeX XMLCite \textit{B. Bollig}, Lect. Notes Comput. Sci. 5457, 212--223 (2009; Zbl 1234.68085) Full Text: DOI
Bollig, Beate On the OBDD complexity of threshold functions and the variable ordering problem (extended abstract). (English) Zbl 1206.68100 Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 129-140 (2009). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{B. Bollig}, Lect. Notes Comput. Sci. 5404, 129--140 (2009; Zbl 1206.68100) Full Text: DOI