"An Efficient Noisy Binary Search in Graphs via Median Approximation."

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-79987-8_19

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/DereniowskiLU21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/DereniowskiLU21
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
An Efficient Noisy Binary Search in Graphs via Median Approximation. IWOCA 2021: 265-281

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.