Faith Ellen - RankMe

83 papers A* 21A 9B 12Misc 2Journal 37Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention. DISC Dan Alistarh, Faith Ellen, Alexander Fedorov
2025	A*	`conf`	Brief Announcement: Distributed Graph Algorithms with Predictions. PODC Joan Boyar, Faith Ellen, Kim S. Larsen
2025	A*	`conf`	Byzantine Agreement with Predictions. PODC Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert
2025	J	`jnl`	Byzantine Agreement with Predictions. CoRR Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert
2025	J	`jnl`	Distributed Graph Algorithms with Predictions. CoRR Joan Boyar, Faith Ellen, Kim S. Larsen
2025	B	`conf`	How Exhaustive Does an Extension-Based Proof Need to Be? OPODIS Faith Ellen, Shihao Liu, Leqi Zhu, Eli Gafni, Rati Gelashvili
2025	A	`conf`	Strong Linearizability Without Compare&Swap: The Case of Bags. DISC Faith Ellen, Gal Sela
2024	J	`jnl`	Revisionist Simulations: A New Approach to Proving Space Lower Bounds. SIAM J. Comput. Faith Ellen, Rati Gelashvili, Leqi Zhu
2024	J	`jnl`	Strongly-Linearizable Bags. CoRR Faith Ellen, Gal Sela
2023	J	`jnl`	Wait-free approximate agreement on graphs. Theor. Comput. Sci. Dan Alistarh, Faith Ellen, Joel Rybicki
2023	J	`jnl`	Why Extension-Based Proofs Fail. SIAM J. Comput. Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2022	B	`conf`	The Step Complexity of Multidimensional Approximate Agreement. OPODIS Hagit Attiya, Faith Ellen
2021	J	`jnl`	Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2021	A	`conf`	Extension-Based Proofs for Synchronous Message Passing. DISC Yilun Sheng, Faith Ellen
2021	A*	`conf`	Reductions and Extension-Based Proofs. PODC Kayman Brusse, Faith Ellen
2021	J	`jnl`	Space Lower Bounds for the Signal Detection Problem. Theory Comput. Syst. Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu
2021	B	`conf`	Wait-Free Approximate Agreement on Graphs. SIROCCO Dan Alistarh, Faith Ellen, Joel Rybicki
2021	J	`jnl`	Wait-free approximate agreement on graphs. CoRR Dan Alistarh, Faith Ellen, Joel Rybicki
2020	J	`jnl`	A complexity-based classification for multiprocessor synchronization. Distributed Comput. Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu
2020	A*	`conf`	Brief Announcement: Why Extension-Based Proofs Fail. PODC Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2020	B	`conf`	Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast. SPAA Faith Ellen, Seth Gilbert
2020	J	`jnl`	Preface. Comput. Geom. Faith Ellen, Jörg-Rüdiger Sack
2020	J	`jnl`	Preface. Theor. Comput. Sci. Faith Ellen, Luís Rodrigues
2020	J	`jnl`	Randomized distributed online algorithms against adaptive offline adversaries. Inf. Process. Lett. Joan Boyar, Faith Ellen, Kim S. Larsen
2019	A*	`conf`	2019 Edsger W. Dijkstra Prize in Distributed Computing. PODC Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela
2019	B	`conf`	Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2019	J	`jnl`	Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. Bull. EATCS Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela
2019	J	`jnl`	Emulating a Shared Register in a System That Never Stops Changing. IEEE Trans. Parallel Distributed Syst. Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch
2019	A*	`ed.`	Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. PODC Peter Robinson, Faith Ellen
2019	A	`conf`	Space Lower Bounds for the Signal Detection Problem. STACS Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu
2019	J	`jnl`	Tight Bounds for Restricted Grid Scheduling. Int. J. Found. Comput. Sci. Joan Boyar, Faith Ellen
2019	A*	`conf`	Why extension-based proofs fail. STOC Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2018	B	`ed.`	22nd International Conference on Principles of Distributed Systems, OPODIS 2018, Hong Kong, December 17-19, 2018 OPODIS Jiannong Cao, Faith Ellen, Luís Rodrigues, Bernardo Ferreira
2018	J	`jnl`	Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2018	A*	`conf`	Revisionist Simulations: A New Approach to Proving Space Lower Bounds. PODC Faith Ellen, Rati Gelashvili, Leqi Zhu
2018	J	`jnl`	The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. CoRR Joan Boyar, Faith Ellen, Kim S. Larsen
2018	J	`jnl`	Why Extension-Based Proofs Fail. CoRR Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2017	J	`jnl`	A General Technique for Non-blocking Trees. CoRR Trevor Brown, Faith Ellen, Eric Ruppert
2017	B	`ed.`	Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings WADS Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack
2017	J	`jnl`	Constant-Length Labeling Schemes for Deterministic Radio Broadcast. CoRR Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2017	J	`jnl`	Limitations of Highly-Available Eventually-Consistent Data Stores. IEEE Trans. Parallel Distributed Syst. Hagit Attiya, Faith Ellen, Adam Morrison
2017	J	`jnl`	Pragmatic Primitives for Non-blocking Data Structures. CoRR Trevor Brown, Faith Ellen, Eric Ruppert
2017	J	`jnl`	Revisionist Simulations: A New Approach to Proving Space Lower Bounds. CoRR Faith Ellen, Rati Gelashvili, Leqi Zhu
2017	J	`jnl`	Simulating a Shared Register in a System that Never Stops Changing. CoRR Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch
2016	J	`jnl`	A Complexity-Based Hierarchy for Multiprocessor Synchronization. CoRR Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu
2016	A*	`conf`	A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. PODC Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu
2016	A*	`conf`	Concurrent Data Structures. PODC Faith Ellen, Trevor Brown
2016	A*	`conf`	Deterministic Objects: Life Beyond Consensus. PODC Yehuda Afek, Faith Ellen, Eli Gafni
2016	B	`conf`	Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract). OPODIS Faith Ellen
2016	J	`jnl`	Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
2016	J	`jnl`	Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
2015	B	`conf`	Atomic Snapshots from Small Registers. OPODIS Leqi Zhu, Faith Ellen
2015	A*	`conf`	Limitations of Highly-Available Eventually-Consistent Data Stores. PODC Hagit Attiya, Faith Ellen, Adam Morrison
2015	J	`jnl`	Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2015	A	`conf`	Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract). DISC Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch
2014	B	`conf`	A general technique for non-blocking trees. PPoPP Trevor Brown, Faith Ellen, Eric Ruppert
2014	—	`book`	Impossibility Results for Distributed Computing Hagit Attiya, Faith Ellen
2014	A*	`conf`	The amortized complexity of non-blocking binary search trees. PODC Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert
2014	J	`jnl`	Tight Bounds for Adopt-Commit Objects. Theory Comput. Syst. James Aspnes, Faith Ellen
2014	J	`jnl`	Tight Bounds for an Online Bin Packing Problem. CoRR Joan Boyar, Faith Ellen
2013	A*	`conf`	A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2013	A	`conf`	An Optimal Implementation of Fetch-and-Increment. DISC Faith Ellen, Philipp Woelfel
2013	—	`conf`	Bounds for Scheduling Jobs on Grid Processors. Space-Efficient Data Structures, Streams, and Algorithms Joan Boyar, Faith Ellen
2013	A*	`conf`	Pragmatic primitives for non-blocking data structures. PODC Trevor Brown, Faith Ellen, Eric Ruppert
2013	J	`jnl`	Tight Bounds for Set Disjointness in the Message Passing Model CoRR Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2012	A*	`conf`	A little advice can be very helpful. SODA Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
2012	A	`conf`	Efficient Fetch-and-Increment. DISC Faith Ellen, Vijaya Ramachandran, Philipp Woelfel
2012	A*	`conf`	Faster than optimal snapshots (for a while): preliminary version. PODC James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2012	J	`jnl`	On the Inherent Sequentiality of Concurrent Objects. SIAM J. Comput. Faith Ellen, Danny Hendler, Nir Shavit
2012	A*	`conf`	Universal constructions that ensure disjoint-access parallelism and wait-freedom. PODC Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
2011	J	`jnl`	Fully-adaptive algorithms for long-lived renaming. Distributed Comput. Alex Brodsky, Faith Ellen, Philipp Woelfel
2011	J	`jnl`	The complexity of updating snapshot objects. J. Parallel Distributed Comput. Hagit Attiya, Faith Ellen, Panagiota Fatourou
2011	B	`conf`	Tight bounds for anonymous adopt-commit objects. SPAA James Aspnes, Faith Ellen
2010	B	`conf`	A universal construction for wait-free transaction friendly data structures. SPAA Phong Chuong, Faith Ellen, Vijaya Ramachandran
2010	A*	`conf`	Non-blocking binary search trees. PODC Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel
2008	J	`jnl`	The space complexity of unbounded timestamps. Distributed Comput. Faith Ellen, Panagiota Fatourou, Eric Ruppert
2007	A*	`conf`	SNZI: scalable NonZero indicators. PODC Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
2007	A	`conf`	The Space Complexity of Unbounded Timestamps. DISC Faith Ellen, Panagiota Fatourou, Eric Ruppert
2007	A*	`conf`	The complexity of updating multi-writer snapshot objects. PODC Hagit Attiya, Faith Ellen, Panagiota Fatourou
2007	J	`jnl`	Time lower bounds for implementations of multi-writer snapshots. J. ACM Faith Ellen, Panagiota Fatourou, Eric Ruppert
2006	A	`conf`	Fully-Adaptive Algorithms for Long-Lived Renaming. DISC Alex Brodsky, Faith Ellen, Philipp Woelfel
2006	Misc	`conf`	Maintaining Information About Nearby Processors in a Mobile Environment. ICDCN Faith Ellen, Sivaramakrishnan Subramanian, Jennifer L. Welch
2006	Misc	`conf`	The Complexity of Updating Multi-writer Snapshot Objects. ICDCN Hagit Attiya, Faith Ellen, Panagiota Fatourou