APA (7th ed.) Citation

BEN-AMRAM, A. M., & HAMILTON, G. (2020). TIGHT POLYNOMIAL WORST-CASE BOUNDS FOR LOOP PROGRAMS. Logical Methods in Computer Science (LMCS), 16(2), 1. https://doi.org/10.23638/LMCS-16(2:4)2020

Chicago Style (17th ed.) Citation

BEN-AMRAM, AMIR M., and GEOFF HAMILTON. "TIGHT POLYNOMIAL WORST-CASE BOUNDS FOR LOOP PROGRAMS." Logical Methods in Computer Science (LMCS) 16, no. 2 (2020): 1. https://doi.org/10.23638/LMCS-16(2:4)2020.

MLA (9th ed.) Citation

BEN-AMRAM, AMIR M., and GEOFF HAMILTON. "TIGHT POLYNOMIAL WORST-CASE BOUNDS FOR LOOP PROGRAMS." Logical Methods in Computer Science (LMCS), vol. 16, no. 2, 2020, p. 1, https://doi.org/10.23638/LMCS-16(2:4)2020.