Wissenschaftliche Publikationen

Alon, N.; Bradford, P. G.; Fleischer, R.: Matching nuts and bolts faster. Information Processing Letters 59 (3), S. 123 - 127 (1996)

Alon, N.; Kelsen, P.; Mahajan, S.; Ramesh, H.: Coloring 2-colorable Hypergraphs with a Sublinear Number of Colors. Nordic Journal of Computing 3 (4), S. 425 - 439 (1996)

Alt, H.; Guibas, L.; Mehlhorn, K.; Karp, R. M.; Wigderson, A.: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16, S. 543 - 547 (1996)

Arikati, S. R.; Maheshwari, A.: Realizing degree sequences in parallel. SIAM Journal of Discrete Mathematics 9 (2), S. 317 - 338 (1996)

Arya, S.; Mount, D. M.; Narayan, O.: Accounting for boundary effects in nearest neighbor searching. Discrete & Computational Geometry 16 (2), S. 155 - 176 (1996)

Basin, D. A.; Matthews, S.: Adding Metatheoretic facilities to First-order Theories. Journal of Logic and Computation 6 (6), S. 835 - 849 (1996)

Basin, D. A.; Walsh, T.: A Calculus for and Termination of Rippling. Journal of Automated Reasoning 16 (1/2), S. 147 - 180 (1996)

Breslauer, D.; Hariharan, R.: Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Processing Letters 6 (1), S. 35 - 44 (1996)

Brodal, G. S.; Chaudhuri, S.; Radhakrishnan, R.: The Randomized Complexity of Maintaining the Minimum. Nordic Journal of Computing 3 (4), S. 337 - 351 (1996)

Chaudhuri, S.: Sensitive functions and approximate problems. Information and Computation 126 (-), S. 161 - 168 (1996)

Chaudhuri, S.; Dimopoulos, Y.; Zaroliagis, C.: On the Parallel Complexity of Acyclic Logic Programs. Parallel Processing Letters 6 (2), S. 223 - 230 (1996)

Cheriyan, J.; Hagerup, T.; Mehlhorn, K.: An o(n³)-Time Maximum-Flow Algorithm. SIAM Journal on Computing 25 (6), S. 1144 - 1170 (1996)

Cheriyan, J.; Mehlhorn, K.: Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica 15 (6), S. 521 - 549 (1996)

De Simone, C.; Diehl, M.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G.: Exact Ground States of Two-Dimensional +-J Ising Spin Glasses. Journal of Statistical Physics 84 (5/6), S. 1363 - 1371 (1996)

Devillers, O.; Golin, M. J.; Kedem, K.; Schirra, S.: Queries on Voronoi Diagrams of Moving Points. Computational Geometry: Theory and Applications 6 (5), S. 315 - 327 (1996)

Dimopoulos, Y.: On Computing Logic Programs. Journal of Automated Reasoning 17 (3), S. 259 - 289 (1996)

El Kahoui, M.: An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve. Journal of Complexity 12 (4), S. 527 - 544 (1996)

Fleischer, R.: A simple balanced search tree with $O(1)$ worst-case update time. International Journal of Foundations of Computer Science 7 (2), S. 137 - 149 (1996)

Fleischer, R.: A Simple Balanced Search Tree with 0(1) Worst-case Update Time. International Journal of Foundations of Computer Science 7 (2), S. 137 - 149 (1996)

Garg, N.; Vazirani, V. V.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing 25 (2), S. 235 - 251 (1996)