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 International Publishing

9783319096193, 9783319096209

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism

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

10.1007/978-3-319-09620-9_8 ◽

2014 ◽

pp. 83-95 ◽

Cited By ~ 9

Author(s):

Florent Becker ◽

Pedro Montealegre ◽

Ivan Rapaport ◽

Ioan Todinca

Keyword(s):

Communication Model

Download Full-text

Communication Complexity Lower Bounds in Distributed Message-Passing

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

10.1007/978-3-319-09620-9_2 ◽

2014 ◽

pp. 14-17 ◽

Cited By ~ 3

Author(s):

Rotem Oshman

Keyword(s):

Lower Bounds ◽

Message Passing ◽

Communication Complexity ◽

Complexity Lower Bounds

Download Full-text

Oblivious Rendezvous in Cognitive Radio Networks

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

10.1007/978-3-319-09620-9_14 ◽

2014 ◽

pp. 165-179 ◽

Cited By ~ 4

Author(s):

Zhaoquan Gu ◽

Qiang-Sheng Hua ◽

Yuexuan Wang ◽

Francis Chi Moon Lau

Keyword(s):

Cognitive Radio ◽

Cognitive Radio Networks ◽

Radio Networks

Download Full-text

Secluded Path via Shortest Path

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

10.1007/978-3-319-09620-9_10 ◽

2014 ◽

pp. 108-120 ◽

Cited By ~ 2

Author(s):

Matthew P. Johnson ◽

Ou Liu ◽

George Rabanca

Keyword(s):

Shortest Path

Download Full-text

Distributed Transactional Contention Management as the Traveling Salesman Problem

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

10.1007/978-3-319-09620-9_6 ◽

2014 ◽

pp. 54-67 ◽

Cited By ~ 6

Author(s):

Bo Zhang ◽

Binoy Ravindran ◽

Roberto Palmieri

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

Contention Management ◽

The Traveling Salesman Problem

Download Full-text

Distributed Algorithmic Foundations of Dynamic Networks

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

10.1007/978-3-319-09620-9_3 ◽

2014 ◽

pp. 18-22 ◽

Cited By ~ 3

Author(s):

Gopal Pandurangan

Keyword(s):

Dynamic Networks

Download Full-text

What Do We Need to Know to Elect in Networks with Unknown Participants?

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

10.1007/978-3-319-09620-9_22 ◽

2014 ◽

pp. 279-294 ◽

Cited By ~ 3

Author(s):

Jérémie Chalopin ◽

Emmanuel Godard ◽

Antoine Naudin

Download Full-text

How Many Ants Does It Take to Find the Food?

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

10.1007/978-3-319-09620-9_21 ◽

2014 ◽

pp. 263-278 ◽

Cited By ~ 3

Author(s):

Yuval Emek ◽

Tobias Langner ◽

David Stolz ◽

Jara Uitto ◽

Roger Wattenhofer

Download Full-text

Randomized Lower Bound for Distributed Spanning-Tree Verification

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

10.1007/978-3-319-09620-9_12 ◽

2014 ◽

pp. 137-148 ◽

Cited By ~ 1

Author(s):

Taisuke Izumi

Keyword(s):

Lower Bound ◽

Spanning Tree

Download Full-text

Algorithmic Aspects of Resource Management in the Cloud

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

10.1007/978-3-319-09620-9_1 ◽

2014 ◽

pp. 1-13

Author(s):

Sebastian Kniesburges ◽

Christine Markarian ◽

Friedhelm Meyer auf der Heide ◽

Christian Scheideler

Keyword(s):

Resource Management

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism

Communication Complexity Lower Bounds in Distributed Message-Passing

Oblivious Rendezvous in Cognitive Radio Networks

Secluded Path via Shortest Path

Distributed Transactional Contention Management as the Traveling Salesman Problem

Distributed Algorithmic Foundations of Dynamic Networks

What Do We Need to Know to Elect in Networks with Unknown Participants?

How Many Ants Does It Take to Find the Food?

Randomized Lower Bound for Distributed Spanning-Tree Verification

Algorithmic Aspects of Resource Management in the Cloud

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