Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

264 Publications


2003 | Journal Article | LibreCat-ID: 19785
Algorithmic Approaches for Storage Networks
K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3016
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 | DOI
 

2003 | Book Chapter | LibreCat-ID: 3018
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 | DOI
 

2003 | Conference Paper | LibreCat-ID: 18196
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 | DOI
 

2003 | Book Chapter | LibreCat-ID: 18258
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 | DOI
 

2003 | Book Chapter | LibreCat-ID: 16543
Congestion and Almost Invariant Sets in Dynamical Systems
M. Dellnitz, R. Preis, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16664
A New Data Structure for the Nondominance Problem in Multi-objective Optimization
O. Schütze, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16665
Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques
O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 15077
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 | DOI
 

2003 | Conference Paper | LibreCat-ID: 15078
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 | DOI
 

2003 | Conference Paper | LibreCat-ID: 13615
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 | DOI
 

2002 | Conference Paper | LibreCat-ID: 19850
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 24338
Distributed Maintenance of Resource Efficient Wireless Network Topologies
M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 18566
Randomized Pursuit-Evasion in Graphs
M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.
LibreCat | DOI
 

2002 | Book Chapter | LibreCat-ID: 16723
Mobile Computing, Mobile Networks
F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 18749
Testing Hypergraph Coloring
A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18964
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18152
A Computable Spectral Theorem
M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
Data Management in Networks
F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
Parallel Bridging Models and Their Impact on Algorithm Design
F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 3023
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
Property Testing in Computational Geometry
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
Computing the Dimension of Linear Subspaces
M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 16497
Complexity Theory and Algorithms
F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 2435
Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI
J. Simon, A. Reinefeld, O. Heinz, in: H. Hellwagner, A. Reinefeld (Eds.), SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, Springer, Berlin / Heidelberg, 1999, pp. 367–381.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18959
New Results on Fault Tolerant Geometric Spanners
T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
Provably Good and Practical Strategies for Non-uniform Data Management in Networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 13608
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 | DOI
 

1998 | Book Chapter | LibreCat-ID: 17412
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat | Files available | DOI
 

1998 | Book Chapter | LibreCat-ID: 16562
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 | DOI
 

1998 | Conference Paper | LibreCat-ID: 13606
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 | DOI
 

1997 | Conference Paper | LibreCat-ID: 19869
Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 3029
Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat | Files available | DOI
 

1997 | Conference Paper | LibreCat-ID: 16568
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 | DOI
 

1997 | Book Chapter | LibreCat-ID: 16569
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 | DOI
 

1997 | Book Chapter | LibreCat-ID: 16605
Communication efficient parallel searching
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 19816
Learning a representation for optimizable formulas
H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 17564
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 | DOI
 

1996 | Book (Editor) | LibreCat-ID: 16702
Automata, Languages and Programming, 23rd International Colloquium, ICALP96
F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 16703
Fault-tolerant shared memory simulations
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
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 | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
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 | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
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 | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
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 | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16732
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 3046
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16789
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat | DOI
 

1988 | Book Chapter | LibreCat-ID: 16767
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 | DOI
 

1988 | Book Chapter | LibreCat-ID: 16768
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 | DOI
 

1987 | Book Chapter | LibreCat-ID: 19821
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 | DOI
 

1986 | Book Chapter | LibreCat-ID: 19819
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 | DOI
 

1986 | Book Chapter | LibreCat-ID: 16774
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 | DOI
 

1986 | Book Chapter | LibreCat-ID: 16775
Speeding up random access machines by few processors
F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16776
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 | DOI
 

1984 | Book Chapter | LibreCat-ID: 16787
Efficient simulations among several models of parallel computers (extended abstract)
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.
LibreCat | DOI
 

1981 | Book Chapter | LibreCat-ID: 16813
Random access machines and straight-line programs
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat | DOI
 

1981 | Book Chapter | LibreCat-ID: 16814
Time-processor trade-offs for universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed