Your search returned the following 23 documents:

23. The LEDA class real number -- extended version
    Stefan Funke, Kurt Mehlhorn, Susanne Schmitt, Christoph Burnikel, Rudolf Fleischer, and Stefan Schirra
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363110-01, Report
    
22. Using Finite Experiments to Study Asymptotic Performance
    Catherine McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, and Doina Precup
    In: Experimental Algorithmics, 2002, 93-126
    
21. A strong and easily computable separation bound for arithmetic expressions involving radicals
    Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
    Algorithmica 27 (1): 87-99, 2000
    
    
20. Limited bookmark randomized online algorithms for the paging problem
    Wolfgang W. Bein, Rudolf Fleischer, and Lawrence L. Larmore
    Information Processing Letters 76 (4-6): 155-162, 2000
    
19. Online scheduling revisited
    Rudolf Fleischer and Michaela Wahl
    In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), Saarbrücken, Germany, September, 5 - 8, 2000, 202-210
    
18. Decision trees: old and new results
    Rudolf Fleischer
    Information and computation 152: 44-61, 1999
    
17. Efficient exact geometric computation made easy
    Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
    In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, USA, June, 13- June, 16, 1999, 341-350
    
    
16. Effiziente und Online-Algorithmen
    Rudolf Fleischer
    Habilitation thesis, Universität des Saarlandes, 1999
    
15. FUN with implementing algorithms
    Rudolf Fleischer
    In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), Elba, Italy, June 18-20, 1998, 1999, 88-98
    
14. On the Bahncard problem
    Rudolf Fleischer
    In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), Taipei, Taiwan, R.o.C., August, 12-14, 1998, 65-74
    
13. A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
    Kurt Mehlhorn, Christoph Burnikel, Rudolf Fleischer, and Stefan Schirra
    In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), New Orleans, USA, January, 5-7, 1997, 702-709
    
12. Episode matching
    Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, and Juha Kärkkäinen
    In: Combinatorial pattern matching : 8th annual symposium (CPM-97), Aarhus, Denmark, June, 30-July, 2, 1997, 12-27
    
11. More efficient parallel totally monotone matrix searching
    Phillip Gnassi Bradford, Rudolf Fleischer, and Michiel Smid
    Journal of Algorithms 23: 386-400, 1997
    
10. A simple balanced search tree with $O(1)$ worst-case update time
    Rudolf Fleischer
    International Journal of Foundations of Computer Science 7 (2): 137-149, 1996
    
9. Matching nuts and bolts faster
   Noga Alon, Phillip Gnassi Bradford, and Rudolf Fleischer
   Information Processing Letters 59 (3): 123-127, 1996
   
8. A communication-randomness tradeoff for two-processor systems
   Rudolf Fleischer, Hermann Jung, and Kurt Mehlhorn
   Information and Computation 116 (2): 155-161, 1995
   
7. Matching nuts and bolts faster
   Phillip Gnassi Bradford and Rudolf Fleischer
   In: Algorithms and Computation: 6th International Symposium (ISAAC'95), Cairns, Australia, December, 4-6, 1995, 402-408
   
6. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
   Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
   Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
   
5. Selected Topics from Computational Geometry, Data Structures and Motion Planning
   Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, and Christian Uhrig
   In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 1992, 25-43
   
4. Simultaneous Inner and Outer Approximation of Shapes
   Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee-Keng Yap
   Algorithmica 8 (5/6): 365-389, 1992
   
3. A Time-Randomness Tradeoff for Communication Complexity
   Rudolf Fleischer, Hermann Jung, and Kurt Mehlhorn
   In: Distributed Algorithms, 4th International Workshop, Bari, Italy, 1991, 390-401
   
2. Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
   Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
   In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
   
1. On Simultaneous Inner and Outer Approximation of Shapes
   Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee-Keng Yap
   In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 216-224