APA (7th ed.) Citation

Englert, M., Lazić, R., & Totzke, P. (2016, July 5). Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 477-484. https://doi.org/10.1145/2933575.2933577

Chicago Style (17th ed.) Citation

Englert, Matthias, Ranko Lazić, and Patrick Totzke. "Reachability in Two-Dimensional Unary Vector Addition Systems with States Is NL-Complete." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science 5 Jul. 2016: 477-484. https://doi.org/10.1145/2933575.2933577.

MLA (9th ed.) Citation

Englert, Matthias, et al. "Reachability in Two-Dimensional Unary Vector Addition Systems with States Is NL-Complete." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 5 Jul. 2016, pp. 477-484, https://doi.org/10.1145/2933575.2933577.