Böttcher S, Hartel R, Messinger C. Searchable Compression of Office Documents by XML Schema Subtraction. In: Database and XML Technologies - 7th International XML Database Symposium, XSym 2010. Springer; 2010:103-112. doi:10.1007/978-3-642-15684-7_9
LibreCat: /record/15137
DOI: 10.1007/978-3-642-15684-7_9

Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: Structural Information and Communication Complexity. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:10.1007/978-3-642-13284-1_14
LibreCat: /record/16365
DOI: 10.1007/978-3-642-13284-1_14

Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg; 2010. doi:10.1007/978-3-642-14162-1
LibreCat: /record/16403
DOI: 10.1007/978-3-642-14162-1

Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg; 2010. doi:10.1007/978-3-642-14165-2
LibreCat: /record/16404
DOI: 10.1007/978-3-642-14165-2

Trier M, Müller C. Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In: Practical Aspects of Knowledge Management. Berlin, Heidelberg; 2010. doi:10.1007/978-3-540-30545-3_23
LibreCat: /record/13301
DOI: 10.1007/978-3-540-30545-3_23

Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: Algorithmic Aspects of Wireless Sensor Networks. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25
LibreCat: /record/19724
DOI: 10.1007/978-3-642-05434-1_25

Kakvi S. Reinforcement Learning for Blackjack. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:300-301. doi:10.1007/978-3-642-04052-8_43
LibreCat: /record/2920
DOI: 10.1007/978-3-642-04052-8_43

Schrieb J, Wehrheim H, Wonisch D. Three-Valued Spotlight Abstractions. In: FM 2009: Formal Methods. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:106-122. doi:10.1007/978-3-642-05089-3_8
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2009. doi:10.1007/978-3-642-10841-9_6
LibreCat: /record/23744
DOI: 10.1007/978-3-642-10841-9_6

Biermann T, Schwabe A, Karl H. Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In: NETWORKING 2009. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:883-894. doi:10.1007/978-3-642-01399-7_69
LibreCat: /record/1830
DOI: 10.1007/978-3-642-01399-7_69

Kakvi S. Reinforcement Learning for Blackjack. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2009. doi:10.1007/978-3-642-04052-8_43
LibreCat: /record/9616
DOI: 10.1007/978-3-642-04052-8_43

Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). ; 2008. doi:10.1007/978-3-540-70575-8_66
LibreCat: /record/19686
DOI: 10.1007/978-3-540-70575-8_66

Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT). ; 2008:378-389. doi:10.1007/978-3-540-69903-3_34
LibreCat: /record/19003
DOI: 10.1007/978-3-540-69903-3_34

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

Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: Unconventional Computing. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-85194-3_11
LibreCat: /record/17978
DOI: 10.1007/978-3-540-85194-3_11

Bienkowski M, Kutyowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007. doi:10.1007/978-3-540-73951-7_30
LibreCat: /record/24276
DOI: 10.1007/978-3-540-73951-7_30

May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: Advances in Cryptology — CRYPTO 2002. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:242-256. doi:10.1007/3-540-45708-9_16
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:10.1007/3-540-44670-2_2
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:10.1007/3-540-45537-x_26
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:10.1007/3-540-44670-2_10
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

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

Ziegler M. (Short) Survey of Real Hypercomputation. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-73001-9_86
LibreCat: /record/17982
DOI: 10.1007/978-3-540-73001-9_86

Meer K, Ziegler M. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64
LibreCat: /record/17983
DOI: 10.1007/978-3-540-74456-6_64

Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg; 2007. doi:10.1007/3-540-44683-4_46
LibreCat: /record/16640
DOI: 10.1007/3-540-44683-4_46

Böttcher S, Steinmetz R. Evaluating XPath Queries on XML Data Streams. In: Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24. Springer; 2007:101-113. doi:10.1007/978-3-540-73390-4_10
LibreCat: /record/15144
DOI: 10.1007/978-3-540-73390-4_10

Böttcher S, Steinmetz R. Data Management for Mobile Ajax Web 2.0 Applications. In: Database and Expert Systems Applications, 18th International Conference, DEXA 2007. Springer; 2007:424-433. doi:10.1007/978-3-540-74469-6_42
LibreCat: /record/15146
DOI: 10.1007/978-3-540-74469-6_42

Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). ; 2006. doi:10.1007/11940128_65
LibreCat: /record/19838
DOI: 10.1007/11940128_65

Kutyowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: SOFSEM 2006: Theory and Practice of Computer Science. ; 2006. doi:10.1007/11611257_37
LibreCat: /record/24277
DOI: 10.1007/11611257_37

Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:10.1007/11889700_11
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:10.1007/11889700_2
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: Architecture of Computing Systems - ARCS. ; 2006:341--351. doi:10.1007/11682127_24
LibreCat: /record/18926
DOI: 10.1007/11682127_24

Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: Logical Approaches to Computational Barriers. Berlin, Heidelberg; 2006. doi:10.1007/11780342_39
LibreCat: /record/17987
DOI: 10.1007/11780342_39

Demaine ED, Meyer auf der Heide F, Pagh R, Petrafcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). In: LATIN 2006: Theoretical Informatics. Berlin, Heidelberg; 2006. doi:10.1007/11682462_34
LibreCat: /record/16472
DOI: 10.1007/11682462_34

Dynia M, Kutyowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2006. doi:10.1007/11821069_29
LibreCat: /record/16473
DOI: 10.1007/11821069_29

Böttcher S, Steinmetz R. DTD-Driven Structure Preserving XML Compression. In: Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23. Berlin, Heidelberg; 2006:266-269. doi:10.1007/11788911_27
LibreCat: /record/15150
DOI: 10.1007/11788911_27

Böttcher S, Steinmetz R. Information Disclosure by XPath Queries. In: Secure Data Management, Third VLDB Workshop, SDM 2006. Springer; 2006:160-174. doi:10.1007/11844662_12
LibreCat: /record/15152
DOI: 10.1007/11844662_12

Fouvry É, Klüners J. Cohen–Lenstra Heuristics of Quadratic Number Fields. In: Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2006. doi:10.1007/11792086_4
LibreCat: /record/35958
DOI: 10.1007/11792086_4

Geiselmann W, Januszewski F, Köpfer H, Pelzl J, Steinwandt R. A Simpler Sieving Device: Combining ECM and TWIRL. In: 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 S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005). Vol 3738. ; 2005:244-257. doi:10.1007/11561354_21
LibreCat: /record/19835
DOI: 10.1007/11561354_21

Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005). 3738. ; 2005:271-284. doi:10.1007/11561354_23
LibreCat: /record/19836
DOI: 10.1007/11561354_23

Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts. In: Proceedings of the 4th International Conference on Networking. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:10.1007/978-3-540-31957-3_90
LibreCat: /record/19912
DOI: 10.1007/978-3-540-31957-3_90

Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: EUROCRYPT 2005. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:10.1007/11426639_22
LibreCat: /record/3010
DOI: 10.1007/11426639_22

Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: Algorithms – ESA 2005. ; 2005. doi:10.1007/11561071_5
LibreCat: /record/26991
DOI: 10.1007/11561071_5

Bdoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Berlin, Heidelberg; 2005:866-877. doi:10.1007/11523468_70
LibreCat: /record/18768
DOI: 10.1007/11523468_70

Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67
LibreCat: /record/18867
DOI: 10.1007/11561071_67

Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg; 2005. doi:10.1007/11549468_105
LibreCat: /record/18912
DOI: 10.1007/11549468_105

Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:10.1007/11561071_72
LibreCat: /record/18915
DOI: 10.1007/11561071_72

Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking. Vol 3420.10.1007/978-3-540-31956-6_49__Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:10.1007/978-3-540-31956-6_49
LibreCat: /record/18924
DOI: 10.1007/978-3-540-31956-6_49

Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30
LibreCat: /record/18925
DOI: 10.1007/978-3-540-31856-9_30

Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_40
LibreCat: /record/17988
DOI: 10.1007/11537311_40

Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_41
LibreCat: /record/17989
DOI: 10.1007/11537311_41

Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68
LibreCat: /record/18280
DOI: 10.1007/11494645_68

Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: Peer-to-Peer Systems IV. Berlin, Heidelberg; 2005. doi:10.1007/11558989_20
LibreCat: /record/16468
DOI: 10.1007/11558989_20

Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg; 2005. doi:10.1007/11549345_1
LibreCat: /record/16469
DOI: 10.1007/11549345_1

Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96
LibreCat: /record/16470
DOI: 10.1007/11752578_96

Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101
LibreCat: /record/16471
DOI: 10.1007/11752578_101

Böttcher S, Steinmetz R. Detecting Privacy Violations in Sensitive XML Databases. In: Secure Data Management, Second VLDB Workshop, SDM 2005. Springer; 2005:143-154. doi:10.1007/11552338_10
LibreCat: /record/15156
DOI: 10.1007/11552338_10

Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004: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 J, May A. A Generalized Wiener Attack on RSA. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:10.1007/978-3-540-24632-9_16
LibreCat: /record/3014
DOI: 10.1007/978-3-540-24632-9_16

May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Advances in Cryptology – CRYPTO 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:10.1007/978-3-540-28628-8_13
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

Damerow V, Sohler C. Extreme Points Under Random Noise. In: Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_25
LibreCat: /record/18778
DOI: 10.1007/978-3-540-30140-0_25

Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials. In: Proc. 12th Annual Symposium on Algorithms (ESA’04). Vol 3221. Berlin, Heidelberg: Springer; 2004:544-555. doi:10.1007/978-3-540-30140-0_49
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04). Vol 3341. Berlin, Heidelberg: Springer ; 2004:805-821. doi:10.1007/978-3-540-30551-4_69
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: 12th Annual European Symposium on Algorithms (ESA 2004). Vol 3221. Lecture Notes in Computer Science. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_9
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

Walder H, Platzner M. A Runtime Environment for Reconfigurable Hardware Operating Systems. In: Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL). Berlin, Heidelberg: Springer; 2004:831-835. doi:10.1007/978-3-540-30117-2_84
LibreCat: /record/13618
DOI: 10.1007/978-3-540-30117-2_84

Salzwedel KA. Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies. 2003;2625. doi:10.1007/3-540-36574-5_12
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003: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 J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:10.1007/978-3-540-45126-6_12
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03). Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:10.1007/978-3-540-24587-2_72
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. Lecture Notes in Computer Science. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:10.1007/978-3-540-45078-8_13
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Dellnitz M, Preis R. Congestion and Almost Invariant Sets in Dynamical Systems. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2003. doi:10.1007/3-540-45084-x_8
LibreCat: /record/16543
DOI: 10.1007/3-540-45084-x_8

Schütze O. A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2003. doi:10.1007/3-540-36970-8_36
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

Schütze O, Mostaghim S, Dellnitz M, Teich J. Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2003. doi:10.1007/3-540-36970-8_9
LibreCat: /record/16665
DOI: 10.1007/3-540-36970-8_9

Böttcher S, Steinmetz R. 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. Springer; 2003:400-410. doi:10.1007/978-3-540-39403-7_30
LibreCat: /record/15077
DOI: 10.1007/978-3-540-39403-7_30

Böttcher S, Steinmetz R. A DTD Graph Based XPath Query Subsumption Test. In: Database and XML Technologies, First International XML Database Symposium, XSym 2003. Berlin, Heidelberg; 2003:85-99. doi:10.1007/978-3-540-39429-7_6
LibreCat: /record/15078
DOI: 10.1007/978-3-540-39429-7_6

Steiger C, Walder H, Platzner M. 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). Berlin, Heidelberg: Springer; 2003:575-584. doi:10.1007/978-3-540-45234-8_56
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

Wanka R. 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). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: 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 M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505. doi:10.1007/3-540-48224-5_41
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

Lukovszki T, Maheshwari A, Zeh N. 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. doi:10.1007/3-540-45294-x_21
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21

Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23
LibreCat: /record/18152
DOI: 10.1007/3-540-45335-0_23

Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204.10.1007/3-540-45477-2_2__Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1
LibreCat: /record/16722
DOI: 10.1007/3-540-44676-1

Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Meyer auf der Heide F, Kutyowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Simon J, Reinefeld A, Heinz O. Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI. In: Hellwagner H, Reinefeld A, eds. SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters. Vol 1734. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer; 1999:367-381. doi:10.1007/10704208
LibreCat: /record/2435
DOI: 10.1007/10704208

Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999: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 F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Eisenring M, Platzner M, Thiele L. Communication Synthesis for Reconfigurable Embedded Systems. In: Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL). Vol 1673. LCS. Springer; 1999:205-214. doi:10.1007/978-3-540-48302-1_21
LibreCat: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg; 1998. doi:10.1007/3-540-68530-8_14
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14