Congratulations to Georges Giakkoupis for his two papers accepted at ACM PODC 2023.
The two papers are as follows:
- Word-Size RMR Trade-offs for Recoverable Mutual Exclusion by David Yu Cheng Chan (University of Calgary), George Giakkoupis and Philipp Woelfel (University of Calgary): The paper presents a tight lower bound on the time complexity of recoverable mutual exclusion algorithms, as a function of the memory word size. This lower bound is the first one that does not restrict the type of atomic operations that can be executed on a memory location.
- Distributed Self-Stabilizing MIS with Few States and Weak Communication by George Giakkoupis and Isabella Ziccardi (University of Bocconi): This paper studies very simple distributed algorithms for computing a maximal independent set in a graph. The algorithms are self-stabilizing, use constant state (and constant randomness), use very limited synchronous communication, and require no IDs or any global information about the graph. The main result is an algorithm stabilizing in a poly-logarithmic number of rounds in all random graphs.
ACM PODC 2023 will take place from June 19-23, 2023, at Orlando, Florida. More details here: https://www.podc.org/podc2023/call-for-papers/
