Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.”https://doi.org/10.1007/978-3-540-69134-1_44__In The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 5040:447--456, 2008.https://doi.org/10.1007/978-3-540-69134-1_44 .
LibreCat: /record/20367
DOI: 10.1007/978-3-540-69134-1_44

Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.”https://doi.org/10.1007/978-3-540-85194-3_11__In Unconventional Computing. Berlin, Heidelberg, 2008.https://doi.org/10.1007/978-3-540-85194-3_11 .
LibreCat: /record/17978
DOI: 10.1007/978-3-540-85194-3_11

Bienkowski, Marcin, and Jarosaw Kutyowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.”https://doi.org/10.1007/978-3-540-73951-7_30__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2007.https://doi.org/10.1007/978-3-540-73951-7_30 .
LibreCat: /record/24276
DOI: 10.1007/978-3-540-73951-7_30

May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”https://doi.org/10.1007/3-540-45708-9_16__In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45708-9_16 .
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”https://doi.org/10.1007/3-540-44670-2_2__In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_2 .
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”https://doi.org/10.1007/3-540-45537-x_26__In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45537-x_26 .
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.”https://doi.org/10.1007/3-540-44670-2_10__In Lecture Notes in Computer Science, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_10 .
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”https://doi.org/10.1007/3-540-68530-8_13__In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-68530-8_13 .
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosaw Kutyowski. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.”https://doi.org/10.1007/978-3-540-69507-3_21__In Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 4362:260--271, 2007.https://doi.org/10.1007/978-3-540-69507-3_21 .
LibreCat: /record/18929
DOI: 10.1007/978-3-540-69507-3_21

Ziegler, Martin. “(Short) Survey of Real Hypercomputation.”https://doi.org/10.1007/978-3-540-73001-9_86__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2007.https://doi.org/10.1007/978-3-540-73001-9_86 .
LibreCat: /record/17982
DOI: 10.1007/978-3-540-73001-9_86

Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.”https://doi.org/10.1007/978-3-540-74456-6_64__In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg, 2007.https://doi.org/10.1007/978-3-540-74456-6_64 .
LibreCat: /record/17983
DOI: 10.1007/978-3-540-74456-6_64

Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.”https://doi.org/10.1007/3-540-44683-4_46__In Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg, 2007.https://doi.org/10.1007/3-540-44683-4_46 .
LibreCat: /record/16640
DOI: 10.1007/3-540-44683-4_46

Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.”https://doi.org/10.1007/978-3-540-73390-4_10__In Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, 101–13. Springer, 2007.https://doi.org/10.1007/978-3-540-73390-4_10 .
LibreCat: /record/15144
DOI: 10.1007/978-3-540-73390-4_10

Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.”https://doi.org/10.1007/978-3-540-74469-6_42__In Database and Expert Systems Applications, 18th International Conference, DEXA 2007, 424–33. Springer, 2007.https://doi.org/10.1007/978-3-540-74469-6_42 .
LibreCat: /record/15146
DOI: 10.1007/978-3-540-74469-6_42

Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.”https://doi.org/10.1007/11940128_65__In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.https://doi.org/10.1007/11940128_65 .
LibreCat: /record/19838
DOI: 10.1007/11940128_65

Kutyowski, Jarosaw, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.”https://doi.org/10.1007/11611257_37__In SOFSEM 2006: Theory and Practice of Computer Science. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11611257_37 .
LibreCat: /record/24277
DOI: 10.1007/11611257_37

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”https://doi.org/10.1007/11889700_11__In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_11 .
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”https://doi.org/10.1007/11889700_2__In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_2 .
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”https://doi.org/10.1007/11889700_4__In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_4 .
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.”https://doi.org/10.1007/11682127_24__In Architecture of Computing Systems - ARCS, 341--351, 2006.https://doi.org/10.1007/11682127_24 .
LibreCat: /record/18926
DOI: 10.1007/11682127_24

Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.”https://doi.org/10.1007/11780342_39__In Logical Approaches to Computational Barriers. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11780342_39 .
LibreCat: /record/17987
DOI: 10.1007/11780342_39

Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Petrafcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).”https://doi.org/10.1007/11682462_34__In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11682462_34 .
LibreCat: /record/16472
DOI: 10.1007/11682462_34

Dynia, M., J. Kutyowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.”https://doi.org/10.1007/11821069_29__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11821069_29 .
LibreCat: /record/16473
DOI: 10.1007/11821069_29

Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.”https://doi.org/10.1007/11788911_27__In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 266–69. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11788911_27 .
LibreCat: /record/15150
DOI: 10.1007/11788911_27

Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.”https://doi.org/10.1007/11844662_12__In Secure Data Management, Third VLDB Workshop, SDM 2006, 160–74. Springer, 2006.https://doi.org/10.1007/11844662_12 .
LibreCat: /record/15152
DOI: 10.1007/11844662_12

Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.”https://doi.org/10.1007/11792086_4__In Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11792086_4 .
LibreCat: /record/35958
DOI: 10.1007/11792086_4

Geiselmann, Willi, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, and Rainer Steinwandt. “A Simpler Sieving Device: Combining ECM and TWIRL.”https://doi.org/10.1007/11927587_12__In Information Security and Cryptology – ICISC 2006. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11927587_12 .
LibreCat: /record/53181
DOI: 10.1007/11927587_12

Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.”https://doi.org/10.1007/11561354_21__In Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), 3738:244–57, 2005.https://doi.org/10.1007/11561354_21 .
LibreCat: /record/19835
DOI: 10.1007/11561354_21

Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.”https://doi.org/10.1007/11561354_23__In Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 271–84. 3738, 2005.https://doi.org/10.1007/11561354_23 .
LibreCat: /record/19836
DOI: 10.1007/11561354_23

Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts.”https://doi.org/10.1007/978-3-540-31957-3_90__In Proceedings of the 4th International Conference on Networking, 3421:800–810. Berlin, Heidelberg, 2005.https://doi.org/10.1007/978-3-540-31957-3_90 .
LibreCat: /record/19912
DOI: 10.1007/978-3-540-31957-3_90

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”https://doi.org/10.1007/11426639_15__In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_15 .
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.”https://doi.org/10.1007/11426639_22__In EUROCRYPT 2005, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_22 .
LibreCat: /record/3010
DOI: 10.1007/11426639_22

Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.”https://doi.org/10.1007/11561071_5__In Algorithms – ESA 2005. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11561071_5 .
LibreCat: /record/26991
DOI: 10.1007/11561071_5

Meschut, Gerson. “Mischbauweise Sorgt Für Frischen Wind.” Konstruktion 04 (2005): 92–93.
LibreCat: /record/21219

Bdoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.”https://doi.org/10.1007/11523468_70__In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 866–77. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11523468_70 .
LibreCat: /record/18768
DOI: 10.1007/11523468_70

Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.”https://doi.org/10.1007/11561071_67__In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005.https://doi.org/10.1007/11561071_67 .
LibreCat: /record/18867
DOI: 10.1007/11561071_67

Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.”https://doi.org/10.1007/11549468_105__In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg, 2005.https://doi.org/10.1007/11549468_105 .
LibreCat: /record/18912
DOI: 10.1007/11549468_105

