MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ralf Klasing" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

21 documents found, showing 1 through 10. Next 10 →

ATOM

The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width (Extended Abstract)
by Ralf Klasing — 1994 — In Proc. 19th Int. Symp. on Mathematical Foundations of Computer Science
… Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width ? (Extended Abstract) Ralf Klasing…
Cited by 3 (0 self) – Add To MetaCart

CONTENTS Abbreviations
by Aris Papadopoulos, Supervised Dr, Ralf Klasing, Academic Year — 2002
… Networks by Aris Papadopoulos Student ID: 0127028 MSc in Advanced Computing Supervised by Dr. Ralf Klasing…
Add To MetaCart

Gathering asynchronous oblivious mobile robots in a ring
by Ralf Klasing, Euripides Markou, Andrzej Pelc — 2006 — Proc. 17th International Symposium on Algorithms and Computation (ISAAC
… oblivious mobile robots in a ring Ralf Klasing, Euripides Markou, Andrzej Pelc January 2007 Gathering…
Cited by 1 (1 self) – Add To MetaCart

Dominating Sets in Web Graphs
by Colin Cooper, Ralf Klasing, Michele Zito — 2004 — in "Proceedings of the Third Workshop on Algorithms and Models for the Web-Graph (WAW 2004)", Lecture Notes in Computer Science
…Dominating Sets in Web Graphs Colin Cooper 1 , Ralf Klasing 2⋆ , and Michele Zito 3 1 Department…
Cited by 3 (1 self) – Add To MetaCart

Lower bounds and algorithms for dominating sets in web graphs
by Colin Cooper, Ralf Klasing, Michele Zito — 2005 — Internet Mathematics
… Graphs Colin Cooper, Ralf Klasing, and Michele Zito Abstract. In this paper we study the size…
Cited by 2 (1 self) – Add To MetaCart

Compressing Cube-Connected Cycles and Butterfly Networks
by Ralf Klasing, Reinhard Lüling, Burkhard Monien — 1990 — Proc. 2nd IEEE Symposium on Parallel and Distributed Processing
…Compressing Cube-Connected Cycles and Butterfly Networks y Ralf Klasing, Reinhard Luling…
Cited by 4 (4 self) – Add To MetaCart

Hardness and approximation results for black hole search in arbitrary graphs
by Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco — 2005 — In Proc. 12th Coll. on Structural Information and Communication complexity (SIROCCO’05
…Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs ⋆ Ralf Klasing…
Cited by 11 (3 self) – Add To MetaCart

Approximation bounds for Black Hole Search problems
by Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco — 2005 — in "Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005)", Lecture Notes in Computer Science
…Approximation bounds for Black Hole Search problems ⋆ Ralf Klasing ⋆⋆ , Euripides Markou…
Cited by 3 (1 self) – Add To MetaCart

Dissemination Of Information In Interconnection Networks (Broadcasting & Gossiping)
by Juraj Hromkovic, Ralf Klasing, Burkhard Monien, Regine Peine — 1996
… DISSEMINATION OF INFORMATION IN INTERCONNECTION NETWORKS (BROADCASTING & GOSSIPING) Juraj Hromkovic y , Ralf…
Cited by 83 (7 self) – Add To MetaCart

Methods and Problems of Wavelength-Routing in All-Optical Networks
by Ralf Klasing Department, Ralf Klasing, Coventry Cv Al — 1998
…Methods and Problems of Wavelength-Routing in All-Optical Networks Ralf Klasing Department…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB