Skip to content

Faith Ellen

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

33

Venues

10

Active years

2006–2025

Best venue rank

A*

Where they publish

Papers

33 indexed papers, newest first.

YearVenueTitleAuthors
2025OPODISHow Exhaustive Does an Extension-Based Proof Need to Be?Faith Ellen, Shihao Liu, Leqi Zhu, Eli Gafni, Rati Gelashvili
2025PODCByzantine Agreement with Predictions.Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert
2025PODCBrief Announcement: Distributed Graph Algorithms with Predictions.Joan Boyar, Faith Ellen, Kim S. Larsen
2022OPODISThe Step Complexity of Multidimensional Approximate Agreement.Hagit Attiya, Faith Ellen
2021PODCReductions and Extension-Based Proofs.Kayman Brusse, Faith Ellen
2021SIROCCOWait-Free Approximate Agreement on Graphs.Dan Alistarh, Faith Ellen, Joel Rybicki
2020PODCBrief Announcement: Why Extension-Based Proofs Fail.Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2020SPAAConstant-Length Labelling Schemes for Faster Deterministic Radio Broadcast.Faith Ellen, Seth Gilbert
2019PODC2019 Edsger W. Dijkstra Prize in Distributed Computing.Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela
2019STOCWhy extension-based proofs fail.Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2019STACSSpace Lower Bounds for the Signal Detection Problem.Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu
2019SPAAConstant-Length Labeling Schemes for Deterministic Radio Broadcast.Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2018PODCRevisionist Simulations: A New Approach to Proving Space Lower Bounds.Faith Ellen, Rati Gelashvili, Leqi Zhu
2016OPODISParticipating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract).Faith Ellen
2016PODCDeterministic Objects: Life Beyond Consensus.Yehuda Afek, Faith Ellen, Eli Gafni
2016PODCConcurrent Data Structures.Faith Ellen, Trevor Brown
2016PODCA Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract].Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu
2015OPODISAtomic Snapshots from Small Registers.Leqi Zhu, Faith Ellen
2015PODCLimitations of Highly-Available Eventually-Consistent Data Stores.Hagit Attiya, Faith Ellen, Adam Morrison
2014PODCThe amortized complexity of non-blocking binary search trees.Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert
2014PPoPPA general technique for non-blocking trees.Trevor Brown, Faith Ellen, Eric Ruppert
2013FOCSA Tight Bound for Set Disjointness in the Message-Passing Model.Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2013PODCPragmatic primitives for non-blocking data structures.Trevor Brown, Faith Ellen, Eric Ruppert
2012PODCFaster than optimal snapshots (for a while): preliminary version.James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2012PODCUniversal constructions that ensure disjoint-access parallelism and wait-freedom.Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
2012SODAA little advice can be very helpful.Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
2011SPAATight bounds for anonymous adopt-commit objects.James Aspnes, Faith Ellen
2010PODCNon-blocking binary search trees.Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel
2010SPAAA universal construction for wait-free transaction friendly data structures.Phong Chuong, Faith Ellen, Vijaya Ramachandran
2007PODCThe complexity of updating multi-writer snapshot objects.Hagit Attiya, Faith Ellen, Panagiota Fatourou
2007PODCSNZI: scalable NonZero indicators.Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
2006ICDCNThe Complexity of Updating Multi-writer Snapshot Objects.Hagit Attiya, Faith Ellen, Panagiota Fatourou
2006ICDCNMaintaining Information About Nearby Processors in a Mobile Environment.Faith Ellen, Sivaramakrishnan Subramanian, Jennifer L. Welch