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.
264 Publications
2003 | Journal Article | LibreCat-ID: 19785
Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” Algorithms for Memory Hierarchies 2625 (2003). https://doi.org/10.1007/3-540-36574-5_12.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 18196
Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. https://doi.org/10.1007/978-3-540-24587-2_72.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 18258
Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In Lecture Notes in Computer Science, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. https://doi.org/10.1007/978-3-540-45078-8_13.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16543
Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-45084-x_8.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16664
Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-36970-8_36.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16665
Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-36970-8_9.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 15077
Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.” In Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, 400–410. Springer, 2003. https://doi.org/10.1007/978-3-540-39403-7_30.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 15078
Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.” In Database and XML Technologies, First International XML Database Symposium, XSym 2003, 85–99. Berlin, Heidelberg, 2003. https://doi.org/10.1007/978-3-540-39429-7_6.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 13615
Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.” In Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), 575–84. Berlin, Heidelberg: Springer, 2003. https://doi.org/10.1007/978-3-540-45234-8_56.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 19850
Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-36379-3_36.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 24338
Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany, 2002. https://doi.org/10.1007/3-540-45706-2_134.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 18566
Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.” In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45465-9_77.
LibreCat
| DOI
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.” In Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45706-2_133.
LibreCat
| DOI
2001 | Journal Article | LibreCat-ID: 18749
Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18152
Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In Graph-Theoretic Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.
LibreCat
| DOI
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. https://doi.org/10.1007/3-540-44676-1.
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. https://doi.org/10.1007/3-540-45022-x_22.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-45253-2_15.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-44411-4_34.
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000. https://doi.org/10.1007/3-540-44520-x_59.
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 2435
Simon, Jens, Alexander Reinefeld, and Oliver Heinz. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.” In SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, edited by Hermann Hellwagner and Alexander Reinefeld, 1734:367–81. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer, 1999. https://doi.org/10.1007/10704208.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999. https://doi.org/10.1007/3-540-48447-7_20.
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 13608
Eisenring, Michael, Marco Platzner, and Lothar Thiele. “Communication Synthesis for Reconfigurable Embedded Systems.” In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1673:205–14. LCS. Springer, 1999. https://doi.org/10.1007/978-3-540-48302-1_21.
LibreCat
| DOI
1998 | Book Chapter | LibreCat-ID: 17412
Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.
LibreCat
| Files available
| 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: 13606
Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.” In Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , 69–78. LNCS. Berlin, Heidelberg: Springer , 1998. https://doi.org/10.1007/bfb0055234.
LibreCat
| DOI
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 | Book Chapter | LibreCat-ID: 3029
Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. https://doi.org/10.1007/3-540-63397-9_5.
LibreCat
| Files available
| 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 | 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
1996 | Book Chapter | LibreCat-ID: 19816
Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-61863-5_33.
LibreCat
| DOI
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 | 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 | 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 | 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
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 | 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 | 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 | Book Chapter | LibreCat-ID: 3046
Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_19.
LibreCat
| DOI