The power of adaptivity in source identification with time queries on the path
From MaRDI portal
Publication:2118878
DOI10.1016/J.TCS.2022.02.008OpenAlexW4213295636MaRDI QIDQ2118878FDOQ2118878
Authors: Victor Lecomte, Gergely Ódor, Patrick Thiran 
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.008
Cites Work
- Random Geometric Graphs
- Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- How close is the sample covariance matrix to the actual covariance matrix?
- Limiting geodesics for first-passage percolation on subsets of \(\mathbb{Z}^{2}\)
- Computing with Noisy Information
- The Accuracy of the Gaussian Approximation to the Sum of Independent Variates
- Title not available (Why is that?)
- Approximability of the minimum weighted doubly resolving set problem
- Rumors in a Network: Who's the Culprit?
- Noisy binary search and its applications
- Active learning
- Sequential metric dimension for random graphs
- Title not available (Why is that?)
- A sequential locating game on graphs
- Networks
- An adaptivity hierarchy theorem for property testing
- Deterministic and probabilistic binary search in graphs
- Locating the contagion source in networks with partial timestamps
- Finding Adam in random growing trees
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- On the limiting distribution of the metric dimension for random forests
- Identifying codes and searching with balls in graphs
- Resolution Limits for the Noisy Non-Adaptive 20 Questions Problem
Cited In (1)
This page was built for publication: The power of adaptivity in source identification with time queries on the path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118878)
