APA (7th ed.) Citation

Bilardi, G., & De Stefani, L. (2024). A universal bound on the space complexity of Directed Acyclic Graph computations.

Chicago Style (17th ed.) Citation

Bilardi, Gianfranco, and Lorenzo De Stefani. A Universal Bound on the Space Complexity of Directed Acyclic Graph Computations. 2024.

MLA (9th ed.) Citation

Bilardi, Gianfranco, and Lorenzo De Stefani. A Universal Bound on the Space Complexity of Directed Acyclic Graph Computations. 2024.

Warning: These citations may not always be 100% accurate.