Sølvsten, S., van de Pol, J., André, Étienne, & Sun, J. (2023). Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. Sølvsten, S & Van De Pol, J 2023, Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts. in É André & J Sun (eds), Automated Technology for Verification and Analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, Vol. 14216, Pp. 72-92, 21 st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.Org/10.1007/978-3-031-45332-8_4. https://doi.org/10.1007/978-3-031-45332-8_4

SØLVSTEN, Steffan, VAN DE POL, Jaco, ANDRÉ, Étienne and SUN, Jun, 2023. Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. Sølvsten, S & van de Pol, J 2023, Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. in É André & J Sun (eds), Automated technology for verification and analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, vol. 14216, pp. 72-92, 21 st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.org/10.1007/978-3-031-45332-8_4. 1 January 2023. DOI 10.1007/978-3-031-45332-8_4.

Sølvsten, S., J. van de Pol, Étienne André, and J. Sun. “Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts”. Sølvsten, S & Van De Pol, J 2023, Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts. in É André & J Sun (eds), Automated Technology for Verification and Analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, Vol. 14216, Pp. 72-92, 21 st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.Org/10.1007/978-3-031-45332-8_4, Jan. 2023, https://doi.org/10.1007/978-3-031-45332-8_4.

Sølvsten, Steffan/van de Pol, Jaco/André, Étienne/Sun, Jun: Predicting Memory Demands of BDD Operations using Maximum Graph Cuts, Sølvsten, S & van de Pol, J 2023, Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. in É André & J Sun (eds), Automated technology for verification and analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, vol. 14216, pp. 72-92, 21 st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.org/10.1007/978-3-031-45332-8_4 2023,

Sølvsten, S., van de Pol, J., André, Étienne and Sun, J. (2023), “Predicting Memory Demands of BDD Operations using Maximum Graph Cuts”, Sølvsten, S & Van De Pol, J 2023, Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts. in É André & J Sun (eds), Automated Technology for Verification and Analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, Vol. 14216, Pp. 72-92, 21 st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.Org/10.1007/978-3-031-45332-8_4, available at:https://doi.org/10.1007/978-3-031-45332-8_4.