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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642222115, 9783642222122

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful

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

10.1007/978-3-642-22212-2_1 ◽

2011 ◽

pp. 1-14 ◽

Cited By ~ 6

Author(s):

Colin Cooper

Keyword(s):

Random Walks ◽

Dynamic Networks ◽

Interacting Particles

Download Full-text

Multiparty Equality Function Computation in Networks with Point-to-Point Links

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

10.1007/978-3-642-22212-2_23 ◽

2011 ◽

pp. 258-269 ◽

Cited By ~ 3

Author(s):

Guanfeng Liang ◽

Nitin Vaidya

Keyword(s):

Function Computation ◽

Point To Point

Download Full-text

The Cover Times of Random Walks on Hypergraphs

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

10.1007/978-3-642-22212-2_19 ◽

2011 ◽

pp. 210-221 ◽

Cited By ~ 2

Author(s):

Colin Cooper ◽

Alan Frieze ◽

Tomasz Radzik

Keyword(s):

Random Walks ◽

Cover Times

Download Full-text

Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing

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

10.1007/978-3-642-22212-2_5 ◽

2011 ◽

pp. 42-53 ◽

Cited By ~ 1

Author(s):

Heinrich Moser ◽

Ulrich Schmid

Keyword(s):

Real Time ◽

Distributed Algorithms ◽

Fault Tolerant ◽

Real Time Computing

Download Full-text

Social Context Congestion Games

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

10.1007/978-3-642-22212-2_25 ◽

2011 ◽

pp. 282-293 ◽

Cited By ~ 2

Author(s):

Vittorio Bilò ◽

Alessandro Celi ◽

Michele Flammini ◽

Vasco Gallotti

Keyword(s):

Social Context ◽

Congestion Games

Download Full-text

SINR Maps: Properties and Applications

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

10.1007/978-3-642-22212-2_2 ◽

2011 ◽

pp. 15-16

Author(s):

David Peleg

Download Full-text

Improving the Optimal Bounds for Black Hole Search in Rings

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

10.1007/978-3-642-22212-2_18 ◽

2011 ◽

pp. 198-209 ◽

Cited By ~ 6

Author(s):

Balasingham Balamohan ◽

Paola Flocchini ◽

Ali Miri ◽

Nicola Santoro

Keyword(s):

Black Hole ◽

Optimal Bounds

Download Full-text

Convergence with Limited Visibility by Asynchronous Mobile Robots

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

10.1007/978-3-642-22212-2_12 ◽

2011 ◽

pp. 125-137 ◽

Cited By ~ 11

Author(s):

Branislav Katreniak

Keyword(s):

Mobile Robots ◽

Limited Visibility

Download Full-text

Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model

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

10.1007/978-3-642-22212-2_8 ◽

2011 ◽

pp. 78-88 ◽

Cited By ~ 1

Author(s):

Sun-Yuan Hsieh ◽

Chi-Ya Kao

Keyword(s):

Conditional Diagnosability

Download Full-text

Self-stabilizing Hierarchical Construction of Bounded Size Clusters

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

10.1007/978-3-642-22212-2_6 ◽

2011 ◽

pp. 54-65 ◽

Cited By ~ 6

Author(s):

Alain Bui ◽

Simon Clavière ◽

Ajoy K. Datta ◽

Lawrence L. Larmore ◽

Devan Sohier

Keyword(s):

Bounded Size

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful

Multiparty Equality Function Computation in Networks with Point-to-Point Links

The Cover Times of Random Walks on Hypergraphs

Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing

Social Context Congestion Games

SINR Maps: Properties and Applications

Improving the Optimal Bounds for Black Hole Search in Rings

Convergence with Limited Visibility by Asynchronous Mobile Robots

Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model

Self-stabilizing Hierarchical Construction of Bounded Size Clusters

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