APA (7th ed.) Citation

Göös, M., Kiefer, S., & Yuan, W. (2022). Lower bounds for unambiguous automata via communication complexity. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Chicago Style (17th ed.) Citation

Göös, M., S. Kiefer, and W. Yuan. Lower Bounds for Unambiguous Automata via Communication Complexity. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

MLA (9th ed.) Citation

Göös, M., et al. Lower Bounds for Unambiguous Automata via Communication Complexity. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

Warning: These citations may not always be 100% accurate.