default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Eisenstat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun:
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. CoRR abs/2411.10290 (2024)- 2022
- [c17]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS 2022 - [c16]Christopher Harshaw, Fredrik Sävje, David Eisenstat, Vahab Mirrokni, Jean Pouget-Abadie:
Design and Analysis of Bipartite Experiments Under a Linear Exposure-response Model. EC 2022: 606 - [i9]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR abs/2206.11654 (2022) - 2021
- [j12]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14(11): 2305-2313 (2021) - [c15]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML 2021: 2676-2686 - [i8]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR abs/2106.05610 (2021) - [i7]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. CoRR abs/2108.01731 (2021)
2010 – 2019
- 2017
- [c14]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. SODA 2017: 2560-2579 - 2016
- [i6]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. CoRR abs/1602.08032 (2016) - 2014
- [b1]David Eisenstat:
Toward Practical Planar Graph Algorithms. Brown University, USA, 2014 - [j11]Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
:
Effective storage capacity of labeled graphs. Inf. Comput. 234: 44-56 (2014) - [c13]David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. ICALP (2) 2014: 459-470 - [c12]David Eisenstat, Philip N. Klein, Claire Mathieu:
Approximating k-center in planar graphs. SODA 2014: 617-627 - [i5]David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. CoRR abs/1403.6758 (2014) - 2013
- [c11]David Eisenstat, Philip N. Klein:
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs. STOC 2013: 735-744 - 2012
- [j10]James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. J. Parallel Distributed Comput. 72(5): 705-715 (2012) - [c10]David Eisenstat, Philip N. Klein, Claire Mathieu:
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA 2012: 626-638 - 2011
- [c9]David Eisenstat:
Random Road Networks: The Quadtree Model. ANALCO 2011: 76-84 - [i4]David Eisenstat, Philip N. Klein, Claire Mathieu:
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. CoRR abs/1110.1320 (2011) - 2010
- [c8]Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin:
Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010: 194-208 - [c7]James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. SPAA 2010: 345-354 - [c6]Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod:
Storage Capacity of Labeled Graphs. SSS 2010: 573-587 - [i3]David Eisenstat:
Random road networks: the quadtree model. CoRR abs/1008.4916 (2010)
2000 – 2009
- 2009
- [j9]David Eisenstat:
k-Fold unions of low-dimensional concept classes. Inf. Process. Lett. 109(23-24): 1232-1234 (2009) - [j8]Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. 10: 1881-1911 (2009) - 2008
- [j7]David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich:
Expected rank and randomness in rooted graphs. Discret. Appl. Math. 156(5): 746-756 (2008) - [j6]Dana Angluin, James Aspnes, David Eisenstat:
A simple population protocol for fast robust approximate majority. Distributed Comput. 21(2): 87-102 (2008) - [j5]Dana Angluin, James Aspnes, David Eisenstat:
Fast computation by population protocols with a leader. Distributed Comput. 21(3): 183-199 (2008) - [j4]David Eisenstat, Gary Gordon, Amanda Redlich:
Combinatorial Properties of a Rooted Graph Polynomial. SIAM J. Discret. Math. 22(2): 776-785 (2008) - [c5]Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180 - [i2]David Eisenstat:
A two-enqueuer queue. CoRR abs/0805.0444 (2008) - 2007
- [j3]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. Distributed Comput. 20(4): 279-304 (2007) - [j2]David Eisenstat, Dana Angluin:
The VC dimension of k-fold union. Inf. Process. Lett. 101(5): 181-184 (2007) - [c4]Dana Angluin, James Aspnes, David Eisenstat:
A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32 - 2006
- [j1]David Eisenstat, Gary Gordon:
Non-isomorphic caterpillars with identical subtree data. Discret. Math. 306(8-9): 827-830 (2006) - [c3]Dana Angluin, James Aspnes, David Eisenstat:
Stably computable predicates are semilinear. PODC 2006: 292-299 - [c2]Dana Angluin, James Aspnes, David Eisenstat:
Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75 - [i1]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. CoRR abs/cs/0608084 (2006) - 2005
- [c1]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
