default search action

combined dblp search
author search
venue search
publication search

ask others

"Lower Bounds for Unambiguous Automata via Communication Complexity."

Mika Göös, Stefan Kiefer, Weiqiang Yuan (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2022.126

access: open

type: Conference or Workshop Paper

metadata version: 2022-06-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/GoosK022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/GoosK022
Mika Göös, Stefan Kiefer, Weiqiang Yuan:
Lower Bounds for Unambiguous Automata via Communication Complexity. ICALP 2022: 126:1-126:13

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.