Scientific Publications

Bachmair, L.; Ganzinger, H.; Waldmann, U.: Refutational Theorem Proving for Hierarchic First-Order Theories. Applicable Algebra in Engineering, Communication and Computing (AAECC) 5 (3/4), pp. 193 - 212 (1994)

Basin, D. A.: A Term Equality Problem Equivalent to Graph Isomorphism. Information Processing Letters 51 (2), pp. 61 - 66 (1994)

Baumgarten, H.; Jung, H.; Mehlhorn, K.: Dynamic Point Location in General Subdivisions. Journal of Algorithms 17 (3), pp. 342 - 380 (1994)

Bilardi, G.; Chaudhuri, S.; Dubhashi, D.; Mehlhorn, K.: A lower bound for area-universal graphs. Information Processing Letters 51, pp. 101 - 105 (1994)

Brink, C.; Britz, K.; Schmidt, R. A.: Peirce Algebras. Formal Aspects of Computing 6 (3), pp. 339 - 358 (1994)

Brink, C.; Gabbay, D. M.; Ohlbach, H. J.: Towards Automating Duality. Journal of Computers and Mathematics with Applications 29 (2), pp. 73 - 90 (1994)

Special issue on algorithms: implementation, libraries and use. Journal on Symbolic Computation 17 (4) (1994)

Chadha, R.; Plaisted, D. A.: Correctness of unification without occur check in Prolog. Journal of Logic Programming 18 (2), pp. 99 - 122 (1994)

Chaudhuri, S.: Tight Bounds on Oblivious Chaining. SIAM Journal on Computing 23 (6), pp. 1253 - 1265 (1994)

Dietzfelbinger, M.; Karlin, A.; Mehlhorn, K.; Meyer Auf Der Heide, F.; Rohnert, H.; Tarjan, R. E.: Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing 23 (4), pp. 738 - 761 (1994)

Dimopoulos, Y.; Magirou, V.: A Graph Theoretic Approach to Default Logic. Information and Computation 112 (2), pp. 239 - 256 (1994)

Feldmann, A.; Sgall, J.; Teng, S.-H.: Dynamic Scheduling on Parallel Machines. Theoretical Computer Science 130 (1), pp. 49 - 72 (1994)

Fleischer, R.: A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. Algorithmica 11 (2), pp. 104 - 115 (1994)

Greiner, G.; Seidel, H.-P.: Modeling with Triangular B-splines. IEEE Computer Graphics and Applications 14 (2), pp. 56 - 60 (1994)

Hagerup, T.; Maas, M.: Generalized Topological Sorting in Linear Time. Nordic Journal of Computing 1 (1), pp. 38 - 49 (1994)

Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19 & 20, pp. 583 - 628 (1994)

Hausmann, B.; Seidel, H.-P.: Visualization of Regular Polytopes in Three and Four Dimensions. Computer Graphics Forum 13 (3), pp. 305 - 316 (1994)

Kaufmann, M.; Mehlhorn, K.: A Linear-time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM Journal on Computing 23 (2), pp. 227 - 246 (1994)

Lee, S.-J.; Plaisted, D. A.: Problem solving by searching for models with a theorem prover. Artificial Intelligence 69 (1/2), pp. 205 - 233 (1994)

Lee, S.-J.; Plaisted, D. A.: Use of replace rules in theorem proving. Methods of Logic in Computer Science 1, pp. 217 - 240 (1994)