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.

214 Publications


2008 | Conference Paper | LibreCat-ID: 19003
Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 15146
Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.” Database and Expert Systems Applications, 18th International Conference, DEXA 2007, Springer, 2007, pp. 424–33, doi:10.1007/978-3-540-74469-6_42.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 17983
Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” Mathematical Foundations of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 18929
Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.” Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp. 260--271, doi:10.1007/978-3-540-69507-3_21.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 16640
Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” Mathematical Foundations of Computer Science 2001, 2007, doi:10.1007/3-540-44683-4_46.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 15144
Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.” Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–13, doi:10.1007/978-3-540-73390-4_10.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3019
May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:10.1007/3-540-45708-9_16.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3022
May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 17982
Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 16473
Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3004
Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 19838
Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006, doi:10.1007/11940128_65.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3005
Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 15150
Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.” Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 2006, pp. 266–69, doi:10.1007/11788911_27.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 18926
Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” Architecture of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3007
Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.
LibreCat | Files available | DOI
 

2006 | Conference Paper | LibreCat-ID: 15152
Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.” Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–74, doi:10.1007/11844662_12.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 16472
Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 17987
Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” Logical Approaches to Computational Barriers, 2006, doi:10.1007/11780342_39.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 17988
Köhler, Sven, et al. “On Approximating Real-World Halting Problems.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18912
Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18924
Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 17989
Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18280
Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18867
Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18925
Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 16468
Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 3006
Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.
LibreCat | Files available | DOI
 

2005 | Conference Paper | LibreCat-ID: 16470
Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 19835
Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 19912
Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 15156
Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–54, doi:10.1007/11552338_10.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18768
Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18915
Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 16471
Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 19836
Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 3010
Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:10.1007/11426639_22.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3011
Blömer, Johannes, et al. “Provably Secure Masking of AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
LibreCat | DOI
 

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

2004 | Conference Paper | LibreCat-ID: 16474
Bansal, Vikas, et al. “Labeling Smart Dust.” 12th Annual European Symposium on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18778
Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004, doi:10.1007/978-3-540-30140-0_25.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18279
Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3014
May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:10.1007/978-3-540-24632-9_16.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18263
Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” Proc. 12th Annual Symposium on Algorithms (ESA’04), vol. 3221, Springer, 2004, pp. 544–55, doi:10.1007/978-3-540-30140-0_49.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 13618
Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.” Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2004, pp. 831–35, doi:10.1007/978-3-540-30117-2_84.
LibreCat | DOI
 

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

2004 | Conference Paper | LibreCat-ID: 19692
Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16543
Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.” Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-45084-x_8.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 18258
Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” Lecture Notes in Computer Science, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:10.1007/978-3-540-45078-8_13.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 13615
Steiger, Christoph, et al. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.” Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2003, pp. 575–84, doi:10.1007/978-3-540-45234-8_56.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 15077
Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.” Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–10, doi:10.1007/978-3-540-39403-7_30.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16664
Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_36.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18196
Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–15, doi:10.1007/978-3-540-24587-2_72.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 15078
Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.” Database and XML Technologies, First International XML Database Symposium, XSym 2003, 2003, pp. 85–99, doi:10.1007/978-3-540-39429-7_6.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3018
Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16665
Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_9.
LibreCat | DOI
 

2003 | Journal Article | LibreCat-ID: 19785
Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” Algorithms for Memory Hierarchies, vol. 2625, 2003, doi:10.1007/3-540-36574-5_12.
LibreCat | DOI
 

2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 18566
Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 19850
Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18152
Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.
LibreCat | DOI
 

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

2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” 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 | Journal Article | LibreCat-ID: 18749
Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, Artur, et al. “Property Testing in Computational Geometry.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 13608
Eisenring, Michael, et al. “Communication Synthesis for Reconfigurable Embedded Systems.” Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), vol. 1673, Springer, 1999, pp. 205–14, doi:10.1007/978-3-540-48302-1_21.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 2435
Simon, Jens, et al. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.” SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, edited by Hermann Hellwagner and Alexander Reinefeld, vol. 1734, Springer, 1999, pp. 367–81, doi:10.1007/10704208.
LibreCat | DOI
 

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

1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 17412
Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.
LibreCat | Files available | DOI
 

1998 | Conference Paper | LibreCat-ID: 13606
Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.” Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , Springer , 1998, pp. 69–78, doi:10.1007/bfb0055234.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, Artur, and Willy-B. Strothmann. “Bounded Degree Spanning Trees.” 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, Johannes. “Denesting by Bounded Degree Radicals.” Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.
LibreCat | Files available | DOI
 

1997 | Conference Paper | LibreCat-ID: 16568
Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.
LibreCat | DOI
 

1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS 96, 1996, doi:10.1007/3-540-60922-9_16.
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 19816
Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” Lecture Notes in Computer Science, 1996, doi:10.1007/3-540-61863-5_33.
LibreCat | DOI
 

1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.
LibreCat | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
LibreCat | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed