Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Faith Ellen
@article{DBLP:journals/siamcomp/AlistarhAEGZ23,
author = {Dan Alistarh and
James Aspnes and
Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
title = {Why Extension-Based Proofs Fail},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {4},
pages = {913--944},
year = {2023},
url = {https://doi.org/10.1137/20m1375851},
doi = {10.1137/20M1375851},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlistarhAEGZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlistarhER23,
author = {Dan Alistarh and
Faith Ellen and
Joel Rybicki},
title = {Wait-free approximate agreement on graphs},
journal = {Theor. Comput. Sci.},
volume = {948},
pages = {113733},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113733},
doi = {10.1016/J.TCS.2023.113733},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlistarhER23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/AttiyaE22,
author = {Hagit Attiya and
Faith Ellen},
editor = {Eshcar Hillel and
Roberto Palmieri and
Etienne Rivi{\`{e}}re},
title = {The Step Complexity of Multidimensional Approximate Agreement},
booktitle = {26th International Conference on Principles of Distributed Systems,
{OPODIS} 2022, December 13-15, 2022, Brussels, Belgium},
series = {LIPIcs},
volume = {253},
pages = {6:1--6:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2022.6},
doi = {10.4230/LIPICS.OPODIS.2022.6},
timestamp = {Wed, 15 Feb 2023 17:36:11 +0100},
biburl = {https://dblp.org/rec/conf/opodis/AttiyaE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EllenGWZ21,
author = {Faith Ellen and
Rati Gelashvili and
Philipp Woelfel and
Leqi Zhu},
title = {Space Lower Bounds for the Signal Detection Problem},
journal = {Theory Comput. Syst.},
volume = {65},
number = {4},
pages = {687--705},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-09993-6},
doi = {10.1007/S00224-020-09993-6},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EllenGWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/EllenGMP21,
author = {Faith Ellen and
Barun Gorain and
Avery Miller and
Andrzej Pelc},
title = {Constant-Length Labeling Schemes for Deterministic Radio Broadcast},
journal = {{ACM} Trans. Parallel Comput.},
volume = {8},
number = {3},
pages = {14:1--14:17},
year = {2021},
url = {https://doi.org/10.1145/3470633},
doi = {10.1145/3470633},
timestamp = {Fri, 01 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/EllenGMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BrusseE21,
author = {Kayman Brusse and
Faith Ellen},
editor = {Avery Miller and
Keren Censor{-}Hillel and
Janne H. Korhonen},
title = {Reductions and Extension-Based Proofs},
booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, July 26-30, 2021},
pages = {497--507},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3465084.3467906},
doi = {10.1145/3465084.3467906},
timestamp = {Mon, 26 Jul 2021 09:04:22 +0200},
biburl = {https://dblp.org/rec/conf/podc/BrusseE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/AlistarhER21,
author = {Dan Alistarh and
Faith Ellen and
Joel Rybicki},
editor = {Tomasz Jurdzinski and
Stefan Schmid},
title = {Wait-Free Approximate Agreement on Graphs},
booktitle = {Structural Information and Communication Complexity - 28th International
Colloquium, {SIROCCO} 2021, Wroc{\l}aw, Poland, June 28 - July 1,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12810},
pages = {87--105},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79527-6\_6},
doi = {10.1007/978-3-030-79527-6\_6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/AlistarhER21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/ShengE21,
author = {Yilun Sheng and
Faith Ellen},
editor = {Seth Gilbert},
title = {Extension-Based Proofs for Synchronous Message Passing},
booktitle = {35th International Symposium on Distributed Computing, {DISC} 2021,
October 4-8, 2021, Freiburg, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {209},
pages = {36:1--36:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.DISC.2021.36},
doi = {10.4230/LIPICS.DISC.2021.36},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wdag/ShengE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-08949,
author = {Dan Alistarh and
Faith Ellen and
Joel Rybicki},
title = {Wait-free approximate agreement on graphs},
journal = {CoRR},
volume = {abs/2103.08949},
year = {2021},
url = {https://arxiv.org/abs/2103.08949},
eprinttype = {arXiv},
eprint = {2103.08949},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-08949.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EllenS20,
author = {Faith Ellen and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Preface},
journal = {Comput. Geom.},
volume = {89},
pages = {101632},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101632},
doi = {10.1016/J.COMGEO.2020.101632},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/EllenS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/EllenGSZ20,
author = {Faith Ellen and
Rati Gelashvili and
Nir Shavit and
Leqi Zhu},
title = {A complexity-based classification for multiprocessor synchronization},
journal = {Distributed Comput.},
volume = {33},
number = {2},
pages = {125--144},
year = {2020},
url = {https://doi.org/10.1007/s00446-019-00361-3},
doi = {10.1007/S00446-019-00361-3},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/EllenGSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoyarEL20,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {Randomized distributed online algorithms against adaptive offline
adversaries},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105973},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105973},
doi = {10.1016/J.IPL.2020.105973},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoyarEL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EllenR20,
author = {Faith Ellen and
Lu{\'{\i}}s Rodrigues},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {842},
pages = {130},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.03.019},
doi = {10.1016/J.TCS.2020.03.019},
timestamp = {Fri, 15 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EllenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AlistarhAEGZ20,
author = {Dan Alistarh and
James Aspnes and
Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
editor = {Yuval Emek and
Christian Cachin},
title = {Brief Announcement: Why Extension-Based Proofs Fail},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {54--56},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405743},
doi = {10.1145/3382734.3405743},
timestamp = {Tue, 04 Aug 2020 16:04:51 +0200},
biburl = {https://dblp.org/rec/conf/podc/AlistarhAEGZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EllenG20,
author = {Faith Ellen and
Seth Gilbert},
editor = {Christian Scheideler and
Michael Spear},
title = {Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast},
booktitle = {{SPAA} '20: 32nd {ACM} Symposium on Parallelism in Algorithms and
Architectures, Virtual Event, USA, July 15-17, 2020},
pages = {213--222},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3350755.3400238},
doi = {10.1145/3350755.3400238},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/EllenG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/AlvisiDEKKS19,
author = {Lorenzo Alvisi and
Shlomi Dolev and
Faith Ellen and
Idit Keidar and
Fabian Kuhn and
Jukka Suomela},
title = {Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for
Nominations},
journal = {Bull. {EATCS}},
volume = {127},
year = {2019},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/574/578},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/AlvisiDEKKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BoyarE19,
author = {Joan Boyar and
Faith Ellen},
title = {Tight Bounds for Restricted Grid Scheduling},
journal = {Int. J. Found. Comput. Sci.},
volume = {30},
number = {3},
pages = {375--405},
year = {2019},
url = {https://doi.org/10.1142/S0129054119500102},
doi = {10.1142/S0129054119500102},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BoyarE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/AttiyaCEKW19,
author = {Hagit Attiya and
Hyun Chul Chung and
Faith Ellen and
Saptaparni Kumar and
Jennifer L. Welch},
title = {Emulating a Shared Register in a System That Never Stops Changing},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {30},
number = {3},
pages = {544--559},
year = {2019},
url = {https://doi.org/10.1109/TPDS.2018.2867479},
doi = {10.1109/TPDS.2018.2867479},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/AttiyaCEKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AlvisiDEKKS19,
author = {Lorenzo Alvisi and
Shlomi Dolev and
Faith Ellen and
Idit Keidar and
Fabian Kuhn and
Jukka Suomela},
editor = {Peter Robinson and
Faith Ellen},
title = {2019 Edsger W. Dijkstra Prize in Distributed Computing},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {1},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3341564},
doi = {10.1145/3293611.3341564},
timestamp = {Fri, 19 Jul 2019 08:02:49 +0200},
biburl = {https://dblp.org/rec/conf/podc/AlvisiDEKKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EllenGMP19,
author = {Faith Ellen and
Barun Gorain and
Avery Miller and
Andrzej Pelc},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {Constant-Length Labeling Schemes for Deterministic Radio Broadcast},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {171--178},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323194},
doi = {10.1145/3323165.3323194},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/EllenGMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EllenGWZ19,
author = {Faith Ellen and
Rati Gelashvili and
Philipp Woelfel and
Leqi Zhu},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Space Lower Bounds for the Signal Detection Problem},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {26:1--26:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.26},
doi = {10.4230/LIPICS.STACS.2019.26},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/EllenGWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlistarhAEGZ19,
author = {Dan Alistarh and
James Aspnes and
Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
editor = {Moses Charikar and
Edith Cohen},
title = {Why extension-based proofs fail},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {986--996},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316407},
doi = {10.1145/3313276.3316407},
timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlistarhAEGZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/podc/2019,
editor = {Peter Robinson and
Faith Ellen},
title = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
publisher = {{ACM}},
year = {2019},
url = {https://dl.acm.org/citation.cfm?id=3293611},
isbn = {978-1-4503-6217-7},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AspnesACE18,
author = {James Aspnes and
Hagit Attiya and
Keren Censor{-}Hillel and
Faith Ellen},
title = {Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {38:1--38:2},
year = {2018},
url = {https://doi.org/10.1145/3231592},
doi = {10.1145/3231592},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AspnesACE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EllenGZ18,
author = {Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
editor = {Calvin Newport and
Idit Keidar},
title = {Revisionist Simulations: {A} New Approach to Proving Space Lower Bounds},
booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018},
pages = {61--70},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3212734.3212749},
doi = {10.1145/3212734.3212749},
timestamp = {Wed, 21 Nov 2018 12:44:03 +0100},
biburl = {https://dblp.org/rec/conf/podc/EllenGZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/opodis/2018,
editor = {Jiannong Cao and
Faith Ellen and
Lu{\'{\i}}s Rodrigues and
Bernardo Ferreira},
title = {22nd International Conference on Principles of Distributed Systems,
{OPODIS} 2018, December 17-19, 2018, Hong Kong, China},
series = {LIPIcs},
volume = {125},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-098-9},
isbn = {978-3-95977-098-9},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/opodis/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06820,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {The Scheduler is Very Powerful in Competitive Analysis of Distributed
List Accessing},
journal = {CoRR},
volume = {abs/1807.06820},
year = {2018},
url = {http://arxiv.org/abs/1807.06820},
eprinttype = {arXiv},
eprint = {1807.06820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06820.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01421,
author = {Dan Alistarh and
James Aspnes and
Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
title = {Why Extension-Based Proofs Fail},
journal = {CoRR},
volume = {abs/1811.01421},
year = {2018},
url = {http://arxiv.org/abs/1811.01421},
eprinttype = {arXiv},
eprint = {1811.01421},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/AttiyaEM17,
author = {Hagit Attiya and
Faith Ellen and
Adam Morrison},
title = {Limitations of Highly-Available Eventually-Consistent Data Stores},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {28},
number = {1},
pages = {141--155},
year = {2017},
url = {https://doi.org/10.1109/TPDS.2016.2556669},
doi = {10.1109/TPDS.2016.2556669},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/AttiyaEM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2017,
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2},
doi = {10.1007/978-3-319-62127-2},
isbn = {978-3-319-62126-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-03274,
author = {Hagit Attiya and
Hyun Chul Chung and
Faith Ellen and
Saptaparni Kumar and
Jennifer L. Welch},
title = {Simulating a Shared Register in a System that Never Stops Changing},
journal = {CoRR},
volume = {abs/1708.03274},
year = {2017},
url = {http://arxiv.org/abs/1708.03274},
eprinttype = {arXiv},
eprint = {1708.03274},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-03274.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03178,
author = {Faith Ellen and
Barun Gorain and
Avery Miller and
Andrzej Pelc},
title = {Constant-Length Labeling Schemes for Deterministic Radio Broadcast},
journal = {CoRR},
volume = {abs/1710.03178},
year = {2017},
url = {http://arxiv.org/abs/1710.03178},
eprinttype = {arXiv},
eprint = {1710.03178},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-03178.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-02455,
author = {Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
title = {Revisionist Simulations: {A} New Approach to Proving Space Lower Bounds},
journal = {CoRR},
volume = {abs/1711.02455},
year = {2017},
url = {http://arxiv.org/abs/1711.02455},
eprinttype = {arXiv},
eprint = {1711.02455},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-02455.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-06687,
author = {Trevor Brown and
Faith Ellen and
Eric Ruppert},
title = {A General Technique for Non-blocking Trees},
journal = {CoRR},
volume = {abs/1712.06687},
year = {2017},
url = {http://arxiv.org/abs/1712.06687},
eprinttype = {arXiv},
eprint = {1712.06687},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-06687.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-06688,
author = {Trevor Brown and
Faith Ellen and
Eric Ruppert},
title = {Pragmatic Primitives for Non-blocking Data Structures},
journal = {CoRR},
volume = {abs/1712.06688},
year = {2017},
url = {http://arxiv.org/abs/1712.06688},
eprinttype = {arXiv},
eprint = {1712.06688},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-06688.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/EllenFKMT16,
author = {Faith Ellen and
Panagiota Fatourou and
Eleftherios Kosmas and
Alessia Milani and
Corentin Travers},
title = {Universal constructions that ensure disjoint-access parallelism and
wait-freedom},
journal = {Distributed Comput.},
volume = {29},
number = {4},
pages = {251--277},
year = {2016},
url = {https://doi.org/10.1007/s00446-015-0261-8},
doi = {10.1007/S00446-015-0261-8},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/EllenFKMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChattopadhyayEE16,
author = {Arkadev Chattopadhyay and
Jeff Edmonds and
Faith Ellen and
Toniann Pitassi},
title = {Upper and Lower Bounds on the Power of Advice},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1412--1432},
year = {2016},
url = {https://doi.org/10.1137/15M1031862},
doi = {10.1137/15M1031862},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChattopadhyayEE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/Ellen16,
author = {Faith Ellen},
editor = {Panagiota Fatourou and
Ernesto Jim{\'{e}}nez and
Fernando Pedone},
title = {Participating Sets, Simulations, and the Consensus Hierarchy (Keynote
Abstract)},
booktitle = {20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain},
series = {LIPIcs},
volume = {70},
pages = {4:1--4:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2016.4},
doi = {10.4230/LIPICS.OPODIS.2016.4},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/opodis/Ellen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AfekEG16,
author = {Yehuda Afek and
Faith Ellen and
Eli Gafni},
editor = {George Giakkoupis},
title = {Deterministic Objects: Life Beyond Consensus},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {97--106},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933116},
doi = {10.1145/2933057.2933116},
timestamp = {Tue, 06 Nov 2018 11:07:19 +0100},
biburl = {https://dblp.org/rec/conf/podc/AfekEG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Ellen016,
author = {Faith Ellen and
Trevor Brown},
editor = {George Giakkoupis},
title = {Concurrent Data Structures},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {151--153},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933123},
doi = {10.1145/2933057.2933123},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/Ellen016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EllenGSZ16,
author = {Faith Ellen and
Rati Gelashvili and
Nir Shavit and
Leqi Zhu},
editor = {George Giakkoupis},
title = {A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended
Abstract]},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {289--298},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933113},
doi = {10.1145/2933057.2933113},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/EllenGSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EllenGSZ16,
author = {Faith Ellen and
Rati Gelashvili and
Nir Shavit and
Leqi Zhu},
title = {A Complexity-Based Hierarchy for Multiprocessor Synchronization},
journal = {CoRR},
volume = {abs/1607.06139},
year = {2016},
url = {http://arxiv.org/abs/1607.06139},
eprinttype = {arXiv},
eprint = {1607.06139},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EllenGSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AspnesACE15,
author = {James Aspnes and
Hagit Attiya and
Keren Censor{-}Hillel and
Faith Ellen},
title = {Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {3:1--3:22},
year = {2015},
url = {https://doi.org/10.1145/2732263},
doi = {10.1145/2732263},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AspnesACE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/ZhuE15,
author = {Leqi Zhu and
Faith Ellen},
editor = {Emmanuelle Anceaume and
Christian Cachin and
Maria Gradinariu Potop{-}Butucaru},
title = {Atomic Snapshots from Small Registers},
booktitle = {19th International Conference on Principles of Distributed Systems,
{OPODIS} 2015, December 14-17, 2015, Rennes, France},
series = {LIPIcs},
volume = {46},
pages = {17:1--17:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2015.17},
doi = {10.4230/LIPICS.OPODIS.2015.17},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/opodis/ZhuE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AttiyaEM15,
author = {Hagit Attiya and
Faith Ellen and
Adam Morrison},
editor = {Chryssis Georgiou and
Paul G. Spirakis},
title = {Limitations of Highly-Available Eventually-Consistent Data Stores},
booktitle = {Proceedings of the 2015 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2015, Donostia-San Sebasti{\'{a}}n, Spain,
July 21 - 23, 2015},
pages = {385--394},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2767386.2767419},
doi = {10.1145/2767386.2767419},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/AttiyaEM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AttiyaCEKW15,
author = {Hagit Attiya and
Hyun Chul Chung and
Faith Ellen and
Saptaparni Kumar and
Jennifer L. Welch},
editor = {Yoram Moses},
title = {Simulating a Shared Register in an Asynchronous System that Never
Stops Changing - (Extended Abstract)},
booktitle = {Distributed Computing - 29th International Symposium, {DISC} 2015,
Tokyo, Japan, October 7-9, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9363},
pages = {75--91},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48653-5\_6},
doi = {10.1007/978-3-662-48653-5\_6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AttiyaCEKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:series/synthesis/2014Attiya,
author = {Hagit Attiya and
Faith Ellen},
title = {Impossibility Results for Distributed Computing},
series = {Synthesis Lectures on Distributed Computing Theory},
publisher = {Morgan {\&} Claypool Publishers},
year = {2014},
url = {https://doi.org/10.2200/S00551ED1V01Y201311DCT012},
doi = {10.2200/S00551ED1V01Y201311DCT012},
isbn = {978-3-031-00882-5},
timestamp = {Fri, 20 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/synthesis/2014Attiya.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AspnesE14,
author = {James Aspnes and
Faith Ellen},
title = {Tight Bounds for Adopt-Commit Objects},
journal = {Theory Comput. Syst.},
volume = {55},
number = {3},
pages = {451--474},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9448-1},
doi = {10.1007/S00224-013-9448-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AspnesE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EllenFHR13,
author = {Faith Ellen and
Panagiota Fatourou and
Joanna Helga and
Eric Ruppert},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Shlomi Dolev},
title = {The amortized complexity of non-blocking binary search trees},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '14,
Paris, France, July 15-18, 2014},
pages = {332--340},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2611462.2611486},
doi = {10.1145/2611462.2611486},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/EllenFHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppopp/BrownER14,
author = {Trevor Brown and
Faith Ellen and
Eric Ruppert},
editor = {Jos{\'{e}} E. Moreira and
James R. Larus},
title = {A general technique for non-blocking trees},
booktitle = {{ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
PPoPP '14, Orlando, FL, USA, February 15-19, 2014},
pages = {329--342},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2555243.2555267},
doi = {10.1145/2555243.2555267},
timestamp = {Sun, 12 Jun 2022 19:46:08 +0200},
biburl = {https://dblp.org/rec/conf/ppopp/BrownER14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarE14,
author = {Joan Boyar and
Faith Ellen},
title = {Tight Bounds for an Online Bin Packing Problem},
journal = {CoRR},
volume = {abs/1404.7325},
year = {2014},
url = {http://arxiv.org/abs/1404.7325},
eprinttype = {arXiv},
eprint = {1404.7325},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BoyarE13,
author = {Joan Boyar and
Faith Ellen},
editor = {Andrej Brodnik and
Alejandro L{\'{o}}pez{-}Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {Bounds for Scheduling Jobs on Grid Processors},
booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
series = {Lecture Notes in Computer Science},
volume = {8066},
pages = {12--26},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40273-9\_2},
doi = {10.1007/978-3-642-40273-9\_2},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/birthday/BoyarE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanEOPV13,
author = {Mark Braverman and
Faith Ellen and
Rotem Oshman and
Toniann Pitassi and
Vinod Vaikuntanathan},
title = {A Tight Bound for Set Disjointness in the Message-Passing Model},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {668--677},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.77},
doi = {10.1109/FOCS.2013.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanEOPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BrownER13,
author = {Trevor Brown and
Faith Ellen and
Eric Ruppert},
editor = {Panagiota Fatourou and
Gadi Taubenfeld},
title = {Pragmatic primitives for non-blocking data structures},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '13,
Montreal, QC, Canada, July 22-24, 2013},
pages = {13--22},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2484239.2484273},
doi = {10.1145/2484239.2484273},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BrownER13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EllenW13,
author = {Faith Ellen and
Philipp Woelfel},
editor = {Yehuda Afek},
title = {An Optimal Implementation of Fetch-and-Increment},
booktitle = {Distributed Computing - 27th International Symposium, {DISC} 2013,
Jerusalem, Israel, October 14-18, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8205},
pages = {284--298},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41527-2\_20},
doi = {10.1007/978-3-642-41527-2\_20},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EllenW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4696,
author = {Mark Braverman and
Faith Ellen and
Rotem Oshman and
Toniann Pitassi and
Vinod Vaikuntanathan},
title = {Tight Bounds for Set Disjointness in the Message Passing Model},
journal = {CoRR},
volume = {abs/1305.4696},
year = {2013},
url = {http://arxiv.org/abs/1305.4696},
eprinttype = {arXiv},
eprint = {1305.4696},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4696.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EllenHS12,
author = {Faith Ellen and
Danny Hendler and
Nir Shavit},
title = {On the Inherent Sequentiality of Concurrent Objects},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {3},
pages = {519--536},
year = {2012},
url = {https://doi.org/10.1137/08072646X},
doi = {10.1137/08072646X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EllenHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EllenFKMT12,
author = {Faith Ellen and
Panagiota Fatourou and
Eleftherios Kosmas and
Alessia Milani and
Corentin Travers},
editor = {Darek Kowalski and
Alessandro Panconesi},
title = {Universal constructions that ensure disjoint-access parallelism and
wait-freedom},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12,
Funchal, Madeira, Portugal, July 16-18, 2012},
pages = {115--124},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2332432.2332457},
doi = {10.1145/2332432.2332457},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/EllenFKMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AspnesACE12,
author = {James Aspnes and
Hagit Attiya and
Keren Censor{-}Hillel and
Faith Ellen},
editor = {Darek Kowalski and
Alessandro Panconesi},
title = {Faster than optimal snapshots (for a while): preliminary version},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12,
Funchal, Madeira, Portugal, July 16-18, 2012},
pages = {375--384},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2332432.2332507},
doi = {10.1145/2332432.2332507},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/AspnesACE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChattopadhyayEEP12,
author = {Arkadev Chattopadhyay and
Jeff Edmonds and
Faith Ellen and
Toniann Pitassi},
editor = {Yuval Rabani},
title = {A little advice can be very helpful},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {615--625},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.52},
doi = {10.1137/1.9781611973099.52},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChattopadhyayEEP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EllenRW12,
author = {Faith Ellen and
Vijaya Ramachandran and
Philipp Woelfel},
editor = {Marcos K. Aguilera},
title = {Efficient Fetch-and-Increment},
booktitle = {Distributed Computing - 26th International Symposium, {DISC} 2012,
Salvador, Brazil, October 16-18, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7611},
pages = {16--30},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33651-5\_2},
doi = {10.1007/978-3-642-33651-5\_2},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EllenRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/BrodskyEW11,
author = {Alex Brodsky and
Faith Ellen and
Philipp Woelfel},
title = {Fully-adaptive algorithms for long-lived renaming},
journal = {Distributed Comput.},
volume = {24},
number = {2},
pages = {119--134},
year = {2011},
url = {https://doi.org/10.1007/s00446-011-0137-5},
doi = {10.1007/S00446-011-0137-5},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/BrodskyEW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/AttiyaEF11,
author = {Hagit Attiya and
Faith Ellen and
Panagiota Fatourou},
title = {The complexity of updating snapshot objects},
journal = {J. Parallel Distributed Comput.},
volume = {71},
number = {12},
pages = {1570--1577},
year = {2011},
url = {https://doi.org/10.1016/j.jpdc.2011.08.002},
doi = {10.1016/J.JPDC.2011.08.002},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/AttiyaEF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AspnesE11,
author = {James Aspnes and
Faith Ellen},
editor = {Rajmohan Rajaraman and
Friedhelm Meyer auf der Heide},
title = {Tight bounds for anonymous adopt-commit objects},
booktitle = {{SPAA} 2011: Proceedings of the 23rd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with {FCRC} 2011)},
pages = {317--324},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1989493.1989548},
doi = {10.1145/1989493.1989548},
timestamp = {Wed, 21 Nov 2018 11:16:22 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AspnesE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EllenFRB10,
author = {Faith Ellen and
Panagiota Fatourou and
Eric Ruppert and
Franck van Breugel},
editor = {Andr{\'{e}}a W. Richa and
Rachid Guerraoui},
title = {Non-blocking binary search trees},
booktitle = {Proceedings of the 29th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2010, Zurich, Switzerland, July 25-28, 2010},
pages = {131--140},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1835698.1835736},
doi = {10.1145/1835698.1835736},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/EllenFRB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ChuongER10,
author = {Phong Chuong and
Faith Ellen and
Vijaya Ramachandran},
editor = {Friedhelm Meyer auf der Heide and
Cynthia A. Phillips},
title = {A universal construction for wait-free transaction friendly 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 = {335--344},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810479.1810538},
doi = {10.1145/1810479.1810538},
timestamp = {Wed, 21 Nov 2018 11:15:55 +0100},
biburl = {https://dblp.org/rec/conf/spaa/ChuongER10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/EllenFR08,
author = {Faith Ellen and
Panagiota Fatourou and
Eric Ruppert},
title = {The space complexity of unbounded timestamps},
journal = {Distributed Comput.},
volume = {21},
number = {2},
pages = {103--115},
year = {2008},
url = {https://doi.org/10.1007/s00446-008-0060-6},
doi = {10.1007/S00446-008-0060-6},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/EllenFR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EllenFR07,
author = {Faith Ellen and
Panagiota Fatourou and
Eric Ruppert},
title = {Time lower bounds for implementations of multi-writer snapshots},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {30},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314694},
doi = {10.1145/1314690.1314694},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EllenFR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EllenLLM07,
author = {Faith Ellen and
Yossi Lev and
Victor Luchangco and
Mark Moir},
editor = {Indranil Gupta and
Roger Wattenhofer},
title = {{SNZI:} scalable NonZero indicators},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {13--22},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1281100.1281106},
doi = {10.1145/1281100.1281106},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/EllenLLM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AttiyaEF07,
author = {Hagit Attiya and
Faith Ellen and
Panagiota Fatourou},
editor = {Indranil Gupta and
Roger Wattenhofer},
title = {The complexity of updating multi-writer snapshot objects},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {318--319},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1281100.1281151},
doi = {10.1145/1281100.1281151},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/AttiyaEF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EllenFR07,
author = {Faith Ellen and
Panagiota Fatourou and
Eric Ruppert},
editor = {Andrzej Pelc},
title = {The Space Complexity of Unbounded Timestamps},
booktitle = {Distributed Computing, 21st International Symposium, {DISC} 2007,
Lemesos, Cyprus, September 24-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4731},
pages = {223--237},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75142-7\_19},
doi = {10.1007/978-3-540-75142-7\_19},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EllenFR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/AspnesFR06,
author = {James Aspnes and
Faith Ellen Fich and
Eric Ruppert},
title = {Relationships between broadcast and shared memory in reliable anonymous
distributed systems},
journal = {Distributed Comput.},
volume = {18},
number = {3},
pages = {209--219},
year = {2006},
url = {https://doi.org/10.1007/s00446-005-0145-4},
doi = {10.1007/S00446-005-0145-4},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/AspnesFR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/FichHS06,
author = {Faith Ellen Fich and
Danny Hendler and
Nir Shavit},
title = {On the inherent weakness of conditional primitives},
journal = {Distributed Comput.},
volume = {18},
number = {4},
pages = {267--277},
year = {2006},
url = {https://doi.org/10.1007/s00446-005-0136-5},
doi = {10.1007/S00446-005-0136-5},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/FichHS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/EllenSW06,
author = {Faith Ellen and
Sivaramakrishnan Subramanian and
Jennifer L. Welch},
editor = {Soma Chaudhuri and
Samir R. Das and
Himadri S. Paul and
Srikanta Tirthapura},
title = {Maintaining Information About Nearby Processors in a Mobile Environment},
booktitle = {Distributed Computing and Networking, 8th International Conference,
{ICDCN} 2006, Guwahati, India, December 27-30, 2006},
series = {Lecture Notes in Computer Science},
volume = {4308},
pages = {193--202},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11947950\_22},
doi = {10.1007/11947950\_22},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/EllenSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/AttiyaEF06,
author = {Hagit Attiya and
Faith Ellen and
Panagiota Fatourou},
editor = {Soma Chaudhuri and
Samir R. Das and
Himadri S. Paul and
Srikanta Tirthapura},
title = {The Complexity of Updating Multi-writer Snapshot Objects},
booktitle = {Distributed Computing and Networking, 8th International Conference,
{ICDCN} 2006, Guwahati, India, December 27-30, 2006},
series = {Lecture Notes in Computer Science},
volume = {4308},
pages = {319--330},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11947950\_35},
doi = {10.1007/11947950\_35},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/AttiyaEF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FatourouFR06,
author = {Panagiota Fatourou and
Faith Ellen Fich and
Eric Ruppert},
editor = {Jon M. Kleinberg},
title = {Time-space tradeoffs for implementations of snapshots},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {169--178},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132542},
doi = {10.1145/1132516.1132542},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FatourouFR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BrodskyEW06,
author = {Alex Brodsky and
Faith Ellen and
Philipp Woelfel},
editor = {Shlomi Dolev},
title = {Fully-Adaptive Algorithms for Long-Lived Renaming},
booktitle = {Distributed Computing, 20th International Symposium, {DISC} 2006,
Stockholm, Sweden, September 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4167},
pages = {413--427},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11864219\_29},
doi = {10.1007/11864219\_29},
timestamp = {Sat, 19 Oct 2019 20:32:37 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BrodskyEW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/Fich05,
author = {Faith Ellen Fich},
title = {Introduction to the special issue {DISC} 2003},
journal = {Distributed Comput.},
volume = {18},
number = {2},
pages = {111--111},
year = {2005},
url = {https://doi.org/10.1007/s00446-005-0132-9},
doi = {10.1007/S00446-005-0132-9},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/Fich05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GumLLF05,
author = {Ben Gum and
Richard J. Lipton and
Andrea S. LaPaugh and
Faith E. Fich},
title = {Estimating the maximum},
journal = {J. Algorithms},
volume = {54},
number = {1},
pages = {105--114},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.04.005},
doi = {10.1016/J.JALGOR.2004.04.005},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GumLLF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FichKPR05,
author = {Faith Ellen Fich and
Andr{\'{e}} K{\"{u}}ndgen and
Michael J. Pelsmajer and
Radhika Ramamurthi},
title = {Graph Minors and Reliable Single Message Transmission},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {815--847},
year = {2005},
url = {https://doi.org/10.1137/S0895480103421129},
doi = {10.1137/S0895480103421129},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FichKPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FichHS05,
author = {Faith Ellen Fich and
Danny Hendler and
Nir Shavit},
title = {Linear Lower Bounds on Real-World Implementations of Concurrent Objects},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {165--173},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.47},
doi = {10.1109/SFCS.2005.47},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FichHS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Fich05,
author = {Faith Ellen Fich},
editor = {Peter Vojt{\'{a}}s and
M{\'{a}}ria Bielikov{\'{a}} and
Bernadette Charron{-}Bost and
Ondrej S{\'{y}}kora},
title = {How Hard Is It to Take a Snapshot?},
booktitle = {{SOFSEM} 2005: Theory and Practice of Computer Science, 31st Conference
on Current Trends in Theory and Practice of Computer Science, Liptovsk{\'{y}}
J{\'{a}}n, Slovakia, January 22-28, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3381},
pages = {28--37},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30577-4\_3},
doi = {10.1007/978-3-540-30577-4\_3},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Fich05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FichLMS05,
author = {Faith Ellen Fich and
Victor Luchangco and
Mark Moir and
Nir Shavit},
editor = {Pierre Fraigniaud},
title = {Obstruction-Free Algorithms Can Be Practically Wait-Free},
booktitle = {Distributed Computing, 19th International Conference, {DISC} 2005,
Cracow, Poland, September 26-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3724},
pages = {78--92},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561927\_8},
doi = {10.1007/11561927\_8},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/FichLMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DavidBF05,
author = {Matei David and
Alex Brodsky and
Faith Ellen Fich},
editor = {Pierre Fraigniaud},
title = {Restricted Stack Implementations},
booktitle = {Distributed Computing, 19th International Conference, {DISC} 2005,
Cracow, Poland, September 26-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3724},
pages = {137--151},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561927\_12},
doi = {10.1007/11561927\_12},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DavidBF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FichLMS05a,
author = {Faith Ellen Fich and
Victor Luchangco and
Mark Moir and
Nir Shavit},
editor = {Pierre Fraigniaud},
title = {Obstruction-Free Step Complexity: Lock-Free {DCAS} as an Example},
booktitle = {Distributed Computing, 19th International Conference, {DISC} 2005,
Cracow, Poland, September 26-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3724},
pages = {493--494},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561927\_37},
doi = {10.1007/11561927\_37},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/FichLMS05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AttiyaFK04,
author = {Hagit Attiya and
Faith Ellen Fich and
Yaniv Kaplan},
editor = {Soma Chaudhuri and
Shay Kutten},
title = {Lower bounds for adaptive collect and related objects},
booktitle = {Proceedings of the Twenty-Third Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2004, St. John's, Newfoundland, Canada,
July 25-28, 2004},
pages = {60--69},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1011767.1011777},
doi = {10.1145/1011767.1011777},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AttiyaFK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BrodskyF04,
author = {Alex Brodsky and
Faith Ellen Fich},
editor = {Soma Chaudhuri and
Shay Kutten},
title = {Efficient synchronous snapshots},
booktitle = {Proceedings of the Twenty-Third Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2004, St. John's, Newfoundland, Canada,
July 25-28, 2004},
pages = {70--79},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1011767.1011778},
doi = {10.1145/1011767.1011778},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BrodskyF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/FichHS04,
author = {Faith E. Fich and
Danny Hendler and
Nir Shavit},
editor = {Soma Chaudhuri and
Shay Kutten},
title = {On the inherent weakness of conditional synchronization primitives},
booktitle = {Proceedings of the Twenty-Third Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2004, St. John's, Newfoundland, Canada,
July 25-28, 2004},
pages = {80--87},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1011767.1011780},
doi = {10.1145/1011767.1011780},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/FichHS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AspnesFR04,
author = {James Aspnes and
Faith E. Fich and
Eric Ruppert},
editor = {Rachid Guerraoui},
title = {Relationships Between Broadcast and Shared Memory in Reliable Anonymous
Distributed Systems},
booktitle = {Distributed Computing, 18th International Conference, {DISC} 2004,
Amsterdam, The Netherlands, October 4-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3274},
pages = {260--274},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30186-8\_19},
doi = {10.1007/978-3-540-30186-8\_19},
timestamp = {Wed, 07 Dec 2022 23:11:11 +0100},
biburl = {https://dblp.org/rec/conf/wdag/AspnesFR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/FichR03,
author = {Faith E. Fich and
Eric Ruppert},
title = {Hundreds of impossibility results for distributed computing},
journal = {Distributed Comput.},
volume = {16},
number = {2-3},
pages = {121--163},
year = {2003},
url = {https://doi.org/10.1007/s00446-003-0091-y},
doi = {10.1007/S00446-003-0091-Y},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/FichR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FatourouFR03,
author = {Panagiota Fatourou and
Faith E. Fich and
Eric Ruppert},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {A tight time lower bound for space-optimal implementations of multi-writer
snapshots},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {259--268},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780582},
doi = {10.1145/780542.780582},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FatourouFR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wdag/2003,
editor = {Faith Ellen Fich},
title = {Distributed Computing, 17th International Conference, {DISC} 2003,
Sorrento, Italy, October 1-3, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2848},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/b13831},
doi = {10.1007/B13831},
isbn = {3-540-20184-X},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeameF02,
author = {Paul Beame and
Faith E. Fich},
title = {Optimal Bounds for the Predecessor Problem and Related Problems},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {38--72},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1822},
doi = {10.1006/JCSS.2002.1822},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BeameF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/FatourouFR02,
author = {Panagiota Fatourou and
Faith E. Fich and
Eric Ruppert},
editor = {Aleta Ricciardi},
title = {Space-optimal multi-writer snapshot objects are slow},
booktitle = {Proceedings of the Twenty-First Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2002, Monterey, California, USA,
July 21-24, 2002},
pages = {13--20},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/571825.571828},
doi = {10.1145/571825.571828},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/FatourouFR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/WatkinsonAF01,
author = {John Watkinson and
Micah Adler and
Faith E. Fich},
editor = {Francesc Comellas and
Josep F{\`{a}}brega and
Pierre Fraigniaud},
title = {New Protocols for Asymmetric Communication Channels},
booktitle = {{SIROCCO} 8, Proceedings of the 8th International Colloquium on Structural
Information and Communication Complexity, Vall de N{\'{u}}ria,
Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001},
series = {Proceedings in Informatics},
volume = {8},
pages = {337--350},
publisher = {Carleton Scientific},
year = {2001},
timestamp = {Thu, 05 Feb 2004 10:15:17 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/WatkinsonAF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FichJ01,
author = {Faith E. Fich and
Colette Johnen},
editor = {Jennifer L. Welch},
title = {A Space Optimal, Deterministic, Self-Stabilizing, Leader Election
Algorithm for Unidirectional Rings},
booktitle = {Distributed Computing, 15th International Conference, {DISC} 2001,
Lisbon, Portugal, October 3-5, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2180},
pages = {224--239},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45414-4\_16},
doi = {10.1007/3-540-45414-4\_16},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/FichJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdlerFGP00,
author = {Micah Adler and
Faith E. Fich and
Leslie Ann Goldberg and
Mike Paterson},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Tight Size Bounds for Packet Headers in Narrow Meshes},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {756--767},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_63},
doi = {10.1007/3-540-45022-X\_63},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AdlerFGP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FichR00,
author = {Faith E. Fich and
Eric Ruppert},
editor = {Maurice Herlihy},
title = {Lower Bounds in Distributed Computing},
booktitle = {Distributed Computing, 14th International Conference, {DISC} 2000,
Toledo, Spain, October 4-6, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1914},
pages = {1--28},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40026-5\_1},
doi = {10.1007/3-540-40026-5\_1},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/FichR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FichJ00,
author = {Faith E. Fich and
Andreas Jakoby},
editor = {Maurice Herlihy},
title = {Short Headers Suffice for Communication in a {DAG} with Link Failures},
booktitle = {Distributed Computing, 14th International Conference, {DISC} 2000,
Toledo, Spain, October 4-6, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1914},
pages = {360--373},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40026-5\_24},
doi = {10.1007/3-540-40026-5\_24},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/FichJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AdlerF99,
author = {Micah Adler and
Faith E. Fich},
editor = {Brian A. Coan and
Jennifer L. Welch},
title = {The Complexity of End-to-End Communication in Memoryless Networks},
booktitle = {Proceedings of the Eighteenth Annual {ACM} Symposium on Principles
of Distributed Computing, PODC, '99Atlanta, Georgia, USA, May 3-6,
1999},
pages = {239--248},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301308.301364},
doi = {10.1145/301308.301364},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AdlerF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameF99,
author = {Paul Beame and
Faith E. Fich},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Optimal Bounds for the Predecessor Problem},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {295--304},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301323},
doi = {10.1145/301250.301323},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FichHS98,
author = {Faith E. Fich and
Maurice Herlihy and
Nir Shavit},
title = {On the Space Complexity of Randomized Synchronization},
journal = {J. {ACM}},
volume = {45},
number = {5},
pages = {843--862},
year = {1998},
url = {https://doi.org/10.1145/290179.290183},
doi = {10.1145/290179.290183},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FichHS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/Fich98,
author = {Faith E. Fich},
editor = {Alain Bui and
Vincent Villain},
title = {End to End Communication},
booktitle = {Distributed Computing, 2nd International Conference On Principles
Of Distributed Systems. {OPODIS} 98, Amiens, France, December 16-18,
1998},
pages = {37--44},
publisher = {Hermes},
year = {1998},
timestamp = {Tue, 20 Jan 2004 14:29:01 +0100},
biburl = {https://dblp.org/rec/conf/opodis/Fich98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-028,
author = {Paul Beame and
Faith E. Fich},
title = {On Searching Sorted Lists: {A} Near-Optimal Lower Bound},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-028}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-028/index.html},
eprinttype = {ECCC},
eprint = {TR98-028},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeameFS97,
author = {Paul Beame and
Faith E. Fich and
Rakesh K. Sinha},
title = {Separating the Power of {EREW} and {CREW} PRAMs with Small Communication
Width},
journal = {Inf. Comput.},
volume = {138},
number = {1},
pages = {89--99},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2649},
doi = {10.1006/INCO.1997.2649},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BeameFS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/CondonFFGJLMRSSS97,
author = {Anne Condon and
Faith E. Fich and
Greg N. Frederickson and
Andrew V. Goldberg and
David S. Johnson and
Michael C. Loui and
Steven Mahaney and
Prabhakar Raghavan and
John E. Savage and
Alan L. Selman and
David B. Shmoys},
title = {Strategic directions in research in theory of computing},
journal = {{SIGACT} News},
volume = {28},
number = {3},
pages = {75--93},
year = {1997},
url = {https://doi.org/10.1145/262301.262310},
doi = {10.1145/262301.262310},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/CondonFFGJLMRSSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Fich97,
author = {Faith E. Fich},
title = {Infrastructure issues related to theory of computing research},
journal = {{SIGACT} News},
volume = {28},
number = {3},
pages = {94--99},
year = {1997},
url = {https://doi.org/10.1145/262301.262311},
doi = {10.1145/262301.262311},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Fich97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Fich96,
author = {Faith E. Fich},
title = {Infrastructure Issues Related to Theory of Computing Research},
journal = {{ACM} Comput. Surv.},
volume = {28},
number = {4es},
pages = {217},
year = {1996},
url = {https://doi.org/10.1145/242224.242502},
doi = {10.1145/242224.242502},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/Fich96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FichIKKK96,
author = {Faith E. Fich and
Russell Impagliazzo and
Bruce M. Kapron and
Valerie King and
Miroslaw Kutylowski},
title = {Limits on the Power of Parallel Random Access Machines with Weak Forms
of Write Conflict Resolution},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {104--111},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0052},
doi = {10.1006/JCSS.1996.0052},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FichIKKK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DymondFNRR96,
author = {Patrick W. Dymond and
Faith E. Fich and
Naomi Nishimura and
Prabhakar Ragde and
Walter L. Ruzzo},
title = {Pointers versus Arithmetic in PRAMs},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {218--232},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0063},
doi = {10.1006/JCSS.1996.0063},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DymondFNRR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FichKKLR95,
author = {Faith E. Fich and
Miroslaw Kowaluk and
Miroslaw Kutylowski and
Krzysztof Lorys and
Prabhakar Ragde},
title = {Retrieval of Scattered Information by EREW, CREW, and {CRCW} PRAMs},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {113--131},
year = {1995},
url = {https://doi.org/10.1007/BF01268141},
doi = {10.1007/BF01268141},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FichKKLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichMP95,
author = {Faith E. Fich and
J. Ian Munro and
Patricio V. Poblete},
title = {Permuting in Place},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {266--278},
year = {1995},
url = {https://doi.org/10.1137/S0097539792238649},
doi = {10.1137/S0097539792238649},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FichMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FichM95,
author = {Faith E. Fich and
Peter Bro Miltersen},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Tables Should Be Sorted (On Random Access Machines)},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {482--493},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_87},
doi = {10.1007/3-540-60220-8\_87},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/FichM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyarFL94,
author = {Joan Boyar and
Faith E. Fich and
Kim S. Larsen},
title = {Bounds on Certain Multiplications of Affine Combinations},
journal = {Discret. Appl. Math.},
volume = {52},
number = {2},
pages = {155--167},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90079-5},
doi = {10.1016/0166-218X(94)90079-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BoyarFL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DymondFNRR93,
author = {Patrick W. Dymond and
Faith E. Fich and
Naomi Nishimura and
Prabhakar Ragde and
Walter L. Ruzzo},
title = {Pointers versus Arithmetic in PRAMs},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {239--252},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336522},
doi = {10.1109/SCT.1993.336522},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DymondFNRR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/FichHS92,
author = {Faith E. Fich and
Maurice Herlihy and
Nir Shavit},
editor = {Jim Anderson and
Sam Toueg},
title = {On the Space Complexity of Randomized Synchronization},
booktitle = {Proceedings of the Twelth Annual {ACM} Symposium on Principles of
Distributed Computing, Ithaca, New York, USA, August 15-18, 1993},
pages = {241--249},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/164051.164078},
doi = {10.1145/164051.164078},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/FichHS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FichIKKK93,
author = {Faith E. Fich and
Russell Impagliazzo and
Bruce M. Kapron and
Valerie King and
Miroslaw Kutylowski},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {Limits on the Power of Parallel Random Access Machines with Weak Forms
of Write Conflict Resolution},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {386--397},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_39},
doi = {10.1007/3-540-56503-5\_39},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FichIKKK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BeameFS93,
author = {Paul Beame and
Faith E. Fich and
Rakesh K. Sinha},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Separating the Power of {EREW} and {CREW} PRAMs with Small Communication
Width},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {163--174},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_245},
doi = {10.1007/3-540-57155-8\_245},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BeameFS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FichKLKR92,
author = {Faith E. Fich and
Miroslaw Kowaluk and
Krzysztof Lorys and
Miroslaw Kutylowski and
Prabhakar Ragde},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Retrieval of scattered information by EREW, {CREW} and {CRCW} PRAMs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {30--41},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_3},
doi = {10.1007/3-540-55706-7\_3},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/FichKLKR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Fich90,
author = {Faith E. Fich},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {29},
number = {1},
pages = {1--2},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90078-Q},
doi = {10.1016/0166-218X(90)90078-Q},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Fich90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichW90,
author = {Faith E. Fich and
Avi Wigderson},
title = {Toward Understanding Exclusive Read},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {718--727},
year = {1990},
url = {https://doi.org/10.1137/0219050},
doi = {10.1137/0219050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FichW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FichMP90,
author = {Faith E. Fich and
J. Ian Munro and
Patricio V. Poblete},
title = {Permuting},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {372--379},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89556},
doi = {10.1109/FSCS.1990.89556},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FichMP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/FichR90,
author = {Faith E. Fich and
Vijaya Ramachandran},
editor = {Frank Thomson Leighton},
title = {Lower Bounds for Parallel Computation on Linked Structures},
booktitle = {Proceedings of the 2nd Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '90, Island of Crete, Greece, July 2-6,
1990},
pages = {109--116},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/97444.97676},
doi = {10.1145/97444.97676},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/FichR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/YeshaFLR89,
author = {Faith E. Fich and
Ming Li and
Prabhakar Ragde and
Yaacov Yesha},
title = {On the Power of Concurrent-Write PRAMs With Read-Only Memory},
journal = {Inf. Comput.},
volume = {83},
number = {2},
pages = {234--244},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90059-X},
doi = {10.1016/0890-5401(89)90059-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/YeshaFLR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/FichW89,
author = {Faith E. Fich and
Avi Wigderson},
editor = {Frank Thomson Leighton},
title = {Towards Understanding Exclusive Read},
booktitle = {Proceedings of the {ACM} Symposium on Parallel Algorithms and Architectures,
{SPAA} '89, Santa Fe, New Mexico, USA, June 18-21, 1989},
pages = {76--82},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/72935.72944},
doi = {10.1145/72935.72944},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/FichW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FichRW88,
author = {Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson},
title = {Simulations Among Concurrent-Write PRAMs},
journal = {Algorithmica},
volume = {3},
pages = {43--51},
year = {1988},
url = {https://doi.org/10.1007/BF01762109},
doi = {10.1007/BF01762109},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FichRW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FichT88,
author = {Faith E. Fich and
Martin Tompa},
title = {The parallel complexity of exponentiating polynomials over finite
fields},
journal = {J. {ACM}},
volume = {35},
number = {3},
pages = {651--667},
year = {1988},
url = {https://doi.org/10.1145/44483.44496},
doi = {10.1145/44483.44496},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FichT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichRW88,
author = {Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson},
title = {Relations Between Concurrent-Write Models of Parallel Computation},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {3},
pages = {606--627},
year = {1988},
url = {https://doi.org/10.1137/0217037},
doi = {10.1137/0217037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FichRW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorodinFHUW88,
author = {Allan Borodin and
Faith E. Fich and
Friedhelm Meyer auf der Heide and
Eli Upfal and
Avi Wigderson},
title = {A Tradeoff Between Search and Update Time for the Implicit Dictionary
Problem},
journal = {Theor. Comput. Sci.},
volume = {58},
pages = {57--68},
year = {1988},
url = {https://doi.org/10.1016/0304-3975(88)90018-7},
doi = {10.1016/0304-3975(88)90018-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BorodinFHUW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinFHUW87,
author = {Allan Borodin and
Faith E. Fich and
Friedhelm Meyer auf der Heide and
Eli Upfal and
Avi Wigderson},
title = {A Time-Space Tradeoff for Element Distinctness},
journal = {{SIAM} J. Comput.},
volume = {16},
number = {1},
pages = {97--99},
year = {1987},
url = {https://doi.org/10.1137/0216007},
doi = {10.1137/0216007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinFHUW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinDFP86,
author = {Allan Borodin and
Danny Dolev and
Faith E. Fich and
Wolfgang J. Paul},
title = {Bounds for Width Two Branching Programs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {549--560},
year = {1986},
url = {https://doi.org/10.1137/0215040},
doi = {10.1137/0215040},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinDFP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BorodinFHUW86,
author = {Allan Borodin and
Faith E. Fich and
Friedhelm Meyer auf der Heide and
Eli Upfal and
Avi Wigderson},
editor = {Laurent Kott},
title = {A Tradeoff Between Search and Update Time for the Implicit Dictionary
Problem},
booktitle = {Automata, Languages and Programming, 13th International Colloquium,
ICALP86, Rennes, France, July 15-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {226},
pages = {50--59},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16761-7\_54},
doi = {10.1007/3-540-16761-7\_54},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BorodinFHUW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BorodinFHUW86,
author = {Allan Borodin and
Faith E. Fich and
Friedhelm Meyer auf der Heide and
Eli Upfal and
Avi Wigderson},
editor = {Burkhard Monien and
Guy Vidal{-}Naquet},
title = {A Time-Space Tradeoff for Element Distinctness},
booktitle = {{STACS} 86, 3rd Annual Symposium on Theoretical Aspects of Computer
Science, Orsay, France, January 16-18, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {210},
pages = {353--358},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16078-7\_89},
doi = {10.1007/3-540-16078-7\_89},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BorodinFHUW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FichT85,
author = {Faith E. Fich and
Martin Tompa},
editor = {Robert Sedgewick},
title = {The Parallel Complexity of Exponentiating Polynomials over Finite
Fields},
booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing,
May 6-8, 1985, Providence, Rhode Island, {USA}},
pages = {38--47},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/22145.22150},
doi = {10.1145/22145.22150},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FichT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FichHRW85,
author = {Faith E. Fich and
Friedhelm Meyer auf der Heide and
Prabhakar Ragde and
Avi Wigderson},
editor = {Robert Sedgewick},
title = {One, Two, Three {\textbackslash}dots Infinity: Lower Bounds for Parallel
Computation},
booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing,
May 6-8, 1985, Providence, Rhode Island, {USA}},
pages = {48--58},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/22145.22151},
doi = {10.1145/22145.22151},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FichHRW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrzozowskiF84,
author = {Janusz A. Brzozowski and
Faith E. Fich},
title = {On generalized locally testable languages},
journal = {Discret. Math.},
volume = {50},
pages = {153--169},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90045-1},
doi = {10.1016/0012-365X(84)90045-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrzozowskiF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/FichRW84,
author = {Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson},
editor = {Tiko Kameda and
Jayadev Misra and
Joseph G. Peters and
Nicola Santoro},
title = {Relations Between Concurrent-Write Models of Parallel Computation},
booktitle = {Proceedings of the Third Annual {ACM} Symposium on Principles of Distributed
Computing, Vancouver, B. C., Canada, August 27-29, 1984},
pages = {179--189},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800222.806745},
doi = {10.1145/800222.806745},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/FichRW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Fich83,
author = {Faith E. Fich},
title = {Lower Bounds for the Cycle Detection Problem},
journal = {J. Comput. Syst. Sci.},
volume = {26},
number = {3},
pages = {392--409},
year = {1983},
url = {https://doi.org/10.1016/0022-0000(83)90007-7},
doi = {10.1016/0022-0000(83)90007-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Fich83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BorodinDFP83,
author = {Allan Borodin and
Danny Dolev and
Faith E. Fich and
Wolfgang J. Paul},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Bounds for Width Two Branching Programs},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {87--93},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808736},
doi = {10.1145/800061.808736},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BorodinDFP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fich83,
author = {Faith E. Fich},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {New Bounds for Parallel Prefix Circuits},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {100--109},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808738},
doi = {10.1145/800061.808738},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Fich83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CulikFS82,
author = {Karel Cul{\'{\i}}k II and
Faith E. Fich and
Arto Salomaa},
title = {A homomorphic characterization of regular languages},
journal = {Discret. Appl. Math.},
volume = {4},
number = {2},
pages = {149--152},
year = {1982},
url = {https://doi.org/10.1016/0166-218X(82)90072-5},
doi = {10.1016/0166-218X(82)90072-5},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CulikFS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fich81,
author = {Faith E. Fich},
title = {Lower Bounds for the Cycle Detection Problem},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {96--105},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802462},
doi = {10.1145/800076.802462},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Fich81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BrzozowskiF80,
author = {Janusz A. Brzozowski and
Faith E. Fich},
title = {Languages of R-Trivial Monoids},
journal = {J. Comput. Syst. Sci.},
volume = {20},
number = {1},
pages = {32--49},
year = {1980},
url = {https://doi.org/10.1016/0022-0000(80)90003-3},
doi = {10.1016/0022-0000(80)90003-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BrzozowskiF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AshcroftF79,
author = {Edward A. Ashcroft and
Faith E. Fich},
title = {A Generalized Setting for Fixpoint Theory},
journal = {Theor. Comput. Sci.},
volume = {9},
pages = {243--256},
year = {1979},
url = {https://doi.org/10.1016/0304-3975(79)90027-6},
doi = {10.1016/0304-3975(79)90027-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AshcroftF79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FichB79,
author = {Faith E. Fich and
Janusz A. Brzozowski},
editor = {Hermann A. Maurer},
title = {A Characterization of a Dot-Depth Two Analogue of Generalized Definite
Languages},
booktitle = {Automata, Languages and Programming, 6th Colloquium, Graz, Austria,
July 16-20, 1979, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {71},
pages = {230--244},
publisher = {Springer},
year = {1979},
url = {https://doi.org/10.1007/3-540-09510-1\_18},
doi = {10.1007/3-540-09510-1\_18},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FichB79.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-02-07 03:13 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:
