• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 147 matches

• 2024
• 
  Faith Ellen, Rati Gelashvili, Leqi Zhu:
  Revisionist Simulations: A New Approach to Proving Space Lower Bounds. SIAM J. Comput. 53(4): 1039-1084 (2024)
• 
  Faith Ellen, Gal Sela:
  Strongly-Linearizable Bags. CoRR abs/2411.19365 (2024)
• 2023
• 
  Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
  Why Extension-Based Proofs Fail. SIAM J. Comput. 52(4): 913-944 (2023)
• 
  Dan Alistarh, Faith Ellen, Joel Rybicki:
  Wait-free approximate agreement on graphs. Theor. Comput. Sci. 948: 113733 (2023)
• 2022
• 
  Hagit Attiya, Faith Ellen:
  The Step Complexity of Multidimensional Approximate Agreement. OPODIS 2022: 6:1-6:12
• 2021
• 
  Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
  Space Lower Bounds for the Signal Detection Problem. Theory Comput. Syst. 65(4): 687-705 (2021)
• 
  Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
  Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. 8(3): 14:1-14:17 (2021)
• 
  Kayman Brusse, Faith Ellen:
  Reductions and Extension-Based Proofs. PODC 2021: 497-507
• 
  Dan Alistarh, Faith Ellen, Joel Rybicki:
  Wait-Free Approximate Agreement on Graphs. SIROCCO 2021: 87-105
• 
  Yilun Sheng, Faith Ellen:
  Extension-Based Proofs for Synchronous Message Passing. DISC 2021: 36:1-36:17
• 
  Dan Alistarh, Faith Ellen, Joel Rybicki:
  Wait-free approximate agreement on graphs. CoRR abs/2103.08949 (2021)
• 2020
• 
  Faith Ellen, Jörg-Rüdiger Sack:
  Preface. Comput. Geom. 89: 101632 (2020)
• 
  Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
  A complexity-based classification for multiprocessor synchronization. Distributed Comput. 33(2): 125-144 (2020)
• 
  Joan Boyar, Faith Ellen, Kim S. Larsen:
  Randomized distributed online algorithms against adaptive offline adversaries. Inf. Process. Lett. 161: 105973 (2020)
• 
  Faith Ellen, Luís Rodrigues:
  Preface. Theor. Comput. Sci. 842: 130 (2020)
• 
  Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
  Brief Announcement: Why Extension-Based Proofs Fail. PODC 2020: 54-56
• 
  Faith Ellen, Seth Gilbert:
  Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast. SPAA 2020: 213-222
• 2019
• 
  Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
  Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. Bull. EATCS 127 (2019)
• 
  Joan Boyar, Faith Ellen:
  Tight Bounds for Restricted Grid Scheduling. Int. J. Found. Comput. Sci. 30(3): 375-405 (2019)
• 
  Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
  Emulating a Shared Register in a System That Never Stops Changing. IEEE Trans. Parallel Distributed Syst. 30(3): 544-559 (2019)
• 
  Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
  2019 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2019: 1
• 
  Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
  Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA 2019: 171-178
• 
  Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
  Space Lower Bounds for the Signal Detection Problem. STACS 2019: 26:1-26:13
• 
  Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
  Why extension-based proofs fail. STOC 2019: 986-996
• 
  Peter Robinson, Faith Ellen:
  Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. ACM 2019, ISBN 978-1-4503-6217-7 [contents]
• 2018
• 
  James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
  Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65(6): 38:1-38:2 (2018)
• 
  Faith Ellen, Rati Gelashvili, Leqi Zhu:
  Revisionist Simulations: A New Approach to Proving Space Lower Bounds. PODC 2018: 61-70
• 
  Jiannong Cao, Faith Ellen, Luís Rodrigues, Bernardo Ferreira:
  22nd International Conference on Principles of Distributed Systems, OPODIS 2018, December 17-19, 2018, Hong Kong, China. LIPIcs 125, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-098-9 [contents]
• 
  Joan Boyar, Faith Ellen, Kim S. Larsen:
  The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. CoRR abs/1807.06820 (2018)
• 
  Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
  Why Extension-Based Proofs Fail. CoRR abs/1811.01421 (2018)

skipping 117 more matches