Robust Detection of Planted Subgraphs in Semi-Random Models
Dor Elimelech, Wasim Huleihel
Submitted.[arxiv]
Detecting Arbitrary Planted Subgraphs in Random Graphs
Dor Elimelech, Wasim Huleihel
Proceedings of 38th Conference on Learning Theory (COLT), PMLR 291:1691-1798, 2025.[arxiv]
Detection of Correlated Random Vectors
Dor Elimelech, Wasim Huleihel
IEEE Trans. on Inform. Theory, 70(12), pp. 8942-8960, December 2024.[arxiv]
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
Dor Elimelech, Tom Meyerovitch, Moshe Schwartz
IEEE Trans. on Inform. Theory, 70(6), pp. 4044-4063, June 2024 [arxiv]
Phase Transitions in the Detection of Correlated Databases
Dor Elimelech, Wasim Huleihel
Proceedings of the 40th International Conference on Machine Learning (ICML), PMLR 202:9246-9266, 2023. [arxiv]
The Second-Order Football-Pool Problem and the Optimal Rate of Generalized-Covering Codes
Dor Elimelech, Moshe Schwartz
Journal of Combinatorial Theory Ser. A, 203, pp. 1-27, paper 105834, 2024. [arxiv]
On the Generalized Covering Radii of Reed-Muller Codes
Dor Elimelech, Hengjia Wei, Moshe Schwartz
IEEE Trans. on Inform. Theory, 68(7), pp. 4378-4391, July 2022.[arxiv]
The Generalized Covering Radii of Linear Codes
Dor Elimelech, Marcelo Firer, Moshe Schwartz
IEEE Trans. on Inform. Theory, 67(12), pp. 8070-8085, December 2021.[arxiv]
Permutations with restricted movement
Dor Elimelech
Discrete and Continuous Dynamical Systems, 2021, 41(9): 4319-4349.[arxiv]
Detection of Correlated Random Vectors
Dor Elimelech, Wasim Huleihel
Proc. of the 2024 IEEE International Symposium on Information Theory, ISIT2024, pp. 1257-1262, Athens, Greece, July 2024.
The Optimal Rate of Second-Order Generalized-Covering Codes
Dor Elimelech, Moshe Schwartz
Proc. of the 2023 IEEE International Symposium on Information Theory, ISIT2023, pp. 222-227, Taipei, Taiwan, July 2023.
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
Dor Elimelech, Tom Meyerovitch, Moshe Schwartz
Proc. of the 2023 IEEE International Symposium on Information Theory, ISIT2023, pp. 2673-2673, Taipei, Taiwan, July 2023
Bounds on the Essential Covering Radius of Constrained Systems
Dor Elimelech, Tom Meyerovitch, Moshe Schwartz
Proc. of the 2023 IEEE International Symposium on Information Theory, ISIT2023, pp. 2679-2684, Taipei, Taiwan, July 2023.
On the Generalized Covering Radii of Reed-Muller Codes
Dor Elimelech, Hengjia Wei, Moshe Schwartz
Proc. of the 2022 IEEE International Symposium on Information Theory, ISIT2022, pp. 1791-1796, Espoo, Finland, June 2022.
The Generalized Covering Radii of Linear Codes
Dor Elimelech, Marcelo Firer, Moshe Schwartz
Proc. of the 2021 IEEE International Symposium on Information Theory, ISIT2021, pp. 302-307, Melbourne, Victoria, Australia, July 2021.
The Capacity of Multidimensional Permutations with Restricted Movement
Dor Elimelech
Proc. of the 2020 IEEE International Symposium on Information Theory, ISIT2020, pp. 120-125, Los Angeles, CA, USA, June 2020.