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.

783 Publications


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

1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204). https://doi.org/10.1007/3-540-48447-7_20
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18965
Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (1999). 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 (pp. 165–174). https://doi.org/10.1145/305619.305637
LibreCat | DOI
 

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

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

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

1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell. https://doi.org/10.1007/978-3-662-01069-3_47
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
LibreCat | DOI
 

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

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

1998 | Book Chapter | LibreCat-ID: 17412
Fischer, M., Lukovszki, T., & Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_14
LibreCat | Files available | DOI
 

1998 | Conference Paper | LibreCat-ID: 17863
Fischer, M., Lukovszki, T., & Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International Workshop, {WAE ’98} (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.
LibreCat | Files available
 

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

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

1998 | Journal Article | LibreCat-ID: 2168
Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
LibreCat | DOI
 

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

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

1998 | Book | LibreCat-ID: 2185
Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 196, 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6
LibreCat | DOI
 

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

1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 16563
Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K., … Vöcking, B. (1998). 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. https://doi.org/10.1145/276698.276790
LibreCat | DOI
 

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

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

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

1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, A., & Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). https://doi.org/10.1007/3-540-63397-9_9
LibreCat | DOI
 

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

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

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

1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).
LibreCat | Files available
 

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

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

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

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

1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002716
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97. https://doi.org/10.1145/258492.258522
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002741
LibreCat | DOI
 

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

1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_22
LibreCat | DOI
 

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

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

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

1996 | Conference Paper | LibreCat-ID: 17483
Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27). Amsterdam: IOS Press.
LibreCat | Files available
 

1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg. https://doi.org/10.1007/bfb0024725
LibreCat | DOI
 

1996 | Report | LibreCat-ID: 18352
Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn.
LibreCat | Files available
 

1996 | Dissertation | LibreCat-ID: 2181
Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.
LibreCat
 

1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
LibreCat | DOI
 

1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.
LibreCat | Files available
 

1996 | Journal Article | LibreCat-ID: 16698
Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630. https://doi.org/10.1007/bf03036467
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427. https://doi.org/10.1007/bf01955042
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955. https://doi.org/10.1137/s0097539793255722
LibreCat | DOI
 

1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
LibreCat | DOI
 

1995 | Dissertation | LibreCat-ID: 19623
Stemann, V. (1995). Contention Resolution in Hashing Based Shared Memory Simulations (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat
 

1995 | Dissertation | LibreCat-ID: 19627
Czumaj, A. (1995). Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat | Files available
 

1995 | Dissertation | LibreCat-ID: 19630
Wachsmann, A. (1995). Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher (Vol. 6). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat
 

1995 | Dissertation | LibreCat-ID: 19634
Ameur, F. (1995). Space-Bounded Learning Algorithms (Vol. 10). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 17482
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Simulating shared memory in real time: On the computation power of reconfigurable meshes. In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures (pp. 46--59).
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 

1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
LibreCat | Files available
 

1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat | Files available
 

1995 | Journal Article | LibreCat-ID: 16566
Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95. https://doi.org/10.1145/215399.215430
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. Proceedings Third Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131
LibreCat | DOI
 

1994 | Dissertation | LibreCat-ID: 19624
Wanka, R. (1994). Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn.
LibreCat | Files available
 

1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094
LibreCat | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide, F., Monien, B., & Rosenberg, A. L. (Eds.). (1993). Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-56731-3
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 17479
Kastens, U., Meyer auf der Heide, F., Wachsmann, A., & Wichmann, F. (1993). OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In Proc. 3rd PASA Workshop, PARS Mitteilungen (pp. 50–55).
LibreCat
 

1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93. https://doi.org/10.1145/165231.165246
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
LibreCat | DOI
 

1992 | Journal Article | LibreCat-ID: 18936
Kutylowski, M., & Wanka, R. (1992). Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2, 213–220. https://doi.org/10.1142/s0129626492000349
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92. https://doi.org/10.1145/129712.129743
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029630
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100229
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1990). Not all keys can be hashed in constant time. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100247
LibreCat | DOI
 

1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232.
LibreCat
 

1989 | Journal Article | LibreCat-ID: 16743
Just, B., Meyer auf der Heide, F., & Wigderson, A. (1989). On computations with integer division. RAIRO - Theoretical Informatics and Applications, 101–111. https://doi.org/10.1051/ita/1989230101011
LibreCat | DOI
 

1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., & Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89. https://doi.org/10.1145/72935.72974
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028969
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, F., & Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028978
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg. https://doi.org/10.1007/bfb0028983
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed