Publication Definability and Undefinability with Real Order at the Background Yuri Gurevich, Alexander Rabinovich Journal of Symbolic Logic | January 2000, Vol 65(2): pp. 946-958
Publication Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs Zhendong Su, Manuel Fahndrich, Alexander Aiken Proceedings POPL 2000, 27’th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | January 2000
Publication Learning Subjective Adjectives from Corpora Janyce M. Wiebe Proceedings of AAAI-00, 17th Conference of the American Association for Artificial Intelligence | January 2000 Proceedings of AAAI-00, 17th Conference of the American Association for Artificial Intelligence ISBN: 0-262-51112-6
Publication Choiceless Polynomial Time Computation and the Zero-One Law Andreas Blass, Yuri Gurevich Proceedings of CSL’2000, Springer Lecture Notes in Computer Science | January 2000
Publication The Multi-Architecture Performance of the Parallel Functional Language GPH P.W. Trinder, H-W. Loidl, E. Barry, K. Hammond, U. Klusik, Simon Peyton Jones Euro-Par 2000 “” Parallel Processing | January 2000 Euro-Par 2000 — Parallel Processing
Publication On the cover time of planar graphs Johan Jonasson, Oded Schramm Electron. Comm. Probab. | January 2000, Vol 5: pp. 85-90
Publication Performance Evaluation of the Nearest Feature Line Method in Image Retrieval Stan Z. Li, Kap Luk Chan, Changliang Wang January 2000
Publication Non-stop Haskell Simon Marlow, Simon Peyton Jones ICFP ’00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming | January 2000 ISBN: 1-58113-202-6
Publication Using Abstract State Machines at Microsoft: A Case Study Yuri Gurevich, Wolfram Schulte, Margus Veanes, Mike Barnett Abstract State Machines | January 2000 Abstract State Machines ISBN: 3-540-67959-6 Project
Publication WebCaL – A Domain Specific Language for Web Caching Sumit Gulwani, Asha Tarachandani, Deepak Gupta, Dheeraj Sanghi, Luciano Porto Barreto , Charles Consel, Gilles Muller Computer Communications | January 2000