"The Query Complexity of Searching Trees with Permanently Noisy Advice."

Lucas Boczkowski et al. (2025)

> Home

Details and statistics

DOI: 10.1145/3707207

access: closed

type: Journal Article

metadata version: 2025-08-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/BoczkowskiFKR25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/BoczkowskiFKR25
Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh:
The Query Complexity of Searching Trees with Permanently Noisy Advice. ACM Trans. Algorithms 21(2): 18:1-18:30 (2025)

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.