David Eisenstat

1.1k total citations
18 papers, 320 citations indexed

About

David Eisenstat is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, David Eisenstat has authored 18 papers receiving a total of 320 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in David Eisenstat's work include Distributed systems and fault tolerance (4 papers), Stochastic processes and statistical mechanics (4 papers) and Machine Learning and Algorithms (3 papers). David Eisenstat is often cited by papers focused on Distributed systems and fault tolerance (4 papers), Stochastic processes and statistical mechanics (4 papers) and Machine Learning and Algorithms (3 papers). David Eisenstat collaborates with scholars based in United States, China and Canada. David Eisenstat's co-authors include Dana Angluin, James Aspnes, Eric Ruppert, Philip N. Klein, Vahab Mirrokni, Jakub Łącki, Laxman Dhulipala, Claire Mathieu, Yitong Yin and Christopher Harshaw and has published in prestigious journals such as Journal of Machine Learning Research, Proceedings of the VLDB Endowment and Discrete Applied Mathematics.

In The Last Decade

David Eisenstat

15 papers receiving 303 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
David Eisenstat United States 7 207 101 57 45 38 18 320
Zoë Diamadi United States 5 258 1.2× 61 0.6× 46 0.8× 55 1.2× 37 1.0× 7 324
Nazim Fatès France 11 60 0.3× 53 0.5× 139 2.4× 26 0.6× 29 0.8× 37 377
Yves Métivier France 12 133 0.6× 50 0.5× 242 4.2× 12 0.3× 125 3.3× 36 332
Eleni Drinea United States 9 230 1.1× 167 1.7× 118 2.1× 6 0.1× 51 1.3× 11 383
Parimal Pal Chaudhuri India 4 75 0.4× 95 0.9× 214 3.8× 13 0.3× 82 2.2× 7 296
Wentu Song Singapore 11 245 1.2× 130 1.3× 104 1.8× 17 0.4× 146 3.8× 36 360
Graham Steel United Kingdom 10 93 0.4× 49 0.5× 19 0.3× 8 0.2× 120 3.2× 40 298
K. Erciyes Türkiye 12 211 1.0× 19 0.2× 20 0.4× 5 0.1× 39 1.0× 36 301
Rafig Agaev Russia 7 144 0.7× 9 0.1× 42 0.7× 8 0.2× 26 0.7× 19 238
Krzysztof Diks Poland 11 229 1.1× 18 0.2× 139 2.4× 26 0.6× 83 2.2× 37 347

Countries citing papers authored by David Eisenstat

Since Specialization
Citations

This map shows the geographic impact of David Eisenstat'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 David Eisenstat with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Eisenstat more than expected).

Fields of papers citing papers by David Eisenstat

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David Eisenstat. 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 David Eisenstat. The network helps show where David Eisenstat may publish in the future.

Co-authorship network of co-authors of David Eisenstat

This figure shows the co-authorship network connecting the top 25 collaborators of David Eisenstat. A scholar is included among the top collaborators of David Eisenstat 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 David Eisenstat. David Eisenstat is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Harshaw, Christopher, et al.. (2023). Design and analysis of bipartite experiments under a linear exposure-response model. Electronic Journal of Statistics. 17(1). 5 indexed citations
2.
Harshaw, Christopher, et al.. (2022). Design and Analysis of Bipartite Experiments Under a Linear Exposure-response Model. 606–606. 2 indexed citations
3.
Dhulipala, Laxman, et al.. (2021). Scalable community detection via parallel correlation clustering. Proceedings of the VLDB Endowment. 14(11). 2305–2313. 8 indexed citations
4.
Eisenstat, David & Philip N. Klein. (2013). Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs. 735–744. 6 indexed citations
5.
Eisenstat, David, Philip N. Klein, & Claire Mathieu. (2013). Approximating k-center in planar graphs. 617–627. 5 indexed citations
6.
Aspnes, James, David Eisenstat, & Yitong Yin. (2010). Low-contention data structures. 345–354. 2 indexed citations
7.
Eisenstat, David. (2009). k-Fold unions of low-dimensional concept classes. Information Processing Letters. 109(23-24). 1232–1234. 2 indexed citations
8.
Angluin, Dana, James Aspnes, Chen Jiang, David Eisenstat, & Lev Reyzin. (2008). Learning Acyclic Probabilistic Circuits Using Test Paths. Journal of Machine Learning Research. 10(65). 169–180. 1 indexed citations
9.
Angluin, Dana, James Aspnes, & David Eisenstat. (2008). A simple population protocol for fast robust approximate majority. Distributed Computing. 21(2). 87–102. 74 indexed citations
10.
Eisenstat, David, et al.. (2008). Combinatorial Properties of a Rooted Graph Polynomial. SIAM Journal on Discrete Mathematics. 22(2). 776–785.
11.
Angluin, Dana, James Aspnes, & David Eisenstat. (2008). Fast computation by population protocols with a leader. Distributed Computing. 21(3). 183–199. 65 indexed citations
12.
Eisenstat, David, et al.. (2007). Expected rank and randomness in rooted graphs. Discrete Applied Mathematics. 156(5). 746–756. 1 indexed citations
13.
Angluin, Dana, James Aspnes, David Eisenstat, & Eric Ruppert. (2007). The computational power of population protocols. Distributed Computing. 20(4). 279–304. 86 indexed citations
14.
Angluin, Dana, James Aspnes, & David Eisenstat. (2006). Fast computation by population protocols with a leader. 1 indexed citations
15.
Eisenstat, David, et al.. (2006). Non-isomorphic caterpillars with identical subtree data. Discrete Mathematics. 306(8-9). 827–830. 9 indexed citations
16.
Angluin, Dana, James Aspnes, & David Eisenstat. (2006). Stably computable predicates are semilinear. 47 indexed citations
17.
Eisenstat, David & Dana Angluin. (2006). The VC dimension of k-fold union. Information Processing Letters. 101(5). 181–184. 5 indexed citations
18.
Angluin, Dana, James Aspnes, & David Eisenstat. (2005). On the power of anonymous one-way communication. 1 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

Breakdown of academic impact, for papers by Zoë Diamadi Breakdown of academic impact, for papers by Nazim Fatès Breakdown of academic impact, for papers by Yves Métivier Breakdown of academic impact, for papers by Eleni Drinea Breakdown of academic impact, for papers by Parimal Pal Chaudhuri Breakdown of academic impact, for papers by Wentu Song Breakdown of academic impact, for papers by Graham Steel Breakdown of academic impact, for papers by K. Erciyes Breakdown of academic impact, for papers by Rafig Agaev Breakdown of academic impact, for papers by Krzysztof Diks
Rankless by CCL
2026