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


2000 | Book Chapter | LibreCat-ID: 16497
F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 16345
F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,” ForschungsForum Paderborn, pp. 112–116, 2000.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 19732
O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university BSP (PUB) library-design, implementation and performance,” in Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 2151
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2164 | OA
P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2165 | OA
P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 17864
M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18747
C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.
LibreCat
 

1999 | Dissertation | LibreCat-ID: 18942
T. Lukovszki, New Results on Geometric Spanners and Their Applications, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18959
T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18965
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data management in networks: experimental evaluation of a provably good strategy,” in Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99, 1999, pp. 165–174.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18576
C. Sohler, “Generating Random Star-Shaped Polygons,” in Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 2210 | OA
P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2166 | OA
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 16501
F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 16502
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999.
LibreCat | DOI
 

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

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

1998 | Dissertation | LibreCat-ID: 19639
B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat | Files available
 

1998 | Report | LibreCat-ID: 19735
O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.
LibreCat | Files available
 

1998 | Book Chapter | LibreCat-ID: 17412
M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat | Files available | DOI
 

1998 | Conference Paper | LibreCat-ID: 17863
M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 1998, pp. 133--142.
LibreCat | Files available
 

1998 | Report | LibreCat-ID: 18145
M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998.
LibreCat
 

1998 | Dissertation | LibreCat-ID: 18445
B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn, 1998.
LibreCat
 

1998 | Journal Article | LibreCat-ID: 2168
C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 2169 | OA
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
LibreCat | Files available
 

1998 | Conference Paper | LibreCat-ID: 2170 | OA
U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.
LibreCat | Files available
 

1998 | Book | LibreCat-ID: 2185
C. Scheideler, Universal Routing Strategies for Interconnection Networks, vol. 1390. 1998.
LibreCat | DOI
 

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

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

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

1998 | Conference Paper | LibreCat-ID: 16563
R. Cole et al., “Randomized protocols for low-congestion circuit routing in multistage interconnection networks,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98, 1998.
LibreCat | DOI
 

1997 | Dissertation | LibreCat-ID: 19631
A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19636
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19637
W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 19869
A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: 10.1007/3-540-63397-9_9.
LibreCat | DOI
 

1997 | Report | LibreCat-ID: 18955
W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 18575
C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
 

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

1997 | Conference Paper | LibreCat-ID: 2179 | OA
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.
LibreCat | Files available
 

1997 | Journal Article | LibreCat-ID: 16564
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.
LibreCat | DOI
 

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

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

1997 | Conference Paper | LibreCat-ID: 16568
M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.
LibreCat | DOI
 

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

1997 | Conference Paper | LibreCat-ID: 16604
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97, 1997.
LibreCat | DOI
 

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

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

1997 | Conference Paper | LibreCat-ID: 16689
B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed