Structural Information and Communication Complexity - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 21)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030795269, 9783030795276

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Epigenetic Consensus Problem

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_9 ◽

2021 ◽

pp. 146-163

Author(s):

Sabrina Rashid ◽

Gadi Taubenfeld ◽

Ziv Bar-Joseph

Keyword(s):

Consensus Problem

Download Full-text

Two-Agent Tree Evacuation

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_12 ◽

2021 ◽

pp. 204-221

Author(s):

Henri Devillez ◽

Béni Egressy ◽

Robin Fritsch ◽

Roger Wattenhofer

Download Full-text

Superfast Coloring in CONGEST via Efficient Color Sampling

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_5 ◽

2021 ◽

pp. 68-83

Author(s):

Magnús M. Halldórsson ◽

Alexandre Nolin

Download Full-text

Testing Equality Under the Local Broadcast Model

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_15 ◽

2021 ◽

pp. 262-276

Author(s):

Muhammad Samir Khan ◽

Nitin H. Vaidya

Keyword(s):

Local Broadcast

Download Full-text

Distributed Detection of Clusters of Arbitrary Size

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_21 ◽

2021 ◽

pp. 370-387

Author(s):

Bogdan-Adrian Manghiuc

Keyword(s):

Distributed Detection ◽

Arbitrary Size

Download Full-text

Wait-Free Approximate Agreement on Graphs

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_6 ◽

2021 ◽

pp. 87-105

Author(s):

Dan Alistarh ◽

Faith Ellen ◽

Joel Rybicki

Download Full-text

Fault-Tolerant Distance Labeling for Planar Graphs

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_18 ◽

2021 ◽

pp. 315-333

Author(s):

Aviv Bar-Natan ◽

Panagiotis Charalampopoulos ◽

Paweł Gawrychowski ◽

Shay Mozes ◽

Oren Weimann

Keyword(s):

Planar Graphs ◽

Fault Tolerant ◽

Distance Labeling

Download Full-text

Threshold-Based Network Structural Dynamics

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_8 ◽

2021 ◽

pp. 127-145

Author(s):

Evangelos Kipouridis ◽

Paul G. Spirakis ◽

Kostas Tsichlas

Keyword(s):

Structural Dynamics

Download Full-text

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_13 ◽

2021 ◽

pp. 222-239

Author(s):

Barun Gorain ◽

Kaushik Mondal ◽

Himadri Nayak ◽

Supantha Pandit

Download Full-text

GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-79527-6_14 ◽

2021 ◽

pp. 243-261

Author(s):

Giacomo Giuliari ◽

Marc Wyss ◽

Markus Legner ◽

Adrian Perrig

Keyword(s):

Resource Allocation ◽

Pareto Optimal ◽

Distributed Resource Allocation ◽

Resource Allocation Algorithm ◽

Allocation Algorithm

Download Full-text

Structural Information and Communication Complexity - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

The Epigenetic Consensus Problem

Two-Agent Tree Evacuation

Superfast Coloring in CONGEST via Efficient Color Sampling

Testing Equality Under the Local Broadcast Model

Distributed Detection of Clusters of Arbitrary Size

Wait-Free Approximate Agreement on Graphs

Fault-Tolerant Distance Labeling for Planar Graphs

Threshold-Based Network Structural Dynamics

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs

GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm

Structural Information and Communication Complexity - Lecture Notes in Computer Science
Latest Publications