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

Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.”10.1007/978-3-540-39403-7_30__Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–10, doi: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.”10.1007/978-3-540-39429-7_6__Database and XML Technologies, First International XML Database Symposium, XSym 2003, 2003, pp. 85–99, doi:10.1007/978-3-540-39429-7_6.
LibreCat: /record/15078
DOI: 10.1007/978-3-540-39429-7_6

Steiger, Christoph, et al. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.”10.1007/978-3-540-45234-8_56__Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2003, pp. 575–84, doi: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.”10.1007/3-540-36379-3_36__Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”10.1007/3-540-45706-2_134__Proceedings of the 8th International Euro-Par Conference, 2002, doi:10.1007/3-540-45706-2_134.
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.”10.1007/3-540-45465-9_77__Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”10.1007/3-540-45706-2_133__Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”10.1007/3-540-45294-x_21__Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, doi: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.”10.1007/3-540-45335-0_23__Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi: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.”10.1007/3-540-45477-2_2__Graph-Theoretic Concepts in Computer Science, vol. 2204, 2001, doi: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.”10.1007/3-540-45718-6_68__Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi: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.”10.1007/3-540-45022-x_22__Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Czumaj, Artur, et al. “Property Testing in Computational Geometry.”10.1007/3-540-45253-2_15__Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15.
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”10.1007/3-540-44411-4_34__SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.”10.1007/3-540-44520-x_59__Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Simon, Jens, et al. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.”10.1007/10704208__SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, edited by Hermann Hellwagner and Alexander Reinefeld, vol. 1734, Springer, 1999, pp. 367–81, doi:10.1007/10704208.
LibreCat: /record/2435
DOI: 10.1007/10704208

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

Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”10.1007/3-540-48481-7_9__Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9