Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: David Eisenstat
@inproceedings{DBLP:conf/nips/DhulipalaELMS22,
author = {Laxman Dhulipala and
David Eisenstat and
Jakub Lacki and
Vahab Mirrokni and
Jessica Shi},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/909de96145d97514b143dfde03e6cd2b-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/DhulipalaELMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/HarshawSEMP22,
author = {Christopher Harshaw and
Fredrik S{\"{a}}vje and
David Eisenstat and
Vahab Mirrokni and
Jean Pouget{-}Abadie},
editor = {David M. Pennock and
Ilya Segal and
Sven Seuken},
title = {Design and Analysis of Bipartite Experiments Under a Linear Exposure-response
Model},
booktitle = {{EC} '22: The 23rd {ACM} Conference on Economics and Computation,
Boulder, CO, USA, July 11 - 15, 2022},
pages = {606},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3490486.3538269},
doi = {10.1145/3490486.3538269},
timestamp = {Fri, 15 Jul 2022 09:13:21 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/HarshawSEMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-11654,
author = {Laxman Dhulipala and
David Eisenstat and
Jakub Lacki and
Vahab Mirrokni and
Jessica Shi},
title = {Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth},
journal = {CoRR},
volume = {abs/2206.11654},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.11654},
doi = {10.48550/ARXIV.2206.11654},
eprinttype = {arXiv},
eprint = {2206.11654},
timestamp = {Fri, 15 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-11654.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/ShiDELM21,
author = {Jessica Shi and
Laxman Dhulipala and
David Eisenstat and
Jakub Lacki and
Vahab S. Mirrokni},
title = {Scalable Community Detection via Parallel Correlation Clustering},
journal = {Proc. {VLDB} Endow.},
volume = {14},
number = {11},
pages = {2305--2313},
year = {2021},
url = {http://www.vldb.org/pvldb/vol14/p2305-shi.pdf},
doi = {10.14778/3476249.3476282},
timestamp = {Thu, 21 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/ShiDELM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/DhulipalaELMS21,
author = {Laxman Dhulipala and
David Eisenstat and
Jakub Lacki and
Vahab S. Mirrokni and
Jessica Shi},
editor = {Marina Meila and
Tong Zhang},
title = {Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {2676--2686},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/dhulipala21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/DhulipalaELMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05610,
author = {Laxman Dhulipala and
David Eisenstat and
Jakub Lacki and
Vahab S. Mirrokni and
Jessica Shi},
title = {Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time},
journal = {CoRR},
volume = {abs/2106.05610},
year = {2021},
url = {https://arxiv.org/abs/2106.05610},
eprinttype = {arXiv},
eprint = {2106.05610},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-05610.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-01731,
author = {Jessica Shi and
Laxman Dhulipala and
David Eisenstat and
Jakub Lacki and
Vahab S. Mirrokni},
title = {Scalable Community Detection via Parallel Correlation Clustering},
journal = {CoRR},
volume = {abs/2108.01731},
year = {2021},
url = {https://arxiv.org/abs/2108.01731},
eprinttype = {arXiv},
eprint = {2108.01731},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-01731.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlistarhAEGR17,
author = {Dan Alistarh and
James Aspnes and
David Eisenstat and
Rati Gelashvili and
Ronald L. Rivest},
editor = {Philip N. Klein},
title = {Time-Space Trade-offs in Population Protocols},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2560--2579},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.169},
doi = {10.1137/1.9781611974782.169},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlistarhAEGR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlistarhAEGR16,
author = {Dan Alistarh and
James Aspnes and
David Eisenstat and
Rati Gelashvili and
Ronald L. Rivest},
title = {Time-Space Trade-offs in Population Protocols},
journal = {CoRR},
volume = {abs/1602.08032},
year = {2016},
url = {http://arxiv.org/abs/1602.08032},
eprinttype = {arXiv},
eprint = {1602.08032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlistarhAEGR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Eisenstat14,
author = {David Eisenstat},
title = {Toward Practical Planar Graph Algorithms},
school = {Brown University, {USA}},
year = {2014},
url = {https://cs.brown.edu/research/pubs/theses/phd/2014/eisenstat.pdf},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Eisenstat14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AngluinABCEK14,
author = {Dana Angluin and
James Aspnes and
Rida A. Bazzi and
Jiang Chen and
David Eisenstat and
Goran Konjevod},
title = {Effective storage capacity of labeled graphs},
journal = {Inf. Comput.},
volume = {234},
pages = {44--56},
year = {2014},
url = {https://doi.org/10.1016/j.ic.2013.11.004},
doi = {10.1016/J.IC.2013.11.004},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/AngluinABCEK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EisenstatMS14,
author = {David Eisenstat and
Claire Mathieu and
Nicolas Schabanel},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Facility Location in Evolving Metrics},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {8573},
pages = {459--470},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43951-7\_39},
doi = {10.1007/978-3-662-43951-7\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EisenstatMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenstatKM14,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
editor = {Chandra Chekuri},
title = {Approximating \emph{k}-center in planar graphs},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {617--627},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.47},
doi = {10.1137/1.9781611973402.47},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenstatKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EisenstatMS14,
author = {David Eisenstat and
Claire Mathieu and
Nicolas Schabanel},
title = {Facility Location in Evolving Metrics},
journal = {CoRR},
volume = {abs/1403.6758},
year = {2014},
url = {http://arxiv.org/abs/1403.6758},
eprinttype = {arXiv},
eprint = {1403.6758},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EisenstatMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EisenstatK13,
author = {David Eisenstat and
Philip N. Klein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Linear-time algorithms for max flow and multiple-source shortest paths
in unit-weight planar graphs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {735--744},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488702},
doi = {10.1145/2488608.2488702},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EisenstatK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/AspnesEY12,
author = {James Aspnes and
David Eisenstat and
Yitong Yin},
title = {Low-contention data structures},
journal = {J. Parallel Distributed Comput.},
volume = {72},
number = {5},
pages = {705--715},
year = {2012},
url = {https://doi.org/10.1016/j.jpdc.2011.10.018},
doi = {10.1016/J.JPDC.2011.10.018},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/AspnesEY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenstatKM12,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
editor = {Yuval Rabani},
title = {An efficient polynomial-time approximation scheme for Steiner forest
in planar graphs},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {626--638},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.53},
doi = {10.1137/1.9781611973099.53},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenstatKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Eisenstat11,
author = {David Eisenstat},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Random Road Networks: The Quadtree Model},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {76--84},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.9},
doi = {10.1137/1.9781611973013.9},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/Eisenstat11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1320,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
title = {An efficient polynomial-time approximation scheme for Steiner forest
in planar graphs},
journal = {CoRR},
volume = {abs/1110.1320},
year = {2011},
url = {http://arxiv.org/abs/1110.1320},
eprinttype = {arXiv},
eprint = {1110.1320},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AngluinEKR10,
author = {Dana Angluin and
David Eisenstat and
Leonid Kontorovich and
Lev Reyzin},
editor = {Marcus Hutter and
Frank Stephan and
Vladimir Vovk and
Thomas Zeugmann},
title = {Lower Bounds on Learning Random Structures with Statistical Queries},
booktitle = {Algorithmic Learning Theory, 21st International Conference, {ALT}
2010, Canberra, Australia, October 6-8, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6331},
pages = {194--208},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16108-7\_18},
doi = {10.1007/978-3-642-16108-7\_18},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/AngluinEKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AspnesEY10,
author = {James Aspnes and
David Eisenstat and
Yitong Yin},
editor = {Friedhelm Meyer auf der Heide and
Cynthia A. Phillips},
title = {Low-contention data structures},
booktitle = {{SPAA} 2010: Proceedings of the 22nd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15,
2010},
pages = {345--354},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810479.1810539},
doi = {10.1145/1810479.1810539},
timestamp = {Wed, 21 Nov 2018 11:15:55 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AspnesEY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/AngluinABCEK10,
author = {Dana Angluin and
James Aspnes and
Rida A. Bazzi and
Jiang Chen and
David Eisenstat and
Goran Konjevod},
editor = {Shlomi Dolev and
Jorge Arturo Cobb and
Michael J. Fischer and
Moti Yung},
title = {Storage Capacity of Labeled Graphs},
booktitle = {Stabilization, Safety, and Security of Distributed Systems - 12th
International Symposium, {SSS} 2010, New York, NY, USA, September
20-22, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6366},
pages = {573--587},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16023-3\_44},
doi = {10.1007/978-3-642-16023-3\_44},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sss/AngluinABCEK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-4916,
author = {David Eisenstat},
title = {Random road networks: the quadtree model},
journal = {CoRR},
volume = {abs/1008.4916},
year = {2010},
url = {http://arxiv.org/abs/1008.4916},
eprinttype = {arXiv},
eprint = {1008.4916},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-4916.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Eisenstat09,
author = {David Eisenstat},
title = {k-Fold unions of low-dimensional concept classes},
journal = {Inf. Process. Lett.},
volume = {109},
number = {23-24},
pages = {1232--1234},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.005},
doi = {10.1016/J.IPL.2009.09.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Eisenstat09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/AngluinACER09,
author = {Dana Angluin and
James Aspnes and
Jiang Chen and
David Eisenstat and
Lev Reyzin},
title = {Learning Acyclic Probabilistic Circuits Using Test Paths},
journal = {J. Mach. Learn. Res.},
volume = {10},
pages = {1881--1911},
year = {2009},
url = {https://dl.acm.org/doi/10.5555/1577069.1755848},
doi = {10.5555/1577069.1755848},
timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/AngluinACER09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EisenstatFFGR08,
author = {David Eisenstat and
Jennifer Feder and
Greg Francos and
Gary Gordon and
Amanda Redlich},
title = {Expected rank and randomness in rooted graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {5},
pages = {746--756},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.08.012},
doi = {10.1016/J.DAM.2007.08.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EisenstatFFGR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/AngluinAE08,
author = {Dana Angluin and
James Aspnes and
David Eisenstat},
title = {A simple population protocol for fast robust approximate majority},
journal = {Distributed Comput.},
volume = {21},
number = {2},
pages = {87--102},
year = {2008},
url = {https://doi.org/10.1007/s00446-008-0059-z},
doi = {10.1007/S00446-008-0059-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/AngluinAE08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/AngluinAE08a,
author = {Dana Angluin and
James Aspnes and
David Eisenstat},
title = {Fast computation by population protocols with a leader},
journal = {Distributed Comput.},
volume = {21},
number = {3},
pages = {183--199},
year = {2008},
url = {https://doi.org/10.1007/s00446-008-0067-z},
doi = {10.1007/S00446-008-0067-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/AngluinAE08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EisenstatGR08,
author = {David Eisenstat and
Gary Gordon and
Amanda Redlich},
title = {Combinatorial Properties of a Rooted Graph Polynomial},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {2},
pages = {776--785},
year = {2008},
url = {https://doi.org/10.1137/06065951X},
doi = {10.1137/06065951X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EisenstatGR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AngluinACER08,
author = {Dana Angluin and
James Aspnes and
Jiang Chen and
David Eisenstat and
Lev Reyzin},
editor = {Rocco A. Servedio and
Tong Zhang},
title = {Learning Acyclic Probabilistic Circuits Using Test Paths},
booktitle = {21st Annual Conference on Learning Theory - {COLT} 2008, Helsinki,
Finland, July 9-12, 2008},
pages = {169--180},
publisher = {Omnipress},
year = {2008},
url = {http://colt2008.cs.helsinki.fi/papers/71-Angluin.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/AngluinACER08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-0444,
author = {David Eisenstat},
title = {A two-enqueuer queue},
journal = {CoRR},
volume = {abs/0805.0444},
year = {2008},
url = {http://arxiv.org/abs/0805.0444},
eprinttype = {arXiv},
eprint = {0805.0444},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-0444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/AngluinAER07,
author = {Dana Angluin and
James Aspnes and
David Eisenstat and
Eric Ruppert},
title = {The computational power of population protocols},
journal = {Distributed Comput.},
volume = {20},
number = {4},
pages = {279--304},
year = {2007},
url = {https://doi.org/10.1007/s00446-007-0040-2},
doi = {10.1007/S00446-007-0040-2},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/AngluinAER07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EisenstatA07,
author = {David Eisenstat and
Dana Angluin},
title = {The {VC} dimension of k-fold union},
journal = {Inf. Process. Lett.},
volume = {101},
number = {5},
pages = {181--184},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.10.004},
doi = {10.1016/J.IPL.2006.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EisenstatA07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AngluinAE07,
author = {Dana Angluin and
James Aspnes and
David Eisenstat},
editor = {Andrzej Pelc},
title = {A Simple Population Protocol for Fast Robust Approximate Majority},
booktitle = {Distributed Computing, 21st International Symposium, {DISC} 2007,
Lemesos, Cyprus, September 24-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4731},
pages = {20--32},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75142-7\_5},
doi = {10.1007/978-3-540-75142-7\_5},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AngluinAE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EisenstatG06,
author = {David Eisenstat and
Gary Gordon},
title = {Non-isomorphic caterpillars with identical subtree data},
journal = {Discret. Math.},
volume = {306},
number = {8-9},
pages = {827--830},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.01.022},
doi = {10.1016/J.DISC.2006.01.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EisenstatG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AngluinAE06,
author = {Dana Angluin and
James Aspnes and
David Eisenstat},
editor = {Eric Ruppert and
Dahlia Malkhi},
title = {Stably computable predicates are semilinear},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2006, Denver, CO, USA, July 23-26,
2006},
pages = {292--299},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1146381.1146425},
doi = {10.1145/1146381.1146425},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AngluinAE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AngluinAE06,
author = {Dana Angluin and
James Aspnes and
David Eisenstat},
editor = {Shlomi Dolev},
title = {Fast Computation by Population Protocols with a Leader},
booktitle = {Distributed Computing, 20th International Symposium, {DISC} 2006,
Stockholm, Sweden, September 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4167},
pages = {61--75},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11864219\_5},
doi = {10.1007/11864219\_5},
timestamp = {Sat, 19 Oct 2019 20:32:37 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AngluinAE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0608084,
author = {Dana Angluin and
James Aspnes and
David Eisenstat and
Eric Ruppert},
title = {The computational power of population protocols},
journal = {CoRR},
volume = {abs/cs/0608084},
year = {2006},
url = {http://arxiv.org/abs/cs/0608084},
eprinttype = {arXiv},
eprint = {cs/0608084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0608084.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/AngluinAER05,
author = {Dana Angluin and
James Aspnes and
David Eisenstat and
Eric Ruppert},
editor = {James H. Anderson and
Giuseppe Prencipe and
Roger Wattenhofer},
title = {On the Power of Anonymous One-Way Communication},
booktitle = {Principles of Distributed Systems, 9th International Conference, {OPODIS}
2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3974},
pages = {396--411},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11795490\_30},
doi = {10.1007/11795490\_30},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/opodis/AngluinAER05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-01-09 23:17 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:
