Matthews, S.; Smaill, A.; Basin, D.: Experience with FS_0 as a Framework Theory. In: Logical Environments, pp. 61 - 82 (Eds. Huet, G.; Plotkin, G.). Cambridge University Press, Cambridge, UK (1993)

Ohlbach, H. J.; Eisinger, N.: Deduction Systems Based on Resolution. In: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1, pp. 183 - 271 (Eds. Gabbay, D. M.; Hogger, C. J.; Robinson, J. A.). Oxford University Press, New York, NY (1993)

Bachmair, L.; Ganzinger, H.; Waldmann, U.: Set Constraints are the Monadic Class. In: Eighth Annual IEEE Symposium on Logic in Computer Science, pp. 75 - 83. Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, June 19, 1993 - June 23, 1993. IEEE, Los Alamitos, USA (1993)

Bachmair, L.; Ganzinger, H.; Waldmann, U.: Superposition with simplification as a decision procedure for the monadic class with equality. In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, pp. 83 - 96 (Eds. Gottlob, G.; Leitsch, A.; Mundici, D.). Third Kurt Gödel Colloquium, Brno, Czech Republic, 1993. Springer, Berlin, Germany (1993)

Barnes, G.: A Method for Implementing Lock-free Shared Data Structures. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 261 - 270. Fifth Annual ACM Symposium on Parallel Algorithms and Architectures , Velen, Germany, June 30, 1993 - July 02, 1993. ACM, New York, NY (1993)

Barnes, G.; Edmonds, J. A.: Time-space Lower Bounds for Directed s-t Connectivity on JAG Models. In: 34th Annual Symposium on Foundations of Computer Science, pp. 228 - 237. 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, USA, November 03, 1993 - November 05, 1993. IEEE explore, Piscataway, NJ (1993)

Barnes, G.; Feige, U.: Short Random Walks on Graphs. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pp. 728 - 737 (Eds. Kosaraju, S. R.; Johnson, D. S.; Aggarwal, A.). Twenty-fifth Annual ACM Symposium on the Theory of Computing , San Diego, CA, USA, May 16, 1993 - May 18, 1993. ACM, New York, NY (1993)

Barth, P.: Linear 0-1 Inequalities and Extended Clauses. In: Proceedings~4th International~Conference on Logic Programming and Automated Reasoning LPAR '93, pp. 40 - 51 (Ed. Voronkov, A.). Untitled Event, St. Petersburg, Russia, 1993. Springer, Berlin, Germany (1993)

Barth, P.; Bockmayr, A.: Solving 0-1 Problems in CLP(PB). In: The Ninth Conference on Artificial Intelligence for Applications, pp. 263 - 269. 9th Conference on Artificial Intelligence for Applications, Orlando, FL, United States, March 01, 1993 - March 05, 1993. IEEE, Los Alamitos, USA (1993)

Basin, D.; Constable, R. L.: Metalogical Frameworks. In: Papers Presented at the Second Annual Workshop on Logical Environments, pp. 1 - 29 (Eds. Huet, G.; Plotkin, G.). Second Annual Workshop on Logical Environments, Edinburgh, UK , 1993-12. Cambridge University Press, New York, NY (1993)

Basin, D.; Matthews, S.: A Conservative Extension of First-order Logic and its Applications to Theorem Proving. In: Foundations of Software Technology and Theoretical Computer Science, pp. 151 - 160 (Ed. Shyamasundar, R. K.). 13th Conference on Foundations of Software Technology and Theoretical Computer Science Conference, Bombay, India, December 15, 1993 - December 17, 1993. Springer, Berlin, Germany (1993)

Basin, D.; Matthews, S.; Kraan, I.; Bundy, A.: A Framework for Program Development Based on Schematic Proof. In: 7th International Workshop on Software Specification and Design, pp. 162 - 171. 7th International Workshop on Software Specification and Design, Redondo Beach, CA, USA, December 06, 1993 - December 07, 1993. IEEE Computer Society Press, Washington, DC (1993)

Basin, D.; Walsh, T.: Difference Unification. In: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence ; Chambéry, France, August 28 - September 3, 1993, Vol. 1, pp. 116 - 122 (Ed. Bajcsy, R.). Thirteenth International Joint Conference on Artificial Intelligence, Chambéry, France, August 28, 1993 - September 03, 1993. Morgan Kaufmann, San Mateo, CA (1993)

Bockmayr, A.: Embedding OR Techniques in Constraint Logic Programming. In: Operations Research '92, pp. 252 - 254 (Eds. Karmann, A.; Mosler, K.; Schader, M.; Uebe, G.). 17th Symposium on Operations Research, Hamburg, August 25, 1992 - August 28, 1992. Physica‐Verlag, Hamburg, Germany (1993)

Bockmayr, A.; Radermacher, F. J.: Künstliche Intelligenz und Operations Research. In: Grundlagen und Anwendungen der Künstlichen Intelligenz, pp. 249 - 254 (Eds. Herzog, O.; Christaller, T.; Schütt, D.). 17. Fachtagung für Künstliche Intelligenz, Berlin, Germany, September 13, 1993 - September 16, 1993. Springer, Berlin (1993)

Chaudhuri, S.: Sensitive Functions and Approximate Problems. In: 34th Annual Symposium on Foundations of Computer Science, pp. 186 - 193. 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, USA, November 03, 1993 - November 05, 1993. IEEE explore, Piscataway, NJ (1993)

Chaudhuri, S.: A Lower Bound for Linear Approximate Compaction. In: Proceedings of the 2nd Israel Symposium on Theory and Computing Systems, pp. 25 - 32. 2nd Israel Symposium on Theory and Computing Systems, Natanya, Israel, June 07, 1993 - June 09, 1993. IEEE explore, Piscataway, NJ (1993)

Chaudhuri, S.; Hagerup, T.; Raman, R.: Approximate and Exact Deterministic Parallel Selection. In: Mathematical Foundations of Computer Science 1993, pp. 352 - 361 (Eds. Borzyszkowski, A. M.; Sokołowski, S.). 18th International Symposium on Mathematical Foundations of Computer Science, Gdańsk, Poland, August 30, 1993 - September 03, 1993. Springer, New York, NY, USA (1993)

Datta, A.; Lenhof, H.-P.; Schwarz, C.; Smid, M.: Static and Dynamic Algorithms for k-point Clustering Problems. In: Algorithms and Data Structures, pp. 265 - 276 (Eds. Dehne, F.; Sack, J.-R.; Santoro, N.; Whitesides, S.). Third Workshop on Algorithms and Data Structures, Montréal, Canada, August 11, 1993 - August 13, 1993. Springer, Berlin, Germany (1993)

Dietz, P.; Mehlhorn, K.; Raman, R.; Uhrig, C.: Lower Bounds for Set Intersection Queries. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 194 - 201. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, USA, January 25, 1993 - January 27, 1993. ACM / SIAM, New York, USA (1993)