Bienkowski, Marcin, and Jarosaw Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.”https://doi.org/10.1007/11561071_72__In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:815–26. Berlin, Heidelberg: Springer , 2005.https://doi.org/10.1007/11561071_72 .
LibreCat: /record/18915
DOI: 10.1007/11561071_72

Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”https://doi.org/10.1007/978-3-540-31956-6_49__In Proceedings of the 4th International Conference on Networking, 3420:413–20.https://doi.org/10.1007/978-3-540-31956-6_49__Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005.https://doi.org/10.1007/978-3-540-31956-6_49 .
LibreCat: /record/18924
DOI: 10.1007/978-3-540-31956-6_49

Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.”https://doi.org/10.1007/978-3-540-31856-9_30__In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005.https://doi.org/10.1007/978-3-540-31856-9_30 .
LibreCat: /record/18925
DOI: 10.1007/978-3-540-31856-9_30

Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.”https://doi.org/10.1007/11537311_40__In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11537311_40 .
LibreCat: /record/17988
DOI: 10.1007/11537311_40

Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.”https://doi.org/10.1007/11537311_41__In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11537311_41 .
LibreCat: /record/17989
DOI: 10.1007/11537311_41

Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.”https://doi.org/10.1007/11494645_68__In Proc. CiE 2005: New Computational Paradigms, 3526:562–71. Springer, 2005.https://doi.org/10.1007/11494645_68 .
LibreCat: /record/18280
DOI: 10.1007/11494645_68

Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.”https://doi.org/10.1007/11558989_20__In Peer-to-Peer Systems IV. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11558989_20 .
LibreCat: /record/16468
DOI: 10.1007/11558989_20

Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.”https://doi.org/10.1007/11549345_1__In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11549345_1 .
LibreCat: /record/16469
DOI: 10.1007/11549345_1

Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.”https://doi.org/10.1007/11752578_96__In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 801–8, 2005.https://doi.org/10.1007/11752578_96 .
LibreCat: /record/16470
DOI: 10.1007/11752578_96

Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.”https://doi.org/10.1007/11752578_101__In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 839–46, 2005.https://doi.org/10.1007/11752578_101 .
LibreCat: /record/16471
DOI: 10.1007/11752578_101

Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.”https://doi.org/10.1007/11552338_10__In Secure Data Management, Second VLDB Workshop, SDM 2005, 143–54. Springer, 2005.https://doi.org/10.1007/11552338_10 .
LibreCat: /record/15156
DOI: 10.1007/11552338_10

Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”https://doi.org/10.1007/978-3-540-30217-9_4__In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30217-9_4 .
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.”https://doi.org/10.1007/978-3-540-30564-4_5__In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30564-4_5 .
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”https://doi.org/10.1007/978-3-540-24632-9_1__In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_1 .
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^rq.”https://doi.org/10.1007/978-3-540-24632-9_16__In Public Key Cryptography – PKC 2004, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_16 .
LibreCat: /record/3014
DOI: 10.1007/978-3-540-24632-9_16

May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.”https://doi.org/10.1007/978-3-540-28628-8_13__In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-28628-8_13 .
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”https://doi.org/10.1007/978-3-540-30140-0_25__In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30140-0_25 .
LibreCat: /record/18778
DOI: 10.1007/978-3-540-30140-0_25

Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.”https://doi.org/10.1007/978-3-540-30140-0_49__In Proc. 12th Annual Symposium on Algorithms (ESA’04), 3221:544–55. Berlin, Heidelberg: Springer, 2004.https://doi.org/10.1007/978-3-540-30140-0_49 .
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.”https://doi.org/10.1007/978-3-540-30551-4_69__In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 3341:805–21. Berlin, Heidelberg: Springer , 2004.https://doi.org/10.1007/978-3-540-30551-4_69 .
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling Smart Dust.”https://doi.org/10.1007/978-3-540-30140-0_9__In 12th Annual European Symposium on Algorithms (ESA 2004), Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30140-0_9 .
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.”https://doi.org/10.1007/978-3-540-30117-2_84__In Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), 831–35. Berlin, Heidelberg: Springer, 2004.https://doi.org/10.1007/978-3-540-30117-2_84 .
LibreCat: /record/13618
DOI: 10.1007/978-3-540-30117-2_84

Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.”https://doi.org/10.1007/3-540-36574-5_12__Algorithms for Memory Hierarchies 2625 (2003).https://doi.org/10.1007/3-540-36574-5_12 .
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”https://doi.org/10.1007/978-3-540-45146-4_2__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: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”https://doi.org/10.1007/978-3-540-45126-6_12__In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.https://doi.org/10.1007/978-3-540-45126-6_12 .
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”https://doi.org/10.1007/978-3-540-24587-2_72__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: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

