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, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 17864
Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.
LibreCat | Files available
 

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

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

1999 | Conference Paper | LibreCat-ID: 2165
Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
LibreCat | DOI
 

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

1999 | Conference Paper | LibreCat-ID: 18965
Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.
LibreCat | DOI
 

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

1999 | Dissertation | LibreCat-ID: 18942
Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. 1999.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 2151
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.
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.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat | DOI
 

1998 | Report | LibreCat-ID: 18145
Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.
LibreCat
 

1998 | Conference Paper | LibreCat-ID: 17863
Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, 1998, pp. 133--142.
LibreCat | Files available
 

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

1998 | Conference Paper | LibreCat-ID: 16563
Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” 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, Brigitte. On Periodic Comparator Networks. 1998.
LibreCat
 

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

1998 | Book Chapter | LibreCat-ID: 17412
Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.
LibreCat | Files available | DOI
 

1998 | Dissertation | LibreCat-ID: 19639
Vöcking, Berthold. Static and Dynamic Data Management in Networks. 1998.
LibreCat | Files available
 

1998 | Report | LibreCat-ID: 19735
Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.
LibreCat | Files available
 

1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16504
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.
LibreCat | DOI
 

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

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

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

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

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

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

1997 | Dissertation | LibreCat-ID: 19636
Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19631
Bäumker, Armin. Communication Efficient Parallel Searching. 1997.
LibreCat
 

1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, Artur, and Willy-B. Strothmann. “Bounded Degree Spanning Trees.” 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, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.
LibreCat | DOI
 

1997 | Dissertation | LibreCat-ID: 19637
Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” 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, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16565
Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” 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, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.
LibreCat | Files available
 

1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.
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.’” Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 2175
Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat | Files available
 

1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
LibreCat | DOI
 

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

1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.
LibreCat
 

1996 | Conference Paper | LibreCat-ID: 17483
Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2183
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat | Files available
 

1996 | Journal Article | LibreCat-ID: 19958
Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
LibreCat
 

1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS 96, 1996, doi:10.1007/3-540-60922-9_16.
LibreCat | DOI
 

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

1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
LibreCat | DOI
 

1996 | Report | LibreCat-ID: 18352
Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2186
Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 

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

1996 | Journal Article | LibreCat-ID: 16698
Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.
LibreCat | DOI
 

1996 | Report | LibreCat-ID: 17418
Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996.
LibreCat
 

1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” 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, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat | Files available
 

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

1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
LibreCat | DOI
 

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

1995 | Dissertation | LibreCat-ID: 19627
Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. 1995.
LibreCat | Files available
 

1995 | Dissertation | LibreCat-ID: 19634
Ameur, Foued. Space-Bounded Learning Algorithms. 1995.
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” 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, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat
 

1995 | Journal Article | LibreCat-ID: 16566
Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
LibreCat | DOI
 

1995 | Dissertation | LibreCat-ID: 19630
Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. 1995.
LibreCat
 

1995 | Dissertation | LibreCat-ID: 19623
Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations. 1995.
LibreCat
 

1995 | Conference Paper | LibreCat-ID: 2187
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat | Files available | DOI
 

1995 | Conference Paper | LibreCat-ID: 2207
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat | Files available
 

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

1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.
LibreCat | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Automata, Languages and Programming, 1993, doi: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.” 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., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 17479
Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat
 

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.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.
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.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
LibreCat | DOI
 

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

1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992, doi: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.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” 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, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
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.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.
LibreCat | DOI
 

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

1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.
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.” 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, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” 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, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32.
LibreCat
 

1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi: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.” STACS 89, 1989, doi: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.” STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed