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.
792 Publications
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
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
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
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
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
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.
1997 | Dissertation | LibreCat-ID: 19631
Communication Efficient Parallel Searching
A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
1997 | Dissertation | LibreCat-ID: 19636
Communication and I/O Efficient Parallel Data Structures
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
1997 | Dissertation | LibreCat-ID: 19637
Bounded Degree Spanning Trees
W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
| Files available
W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
1997 | Conference Paper | LibreCat-ID: 19869
Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat
| DOI
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
1997 | Report | LibreCat-ID: 18955
Decremental Biconnectivity on Planar Graphs
W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.
LibreCat
| Files available
W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.
1997 | Conference Paper | LibreCat-ID: 18575
Encoding a Triangulation as a Permutation of its Point Set
C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
1997 | Conference Paper | LibreCat-ID: 2175 |
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
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
1997 | Conference Paper | LibreCat-ID: 2179 |
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat
| Files available
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
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
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.
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
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.
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
F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.
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
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.
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
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
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
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.
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
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
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
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
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
B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.
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
F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.
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
F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.
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
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.
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
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.
1996 | Conference Paper | LibreCat-ID: 17483
A Realistic Cost Model for the Communication Time in Parallel Programs
M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.
LibreCat
| Files available
M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.
1996 | Book Chapter | LibreCat-ID: 17564
Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
LibreCat
| DOI
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
1996 | Report | LibreCat-ID: 18352
A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware
M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996.
LibreCat
| Files available
M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996.
1996 | Dissertation | LibreCat-ID: 2181
Universal routing strategies
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
LibreCat
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
1996 | Journal Article | LibreCat-ID: 2182
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
LibreCat
| DOI
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
1996 | Conference Paper | LibreCat-ID: 2183 |
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
1996 | Conference Paper | LibreCat-ID: 2184 |
Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
1996 | Conference Paper | LibreCat-ID: 2186 |
Universal Algorithms for Store-and-Forward and Wormhole Routing
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
LibreCat
| Files available
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
1996 | Journal Article | LibreCat-ID: 16698
Trial and error. A new approach to space-bounded learning
F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.
LibreCat
| DOI
F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.
1996 | Journal Article | LibreCat-ID: 16699
Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.
LibreCat
| DOI
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.
1996 | Journal Article | LibreCat-ID: 16700
Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
LibreCat
| DOI
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
1996 | Journal Article | LibreCat-ID: 16701
The Tree Model for Hashing: Lower and Upper Bounds
J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.
LibreCat
| DOI
J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.
1996 | Book (Editor) | LibreCat-ID: 16702
Automata, Languages and Programming, 23rd International Colloquium, ICALP96
F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
LibreCat
| DOI
F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
1996 | Book Chapter | LibreCat-ID: 16703
Fault-tolerant shared memory simulations
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
LibreCat
| DOI
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
1995 | Dissertation | LibreCat-ID: 19623
Contention Resolution in Hashing Based Shared Memory Simulations
V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Dissertation | LibreCat-ID: 19627
Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations
A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
| Files available
A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Dissertation | LibreCat-ID: 19630
Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher
A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Dissertation | LibreCat-ID: 19634
Space-Bounded Learning Algorithms
F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Conference Paper | LibreCat-ID: 17482
Simulating shared memory in real time: On the computation power of reconfigurable meshes
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
1995 | Conference Paper | LibreCat-ID: 2187 |
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
LibreCat
| Files available
| DOI
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
1995 | Conference Paper | LibreCat-ID: 2207 |
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
1995 | Conference Paper | LibreCat-ID: 2208 |
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
1995 | Journal Article | LibreCat-ID: 16566
Transforming comparison model lower bounds to the parallel-random-access-machine
D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.
LibreCat
| DOI
D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.
1995 | Book Chapter | LibreCat-ID: 16704
A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
LibreCat
| DOI
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
1995 | Book Chapter | LibreCat-ID: 16705
Shared memory simulations with triple-logarithmic delay
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat
| DOI
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
1995 | Conference Paper | LibreCat-ID: 16706
Optimal trade-offs between size and slowdown for universal parallel networks
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.
LibreCat
| DOI
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.