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.

262 Publications


2006 | Book Chapter | LibreCat-ID: 3007
Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4
LibreCat | Files available | DOI
 

2006 | Conference Paper | LibreCat-ID: 18926
Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: Architecture of Computing Systems - ARCS. ; 2006:341--351. doi:10.1007/11682127_24
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 17987
Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: Logical Approaches to Computational Barriers. Berlin, Heidelberg; 2006. doi:10.1007/11780342_39
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 16472
Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In: LATIN 2006: Theoretical Informatics. Berlin, Heidelberg; 2006. doi:10.1007/11682462_34
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 16473
Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2006. doi:10.1007/11821069_29
LibreCat | DOI
 

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

2006 | Conference Paper | LibreCat-ID: 15152
Böttcher S, Steinmetz R. Information Disclosure by XPath Queries. In: Secure Data Management, Third VLDB Workshop, SDM 2006. Springer; 2006:160-174. doi:10.1007/11844662_12
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 35958
Fouvry É, Klüners J. Cohen–Lenstra Heuristics of Quadratic Number Fields. In: Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2006. doi:10.1007/11792086_4
LibreCat | Files available | DOI
 

2005 | Conference Paper | LibreCat-ID: 19835
Rührup S, Schindelhauer C, Volbert K. 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). Vol 3738. ; 2005:244-257. doi:10.1007/11561354_21
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 19836
Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005). 3738. ; 2005:271-284. doi:10.1007/11561354_23
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 19912
Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In: Proceedings of the 4th International Conference on Networking. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:10.1007/978-3-540-31957-3_90
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 3006
Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15
LibreCat | Files available | DOI
 

2005 | Book Chapter | LibreCat-ID: 3010
Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: EUROCRYPT 2005. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:10.1007/11426639_22
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 26991
Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: Algorithms – ESA 2005. ; 2005. doi:10.1007/11561071_5
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18768
Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Berlin, Heidelberg; 2005:866-877. doi:10.1007/11523468_70
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18867
Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67
LibreCat | DOI
 

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

2005 | Conference Paper | LibreCat-ID: 18915
Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:10.1007/11561071_72
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18924
Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking. Vol 3420. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:10.1007/978-3-540-31956-6_49
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18925
Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 17988
Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_40
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 17989
Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_41
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18280
Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68
LibreCat | DOI
 

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

2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg; 2005. doi:10.1007/11549345_1
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 16470
Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 16471
Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 15156
Böttcher S, Steinmetz R. Detecting Privacy Violations in Sensitive XML Databases. In: Secure Data Management, Second VLDB Workshop, SDM 2005. Springer; 2005:143-154. doi:10.1007/11552338_10
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 19692
Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3011
Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:10.1007/978-3-540-30564-4_5
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3012
Blömer J, May A. A Generalized Wiener Attack on RSA. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1
LibreCat | Files available | DOI
 

2004 | Book Chapter | LibreCat-ID: 3014
May A. 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:218-230. doi:10.1007/978-3-540-24632-9_16
LibreCat | DOI
 

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

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

2004 | Conference Paper | LibreCat-ID: 18263
Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials. In: Proc. 12th Annual Symposium on Algorithms (ESA’04). Vol 3221. Berlin, Heidelberg: Springer; 2004:544-555. doi:10.1007/978-3-540-30140-0_49
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18279
Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04). Vol 3341. Berlin, Heidelberg: Springer ; 2004:805-821. doi:10.1007/978-3-540-30551-4_69
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 16474
Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: 12th Annual European Symposium on Algorithms (ESA 2004). Vol 3221. Lecture Notes in Computer Science. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_9
LibreCat | DOI
 

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

2003 | Journal Article | LibreCat-ID: 19785
Salzwedel KA. Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies. 2003;2625. doi:10.1007/3-540-36574-5_12
LibreCat | DOI
 

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

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

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

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

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

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

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

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

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

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

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

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

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

2002 | Book Chapter | LibreCat-ID: 16723
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 | DOI
 

2001 | Journal Article | LibreCat-ID: 18749
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 | DOI
 

2001 | Conference Paper | LibreCat-ID: 18964
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 | DOI
 

2001 | Conference Paper | LibreCat-ID: 18152
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 | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68
LibreCat | DOI
 

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

2000 | Book Chapter | LibreCat-ID: 3023
Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 2435
Simon J, Reinefeld A, Heinz O. Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI. In: Hellwagner H, Reinefeld A, eds. SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters. Vol 1734. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer; 1999:367-381. doi:10.1007/10704208
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999:193-204. doi:10.1007/3-540-48447-7_20
LibreCat | DOI
 

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

1999 | Conference Paper | LibreCat-ID: 13608
Eisenring M, Platzner M, Thiele L. Communication Synthesis for Reconfigurable Embedded Systems. In: Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL). Vol 1673. LCS. Springer; 1999:205-214. doi:10.1007/978-3-540-48302-1_21
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 17412
Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg; 1998. doi:10.1007/3-540-68530-8_14
LibreCat | Files available | DOI
 

1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 13606
Platzner M, De Micheli G. Acceleration of satisfiability algorithms by reconfigurable hardware. In: Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) . LNCS. Berlin, Heidelberg: Springer ; 1998:69-78. doi:10.1007/bfb0055234
LibreCat | DOI
 

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

1997 | Book Chapter | LibreCat-ID: 3029
Blömer J. Denesting by bounded degree radicals. In: Algorithms — ESA ’97. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:10.1007/3-540-63397-9_5
LibreCat | Files available | DOI
 

1997 | Conference Paper | LibreCat-ID: 16568
Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13
LibreCat | DOI
 

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

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

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

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

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

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

1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81
LibreCat | DOI
 

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

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

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

1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide F, Monien B, Rosenberg AL, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer; 1993. doi:10.1007/3-540-56731-3
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: Automata, Languages and Programming. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56939-1_89
LibreCat | DOI
 

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

1992 | Book Chapter | LibreCat-ID: 3046
Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:10.1007/3-540-55488-2_19
LibreCat | DOI
 

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

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

1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: STACS 92. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55210-3_176
LibreCat | DOI
 

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

1988 | Book Chapter | LibreCat-ID: 16767
Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On computations with integer division. In: STACS 88. Berlin, Heidelberg; 1988. doi:10.1007/bfb0035829
LibreCat | DOI
 

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

1987 | Book Chapter | LibreCat-ID: 19821
Büning HK, Lettmann T. Representation independent query and update operations on propositional definite Horn formulas. In: Börger E, ed. Computation Theory and Logic. Berlin, Heidelberg; 1987:208-223. doi:10.1007/3-540-18170-9_167
LibreCat | DOI
 

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

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

1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide F. Speeding up random access machines by few processors. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_72
LibreCat | DOI
 

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

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

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed