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 | 
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 |
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