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