APA (7th ed.) Citation

Dürr, C., Heiligman, M., HOyer, P., & Mhalla, M. (2006). Quantum Query Complexity of Some Graph Problems. SIAM journal on computing, 35(6), 1310-1328. https://doi.org/10.1137/050644719

Chicago Style (17th ed.) Citation

Dürr, Christoph, Mark Heiligman, Peter HOyer, and Mehdi Mhalla. "Quantum Query Complexity of Some Graph Problems." SIAM Journal on Computing 35, no. 6 (2006): 1310-1328. https://doi.org/10.1137/050644719.

MLA (9th ed.) Citation

Dürr, Christoph, et al. "Quantum Query Complexity of Some Graph Problems." SIAM Journal on Computing, vol. 35, no. 6, 2006, pp. 1310-1328, https://doi.org/10.1137/050644719.