Wissenschaftliche Publikationen

Albers, S.: On the Influence of Lookahead in Competitive Paging Algorithms. Algorithmica 18 (1), S. 283 - 305 (1997)

Albers, S.; Hagerup, T.: Improved Parallel Integer Sorting without Concurrent Writing. Information and Computation 136 (1), S. 25 - 51 (1997)

Albers, S.; Mitzenmacher, M.: Revisiting the COUNTER algorithms for list update. Information Processing Letters 64 (3), S. 155 - 160 (1997)

Arikati, S. R.; Maheshwari, A.; Zaroliagis, C.: Efficient Computation of implicit representations of sparse graphs. Discrete Applied Mathematics 78 (1-3), S. 1 - 16 (1997)

Arikati, S.; Maheshwari, A.; Zaroliagis, C.: Efficient Computation of Implicit Representations of Spare Graphs. Discrete applied mathematics 78 (1-3), S. 1 - 16 (1997)

Arya, S.; Smid, M.: Efficient construction of a bounded degree spanner with low weight. Algorithmica 17 (1), S. 33 - 54 (1997)

Basin, D. A.; Matthews, S.; Viganò, L.: Labelled Propositional Modal Logics: Theory and Practice. Journal of Logic and Computation 7 (6), S. 685 - 717 (1997)

Bradford, P. G.; Capoyleas, V.: Weak epsilon-Nets for Points on a Hypersphere. Discrete & Computational Geometry 18 (1), S. 83 - 91 (1997)

Bradford, P. G.; Fleischer, R.; Smid, M.: More Efficient Parallel Totally Monotone Matrix Searching. Journal of Algorithms 23 (2), S. 386 - 400 (1997)

Brandenburg, F. J.; Jünger, M.; Mutzel, P.: Algorithmen zum automatischen Zeichnen von Graphen. Informatik Spektrum 20 (4), S. 199 - 207 (1997)

Breslauer, D.; Jiang, T.; Jiang, Z.: Rotations of Periodic Strings and Short Superstrings. Journal of Algorithms 24 (1), S. 340 - 353 (1997)

Campagna, S.; Slusallek, P.; Seidel, H.-P.: Ray Tracing of Spline Surfaces: Bézier Clipping, Chebyshev Boxing, and Bounding Volume Hierarchy - A Critical Comparison with New Results. The Visual Computer 13 (6), S. 265 - 282 (1997)

Chaudhuri, S.; Dubhashi, D.: Probabilistic Recurrence Relations Revisited. Theoretical computer science 181 (1), S. 45 - 56 (1997)

Chaudhuri, S.; Radhakrishnan, J.: The Complexity of Parallel Prefix Problems on Small Domains. Information and Computation 138 (1), S. 1 - 22 (1997)

Christof, T.; Jünger, M.; Kececioglu, J.; Mutzel, P.; Reinelt, G.: A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. Journal of Computational Biology 4 (4), S. 433 - 447 (1997)

Crochemore, M.; Galil, Z.; Gasieniec, L.; Park, K.; Rytter, W.: Constant-time Randomized Parallel String Matching. SIAM Journal on Computing 26 (4), S. 950 - 960 (1997)

Das, G.; Kapoor, S.; Smid, M.: On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. Algorithmica 19, S. 447 - 460 (1997)

Deng, X.; Mahajan, S.: The Cost of Derandomization: Computability or Competitiveness. SIAM Journal on Computing 26 (3), S. 786 - 802 (1997)

Dietzfelbinger, M.; Hagerup, T.; Katajainen, J.; Penttonen, M.: A Reliable Randomized Algorithm for the Closest-pair Problem. Journal of Algorithms 25 (1), S. 19 - 51 (1997)

Edelsbrunner, H.; Ramos, E. A.: Inclusion-exclusion complexes for pseudo-disk collections. Discrete and Computational Geometry 17, S. 287 - 306 (1997)