MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Burkhard Monien" – sorted by Relevance.

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

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

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

ATOM

Parallel Sparse Cholesky Factorization
by Burkhard Monien, Jürgen Schulze
…Parallel Sparse Cholesky Factorization Burkhard Monien and Jurgen Schulze University of Paderborn…
Add To MetaCart

Load balancing of indivisible unit size tokens in dynamic and heterogeneous networks
by Burkhard Monien, Stefan Schamberger — 2004 — Proc. of ESA’04
… Elsa"sser, Burkhard Monien, and Stefan Schamberger Institute for Computer Science University…
Cited by 6 (3 self) – Add To MetaCart

Upper Bounds on the Bisection Width of 3- and 4-regular Graphs
by Burkhard Monien, Robert Preis — 2001 — in Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001
…Upper Bounds on the Bisection Width of 3- and 4-regular Graphs Burkhard Monien and Robert Preis…
Cited by 8 (2 self) – Add To MetaCart

Load balancing in dynamic networks
by Burkhard Monien, Stefan Schamberger — 2004 — In I–SPAN
… Load Balancing in Dynamic Networks \Lambda Robert Elsa"sser Burkhard Monien Stefan Schamberger…
Cited by 4 (3 self) – Add To MetaCart

A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance
by Reinhard Lüling, Burkhard Monien — 1993 — In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures
… Burkhard Monien Department of Mathematics and Computer Science University of Paderborn, Germany e…
Cited by 36 (5 self) – Add To MetaCart

A Local Graph Partitioning Heuristic Meeting Bisection Bounds (Extended Abstract)
by Burkhard Monien, Ralf Diekmann — 1997 — 8th SIAM Conf. on Parallel Processing for Scientific Computing (PP'97
… Partitioning Heuristic Meeting Bisection Bounds Burkhard Monien y Ralf Diekmann y Extended Abstract…
Cited by 13 (3 self) – Add To MetaCart

Using Helpful Sets to Improve Graph Bisections
by Ralf Diekmann, Burkhard Monien, Robert Preis — 1995 — Univ. of Paderborn
… 1994 Using Helpful Sets to Improve Graph Bisections Ralf Diekmann , Burkhard Monien and Robert…
Cited by 33 (20 self) – Add To MetaCart

Efficient Schemes for Nearest Neighbor Load Balancing
by Ralf Diekmann, Andreas Frommer, Burkhard Monien — 1998
… and Burkhard Monien y y Department of Mathematics and Computer Science University of Paderborn, Furstenallee…
Cited by 31 (13 self) – Add To MetaCart

Diffusion schemes for load balancing on heterogeneous networks
by Robert Elsässer, Burkhard Monien, Robert Preis — 2002 — Theory of Computing Systems
…Diusion Schemes for Load Balancing on Heterogeneous Networks Robert Elsasser, Burkhard Monien…
Cited by 13 (7 self) – Add To MetaCart

Simulating Binary Trees on Hypercubes
by Burkhard Monien, I. Hal Sudborough — 1988 — in: Proceedings Third Aegan Workshop on Computing, Lecture Notes Computer Science 319
…Simulating Binary Trees on Hypercubes Burkhard Monien y Dep. of Mathematics and Computer Science…
Cited by 13 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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