Wissenschaftliche Publikationen

Ahuja, R. K.; Mehlhorn, K.; Orlin, J. B.; Tarjan, R. E.: Faster Algorithms for the Shortest Path Problem. Journal of the ACM 37 (2), S. 213 - 223 (1990)

Brahm, U.; Pitz, W.: Parkwächter. C't Magazin für Computer Technik - (3), S. 252 - 253 (1990)

Ching, Y.-T.; Mehlhorn, K.; Smid, M. H. M.: Dynamic Deferred Data Structuring. Information Processing Letters 35 (1), S. 37 - 40 (1990)

Hagerup, T.: Planar Depth-First Search in O(log n) Parallel Time. SIAM Journal on Computing 19 (4), S. 678 - 704 (1990)

Hagerup, T.: Optimal Parallel Algorithms on Planar Graphs. Information and Computation 84 (1), S. 71 - 96 (1990)

Hagerup, T.; Rüb, C.: A Guided Tour of Chernoff Bounds. Information Processing Letters 33 (6), S. 305 - 308 (1990)

Hagerup, T.; Shen, H.: Improved Nonconservative Sequential and Parallel Integer Sorting. Information Processing Letters 36 (2), S. 57 - 63 (1990)

Mehlhorn, K.; Näher, S.: Dynamic Fractional Cascading. Algorithmica 5 (2), S. 215 - 241 (1990)

Mehlhorn, K.; Näher, S.: Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Information Processing Letters 35 (4), S. 183 - 189 (1990)

Mehlhorn, K.; Näher, S.: A faster compaction algorithm with automatic jog insertion. IEEE Transactions on CAD of Integrated Circuits and Systems 9, S. 158 - 166 (1990)

Mehlhorn, K.; Näher, S.; Rauch, M.: On the Complexity of a Game Related to the Dictionary Problem. SIAM Journal on Computing 19 (5), S. 902 - 906 (1990)

Mehlhorn, K.; Näher, S.; Uhrig, C.: Hidden Line Elimination for Isooriented Rectangles. Information Processing Letters 35 (3), S. 137 - 143 (1990)

Mehlhorn, K.; Rülling, W.: Compaction on the Torus. IEEE Transactions on CAD of Integrated Circuits and Systems 9, S. 389 - 397 (1990)

Seidel, H.-P.: Symmetric Triangular Algorithms for Curves. Computer Aided Geometric Design 7 (1-4), S. 57 - 67 (1990)

Seidel, H.-P.: Quaternionen in Computergraphik und Robotik / Quaternions in Computer Graphics and Robotics. Information technology 32 (4), S. 266 - 275 (1990)

Kaufmann, M.; Mehlhorn, K.: Routing Problems in Grid Graphs. In: Paths, Flows, and VLSI-Layout (Hg. Korte, B.; Lovász, L.; Prömel, H. J.; Schrijver, A.). Springer, Berlin, Germany (1990)

Mehlhorn, K.; Tsakalidis, A.: Data Structures. In: Handbook of Theoretical Computer Science, S. 301 - 341 (Hg. Leeuwen, J.). Elsevier/MIT, Amsterdam, The Netherlands (1990)

Alt, H.; Fleischer, R.; Kaufmann, M.; Mehlhorn, K.; Näher, S.; Schirra, S.; Uhrig, C.: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. In: Computational geometry (SCG-90): 6th annual symposium, S. 281 - 289. Untitled Event, Berkeley, USA, 06. Juni 1990. ACM, New York, USA (1990)

Bachmair, L.; Ganzinger, H.: On Restrictions of Ordered Paramodulation with Simplification. In: 10th International Conference on Automated Deduction, S. 427 - 441 (Hg. Stickel, M. E.). 10th International Conference on Automated Deduction, Kaiserslautern, FRG, 24. Juli 1990 - 27. Juli 1990. Springer, Berlin (1990)

Cheriyan, J.; Hagerup, T.; Mehlhorn, K.: Can A Maximum Flow be Computed in o(nm) Time? In: Automata, languages and programming (ICALP-90): 17th international colloquium, S. 235 - 248. Untitled Event, Warwick University, England, 16. Juli 1990. Springer, Berlin, Germany (1990)