Elena Grigorescu

900 total citations
48 papers, 312 citations indexed

About

Elena Grigorescu is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Elena Grigorescu has authored 48 papers receiving a total of 312 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Artificial Intelligence, 33 papers in Computational Theory and Mathematics and 12 papers in Computer Networks and Communications. Recurrent topics in Elena Grigorescu's work include Complexity and Algorithms in Graphs (26 papers), Cryptography and Data Security (16 papers) and Machine Learning and Algorithms (12 papers). Elena Grigorescu is often cited by papers focused on Complexity and Algorithms in Graphs (26 papers), Cryptography and Data Security (16 papers) and Machine Learning and Algorithms (12 papers). Elena Grigorescu collaborates with scholars based in United States, Israel and South Korea. Elena Grigorescu's co-authors include Arnab Bhattacharyya, Vitaly Feldman, Lev Reyzin, Santosh Vempala, Ying Xiao, David P. Woodruff, Madhu Sudan, Sofya Raskhodnikova, Kyomin Jung and Tali Kaufman and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Elena Grigorescu

46 papers receiving 293 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Elena Grigorescu United States	9	204	169	86	39	29	48	312
Dana Moshkovitz United States	7	120 0.6×	184 1.1×	85 1.0×	21 0.5×	29 1.0×	29	288
Michael Capalbo United States	9	97 0.5×	163 1.0×	72 0.8×	16 0.4×	36 1.2×	16	286
Anup Rao United States	16	340 1.7×	368 2.2×	109 1.3×	27 0.7×	97 3.3×	40	527
Zeev Dvir United States	13	346 1.7×	332 2.0×	111 1.3×	18 0.5×	115 4.0×	53	562
Luděk Kučera Czechia	8	102 0.5×	177 1.0×	75 0.9×	20 0.5×	29 1.0×	35	303
Christian Deppe Germany	9	153 0.8×	65 0.4×	92 1.1×	62 1.6×	143 4.9×	94	349
Avner Magen Canada	12	117 0.6×	220 1.3×	70 0.8×	14 0.4×	21 0.7×	32	325
Prahladh Harsha United States	11	284 1.4×	337 2.0×	79 0.9×	19 0.5×	36 1.2×	40	412
Anna Gál United States	12	237 1.2×	261 1.5×	91 1.1×	15 0.4×	64 2.2×	39	370
Julia Abrahams United States	11	222 1.1×	79 0.5×	69 0.8×	89 2.3×	51 1.8×	27	334

Countries citing papers authored by Elena Grigorescu

Since Specialization

Citations

This map shows the geographic impact of Elena Grigorescu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Elena Grigorescu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Elena Grigorescu more than expected).

Fields of papers citing papers by Elena Grigorescu

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Elena Grigorescu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Elena Grigorescu. The network helps show where Elena Grigorescu may publish in the future.

Co-authorship network of co-authors of Elena Grigorescu

This figure shows the co-authorship network connecting the top 25 collaborators of Elena Grigorescu. A scholar is included among the top collaborators of Elena Grigorescu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Elena Grigorescu. Elena Grigorescu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Grigorescu, Elena, et al.. (2025). On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. IEEE Transactions on Information Theory. 71(4). 2591–2603.

Grigorescu, Elena, et al.. (2024). On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. 879–884. 1 indexed citations

Blocki, Jeremiah, et al.. (2021). Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Transactions on Information Theory. 67(7). 4338–4360. 4 indexed citations

Grigorescu, Elena, et al.. (2020). The Maximum Binary Tree Problem.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 22. 1 indexed citations

Canonne, Clément L., Elena Grigorescu, Siyao Guo, Akash Kumar, & Karl Wimmer. (2019). . Theory of Computing. 15(1). 1–55. 3 indexed citations

Braverman, Vladimir, Elena Grigorescu, Harry G. Lang, David P. Woodruff, & Samson Zhou. (2018). Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations

Cheraghchi, Mahdi, Elena Grigorescu, Brendan Juba, Karl Wimmer, & Ning Xie. (2018). AC0∘MOD2 lower bounds for the Boolean Inner Product. Journal of Computer and System Sciences. 97. 45–59. 5 indexed citations

Grigorescu, Elena, et al.. (2018). Structural Results on Matching Estimation with Applications to Streaming. Algorithmica. 81(1). 367–392. 2 indexed citations

Diakonikolas, Ilias, et al.. (2017). Communication-Efficient Distributed Learning of Discrete Distributions. Neural Information Processing Systems. 30. 6391–6401. 7 indexed citations

10.

Grigorescu, Elena, et al.. (2016). Nearly optimal sparse group testing. 401–408. 8 indexed citations

11.

Berman, Piotr, Arnab Bhattacharyya, Elena Grigorescu, et al.. (2014). Steiner transitive-closure spanners of low-dimensional posets. COMBINATORICA. 34(3). 255–277. 2 indexed citations

12.

Chen, Victor, Elena Grigorescu, & Ronald de Wolf. (2013). Error-Correcting Data Structures. SIAM Journal on Computing. 42(1). 84–111. 4 indexed citations

13.

Ben‐Sasson, Eli, et al.. (2011). On Sums of Locally Testable Affine Invariant Properties.. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 18. 79. 1 indexed citations

14.

Bhattacharyya, Arnab, et al.. (2010). Separations of Matroid Freeness Properties. Electronic colloquium on computational complexity. 17. 136. 1 indexed citations

15.

Chen, Victor, Elena Grigorescu, & Ronald de Wolf. (2010). Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

16.

Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-Closure Spanners of the Hypercube and the Hypergrid.. Electronic colloquium on computational complexity. 16. 46. 4 indexed citations

17.

Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-closure spanners. arXiv (Cornell University). 932–941. 21 indexed citations

18.

Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-Closure Spanners. 932–941. 9 indexed citations

19.

Grigorescu, Elena, Tali Kaufman, & Madhu Sudan. (2008). 2-Transitivity Is Insufficient for Local Testability. 259–267. 15 indexed citations

20.

Dinur, Irit, Elena Grigorescu, Swastik Kopparty, & Madhu Sudan. (2008). Decodability of group homomorphisms beyond the johnson bound. Electronic colloquium on computational complexity. 15. 275–284. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact