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