scientific article; zbMATH DE number 7561283
From MaRDI portal
Publication:5090923
DOI10.4230/LIPICS.DISC.2018.31MaRDI QIDQ5090923FDOQ5090923
Authors: Mohsen Ghaffari, Jason Li 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.04764
Title of this publication is not available (Why is that?)
Recommendations
- New classes of distributed time complexity
- scientific article; zbMATH DE number 4050992
- Efficient distributed algorithms by using the archimedean time assumption
- Near-optimal scheduling of distributed algorithms
- Some distributed algorithms revisited
- Distributed MST and routing in almost mixing time
- New approaches to deriving parallel algorithms
- scientific article; zbMATH DE number 2107027
- Transience bounds for distributed algorithms
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Distributed Computing: A Locality-Sensitive Approach
- The probabilistic method
- Efficient PRAM simulation on a distributed memory machine
- Parallel Prefix Computation
- Title not available (Why is that?)
- Parallelism in random access machines
- The cover time of the giant component of a random graph
- Distributed algorithms for random graphs
- The hyperring: a low-congestion deterministic data structure for distributed environments
- The complexity of deterministic PRAM simulation on distributed memory machines
- Distributed MST and routing in almost mixing time
- A unified approach to models of synchronous parallel machines
- Time Bounded Random Access Machines with Parallel Processing
- An efficient parallel solver for SDD linear systems
- Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut
- Xheal, localized self-healing using expanders
- Generalized preconditioning and undirected minimum-cost flow
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
Cited In (7)
- Low-congestion shortcut and graph parameters
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Distributed MST and routing in almost mixing time
- New classes of distributed time complexity
- A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
- Deterministic near-optimal distributed listing of cliques
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090923)
