Bockmayr, A.; Kasper, T.: Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study. In: Deklarative Constraint Programmierung, pp. 29 - 41 (Eds. Geske, U.; Simonis, H.). Untitled Event, Dresden, Germany, 1996. GMD, Sankt Augustin, Germany (1996)

Bradford, P. G.; Reinert, K.: Lower Bounds for Row Minima Searching. In: Automata Languages and Programming, pp. 454 - 465 (Eds. Meyer auf der Heide, F.; Monien, B.). 23rd International Colloquium on Automata Languages and Programming, Paderborn, Germany, July 08, 1996 - July 12, 1996. Springer, Berlin, Germany (1996)

Brodal, G. S.: Priority queues on parallel machines. In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), pp. 416 - 427. Untitled Event, Reykjavik, Iceland, July 03, 1996 - July 05, 1996. Springer, Berlin, Germany (1996)

Brodal, G. S.; Chaudhuri, S.; Radhakrishnan, J.: The Randomized Complexity of Maintaining the Minimum. In: Algorithm Theory - SWAT '96, pp. 4 - 15 (Eds. Karlsson, R.; Lingas, A.). 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 03, 1996 - July 05, 1996. Springer, Berlin (1996)

Brodal, G. S.; Gasieniec, L.: Approximate Dictionary Queries. In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), pp. 65 - 74 (Eds. Hirschberg, D.; Myers, G.). Untitled Event, Laguna Beach, June 10, 1996 - June 12, 1996. Springer, Berlin, Germany (1996)

Calinescu, G.; Fernandes, C. G.; Finkler, U.; Karloff, H.: A Better Approximation Algorithm for Finding Planar Subgraphs. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 16 - 25. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Georgia, USA, January 28, 1996 - January 30, 1996. ACM, New York, NY (1996)

Cantu, F.; Bundy, A.; Smaill, A.; Basin, D. A.: Experiments in Automating Hardware Verification using Inductive Proof Planning. In: Formal Methods for Computer-Aided Design, pp. 94 - 108 (Eds. Srivas, M.; Camilleri, A.). First International Conference on Formal Methods in Computer-aided Design, Palo Alto, CA, USA, November 06, 1996 - November 08, 1996. Springer, Berlin, Germany (1996)

Charatonik, W.; Podelski, A.: The Independence Property of a Class of Set Constraints. In: Principles and Practice of Constraint Programming, Proceedings of the Second International Conference (CP'96), pp. 76 - 90 (Ed. Freuder, E.). Untitled Event, Cambridge, USA, 1996. Springer, Berlin, Germany (1996)

Chaudhuri, S.; Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 30 - 36. 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA, May 22, 1996 - May 24, 1996. ACM, New York (1996)

Chen, D. Z.; Das, G.; Smid, M.: Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. In: Proceedings of the 8th Canadian Conference on Computational Geometry, pp. 155 - 160 (Eds. Fiala, F.; Kranakis, E.; Sack, J.-R.). 8th Canadian Conference on Computational Geometry, Ottawa, Canada, August 12, 1996 - August 15, 1996. Carleton University Press, Ottawa (1996)

Chlebus, B. S.; Czumaj, A.; Gasieniec, L.; Kowaluk, M.; Plandowski, W.: Parallel Alternating-Direction Access Machine. In: Mathematical Foundations of Computer Science 1996, pp. 267 - 278 (Eds. Penczek, W.; Szalas, A.). 21st International Symposium on Mathematical Foundations of Computer Science, Cracow, Poland, September 02, 1996 - September 06, 1996. Springer, Berlin (1996)

Chong, K. W.: Finding minimum spanning trees on the EREW PRAM. In: International Computer Symposium, pp. 7 - 14. Untitled Event, Taiwan, 1996. -, - (1996)

Chong, K. W.; Lam, T. W.: Towards more precise parallel biconnectivity approximation. In: 7th Annual International Symposium on Algorithms and Computation, pp. 223 - 232. Untitled Event, Osaka, 1996. -, - (1996)

Cole, R.; Hariharan, R.: An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), pp. 323 - 332. Untitled Event, Georgia, USA, 1996. acm, New York (1996)

Das, G.; Kapoor, S.; Smid, M.: On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. In: Foundations of software technology and theoretical computer science, pp. 64 - 75 (Eds. Chandru, V.; Vinay, V.). 16th Conference on Foundations of Software Technology and Theoretical Computer Science , Hyderabad, India, December 18, 1996 - December 20, 1996. Springer, Berlin, Germany (1996)

Diks, K.; Hagerup, T.: More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. In: Graph-theoretic Concepts in Computer Science, pp. 126 - 140 (Eds. d'Amore, F.; Franciosa, P. G.; Marchetti-Spaccamela, A.). 22nd International Workshop on Graph-theoretic Concepts in Computer Science , Cadenabbia, Italy, June 12, 1996 - June 14, 1996. Springer, Berlin, Germany (1996)

Dobkin, D. P.; Gunopulos, D.: Geometric problems in machine learning. In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), pp. 121 - 132 (Eds. Lin, M. C.; Manocha, D.). Untitled Event, Philadelphia, USA, May 27, 1996 - May 28, 1996. Springer, Berlin, Germany (1996)

Fabri, A.; Giezeman, G.-J.; Kettner, L.; Schirra, S.; Schönherr, S.: The CGAL Kernel: A Basis for Geometric Computation. In: Applied Computational Geometry: Towards Geometric Engineering, pp. 191 - 202 (Eds. Lin, M. C.; Manocha, D.; Lin, M. C.). FCRC'96 Workshop, WACG'96 , Philadelphia, PA, May 27, 1996 - May 28, 1996. Springer, Berlin (1996)

Ganzinger, H.: Saturation-based Theorem Proving (Abstract). In: Automata Languages and Programming, pp. 1 - 3 (Eds. Meyer auf der Heide, F.; Monien, B.). 23rd International Colloquium on Automata Languages and Programming, Paderborn, Germany, July 08, 1996 - July 12, 1996. Springer, Berlin, Germany (1996)

Ganzinger, H.: Saturation-based Theorem Proving: Past Successes and Future Potential. In: Automated Deduction - Cade-13, p. 1 - 1 (Eds. McRobbie, M. A.; Slaney, J. K.). 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996 - August 03, 1996. Springer, Berlin (1996)