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. 2001.04235
  4. Cited By
Notes on Theory of Distributed Systems
v1v2v3v4 (latest)

Notes on Theory of Distributed Systems

10 January 2020
J. Aspnes
    GNN
ArXiv (abs)PDFHTML

Papers citing "Notes on Theory of Distributed Systems"

7 / 7 papers shown
Lower Bounds for Shared-Memory Leader Election under Bounded Write
  Contention
Lower Bounds for Shared-Memory Leader Election under Bounded Write ContentionInternational Symposium on Distributed Computing (DISC), 2021
Dan Alistarh
Rati Gelashvili
Giorgi Nadiradze
167
2
0
05 Aug 2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid
  Model
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model
Ioannis Anagnostides
Themis Gouleakis
220
12
0
03 Aug 2021
Byzantine Agreement with Unknown Participants and Failures
Byzantine Agreement with Unknown Participants and FailuresIEEE International Parallel and Distributed Processing Symposium (IPDPS), 2021
Pankaj Khanchandani
Roger Wattenhofer
222
15
0
20 Feb 2021
Store-Collect in the Presence of Continuous Churn with Application to
  Snapshots and Lattice Agreement
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice AgreementSafety-critical Systems Symposium (SSS), 2020
Hagit Attiya
S. Kumari
Archit Somani
J. Welch
280
11
0
17 Mar 2020
Fine-grained Analysis on Fast Implementations of Distributed
  Multi-writer Atomic Registers
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic RegistersACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020
Kaile Huang
Yu Huang
Hengfeng Wei
346
4
0
22 Jan 2020
Faster asynchronous MST and low diameter tree construction with
  sublinear communication
Faster asynchronous MST and low diameter tree construction with sublinear communication
A. Mashreghi
Valerie King
172
12
0
28 Jul 2019
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning
  Trees
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
369
9
0
23 Jul 2016
1
Page 1 of 1