Crossref
Robust Detection of Planted Subgraphs in Semi-Random Models
IEEE Transactions on Information Theory · 2026-09 · 72 (9) · 6976-6992
DOI: 10.1109/tit.2026.3705301 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-09. Verfasst von Dor Elimelech und 1 weiteren Autor:innen. Die Arbeit nennt 57 Literaturangaben. Gefördert von: Israel Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Israel Science Foundation
Zitieren
APA
Elimelech, D., & Huleihel, W. (2026). Robust Detection of Planted Subgraphs in Semi-Random Models. IEEE Transactions on Information Theory, 72(9), 6976-6992. https://doi.org/10.1109/tit.2026.3705301
Vancouver
Elimelech D, Huleihel W. Robust Detection of Planted Subgraphs in Semi-Random Models. IEEE Transactions on Information Theory. 2026;72(9):6976-6992. doi:10.1109/tit.2026.3705301
BibTeX
@article{Elimelech2026,
author = {Elimelech, Dor and Huleihel, Wasim},
title = {Robust Detection of Planted Subgraphs in Semi-Random Models},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {9},
pages = {6976--6992},
doi = {10.1109/tit.2026.3705301}
}
EUVIMED