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

9783540222309, 9783540277965

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

F-Chord: Improved Uniform Routing on Chord

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

10.1007/978-3-540-27796-5_9 ◽

2004 ◽

pp. 89-98 ◽

Cited By ~ 10

Author(s):

Gennaro Cordasco ◽

Luisa Gargano ◽

Mikael Hammar ◽

Alberto Negro ◽

Vittorio Scarano

Download Full-text

Two-Hop Virtual Path Layout in Tori

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

10.1007/978-3-540-27796-5_7 ◽

2004 ◽

pp. 69-78 ◽

Cited By ~ 3

Author(s):

Sébastien Choplin ◽

Lata Narayanan ◽

Jaroslav Opatrny

Keyword(s):

Virtual Path

Download Full-text

Asynchronous Broadcast in Radio Networks

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

10.1007/978-3-540-27796-5_6 ◽

2004 ◽

pp. 57-68 ◽

Cited By ~ 5

Author(s):

Bogdan S. Chlebus ◽

Mariusz A. Rokicki

Keyword(s):

Radio Networks

Download Full-text

On Approximability of the Independent Set Problem for Low Degree Graphs

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

10.1007/978-3-540-27796-5_5 ◽

2004 ◽

pp. 47-56 ◽

Cited By ~ 1

Author(s):

Miroslav Chlebík ◽

Janka Chlebíková

Keyword(s):

Independent Set ◽

Independent Set Problem ◽

Low Degree

Download Full-text

Approximation Algorithm for Hotlink Assignment in the Greedy Model

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

10.1007/978-3-540-27796-5_21 ◽

2004 ◽

pp. 233-244 ◽

Cited By ~ 3

Author(s):

Rachel Matichin ◽

David Peleg

Keyword(s):

Approximation Algorithm

Download Full-text

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach

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

10.1007/978-3-540-27796-5_18 ◽

2004 ◽

pp. 197-208 ◽

Cited By ~ 2

Author(s):

Arvind Gupta ◽

Ján Maňuch ◽

Ladislav Stacho

Keyword(s):

Design Theory ◽

Fault Tolerant ◽

Theory Approach

Download Full-text

Robot Convergence via Center-of-Gravity Algorithms

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

10.1007/978-3-540-27796-5_8 ◽

2004 ◽

pp. 79-88 ◽

Cited By ~ 40

Author(s):

Reuven Cohen ◽

David Peleg

Keyword(s):

Center Of Gravity

Download Full-text

Improved Bounds for Optimal Black Hole Search with a Network Map

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

10.1007/978-3-540-27796-5_11 ◽

2004 ◽

pp. 111-122 ◽

Cited By ~ 20

Author(s):

Stefan Dobrev ◽

Paola Flocchini ◽

Nicola Santoro

Keyword(s):

Black Hole

Download Full-text

Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks

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

10.1007/978-3-540-27796-5_19 ◽

2004 ◽

pp. 209-220

Author(s):

Flaminia L. Luccio ◽

Jop F. Sibeyn

Keyword(s):

Vertex Sets

Download Full-text

Existence of Nash Equilibria in Selfish Routing Problems

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

10.1007/978-3-540-27796-5_14 ◽

2004 ◽

pp. 149-160 ◽

Cited By ~ 2

Author(s):

Alessandro Ferrante ◽

Mimmo Parente

Keyword(s):

Nash Equilibria ◽

Selfish Routing ◽

Routing Problems

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

F-Chord: Improved Uniform Routing on Chord

Two-Hop Virtual Path Layout in Tori

Asynchronous Broadcast in Radio Networks

On Approximability of the Independent Set Problem for Low Degree Graphs

Approximation Algorithm for Hotlink Assignment in the Greedy Model

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach

Robot Convergence via Center-of-Gravity Algorithms

Improved Bounds for Optimal Black Hole Search with a Network Map

Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks

Existence of Nash Equilibria in Selfish Routing Problems

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