Dor Elimelech

Orcid: 0000-0002-9141-8669

According to our database1, Dor Elimelech authored at least 13 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Asymptotically good bosonic Fock state codes: Exact and approximate.
CoRR, March, 2026

2025
Robust Detection of Planted Subgraphs in Semi-Random Models.
CoRR, August, 2025

Detecting Arbitrary Planted Subgraphs in Random Graphs.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
The second-order football-pool problem and the optimal rate of generalized-covering codes.
J. Comb. Theory A, April, 2024

Detection of Correlated Random Vectors.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
The Optimal Rate of Second-Order Generalized-Covering Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Bounds on the Essential Covering Radius of Constrained Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Phase Transitions in the Detection of Correlated Databases.
Proceedings of the International Conference on Machine Learning, 2023

2022
On the Generalized Covering Radii of Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
The Generalized Covering Radii of Linear Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
The Capacity of Multidimensional Permutations with Restricted Movement.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Permutations With Restricted Movement.
CoRR, 2019


  Loading...