APA (7th ed.) Citation

ALAOUI, Z. I., & PLUMP, D. (2026). RULE-BASED GRAPH PROGRAMS MATCHING THE TIME COMPLEXITY OF IMPERATIVE ALGORITHMS. Logical Methods in Computer Science (LMCS), 22(2), 1. https://doi.org/10.46298/LMCS-22(2:20)2026

Chicago Style (17th ed.) Citation

ALAOUI, ZIAD ISMAILI, and DETLEF PLUMP. "RULE-BASED GRAPH PROGRAMS MATCHING THE TIME COMPLEXITY OF IMPERATIVE ALGORITHMS." Logical Methods in Computer Science (LMCS) 22, no. 2 (2026): 1. https://doi.org/10.46298/LMCS-22(2:20)2026.

MLA (9th ed.) Citation

ALAOUI, ZIAD ISMAILI, and DETLEF PLUMP. "RULE-BASED GRAPH PROGRAMS MATCHING THE TIME COMPLEXITY OF IMPERATIVE ALGORITHMS." Logical Methods in Computer Science (LMCS), vol. 22, no. 2, 2026, p. 1, https://doi.org/10.46298/LMCS-22(2:20)2026.