Ziegler, Martin. “Fast Relative Approximation of Potential Fields.”https://doi.org/10.1007/978-3-540-45078-8_13__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: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.”https://doi.org/10.1007/3-540-45084-x_8__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003.https://doi.org/10.1007/3-540-45084-x_8 .
LibreCat: /record/16543
DOI: 10.1007/3-540-45084-x_8

Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.”https://doi.org/10.1007/3-540-36970-8_36__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003.https://doi.org/10.1007/3-540-36970-8_36 .
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.”https://doi.org/10.1007/3-540-36970-8_9__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003.https://doi.org/10.1007/3-540-36970-8_9 .
LibreCat: /record/16665
DOI: 10.1007/3-540-36970-8_9

Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.”https://doi.org/10.1007/978-3-540-39403-7_30__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: /record/15077
DOI: 10.1007/978-3-540-39403-7_30

Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.”https://doi.org/10.1007/978-3-540-39429-7_6__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: /record/15078
DOI: 10.1007/978-3-540-39429-7_6

Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.”https://doi.org/10.1007/978-3-540-45234-8_56__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: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.”https://doi.org/10.1007/3-540-36379-3_36__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: /record/19850
DOI: 10.1007/3-540-36379-3_36

Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”https://doi.org/10.1007/3-540-45706-2_134__In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany, 2002.https://doi.org/10.1007/3-540-45706-2_134 .
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Hahn, O., M. Koyro, and Gerson Meschut. “Lipirea În Combinatie Cu Îmbinarile Obtinute Prin Deformare.” Sudura 2 (2002): 10–13.
LibreCat: /record/21050

Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.”https://doi.org/10.1007/3-540-45465-9_77__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: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.”https://doi.org/10.1007/3-540-45706-2_133__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: /record/16723
DOI: 10.1007/3-540-45706-2_133

Meschut, Gerson. “Hybridfügen – Grundlagen, Technologie, Anwendungen.” In DVM-Bericht 668, 668:119–34. Berlin, 2001.
LibreCat: /record/21009

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”https://doi.org/10.1007/3-540-48224-5_41__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: /record/18749
DOI: 10.1007/3-540-48224-5_41

Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”https://doi.org/10.1007/3-540-45294-x_21__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: /record/18964
DOI: 10.1007/3-540-45294-x_21

Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.”https://doi.org/10.1007/3-540-45335-0_23__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: /record/18152
DOI: 10.1007/3-540-45335-0_23

Meyer auf der Heide, Friedhelm. “Data Management in Networks.”https://doi.org/10.1007/3-540-45477-2_2__In Graph-Theoretic Concepts in Computer Science, Vol. 2204.https://doi.org/10.1007/3-540-45477-2_2__Lecture Notes in Computer Science. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45477-2_2 .
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.”https://doi.org/10.1007/3-540-45718-6_68__In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45718-6_68 .
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

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: /record/16722
DOI: 10.1007/3-540-44676-1

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.”https://doi.org/10.1007/3-540-45253-2_15__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: /record/17990
DOI: 10.1007/3-540-45253-2_15

Fromme, J., S. Ganguin, S. Iske, Dorothee M. Meister, and U. Sander, eds. Medienbildung und Gesellschaft. VS Verlag, 2000.
LibreCat: /record/18121

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”https://doi.org/10.1007/3-540-44411-4_34__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: /record/18146
DOI: 10.1007/3-540-44411-4_34

Meyer auf der Heide, Friedhelm, Mirosaw Kutyowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.”https://doi.org/10.1007/3-540-44520-x_59__In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000.https://doi.org/10.1007/3-540-44520-x_59 .
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Simon, Jens, Alexander Reinefeld, and Oliver Heinz. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.”https://doi.org/10.1007/10704208__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: /record/2435
DOI: 10.1007/10704208

Koyro, M., and Gerson Meschut. “Eine Quasistationäre Meßmethode Zur Ermittlung Der Wärmeleitfähigkeit Polymerer Zwischenschichten in Abhängigkeit von Der Temperatur.” In Tagungsband Zur Veranstaltung Werkstoffprüfung 1999, 173–84, 1999.
LibreCat: /record/20992

Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.”https://doi.org/10.1007/3-540-48447-7_20__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: /record/18959
DOI: 10.1007/3-540-48447-7_20

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”https://doi.org/10.1007/3-540-48481-7_9__In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999.https://doi.org/10.1007/3-540-48481-7_9 .
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Eisenring, Michael, Marco Platzner, and Lothar Thiele. “Communication Synthesis for Reconfigurable Embedded Systems.”https://doi.org/10.1007/978-3-540-48302-1_21__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: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”https://doi.org/10.1007/3-540-68530-8_14__In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998.https://doi.org/10.1007/3-540-68530-8_14 .
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

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

Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.”https://doi.org/10.1007/bfb0055234__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: /record/13606
DOI: 10.1007/bfb0055234

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

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/3-540-63397-9_5__In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.https://doi.org/10.1007/3-540-63397-9_5 .
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”https://doi.org/10.1007/3-540-63397-9_13__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: /record/16568
DOI: 10.1007/3-540-63397-9_13

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

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

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