APA (7th ed.) Citation

Coja-Oghlan, A., Goerdt, A., Lanka, A., & Schädlich, F. (2004). Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theoretical computer science, 329(1-3), 1-45. https://doi.org/10.1016/j.tcs.2004.07.017

Chicago Style (17th ed.) Citation

Coja-Oghlan, Amin, Andreas Goerdt, André Lanka, and Frank Schädlich. "Techniques from Combinatorial Approximation Algorithms Yield Efficient Algorithms for Random 2k-SAT." Theoretical Computer Science 329, no. 1-3 (2004): 1-45. https://doi.org/10.1016/j.tcs.2004.07.017.

MLA (9th ed.) Citation

Coja-Oghlan, Amin, et al. "Techniques from Combinatorial Approximation Algorithms Yield Efficient Algorithms for Random 2k-SAT." Theoretical Computer Science, vol. 329, no. 1-3, 2004, pp. 1-45, https://doi.org/10.1016/j.tcs.2004.07.017.