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.

735 Publications


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

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

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

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

1999 | Conference Paper | LibreCat-ID: 2165
Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.
LibreCat | Files available
 

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

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

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

1999 | Book Chapter | LibreCat-ID: 17052
Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: Informatik Aktuell. Berlin, Heidelberg; 1999. doi:10.1007/978-3-662-01069-3_47
LibreCat | DOI
 

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

1999 | Dissertation | LibreCat-ID: 18942
Lukovszki T. New Results on Geometric Spanners and Their Applications. Universität Paderborn; 1999.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 2151
Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
LibreCat | DOI
 

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

1998 | Report | LibreCat-ID: 18145
Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998.
LibreCat
 

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

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

1998 | Conference Paper | LibreCat-ID: 16563
Cole R, Maggs BM, Meyer auf der Heide F, 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. doi:10.1145/276698.276790
LibreCat | DOI
 

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

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

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

1998 | Dissertation | LibreCat-ID: 19639
Vöcking B. Static and Dynamic Data Management in Networks. Universität Paderborn; 1998.
LibreCat | Files available
 

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

1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi: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. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6
LibreCat | DOI
 

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

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

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

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

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

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

1997 | Dissertation | LibreCat-ID: 19636
Dittrich W. Communication and I/O Efficient Parallel Data Structures. Universität Paderborn; 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19631
Bäumker A. Communication Efficient Parallel Searching. Universität Paderborn; 1997.
LibreCat
 

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

1997 | Conference Paper | LibreCat-ID: 16568
Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13
LibreCat | DOI
 

1997 | Dissertation | LibreCat-ID: 19637
Strothmann W-B. Bounded Degree Spanning Trees. Universität Paderborn; 1997.
LibreCat | Files available
 

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

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

1997 | Journal Article | LibreCat-ID: 16564
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387
LibreCat | DOI
 

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

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

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

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

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

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

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

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

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

1996 | Conference Paper | LibreCat-ID: 17483
Fischer M, Rethmann J, Wachsmann A. 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). Amsterdam: IOS Press; 1996:13–27.
LibreCat | Files available
 

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

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

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

1996 | Conference Paper | LibreCat-ID: 2184
Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.
LibreCat | Files available
 

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

1996 | Report | LibreCat-ID: 18352
Fischer M, Rethmann J, Wachsmann A. 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
 

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

1996 | Dissertation | LibreCat-ID: 2181
Scheideler C. Universal Routing Strategies. University of Paderborn, Germany; 1996.
LibreCat
 

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

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

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

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

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

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

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

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

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

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

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

1995 | Dissertation | LibreCat-ID: 19627
Czumaj A. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Universität Paderborn; 1995.
LibreCat | Files available
 

1995 | Dissertation | LibreCat-ID: 19634
Ameur F. Space-Bounded Learning Algorithms. Universität Paderborn; 1995.
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide F, Storch M, Wanka R. 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. ; 1995. doi:10.1145/215399.215430
LibreCat | DOI
 

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

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

1995 | Dissertation | LibreCat-ID: 19630
Wachsmann A. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Universität Paderborn; 1995.
LibreCat
 

1995 | Dissertation | LibreCat-ID: 19623
Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. Universität Paderborn; 1995.
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 2187
Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 

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

1994 | Dissertation | LibreCat-ID: 19624
Wanka R. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität Paderborn; 1994.
LibreCat | Files available
 

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

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

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

1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93. ; 1993. doi:10.1145/165231.165246
LibreCat | DOI
 

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

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

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

1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55488-2_31
LibreCat | DOI
 

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

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

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

1992 | Conference Paper | LibreCat-ID: 16736
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92. ; 1992. doi:10.1145/129712.129743
LibreCat | DOI
 

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

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

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

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

1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90. ; 1990. doi:10.1145/100216.100229
LibreCat | DOI
 

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

1990 | Conference Paper | LibreCat-ID: 16742
Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90. ; 1990. doi:10.1145/100216.100247
LibreCat | DOI
 

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

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

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

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

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed