SIROCCO B

22 papers

YearTitle / Authors
2021A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems.
Sergio Rajsbaum
2021Approximate Minimum Directed Spanning Trees Under Congestion.
Christoph Lenzen, Hossein Vahidi
2021Collecting Coupons is Faster with Friends.
Dan Alistarh, Peter Davies
2021Constant Round Distributed Domination on Graph Classes with Bounded Expansion.
Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny
2021Distributed Algorithms for Fractional Coloring.
Nicolas Bousquet, Louis Esperet, François Pirot
2021Distributed Detection of Clusters of Arbitrary Size.
Bogdan-Adrian Manghiuc
2021Distributed Graph Problems Through an Automata-Theoretic Lens.
Yi-Jun Chang, Jan Studený, Jukka Suomela
2021Fault-Tolerant Distance Labeling for Planar Graphs.
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021Fragmented Objects: Boosting Concurrency of Shared Large Objects.
Antonio Fernández Anta, Chryssis Georgiou, Theophanis Hadjistasi, Nicolas Nicolaou, Efstathios Stavrakis, Andria Trigeorgi
2021GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm.
Giacomo Giuliari, Marc Wyss, Markus Legner, Adrian Perrig
2021Graph Exploration by Energy-Sharing Mobile Agents.
Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende
2021Near-Optimal Scheduling in the Congested Clique.
Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin
2021New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem.
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
2021Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings
Tomasz Jurdzinski, Stefan Schmid
2021Superfast Coloring in CONGEST via Efficient Color Sampling.
Magnús M. Halldórsson, Alexandre Nolin
2021Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities.
Volker Turau
2021Testing Equality Under the Local Broadcast Model.
Muhammad Samir Khan, Nitin H. Vaidya
2021The Epigenetic Consensus Problem.
Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph
2021Threshold-Based Network Structural Dynamics.
Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas
2021Two-Agent Tree Evacuation.
Henri Devillez, Béni Egressy, Robin Fritsch, Roger Wattenhofer
2021Wait-Free Approximate Agreement on Graphs.
Dan Alistarh, Faith Ellen, Joel Rybicki