ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1711.02455
  4. Cited By
Revisionist Simulations: A New Approach to Proving Space Lower Bounds
v1v2v3v4v5 (latest)

Revisionist Simulations: A New Approach to Proving Space Lower Bounds

7 November 2017
Faith Ellen
Rati Gelashvili
Leqi Zhu
ArXiv (abs)PDFHTML

Papers citing "Revisionist Simulations: A New Approach to Proving Space Lower Bounds"

6 / 6 papers shown
The Space Complexity of Consensus from Swap
The Space Complexity of Consensus from SwapJournal of the ACM (JACM), 2023
Sean Ovens
107
1
0
11 May 2023
A Speedup Theorem for Asynchronous Computation with Applications to
  Consensus and Approximate Agreement
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate AgreementACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Pierre Fraigniaud
A. Paz
S. Rajsbaum
LRM
311
4
0
10 Jun 2022
Reaching Agreement Among $k$ out of $n$ Processes
Reaching Agreement Among kkk out of nnn ProcessesColloquium on Structural Information & Communication Complexity (SIROCCO), 2022
G. Taubenfeld
361
0
0
10 May 2022
Probabilistic Indistinguishability and the Quality of Validity in
  Byzantine Agreement
Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement
G. Goren
Yoram Moses
Alexander Spiegelman
108
7
0
09 Nov 2020
Why Extension-Based Proofs Fail
Why Extension-Based Proofs Fail
Dan Alistarh
J. Aspnes
Faith Ellen
Rati Gelashvili
Leqi Zhu
146
20
0
04 Nov 2018
A Complexity-Based Hierarchy for Multiprocessor Synchronization
A Complexity-Based Hierarchy for Multiprocessor Synchronization
Faith Ellen
Rati Gelashvili
Nir Shavit
Leqi Zhu
88
25
0
20 Jul 2016
1
Page 1 of 1