Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Mika Göös, Stefan Kiefer, Weiqiang Yuan. Lower Bounds for Unambiguous Automata via Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC), 29:15, 2022. [doi]
Abstract is missing.