default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Node-Averaged Complexity of Locally Checkable Problems on Trees."

Alkida Balliu et al. (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.DISC.2023.7

access: open

type: Conference or Workshop Paper

metadata version: 2023-11-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/wdag/Balliu0KOS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/Balliu0KOS23
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. DISC 2023: 7:1-7:21

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.