David Eisenstat

41 papers A* 9A 2B 3C 1Journal 23Unranked 2

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. CoRR Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun
2024	J	`jnl`	The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. Proc. VLDB Endow. Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun
2022	A*	`conf`	Design and Analysis of Bipartite Experiments Under a Linear Exposure-response Model. EC Christopher Harshaw, Fredrik Sävje, David Eisenstat, Vahab Mirrokni, Jean Pouget-Abadie
2022	A*	`conf`	Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi
2022	J	`jnl`	Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi
2021	A*	`conf`	Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi
2021	J	`jnl`	Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi
2021	J	`jnl`	Scalable Community Detection via Parallel Correlation Clustering. CoRR Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni
2021	J	`jnl`	Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni
2017	A*	`conf`	Time-Space Trade-offs in Population Protocols. SODA Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
2016	J	`jnl`	Time-Space Trade-offs in Population Protocols. CoRR Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
2014	A*	`conf`	Approximating SODA David Eisenstat, Philip N. Klein, Claire Mathieu
2014	J	`jnl`	Effective storage capacity of labeled graphs. Inf. Comput. Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2014	—	`conf`	Facility Location in Evolving Metrics. ICALP (2) David Eisenstat, Claire Mathieu, Nicolas Schabanel
2014	J	`jnl`	Facility Location in Evolving Metrics. CoRR David Eisenstat, Claire Mathieu, Nicolas Schabanel
2014	—	`—`	Toward Practical Planar Graph Algorithms. David Eisenstat
2013	A*	`conf`	Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs. STOC David Eisenstat, Philip N. Klein
2012	A*	`conf`	An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA David Eisenstat, Philip N. Klein, Claire Mathieu
2012	J	`jnl`	Low-contention data structures. J. Parallel Distributed Comput. James Aspnes, David Eisenstat, Yitong Yin
2011	J	`jnl`	An efficient polynomial-time approximation scheme for Steiner forest in planar graphs CoRR David Eisenstat, Philip N. Klein, Claire Mathieu
2011	—	`conf`	Random Road Networks: The Quadtree Model. ANALCO David Eisenstat
2010	B	`conf`	Low-contention data structures. SPAA James Aspnes, David Eisenstat, Yitong Yin
2010	B	`conf`	Lower Bounds on Learning Random Structures with Statistical Queries. ALT Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin
2010	J	`jnl`	Random road networks: the quadtree model CoRR David Eisenstat
2010	C	`conf`	Storage Capacity of Labeled Graphs. SSS Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2009	J	`jnl`	Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2009	J	`jnl`	k-Fold unions of low-dimensional concept classes. Inf. Process. Lett. David Eisenstat
2008	J	`jnl`	A simple population protocol for fast robust approximate majority. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat
2008	J	`jnl`	A two-enqueuer queue CoRR David Eisenstat
2008	J	`jnl`	Combinatorial Properties of a Rooted Graph Polynomial. SIAM J. Discret. Math. David Eisenstat, Gary Gordon, Amanda Redlich
2008	J	`jnl`	Expected rank and randomness in rooted graphs. Discret. Appl. Math. David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich
2008	J	`jnl`	Fast computation by population protocols with a leader. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat
2008	A*	`conf`	Learning Acyclic Probabilistic Circuits Using Test Paths. COLT Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2007	A	`conf`	A Simple Population Protocol for Fast Robust Approximate Majority. DISC Dana Angluin, James Aspnes, David Eisenstat
2007	J	`jnl`	The VC dimension of k-fold union. Inf. Process. Lett. David Eisenstat, Dana Angluin
2007	J	`jnl`	The computational power of population protocols. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2006	A	`conf`	Fast Computation by Population Protocols with a Leader. DISC Dana Angluin, James Aspnes, David Eisenstat
2006	J	`jnl`	Non-isomorphic caterpillars with identical subtree data. Discret. Math. David Eisenstat, Gary Gordon
2006	A*	`conf`	Stably computable predicates are semilinear. PODC Dana Angluin, James Aspnes, David Eisenstat
2006	J	`jnl`	The computational power of population protocols CoRR Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2005	B	`conf`	On the Power of Anonymous One-Way Communication. OPODIS Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert