Aditya Biradavolu
Abstract
The 32nd International Symposium on Distributed Computing, DISC 2018 was held in New Orleans, USA, from October 15-19, 2018. The conference took place at the Hampton Inn & Suites New Orleans-Convention Center and was organized by Costas Busch of Louisiana State University. The conference included two workshops and three days of main conference this year.
- Reuven Bar-Yehuda, Oded Goldreich, Alon Itai: On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. PODC 1987: 98--108 Google Scholar
Digital Library
- Gregory V. Chockler, Alexey Gotsman: Multi-Shot Distributed Transaction Commit. DISC 2018: 14:1--14:18Google Scholar
- Alon Berger, Idit Keidar, Alexander Spiegelman: Integrated Bounds for Disintegrated Storage. DISC 2018: 11:1--11:18Google Scholar
- James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel: Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC 2018: 8:1--8:17Google Scholar
- Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry: Redundancy in Distributed Proofs. DISC 2018: 24:1--24:18Google Scholar
- Mohsen Gha ari, Fabian Kuhn: Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. DISC 2018: 30:1--30:12Google Scholar
- Ali Mashreghi, Valerie King: Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. DISC 2018: 37:1--37:17Google Scholar
- Fabien Dufoulon, Janna Burman, Jo roy Beauquier: Beeping a Deterministic Time-Optimal Leader Election. DISC 2018: 20:1--20:17Google Scholar
- Yehuda Afek, Shaked Rafaeli, Moshe Sulamy: The Role of A-priori Information in Networks of Rational Agents. DISC 2018: 5:1--5:18Google Scholar
- Petra Berenbrink, Robert Elsasser, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik: A Population Protocol for Exact Majority with O(log5=3n) Stabilization Time and Θ(logn) States. DISC 2018: 10:1--10:18Google Scholar
- Calvin Newport, Peter Robinson: Fault-Tolerant Consensus with an Abstract MAC Layer. DISC 2018: 38:1--38:20Google Scholar
- Artur Czumaj, Christian Konrad: Detecting Cliques in CONGEST Networks. DISC 2018: 16:1--16:15Google Scholar
- Merav Parter, Eylon Yogev: Congested Clique Algorithms for Graph Spanners. DISC 2018: 40:1--40:18Google Scholar
Recommendations
SPAA 2018 Review
The 2018 ACM Symposium on Parallelism in Algorithms and Architectures was held on July 1618 in Vienna, Austria. The conference took place on the TU Wien campus in the Engineering building, an ideal location that was walking distance to central Vienna as ...
Hydromagnetic analogue of the rotating disc problem
RésuméOn a étudié un mouvement magnétohydrodynamique de Stokes, valable pour un nombre de Hartmann quelconque, du problème d'un disque en rotation dans un champ magnétique uniforme et parallèle à son axe.
Comments