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

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

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

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

Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257.
LibreCat: /record/19835
DOI: 10.1007/11561354_21

Probability Distributions for Channel Utilisation
C. Schindelhauer, K. Voß, 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

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

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

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

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

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

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

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

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

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

Improved Algorithms for Dynamic Page Migration
M. Bienkowski, M. Dynia, M. Korzeniowski, 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

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

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

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

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

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

A Web Computing Environment for Parallel Algorithms in Java
O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, 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

Load Balancing Strategies in a Web Computing Environment
O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, 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

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

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum, I. Wegener, in: Parallel Problem Solving from Nature - PPSN VIII, Berlin, Heidelberg, 2004.
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

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

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

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

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

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

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

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

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

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

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

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

Quasi-optimal Arithmetic for Quaternion Polynomials
M. Ziegler, 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

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

Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients
S. Böttcher, R. Steinmetz, in: Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–410.
LibreCat: /record/15077
DOI: 10.1007/978-3-540-39403-7_30

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

Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices
C. Steiger, H. Walder, M. Platzner, in: Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin, Heidelberg, 2003, pp. 575–584.
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

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

Communication-efficient parallel multiway and approximate minimum cut computation
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Acceleration of satisfiability algorithms by reconfigurable hardware
M. Platzner, G. De Micheli, in: Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , Springer , Berlin, Heidelberg, 1998, pp. 69–78.
LibreCat: /record/13606
DOI: 10.1007/bfb0055234

Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

Static and dynamic data management in networks
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Communication efficient parallel searching
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Learning a representation for optimizable formulas
H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.
LibreCat: /record/19816
DOI: 10.1007/3-540-61863-5_33

Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

Automata, Languages and Programming, 23rd International Colloquium, ICAL
F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICAL, Berlin, Heidelberg, 1996.
LibreCat: /record/16702
DOI: 10.1007/3-540-61440-0

Fault-tolerant shared memory simulations
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
LibreCat: /record/16703
DOI: 10.1007/3-540-60922-9_16

A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Shared memory simulations with triple-logarithmic delay
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Hot-potato routing on multi-dimensional tori
F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Parallel Architectures and Their Efficient Use
F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Capabilities and complexity of computations with integer division
K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Resemblance and symmetries of geometric patterns
H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

High performance universal hashing, with applications to shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Hashing strategies for simulating shared memory on distributed memory machines
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

On computations with integer division
B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

Upper and lower bounds for the dictionary problem
M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.
LibreCat: /record/16768
DOI: 10.1007/3-540-19487-8_24

Representation independent query and update operations on propositional definite Horn formulas
H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic, Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat: /record/19821
DOI: 10.1007/3-540-18170-9_167

Classes of first order formulas under various satisfiability definitions
H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119

A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54

Speeding up random access machines by few processors
F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

A time-space tradeoff for element distinctness
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

Efficient simulations among several models of parallel computers (extended abstract)
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Random access machines and straight-line programs
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Time-processor trade-offs for universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111