Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

298 Publications


1999 | Book Chapter | LibreCat-ID: 17052
International Workshop on Communication and Data Management in Large Networks
E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
Provably Good and Practical Strategies for Non-uniform Data Management in Networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16503
Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16504
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 16562
Communication-efficient parallel multiway and approximate minimum cut computation
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 16563
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 2175 | OA
Optimal Wormhole Routing in the (n, d)-Torus
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat | Files available
 

1997 | Journal Article | LibreCat-ID: 16564
A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16565
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16567
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16568
Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16569
Static and dynamic data management in networks
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16604
Allocating weighted jobs in parallel
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16605
Communication efficient parallel searching
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16689
Exploiting locality for data management in systems of limited bandwidth
B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16693
Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”
F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 19958
Routing on Networks of Optical Crossbars (Extended Abstract).
F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.
LibreCat
 

1996 | Report | LibreCat-ID: 17418
Contention Resolution in Hashing Based Shared Memory Simulations
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.
LibreCat
 

1996 | Conference Paper | LibreCat-ID: 17419
A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.
LibreCat
 

Filters and Search Terms

(person=15523)

status=public

Search

Filter Publications

Display / Sort

Export / Embed