Filed under: Uncategorized | Tags: algorithms, Byzantine agreement, conferences, distributed computing, PODC, theory
The end of the semester here at UNM just about killed me. In addition to the usual academic hubbub, I hosted a visitor, submitted a paper, finished up the camera ready for our PODC paper, and dealt with my toddler who decided it would be a good couple of weeks to wake up every night at 2am (teething?, headache?, likes a dose of cherry-flavored children’s tylenol as a nightcap?)
The camera-ready of our paper, “Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary” (that I blogged about previously) is now available here. This was probably the most time I’ve spent going from an accepted paper to a camera ready – mostly because the algorithm in the paper consisted of several small parts with many connections between the parts. Hopefully, our new version makes everything much easier to understand.
Some great news we received, right after submitting the camera ready, is that our paper was selected to be in the “best paper session” of PODC. The list of all such papers is below – I know that at least some of these papers will be invited to a special issue of the JACM, and all of them look interesting. The best paper session is a new thing for PODC. I definitely like the idea of having multiple best papers, it gives more information about the assessment of the PC than a single best paper. I’ll probably read through most of these before the conference.
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary
Optimal Gradient Clock Synchronization in Dynamic Networks
Lenzen, Kuhn, Locher, Oshman
Online set packing and competitive scheduling of multi-part tasks
Emek, Halldorsson, Mansour, Patt-Shamir, Radhakrishnan, Rawitz
How to Meet when you Forget: Log-space Rendezvous in Arbitrary Graphs
Czyzowicz, Kosowski, Pelc
A Modular Approach to Shared-memory Consensus, with Applications to the Probabilistic-write Model
Constant RMR Solutions to Reader Writer Synchronization
Leave a Comment so far
Leave a comment