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.

209 Publications


2004 | Conference Paper | LibreCat-ID: 18279
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 | DOI
 

2004 | Book Chapter | LibreCat-ID: 3014
A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18263
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 | DOI
 

2004 | Conference Paper | LibreCat-ID: 13618
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 | DOI
 

2004 | Book Chapter | LibreCat-ID: 3015
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 | DOI
 

2004 | Conference Paper | LibreCat-ID: 19692
P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII, 2004.
LibreCat | DOI
 

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

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

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

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

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

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

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

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

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

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

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

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

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

2002 | Conference Paper | LibreCat-ID: 19850
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 | DOI
 

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

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

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

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

2001 | Conference Paper | LibreCat-ID: 18964
T. Lukovszki, A. Maheshwari, and N. Zeh, “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.
LibreCat | DOI
 

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

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

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

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

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

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

1999 | Conference Paper | LibreCat-ID: 13608
M. Eisenring, M. Platzner, and L. Thiele, “Communication Synthesis for Reconfigurable Embedded Systems,” in Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1999, vol. 1673, pp. 205–214.
LibreCat | DOI
 

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

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

1998 | Book Chapter | LibreCat-ID: 16562
F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat | DOI
 

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

1998 | Conference Paper | LibreCat-ID: 13606
M. Platzner and G. De Micheli, “Acceleration of satisfiability algorithms by reconfigurable hardware,” in Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , 1998, pp. 69–78.
LibreCat | DOI
 

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

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

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

1997 | Conference Paper | LibreCat-ID: 16568
M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16569
F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

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

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

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

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

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

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

1995 | Book Chapter | LibreCat-ID: 16874
A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
LibreCat | DOI
 

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

1993 | Book Chapter | LibreCat-ID: 16732
K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in Data structures and efficient algorithms, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

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

1992 | Book Chapter | LibreCat-ID: 3046
H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 

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

1988 | Book Chapter | LibreCat-ID: 16767
B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in STACS 88, Berlin, Heidelberg, 1988.
LibreCat | DOI
 

1988 | Book Chapter | LibreCat-ID: 16768
M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in SWAT 88, Berlin, Heidelberg, 1988.
LibreCat | DOI
 

1987 | Book Chapter | LibreCat-ID: 19821
H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in Computation Theory and Logic, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16776
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 19819
H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16774
A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in Automata, Languages and Programming, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

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

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

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

1981 | Book Chapter | LibreCat-ID: 16814
F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” 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: IEEE

Export / Embed