K. Nebe, F. Klompmaker, H. Jung, and H. G. Fischer, “Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction,” in Human-Computer Interaction. Interaction Techniques and Environments., vol. 6762, J. A. Jacko, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 100–109.
LibreCat: /record/6293
DOI: 10.1007/978-3-642-21605-3_11

H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities,” in Human Centered Design, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 28–37.
LibreCat: /record/6300
DOI: 10.1007/978-3-642-21753-1_4

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
LibreCat: /record/16410
DOI: 10.1007/978-3-642-18381-2_15

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.
LibreCat: /record/16459
DOI: 10.1007/978-3-642-22212-2_13

M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath Query Evaluation,” in East European Conference on Advances in Databases and Information Systems, 2011, pp. 27–41.
LibreCat: /record/15097
DOI: 10.1007/978-3-642-23737-9_3

A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,” in Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, 2011, pp. 154–166.
LibreCat: /record/15099
DOI: 10.1007/978-3-642-24577-0_17

S. Böttcher, R. Hartel, and S. Stey, “TraCX: Transformation of Compressed XML,” in Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, 2011, pp. 182–193.
LibreCat: /record/15100
DOI: 10.1007/978-3-642-24577-0_19

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.
LibreCat: /record/16409
DOI: 10.1007/978-3-642-22012-8_52

C. Fuchs, “Como podemos definir vigilância?,”https://doi.org/10.11606/issn.1982-8160.v5i1p109-136__MATRIZes, vol. 5, no. 1, pp. 109–133, 2011, doi:https://doi.org/10.11606/issn.1982-8160.v5i1p109-136 .
LibreCat: /record/42728
DOI: https://doi.org/10.11606/issn.1982-8160.v5i1p109-136

M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, vol. 5873, pp. 624--639.
LibreCat: /record/19796
DOI: 10.1007/978-3-642-05118-0_43

H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in From Animals to Animats 11, 2010, vol. 6226, pp. 639–648.
LibreCat: /record/20226
DOI: 10.1007/978-3-642-15193-4_60

R. Grzablewicz, J. Kutyowski, M. Kutyowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,”10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55 .
LibreCat: /record/24282
DOI: 10.1007/11424826_55

M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

H. Seebach et al., “Designing Self-healing in Automotive Systems,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2010.
LibreCat: /record/20961
DOI: 10.1007/978-3-642-16576-4_4

P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop on Internet and Network Economics (WINE), 2010.
LibreCat: /record/19029
DOI: 10.1007/978-3-642-17572-5_37

B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin, Heidelberg, 2010.
LibreCat: /record/16505
DOI: 10.1007/978-3-642-17289-2_60

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

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

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

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

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

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

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

J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

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

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

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

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

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

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

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

M. Bienkowski and J. Kutyowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,”10.1007/978-3-540-73951-7_30__2007, doi:10.1007/978-3-540-73951-7_30 .
LibreCat: /record/24276
DOI: 10.1007/978-3-540-73951-7_30

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

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

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

A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

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

M. Dynia, M. Korzeniowski, and J. Kutyowski, “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), 2007, vol. 4362, pp. 260--271.
LibreCat: /record/18929
DOI: 10.1007/978-3-540-69507-3_21

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

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

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

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

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

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

J. Kutyowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,”10.1007/11611257_37__2006, doi:10.1007/11611257_37 .
LibreCat: /record/24277
DOI: 10.1007/11611257_37

J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat: /record/3004
DOI: 10.1007/11889700_11

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

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

M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894, pp. 341--351.
LibreCat: /record/18926
DOI: 10.1007/11682127_24

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

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

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

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

S. Böttcher and R. Steinmetz, “Information Disclosure by XPath Queries,” in Secure Data Management, Third VLDB Workshop, SDM 2006, 2006, pp. 160–174.
LibreCat: /record/15152
DOI: 10.1007/11844662_12

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

W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, and R. Steinwandt, “A Simpler Sieving Device: Combining ECM and TWIRL,” in Information Security and Cryptology – ICISC 2006, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.
LibreCat: /record/53181
DOI: 10.1007/11927587_12

S. Rührup, C. Schindelhauer, and K. Volbert, “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), 2005, vol. 3738, pp. 244–257.
LibreCat: /record/19835
DOI: 10.1007/11561354_21

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

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

J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.
LibreCat: /record/3010
DOI: 10.1007/11426639_22

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

G. Meschut, “Mischbauweise sorgt für frischen Wind,” Konstruktion, vol. 04, pp. 92–93, 2005.
LibreCat: /record/21219

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

G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769.
LibreCat: /record/18867
DOI: 10.1007/11561071_67

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

M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 815–826.
LibreCat: /record/18915
DOI: 10.1007/11561071_72

M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3420, pp. 413–420.
LibreCat: /record/18924
DOI: 10.1007/978-3-540-31956-6_49

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

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

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

M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.
LibreCat: /record/18280
DOI: 10.1007/11494645_68

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

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

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

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

S. Böttcher and R. Steinmetz, “Detecting Privacy Violations in Sensitive XML Databases,” in Secure Data Management, Second VLDB Workshop, SDM 2005, 2005, pp. 143–154.
LibreCat: /record/15156
DOI: 10.1007/11552338_10

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

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

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

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

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

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

M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,” in Proc. 12th Annual Symposium on Algorithms (ESA’04), 2004, vol. 3221, pp. 544–555.
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821.
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in 12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

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

K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms for Memory Hierarchies, vol. 2625, 2003.
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

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

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

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

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

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

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

C. Steiger, H. Walder, and M. 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), 2003, pp. 575–584.
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

R. Wanka, “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), 2002, pp. 413–420.
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,”10.1007/3-540-45706-2_134__2002, doi:10.1007/3-540-45706-2_134 .
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134