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

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”10.1007/11889700_11__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi: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.”10.1007/11889700_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”10.1007/11889700_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.”10.1007/11682127_24__Architecture of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24.
LibreCat: /record/18926
DOI: 10.1007/11682127_24

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

Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).”10.1007/11682462_34__LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.
LibreCat: /record/16472
DOI: 10.1007/11682462_34

Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.”10.1007/11821069_29__Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29.
LibreCat: /record/16473
DOI: 10.1007/11821069_29

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

Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.”10.1007/11844662_12__Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–74, doi: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.”10.1007/11792086_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, doi:10.1007/11792086_4.
LibreCat: /record/35958
DOI: 10.1007/11792086_4

Geiselmann, Willi, et al. “A Simpler Sieving Device: Combining ECM and TWIRL.”10.1007/11927587_12__Information Security and Cryptology – ICISC 2006, Springer Berlin Heidelberg, 2006, doi:10.1007/11927587_12.
LibreCat: /record/53181
DOI: 10.1007/11927587_12

Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.”10.1007/11561354_21__Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21.
LibreCat: /record/19835
DOI: 10.1007/11561354_21

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

Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts.”10.1007/978-3-540-31957-3_90__Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi: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.”10.1007/11426639_15__EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.”10.1007/11426639_22__EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 371–86, doi: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.”10.1007/11561071_5__Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5.
LibreCat: /record/26991
DOI: 10.1007/11561071_5

Bdoiu, Mihai, et al. “Facility Location in Sublinear Time.”10.1007/11523468_70__Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70.
LibreCat: /record/18768
DOI: 10.1007/11523468_70

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

Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.”10.1007/11549468_105__Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi: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.”10.1007/11561071_72__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72.
LibreCat: /record/18915
DOI: 10.1007/11561071_72

Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”10.1007/978-3-540-31956-6_49__Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49.
LibreCat: /record/18924
DOI: 10.1007/978-3-540-31956-6_49

Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.”10.1007/978-3-540-31856-9_30__Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30.
LibreCat: /record/18925
DOI: 10.1007/978-3-540-31856-9_30

Köhler, Sven, et al. “On Approximating Real-World Halting Problems.”10.1007/11537311_40__Fundamentals of Computation Theory, 2005, doi: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.”10.1007/11537311_41__Fundamentals of Computation Theory, 2005, doi: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.”10.1007/11494645_68__Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.
LibreCat: /record/18280
DOI: 10.1007/11494645_68

Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”10.1007/11558989_20__Peer-to-Peer Systems IV, 2005, doi: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.”10.1007/11549345_1__Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
LibreCat: /record/16469
DOI: 10.1007/11549345_1

Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.”10.1007/11752578_96__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.
LibreCat: /record/16470
DOI: 10.1007/11752578_96

Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.”10.1007/11752578_101__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi: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.”10.1007/11552338_10__Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–54, doi:10.1007/11552338_10.
LibreCat: /record/15156
DOI: 10.1007/11552338_10

Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”10.1007/978-3-540-30217-9_4__Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

Blömer, Johannes, et al. “Provably Secure Masking of AES.”10.1007/978-3-540-30564-4_5__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi: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.”10.1007/978-3-540-24632-9_1__Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi: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.”10.1007/978-3-540-24632-9_16__Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 218–30, doi: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.”10.1007/978-3-540-28628-8_13__Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, 2004, pp. 213–19, doi: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.”10.1007/978-3-540-30140-0_25__Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004, doi: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.”10.1007/978-3-540-30140-0_49__Proc. 12th Annual Symposium on Algorithms (ESA’04), vol. 3221, Springer, 2004, pp. 544–55, doi:10.1007/978-3-540-30140-0_49.
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.”10.1007/978-3-540-30551-4_69__Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69.
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

Bansal, Vikas, et al. “Labeling Smart Dust.”10.1007/978-3-540-30140-0_9__12th Annual European Symposium on Algorithms (ESA 2004), vol. 3221, 2004, doi: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.”10.1007/978-3-540-30117-2_84__Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2004, pp. 831–35, doi: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.”10.1007/3-540-36574-5_12__Algorithms for Memory Hierarchies, vol. 2625, 2003, doi: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.”10.1007/978-3-540-45146-4_2__Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi: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).”10.1007/978-3-540-45126-6_12__Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi: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.”10.1007/978-3-540-24587-2_72__Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–15, doi: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.”10.1007/978-3-540-45078-8_13__Lecture Notes in Computer Science, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi: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.”10.1007/3-540-45084-x_8__Lecture Notes in Computer Science, 2003, doi: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.”10.1007/3-540-36970-8_36__Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_36.
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.”10.1007/3-540-36970-8_9__Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_9.
LibreCat: /record/16665
DOI: 10.1007/3-540-36970-8_9