The following pages link to Akka Zemmari (Q975421):
Displaying 33 items.
- (Q259058) (redirect page) (← links)
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Uniform election in trees and polyominoids (Q708324) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- On handshakes in random graphs (Q975422) (← links)
- Analysis of a randomized rendezvous algorithm (Q1398376) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) (Q1660914) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Locally guided randomized elections in trees: The totally fair case (Q1775889) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- Randomized local elections. (Q1853021) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- Counting in one-hop beeping networks (Q2420611) (← links)
- Broadcast in the rendezvous model (Q2495650) (← links)
- A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes (Q2787432) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Q2938103) (← links)
- (Q3077352) (← links)
- Design Patterns in Beeping Algorithms. (Q3174939) (← links)
- (Q3176602) (← links)
- Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms (Q3179391) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- (Q4502595) (← links)
- (Q4524581) (← links)
- RDA: A Coq Library to Reason about Randomised Distributed Algorithms in the Message Passing Model (Q4621204) (← links)
- Merging Time of Random Mobile Agents (Q5198497) (← links)
- STACS 2004 (Q5309731) (← links)
