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
Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998. https://doi.org/10.1007/bfb0054332.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 16563
Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “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. https://doi.org/10.1145/276698.276790.
LibreCat | DOI
 

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

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

1997 | Dissertation | LibreCat-ID: 19637
Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997. https://doi.org/10.1007/3-540-63397-9_9.
LibreCat | DOI
 

1997 | Report | LibreCat-ID: 18955
Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 18575
Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational Geometry, 39–43, 1997.
LibreCat
 

1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.
LibreCat | Files available
 

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

1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16565
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.
LibreCat | DOI
 

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

1997 | Conference Paper | LibreCat-ID: 16568
Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997. https://doi.org/10.1109/sfcs.1997.646117.
LibreCat | DOI
 

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

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

1996 | Report | LibreCat-ID: 17418
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB, University of Paderborn, 1996.
LibreCat
 

1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.
LibreCat
 

1996 | Conference Paper | LibreCat-ID: 17483
Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “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), 13–27. Amsterdam: IOS Press, 1996.
LibreCat | Files available
 

1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.
LibreCat | DOI
 

1996 | Report | LibreCat-ID: 18352
Fischer, Matthias, Jochen Rethmann, and Alf 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
 

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

1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 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, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.
LibreCat | Files available
 

1996 | Journal Article | LibreCat-ID: 16698
Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta Informatica, 1996, 621–30. https://doi.org/10.1007/bf03036467.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, 413–27. https://doi.org/10.1007/bf01955042.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, 517–42. https://doi.org/10.1007/bf01940878.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, 936–55. https://doi.org/10.1137/s0097539793255722.
LibreCat | DOI
 

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

1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.” In STACS 96. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-60922-9_16.
LibreCat | DOI
 

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

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

1995 | Dissertation | LibreCat-ID: 19630
Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Vol. 6. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 

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

1995 | Conference Paper | LibreCat-ID: 17482
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 46--59, 1995.
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA, 341--354. Lecture Notes in Computer Science, 1995. 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, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.
LibreCat | Files available
 

1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.
LibreCat | Files available
 

1995 | Journal Article | LibreCat-ID: 16566
Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In STACS 95. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-59042-0_81.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_133.
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “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. https://doi.org/10.1145/215399.215430.
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995. https://doi.org/10.1109/istcs.1995.377051.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60618-1_77.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_131.
LibreCat | DOI
 

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

1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, 738–61. https://doi.org/10.1137/s0097539791194094.
LibreCat | DOI
 

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

1993 | Conference Paper | LibreCat-ID: 17479
Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” In Proc. 3rd PASA Workshop, PARS Mitteilungen, 50–55, 1993.
LibreCat
 

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

1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” In Automata, Languages and Programming. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56939-1_89.
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993. https://doi.org/10.1145/165231.165246.
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56503-5_46.
LibreCat | DOI
 

1992 | Journal Article | LibreCat-ID: 18936
Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, 213–20. https://doi.org/10.1142/s0129626492000349.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_31.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-56731-3_3.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In STACS 92. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55210-3_176.
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992. https://doi.org/10.1145/129712.129743.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992. https://doi.org/10.1007/978-3-322-95233-2_7.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” In Automata, Languages and Programming. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0032018.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029630.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “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. https://doi.org/10.1145/100216.100229.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “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. https://doi.org/10.1145/100216.100247.
LibreCat | DOI
 

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

1989 | Journal Article | LibreCat-ID: 16743
Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, 101–11. https://doi.org/10.1051/ita/1989230101011.
LibreCat | DOI
 

1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” In Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989. https://doi.org/10.1145/72935.72974.
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028969.
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028978.
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In STACS 89. Berlin, Heidelberg, 1989. https://doi.org/10.1007/bfb0028983.
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16763
Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4.
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, 740–47. https://doi.org/10.1145/44483.44490.
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16765
Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Theoretical Computer Science, 1988, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7.
LibreCat | DOI
 

1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., A. Karlin, K. Mehlhorn, Friedhelm Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988. https://doi.org/10.1109/sfcs.1988.21968.
LibreCat | DOI
 

1988 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.” In STACS 88. Berlin, Heidelberg, 1988. https://doi.org/10.1007/bfb0035829.
LibreCat | DOI
 

1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In SWAT 88. Berlin, Heidelberg, 1988. https://doi.org/10.1007/3-540-19487-8_24.
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, 97–99. https://doi.org/10.1137/0216007.
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” SIAM Journal on Computing, 1987, 100–107. https://doi.org/10.1137/0216008.
LibreCat | DOI
 

1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” SIAM Journal on Computing, 1986, 106–19. https://doi.org/10.1137/0215008.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” In Automata, Languages and Programming. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16761-7_54.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_72.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_89.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16779
Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, 101–5. https://doi.org/10.1016/0020-0190(85)90042-0.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, 929–37. https://doi.org/10.1145/4221.4250.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30. https://doi.org/10.1016/0304-3975(85)90079-9.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.58.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16783
Fich, F E, Friedhelm Meyer auf der Heide, P Ragde, and A Wigderson. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985. https://doi.org/10.1145/22145.22151.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985. https://doi.org/10.1145/22145.22191.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.38.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control 67, no. 1–3 (1985): 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8.
LibreCat | DOI
 

1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, 668–76. https://doi.org/10.1145/828.322450.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed