<algorithm name="ParsCit" version="1.0">
<citationList>
<citation>
<authors>
<author>J Reif</author>
<author>L G Valiant</author>
</authors>
<booktitle>Proceedings of the 15th Annual ACM Symposium on Theory of Computing</booktitle>
<location>Boston</location>
<date>1987</date>
<title>A Logarithmic Time Sort on Linear Size Networks</title>
<journal>Journal of the ACM</journal>
<pages>60--76</pages>
</citation>
<citation>
<authors>
<author>U Vazirani</author>
</authors>
<booktitle>In Proceedings of the 19 th Annual ACM Symposium on Theory of Computing</booktitle>
<location>New York City</location>
<date>1987</date>
<title>Efficiency considerations in using semi-random sources</title>
</citation>
<citation>
<authors>
<author>A C Yao</author>
</authors>
<booktitle>In Proceedings of the 13 th Annual ACM Symposium on Theory of Computing</booktitle>
<location>Milwaukee, Wisconsin</location>
<date>1981</date>
<title>The entropic limitations on VLSI computations</title>
<pages>308--311</pages>
</citation>
<citation>
<authors>
<author>Nimrod Megiddo</author>
</authors>
<date>1984</date>
<title>Linear programming in linear time when the dimension is fixed</title>
<journal>Journal of the ACM</journal>
<pages>31--1</pages>
</citation>
<citation>
<authors>
<author>Muneo Takahashi</author>
<author>Yuji Kamayachi</author>
</authors>
<booktitle>Proceedings of the Eighth International Conference on Software Engineering</booktitle>
<date></date>
<title>An Empirical Study of a Model for Program Error Prediction</title>
<pages>28--30</pages>
</citation>
<citation>
<authors>
<author>G M Lohman</author>
</authors>
<booktitle>Proceedings of the ACM SIGMOD International Conference on the Management of Data</booktitle>
<location>Chicago, IL</location>
<date>1988</date>
<title>Grammar-Like Functional Rules for Representing Query Optimization Alternatives</title>
<pages>18--27</pages>
</citation>
<citation>
<authors>
<author>R E Mayer</author>
</authors>
<volume>2</volume>
<date>1979</date>
<title>A psychology of learning BASIC computer programming</title>
<journal>Journal of Communications of the ACM</journal>
<pages>589--593</pages>
</citation>
<citation>
<authors>
<author>Marc Gyssens</author>
<author>Laks V S Lakshmanan</author>
<author>Iyer N Subramanian</author>
</authors>
<booktitle>In Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems</booktitle>
<location>Montreal, Canada</location>
<date></date>
<title>Tables as a paradigm for querying and restructuring</title>
<pages>3--5</pages>
</citation>
<citation>
<authors>
<author>Wolf-Dietrich Weber</author>
<author>Anoop Gupta</author>
</authors>
<booktitle>In Proceedings of the Third International Conference on Architectural Support for Programming Languages Operating Systems ASPLOS III</booktitle>
<date></date>
<title>Analysis of Cache Invalidation Patterns in Multiprocessors</title>
<pages>243--256</pages>
</citation>
<citation>
<authors>
<author>Dan Suciu</author>
<author>Val Breazu-Tannen</author>
</authors>
<booktitle>In Proceedings of 13th ACM Symposium on Principles of Database Systems, Minneapofis</booktitle>
<location>Minnesota</location>
<date>1994</date>
<title>A query language for NC</title>
</citation>
<citation>
<authors>
<author>W Hill</author>
</authors>
<booktitle>Proceedings of the 1989 ACM Conference on Human Factors in Computing Systems</booktitle>
<date>1989</date>
<title>How Some Advice Fails</title>
<pages>85--90</pages>
</citation>
<citation>
<authors>
<author>D LEHMAN</author>
<author>ANO RABIN</author>
<author>M</author>
</authors>
<booktitle>In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages</booktitle>
<location>Williamsburg, Va</location>
<date></date>
<title>On the advantages of free choice: A symmetric and fully distributed solution of the dining philosophers problem</title>
<pages>26--28</pages>
</citation>
<citation>
<authors>
<author>K Abrahamson</author>
</authors>
<booktitle>In Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing</booktitle>
<date>1988</date>
<title>On achieving consensus using shared memory</title>
<pages>291--302</pages>
</citation>
<citation>
<authors>
<author>J Grudin</author>
<author>S E Poltrock</author>
</authors>
<booktitle>In Proceedings CHI '89 Human Factors in Computing Systems. ACM</booktitle>
<location>New York</location>
<date>1981</date>
<title>User interface design in large corporations: Coordination and communication across disciplines</title>
<pages>197--203</pages>
</citation>
<citation>
<authors>
<author>S Takakuwa</author>
</authors>
<booktitle>In Proceedings of the 1994 Winter Simulation Conference, Piscataway</booktitle>
<location>New Jersey</location>
<date>1994</date>
<title>Precise modeling and analysis of large-scale AS/RS</title>
</citation>
<citation>
<authors>
<author>J Heintz</author>
<author>C P Schnorr</author>
</authors>
<booktitle>In Proceedings of the lth Annual ACM Symposium on the Theory o f Computing</booktitle>
<date>1980</date>
<title>Testing polynomials that are easy to compute</title>
<pages>262--272</pages>
</citation>
<citation>
<authors>
<author>Barry Silverman</author>
</authors>
<date>1992</date>
<title>Survey of Expert Critiquing Systems: Practical and Theoretical Frontiers</title>
<journal>Communications of the ACM</journal>
<pages>35--4</pages>
</citation>
<citation>
<authors>
<author>H Ludwigs</author>
</authors>
<booktitle>Proceedings of the 16th annual SIMULATION symposium</booktitle>
<location>Tampa, Florida</location>
<date>1983</date>
<title>SIMIS II -An Environment For Material Flow Systems Simulation</title>
<pages>69--78</pages>
</citation>
<citation>
<authors>
<author>Robert M Metcalfe</author>
<author>David R Boggs</author>
</authors>
<volume>19</volume>
<date>1976</date>
<title>Ethemet: Distributed Packet Switching for Local Computer Networks</title>
<journal>Communications of the ACM</journal>
</citation>
<citation>
<authors>
<author>A Deutsch</author>
</authors>
<booktitle>Proceedings of the ACM SIGPLAN 94 Conference on Programming Language Design Implementation</booktitle>
<date>1994</date>
<title>Interprocedural may-alias analysis for pointers: Beyond k-limiting</title>
<pages>230--241</pages>
</citation>
<citation>
<authors>
<author>Alan Borning</author>
</authors>
<date>1981</date>
<title>The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory</title>
<journal>ACM Transactions on Programming Languages Systems</journal>
<pages>3--4</pages>
</citation>
<citation>
<authors>
<author>D Gries</author>
<author>J Prins</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN 85 Symposium on Language Issues in Programming Environments. no 7, 18. ACM</booktitle>
<location>New York</location>
<date>1985</date>
<title>A new notion of encapsulation</title>
<pages>131--139</pages>
</citation>
<citation>
<authors>
<author>A D Falkoff</author>
</authors>
<booktitle>Proceedings of the Second Annual SHARE Workshop on Design Automation, Atlantic City</booktitle>
<date>1965</date>
<title>Formal Description of Processes -The First Step in Design Automation</title>
</citation>
<citation>
<authors>
<author>Barry W Smith</author>
</authors>
<volume>8</volume>
<date>1965</date>
<title>Symbolic notations for statistical tables and an approach towards automatic systems design</title>
<journal>Communications of the ACM Association for Computing Machinery</journal>
</citation>
<citation>
<authors>
<author>J V Raghavan</author>
<author>J E Bracken</author>
<author>R A Rohrer</author>
</authors>
<booktitle>Proceedings of the 29th ACM/IEEE Design Automation Conference</booktitle>
<date>1992</date>
<title>AWESpice: A General Tool for the Accurate and Efficient Simulation of Interconnect Problems</title>
<pages>87--92</pages>
</citation>
<citation>
<authors>
<author>J Bradley Chen</author>
<author>Brian N Bershad</author>
</authors>
<booktitle>In Proceedings Conference of SIGIR</booktitle>
<date>1993</date>
<title>The Impact of Operating System Structure on Memory System Performance</title>
<pages>120--133</pages>
</citation>
<citation>
<authors>
<author>G D Stamoulis</author>
<author>J N Tsitsiklis</author>
</authors>
<booktitle>In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms Architectures</booktitle>
<date>1991</date>
<title>The efficiency of greedy routing in hypercubes and butterflies</title>
<pages>248--259</pages>
</citation>
<citation>
<authors>
<author>Phillip B Gibbons</author>
<author>Ephraim Korach</author>
</authors>
<booktitle>In Proceedings of the 6th Annual Symposium on Parallel Algorithms Architectures</booktitle>
<location>New York, NY, USA</location>
<date>1994</date>
<title>On testing cache-coherent shared memories</title>
<publisher>ACM Press</publisher>
<pages>177--188</pages>
</citation>
<citation>
<authors>
<author>J C MOGUL</author>
</authors>
<booktitle>In Proceedings of the SIGCOMM 90 Symposium on Communications Architectures Protocols. ACM</booktitle>
<location>New York</location>
<date>1990</date>
<title>Efficient use of workstations for passive monitoring of local area networks</title>
<pages>253--263</pages>
</citation>
<citation>
<authors>
<author>C Rose</author>
</authors>
<volume>2</volume>
<date>1996</date>
<title>Minimizing the Average Cost of Paging and Registration: A Timer-Based Method</title>
<journal>ACM journal of Wireless Networks</journal>
<pages>109--116</pages>
</citation>
<citation>
<authors>
<author>George W Cherry</author>
</authors>
<date>1991</date>
<title>S-R Machines: a Visual Formalism for Reactive and Interactive Systems</title>
<journal>ACM Software Engineering Notes</journal>
<pages>16--3</pages>
</citation>
<citation>
<authors>
<author>Kenji Yamanishi</author>
</authors>
<booktitle>In Proceedings of the Third Annual Workshop on Computational Learning Theory</booktitle>
<date>1990</date>
<title>A learning criterion for stochastic rules</title>
</citation>
<citation>
<authors>
<author>Brown</author>
<author>Dobbie</author>
</authors>
<booktitle>in Proceedings of the thirty SIGCSE Technical Symposium on Computer Science</booktitle>
<date>1999</date>
<title>A learning criterion for stochastic rules on Supporting and Evaluating Team Dynamics in Group Projects</title>
<publisher>ACM Press</publisher>
<pages>281--285</pages>
</citation>
<citation>
<authors>
<author>Xiaogang Qiu</author>
<author>Michel Dubois</author>
</authors>
<booktitle>In Proceedings of the 25th Annual International Symposium on Computer Architecture ISCA</booktitle>
<date>1998</date>
<title>Options for Dynamic Address Translation for COMAs</title>
<pages>214--225</pages>
</citation>
<citation>
<authors>
<author>Brian K Reid</author>
</authors>
<booktitle>In Conference Record of 7th annual Symposium on Principles of Programming Languages</booktitle>
<location>Las Vegas, Nevada</location>
<date>1980</date>
<title>A high-level approach to computer document formatting</title>
<pages>24--31</pages>
</citation>
<citation>
<authors>
<author>R Jain</author>
<author>Y B Lin</author>
</authors>
<date>1995</date>
<title>An Auxiliary User Location Strategy Employing Forwarding Pointers to Reduce Network Impact of PCS</title>
<journal>ACM Balker Journal of Wireless Nattuork</journal>
</citation>
<citation>
<authors>
<author>David R Karger</author>
<author>Philip N Klein</author>
<author>Robert E Tarjan</author>
</authors>
<date>1995</date>
<title>A randomized linear-time algorithm to find minimum spanning trees</title>
<journal>Journal of the ACM</journal>
<pages>42--2</pages>
</citation>
<citation>
<authors>
<author>Thomas D Clark</author>
<author>William A Shrode</author>
</authors>
<booktitle>Proceedings of the Winter Simulation Conference</booktitle>
<location>Miami, Florida</location>
<date>1978</date>
<title>Public Utility Operation and Growth: A System Simulation Model</title>
<pages>806--814</pages>
</citation>
<citation>
<authors>
<author>M E Maron</author>
<author>K L Kuhns</author>
</authors>
<volume>7</volume>
<date>1960</date>
<title>On relevance, probabilistic indexing and information retrieval</title>
<journal>Journal of the Associations of Computing Machinery ACM</journal>
<pages>216--244</pages>
</citation>
<citation>
<authors>
<author>U V Vazirani</author>
</authors>
<booktitle>Proceedings of the 17th Annual ACM Symposium on Theory of Computing</booktitle>
<date>1985</date>
<title>Towards a strong communication complexity theory or generating quasirandom sequences from two communicating; slightly-random sources</title>
<pages>366--378</pages>
</citation>
<citation>
<authors>
<author>Claus-Werner Lermen</author>
<author>Dieter Maurer</author>
</authors>
<booktitle>In Proceedings 1986 ACM Conference on Lisp Functional Programming</booktitle>
<location>Cambridge, Massachusetts</location>
<date>1986</date>
<title>A protocol for distributed reference counting</title>
<pages>343--350</pages>
<journal>ACM SIGPLAN/SIGACT/SIGART</journal>
</citation>
<citation>
<authors>
<author>A Aggarwal</author>
<author>B Alpern</author>
<author>A K Chandra</author>
<author>M Snil</author>
</authors>
<booktitle>In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing</booktitle>
<date>1987</date>
<title>A model for hierarchical memory</title>
<pages>305--313</pages>
</citation>
<citation>
<authors>
<author>Steffen Lange</author>
<author>Thomas Zeugmann</author>
</authors>
<booktitle>Proceedings of the Sixth Conference on Computational Learning Theory COLT</booktitle>
<date>1993</date>
<title>Language learning in dependence on the space of hypotheses</title>
<pages>127--136</pages>
</citation>
<citation>
<authors>
<author>Avrim Blum</author>
</authors>
<booktitle>In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing</booktitle>
<location>New York</location>
<date>1990</date>
<title>Learning Boolean functions in an infinite attribute space</title>
<pages>64--72</pages>
</citation>
<citation>
<authors>
<author>J Carabetta</author>
</authors>
<volume>19</volume>
<date>1987</date>
<title>The Planning and Procedures Associated with the Western New England College Winter Invitational High School Programming Contest</title>
<journal>ACM SIGCSE Bulletin</journal>
<pages>29--35</pages>
</citation>
<citation>
<authors>
<author>R S GLANVILLE</author>
<author>S L GRAHAM</author>
</authors>
<booktitle>In Conference Record of the 5th Annual Symposium on Principles of Programming Languages (Tucson, Ariz</booktitle>
<location>New York</location>
<date>1978</date>
<title>A new method for compiler code generation</title>
<publisher>ACM</publisher>
<pages>23--25</pages>
</citation>
<citation>
<authors>
<author>B Kutzlcr</author>
<author>S Sifter</author>
</authors>
<booktitle>in Proceedings of the 1986 Symposium on Symbolic Algebraic Computation</booktitle>
<date>1986</date>
<title>Automate A Geometry Theorem Proving Using Buchberger's Algorithm</title>
<pages>209--214</pages>
</citation>
<citation>
<authors>
<author>Atsushi Ohori</author>
<author>Peter Buneman</author>
</authors>
<booktitle>In ACM Conference on LISP Functional Programming</booktitle>
<date>1988</date>
<title>Type inference in a database langage</title>
<pages>174--183</pages>
</citation>
<citation>
<authors>
<author>Steven M Drucker</author>
<author>Tinsley A Galyean</author>
<author>David Zeltzer</author>
</authors>
<date>1992</date>
<title>CINEMA: A system for procedural camera movements. volume 25</title>
<pages>67--70</pages>
</citation>
<citation>
<authors>
<author>G C Necula</author>
</authors>
<booktitle>In Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</booktitle>
<location>Paris, France</location>
<date></date>
<title>Proof-carrying code</title>
<pages>15--17</pages>
</citation>
<citation>
<authors>
<author>Akima</author>
</authors>
<volume>17</volume>
<date>1970</date>
<title>A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures</title>
<journal>Journal of the ACM</journal>
<pages>589--602</pages>
</citation>
<citation>
<authors>
<author>J Why rudin</author>
</authors>
<booktitle>In Proceedings of the Conference on Computer-Supported Cooperative Work</booktitle>
<location>Portland, OR), NY</location>
<date></date>
<title>CSCW Applications Fail: Problems in x the Design and Evaluation of Organisational Interfaces</title>
<pages>26--28</pages>
</citation>
<citation>
<authors>
<author>R P Selke</author>
</authors>
<booktitle>In Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages</booktitle>
<date>1989</date>
<title>A rewriting semantics for program dependence graphs</title>
<publisher>ACM Press</publisher>
<pages>2--24</pages>
</citation>
<citation>
<authors>
<author>B CABRAL</author>
<author>N CAM</author>
<author>J FORAN</author>
</authors>
<booktitle>Proceedings of the 1994 Symposium on Volume Visualization</booktitle>
<location>Washington</location>
<date>1994</date>
<title>Accelerated Rendering Tomographic Reconstruction Using Texture Mapping Hardware</title>
<pages>91--97</pages>
</citation>
<citation>
<authors>
<author>T Malone</author>
<author>K Crowston</author>
</authors>
<booktitle>In Proceedings of the Conference on Compute-Supported Cooperative Work. Association for Computing Machinery ACM</booktitle>
<location>New York, (Los Angeles</location>
<date></date>
<title>What is coordination theory and how can it help design cooperative work systems</title>
</citation>
<citation>
<authors>
<author>W Cunto</author>
<author>J Ian Munro</author>
</authors>
<booktitle>Proceedings of the Sixteenth Annual ACM Symposzum on Theory of Computing</booktitle>
<date>1984</date>
<title>Average case selection</title>
<pages>369--375</pages>
</citation>
<citation>
<authors>
<author>P Cousot</author>
<author>R Cousot</author>
</authors>
<booktitle>4th ACM Symposium on Principles of Programming Languages</booktitle>
<date>1977</date>
<title>Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints</title>
<pages>238--252</pages>
</citation>
<citation>
<authors>
<author>A Avritzer</author>
<author>B Larson</author>
</authors>
<booktitle>Proceedings of the 1993 International Symposium on Software Testing Analysis ISSTA</booktitle>
<date>1993</date>
<title>Load testing software using deterministic state testing</title>
<publisher>ACM Press</publisher>
<pages>82--88</pages>
</citation>
<citation>
<authors>
<author>Mark Finch</author>
<author>Mike Falvo</author>
<author>Vernon L Chi</author>
<author>Sean Washburn</author>
<author>Russell M Taylor</author>
<author>Richard Superfine</author>
</authors>
<booktitle>In Conference Symposium on Interactive 3D Graphics</booktitle>
<date>1995</date>
<title>Surface Modification Tools in a Virtual Environment Interface to a Scanning Probe Microscope</title>
<pages>13--18</pages>
</citation>
<citation>
<authors>
<author>K Andrews</author>
<author>R R Henry</author>
<author>W K Yamamoto</author>
</authors>
<booktitle>Proceedings of the ACM SIGPLAN 1988 Symposium on Programming Lanuage Design Implementation, ACM SiGPLAN Notices</booktitle>
<volume>18</volume>
<date>1988</date>
<title>Design and Implementation of the UW Illustrated Compiler</title>
<pages>105--114</pages>
</citation>
<citation>
<authors>
<author>S Konstantinidou</author>
<author>L Snyder</author>
</authors>
<booktitle>In Proceedings of the 18th International Symposium on Computer Architecture</booktitle>
<date>1991</date>
<title>Chaos Router: architecture and performance</title>
<pages>212--221</pages>
</citation>
<citation>
<authors>
<author>K Daniels</author>
<author>V J Milenkovic</author>
</authors>
<booktitle>In Proceedirgs of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms</booktitle>
<date>1995</date>
<title>Multiple Translational Containment: Approximate and Exact Algorithms</title>
</citation>
<citation>
<authors>
<author>K Knowlton</author>
</authors>
<booktitle>Proceedings of ACM SIGPLAN Symposium on 2-D Man-machine Communications, Los Alamos</booktitle>
<date>1972</date>
<title>A Report on the Use of FORTRAN-coded EXPLOR for the Teaching of Computer Graphics and Computer Art</title>
</citation>
<citation>
<authors>
<author>P W Foltz</author>
</authors>
<booktitle>In Proceedings of theACM Conference on Office Information Systems</booktitle>
<location>Boston</location>
<date></date>
<title>Using Latent Semantic Indexing for information filtering</title>
<publisher>ACM/SIGOIS</publisher>
<pages>25--27</pages>
</citation>
<citation>
<authors>
<author>G Bristow</author>
<author>C Drey</author>
<author>B Edwards</author>
<author>W Riddie</author>
</authors>
<booktitle>Proceedings of the Jib International Conference on Software Engineering</booktitle>
<date>1979</date>
<title>Anomaly Detection in Concurrent Programs</title>
<pages>265--273</pages>
</citation>
<citation>
<authors>
<author>K Pettis</author>
<author>R C Hansen</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design Implementation</booktitle>
<date>1990</date>
<title>Profile guided code positioning</title>
<pages>16--27</pages>
</citation>
<citation>
<authors>
<author>N Matelan</author>
</authors>
<booktitle>In Proceedings of the 12th International Symposium on Computer Architecture</booktitle>
<date>1985</date>
<title>The Flex/32 multicomputer</title>
<publisher>Computer Society Press</publisher>
<pages>209--213</pages>
</citation>
<citation>
<authors>
<author>W TICHY</author>
</authors>
<booktitle>In Proceedings of the 6th IEEE International Conference on Software Engineering (Sept.). IEEE</booktitle>
<location>New York</location>
<date>1982</date>
<title>Design implementation, and evaluation of a revision control system</title>
</citation>
<citation>
<authors>
<author>T J Ostrand</author>
<author>M J Balcer</author>
</authors>
<date>1988</date>
<title>The categorypartition method for specifying and generating functional tests</title>
<journal>Communications of the ACM</journal>
<pages>31--6</pages>
</citation>
<citation>
<authors>
<author>Vladimir Batageli</author>
</authors>
<volume>18</volume>
<date>1975</date>
<title>The quadratic hash method when the table is not a prime number</title>
<journal>Communications of the ACM</journal>
<pages>216--217</pages>
</citation>
<citation>
<authors>
<author>J WARREN</author>
</authors>
<booktitle>In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages (Salt Lake City, UT</booktitle>
<location>New York</location>
<date>1984</date>
<title>A hierarchical basis for reordering transformations</title>
<publisher>ACM</publisher>
<pages>272--282</pages>
</citation>
<citation>
<authors>
<author>J ROMPEL</author>
</authors>
<booktitle>In Proceedings of the 22nd Annual ACM Symposium on the Theoo' of Computing. ACM</booktitle>
<location>New York</location>
<date>1990</date>
<title>One-way functions are necessary and sufficient for secure signatures</title>
<pages>387--394</pages>
</citation>
<citation>
<authors>
<author>J M Wing</author>
<author>M Vaziri-Farahani</author>
</authors>
<booktitle>In Proceedings of SIGSOFT'95 Third ACM SIGSOFT Symposium on the Foundations of Software Engineering</booktitle>
<date>1995</date>
<title>Model checking software systems: A case study</title>
<pages>128--139</pages>
</citation>
<citation>
<authors>
<author>S L Peyton Jones</author>
<author>Jon Salldld</author>
</authors>
<booktitle>In Proceedings of the 1989 Conference on Functional Programming Languages and Computer Architecture</booktitle>
<date>1989</date>
<title>The Model Spineless Tagless G-machine</title>
</citation>
<citation>
<authors>
<author>F Lockwood Morris</author>
</authors>
<booktitle>In Proceedings of the First ACM Symposium on Principles of Programming Languages</booktitle>
<date>1973</date>
<title>Advice on structuring compilers and proving them correct</title>
<pages>144--152</pages>
</citation>
<citation>
<authors>
<author>J Ross</author>
<author>K Ruhleder</author>
</authors>
<booktitle>Proceedings of the 1993 Conference on Computer Personnel Research</booktitle>
<date>1993</date>
<title>Preparing IS Professionals for a Rapidly Changing World: The Challenge for IS Edacators</title>
<pages>379--384</pages>
</citation>
<citation>
<authors>
<author>J CONKLIN</author>
<author>M L BEGEMAN</author>
</authors>
<booktitle>In Proceedings of the ACM Conference on Computer-Supported Cooperative Work CSCW '88</booktitle>
<location>Portland, OR</location>
<date>1988</date>
<title>gIBIS: a hypertext tool for exploratory policy discussion</title>
<publisher>ACM Press</publisher>
<pages>26--28</pages>
</citation>
<citation>
<authors>
<author>J Histad</author>
</authors>
<booktitle>in Proceedings of the 18th ACM Symposium on Theory of Computing</booktitle>
<date>1986</date>
<title>Almost Optimal Lower Bounds for Small Depth Circuits</title>
<pages>6--20</pages>
</citation>
<citation>
<authors>
<author>A Davis</author>
</authors>
<volume>9</volume>
<date>1988</date>
<title>A Comparison of Techniques for the Specification of External System Behavior</title>
<journal>Communications of the ACM 3I</journal>
<pages>1098--1115</pages>
</citation>
<citation>
<authors>
<author>S P Fekete</author>
</authors>
<booktitle>in Proceedings of the ACM/SIAM Symposium on Discrete Algorithms</booktitle>
<date>1999</date>
<title>Simplicity and hardness of the Maximum Traveling Salesman Problem under geometric distances</title>
</citation>
<citation>
<authors>
<author>Randy Allen</author>
<author>Ken Kennedy</author>
</authors>
<volume>4</volume>
<date>1987</date>
<title>Automatic Translation of FORTRAN Programs to Vector Form</title>
<journal>ACM Transactions of Programming Languages Systems, volume 9, No</journal>
<pages>491--542</pages>
</citation>
<citation>
<authors>
<author>J Buhler</author>
<author>M Tompa</author>
</authors>
<booktitle>In Proceedings of the Fifth Annual International Conference on Computational Molecular Biology RECOMB-01</booktitle>
<location>Montreal, Canada</location>
<date>2001</date>
<title>Finding motifs using random projections</title>
<publisher>ACM Press</publisher>
<pages>69--76</pages>
</citation>
<citation>
<authors>
<author>Christian Collberg</author>
</authors>
<booktitle>In Proceedings of the SIGPLAN '97 Conference on Programming Language Design Implementation</booktitle>
<date>1997</date>
<title>Reverse interpretation + mutation analysis -automatic retargeting</title>
</citation>
<citation>
<authors>
<author>J R Rossignac</author>
<author>H B Voelcker</author>
</authors>
<date>1989</date>
<title>Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection and shading algorithms</title>
<journal>ACM Transactions on Graphics</journal>
<pages>8--1</pages>
</citation>
<citation>
<authors>
<author>James P Callan</author>
<author>Zhihong Lu</author>
<author>W Bruce Croft</author>
</authors>
<booktitle>In Proceedings of the 18th International Conference on Research Development in Information Retrieval</booktitle>
<location>Seattle, WA</location>
<date>1995</date>
<title>Searching Distributed Collections with Inference Networks</title>
<pages>21--29</pages>
</citation>
<citation>
<authors>
<author>MAKOTO MATSUMOTO</author>
</authors>
<booktitle>and Computer Simulation Special Issue on Uniform Random Number Generation</booktitle>
<date>1998</date>
<title>Mersenne Twister. A 623-dimensionally equidistribuited uniform pseudo-random number generator</title>
<journal>ACM Transactions on Modeling</journal>
</citation>
<citation>
<authors>
<author>M Dennis Mickunas</author>
<author>Richard M ScheU</author>
</authors>
<booktitle>ACM: Proceedings of the Annual Conference</booktitle>
<date>1978</date>
<title>Parallel Compilation in a Multiprocessor Environment</title>
<pages>241--246</pages>
</citation>
<citation>
<authors>
<author>K Osterbye</author>
</authors>
<booktitle>In Proceedings of the ACM Conference on Hypertext</booktitle>
<location>Milan, Italy, Nov), ACM, New York</location>
<date>1992</date>
<title>Structural and cognitive problems in providing version control for hypertext</title>
<pages>3</pages>
</citation>
<citation>
<authors>
<author>P Pirolli</author>
</authors>
<booktitle>in Conference on Human Factors in Computing Systems</booktitle>
<date>1997</date>
<title>Computational models of information scentfollowing in a very large browsable text collection</title>
</citation>
<citation>
<authors>
<author>William E Biles</author>
<author>J James</author>
</authors>
<booktitle>Proceedings of the Winter Simulation Conference</booktitle>
<location>New York</location>
<date>1977</date>
<title>Strategies for Optimization of Multiple-Response Simulation Models</title>
<publisher>IEEE Press</publisher>
<pages>135--142</pages>
</citation>
<citation>
<authors>
<author>P YIANNILOS</author>
</authors>
<booktitle>In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM</booktitle>
<location>New York, NY</location>
<date>1993</date>
<title>Data structures algorithms for nearest neighbor search in general metric spaces</title>
<publisher>Press</publisher>
<pages>311--321</pages>
</citation>
<citation>
<authors>
<author>A P Sistla</author>
<author>O Wolfson</author>
</authors>
<booktitle>In Proceedings of the 1995 ACM SIGMOD Intl. Conference on Management of Data</booktitle>
<date>1995</date>
<title>Temporal Conditions and Integrity Constraints in Active Database Systems</title>
<pages>269--280</pages>
</citation>
<citation>
<authors>
<author>K Inoue</author>
<author>T Ishihara</author>
<author>K Murakami</author>
</authors>
<booktitle>In Proceedings of the International Symposium on Low Power Electronics Design ISLPED</booktitle>
<date>1999</date>
<title>Way-predicting set-associative cache for high performance and low energy consumption</title>
<pages>273--75</pages>
</citation>
<citation>
<booktitle>Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms</booktitle>
<date>1996</date>
<title>Ming-Deh Huang and Ashwin Rao, Interpolation of sparse multivariate polynomials over finite fields with applications</title>
<pages>508--517</pages>
</citation>
<citation>
<authors>
<author>B CHAZELLE</author>
</authors>
<booktitle>In Proceedings of the 26th Annual ACM Symposium on Theory of Computing</booktitle>
<location>Montreal, Que., Canada</location>
<date>1994</date>
<title>Computational geometry: A retrospective</title>
<publisher>ACM</publisher>
<pages>23--25</pages>
</citation>
<citation>
<authors>
<author>C Preist</author>
<author>M van_Tol</author>
</authors>
<booktitle>Proceedings of the 1 st International Conference on the Intemet Computing Economics, ACM</booktitle>
<date>1998</date>
<title>Adaptive Agents in a Persistent Shout Double Auction</title>
<publisher>Press</publisher>
</citation>
<citation>
<authors>
<author>D CALLAHAN</author>
<author>B KOBLENZ</author>
</authors>
<booktitle>In Proceedings of the 1991 ACM SIGPLAN Conference on Programming Language Design Implementation. ACM</booktitle>
<location>New York</location>
<date>1991</date>
<title>Register allocation via hierarchical graph coloring</title>
<pages>192--203</pages>
</citation>
<citation>
<authors>
<author>B A Barsky</author>
<author>J C</author>
</authors>
<volume>2</volume>
<date>1983</date>
<title>Local control of bias and tension in Beta-splines</title>
<journal>ACM Transactions on Graphics</journal>
<pages>109--134</pages>
</citation>
<citation>
<authors>
<author>A C Arvillias</author>
<author>D G Maritsas</author>
</authors>
<volume>25</volume>
<date>1978</date>
<title>Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation</title>
<journal>Journal of the ACM</journal>
<pages>675--686</pages>
</citation>
<citation>
<authors>
<author>Michael Luby</author>
<author>Erie Vigoda</author>
</authors>
<booktitle>In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theot3 of Computing</booktitle>
<date>1997</date>
<title>Approximately counting up to four</title>
<pages>682--687</pages>
</citation>
<citation>
<authors>
<author>K P Eswaran</author>
<author>J N Gray</author>
<author>R A Lorie</author>
<author>I L Traiger</author>
</authors>
<date>1976</date>
<title>The Notions of Consistency and Predicate Locks in a Database System</title>
<journal>Communication of ACM</journal>
<pages>19--11</pages>
</citation>
<citation>
<authors>
<author>C DWORK</author>
<author>O WAARTS</author>
</authors>
<booktitle>In Proceedings of the 24th ACM Symposium on the Theory of Computing. ACM</booktitle>
<location>New York</location>
<date>1992</date>
<title>Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible</title>
<pages>655--666</pages>
</citation>
<citation>
<authors>
<author>I D Baxter</author>
</authors>
<booktitle>In Proceedings of the Fifth Symposium on Software Reusability</booktitle>
<date>1999</date>
<title>DMS transformational software maintenance by reuse: A production research system</title>
<publisher>ACM</publisher>
<pages>163</pages>
</citation>
<citation>
<authors>
<author>C Ruggieri</author>
<author>T P Murtagh</author>
</authors>
<booktitle>In Proceedings of the 15th ACM Symposium on Principles of Programming Languages</booktitle>
<date>1988</date>
<title>Lifetime analysis of dynamically allocated objects</title>
<pages>285--293</pages>
</citation>
<citation>
<authors>
<author>James Laudon</author>
<author>Daniel Lenoski</author>
</authors>
<booktitle>In Proceedings of the 18th Annual ACM Symposium on Theory of Computing</booktitle>
<date>1986</date>
<title>An optimal sorting algorithm for mesh connected computers</title>
<pages>255--263</pages>
</citation>
<citation>
<authors>
<author>James Laudon</author>
<author>Daniel Lenoski</author>
</authors>
<booktitle>In Proceedings of the 24th Annual International Symposium on Computer Architecture</booktitle>
<date>1997</date>
<title>The SGI Origin 2000: A ccNUMA Highly Scalable Server</title>
</citation>
<citation>
<authors>
<author>Alan R Feuer</author>
<author>Edward B Fowlkes</author>
</authors>
<booktitle>in Proceedings 4th International Conference on Software Engineering. Los Alamitos</booktitle>
<location>California</location>
<date>1979</date>
<title>Some Results from an Empirical Study of Computer Software</title>
<publisher>IEEE Computer Society Press</publisher>
<pages>351--355</pages>
</citation>
<citation>
<authors>
<author>E Brynjolfsson</author>
<author>S Yang</author>
</authors>
<booktitle>In Proceedings of the International Conference on Information Systems (Atlanta, GA</booktitle>
<date>1997</date>
<title>Intangible benefits and costs of computer investments: Evidence from the financial market</title>
</citation>
<citation>
<authors>
<author>M Bender</author>
<author>S Chakrabarti</author>
<author>S Muthukrishnan</author>
</authors>
<booktitle>In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms</booktitle>
<location>San Francisco, California</location>
<date>1998</date>
<title>Flow and stretch metrics for scheduling continuous job streams</title>
<pages>270--279</pages>
</citation>
<citation>
<authors>
<author>P A Fishwick</author>
</authors>
<date>1992</date>
<title>An Integrated Approach to System Modelling using a Synthesis of</title>
<journal>Artificial Intelligence, Software Engineering and Simulation Methodologies. ACM Transactions on Modehng Computer Szmulatzon</journal>
<pages>2--4</pages>
</citation>
<citation>
<authors>
<author>Steve Pieper</author>
<author>Joseph Rosen</author>
<author>David Zeltzer</author>
</authors>
<booktitle>Proceedings of the ACM 199 Symposium on Interactive SD Graphics</booktitle>
<date>1992</date>
<title>Interactive computer graphics for plastic surgery: A task-level analysis and implementation</title>
<pages>127--134</pages>
</citation>
<citation>
<authors>
<author>J Clement</author>
<author>J Lochhead</author>
<author>E Soloway</author>
</authors>
<booktitle>Proceedings of the National ACM Conference</booktitle>
<location>Nashville, Tenn</location>
<date>1980</date>
<title>Positive Effects of Computer Programming On Students Understanding of Variables and Equations</title>
</citation>
<citation>
<authors>
<author>B L Peuto</author>
<author>L J Shustek</author>
</authors>
<booktitle>Performance, Proceedings of the 4th Annual Symposium on Computer Architecture</booktitle>
<location>Maryland New York</location>
<date>1977</date>
<title>An instruction Timing Model of CPU</title>
<pages>165--178</pages>
</citation>
<citation>
<authors>
<author>Robert M Metcalfe</author>
<author>David R Boggs</author>
</authors>
<volume>19</volume>
<date>1976</date>
<title>Ethernet: Distributed Packet Switching for Local Computer Networks</title>
<journal>Communications of the ACM</journal>
<pages>395--404</pages>
</citation>
<citation>
<authors>
<author>C W Tseng</author>
</authors>
<booktitle>In Proceedings of the Fifth ACM/SiGPLAN Symposium on Principles Practice of Parallel Programming</booktitle>
<date>1995</date>
<title>Compiler optimizations for eliminating barrier synchronization</title>
<pages>144--155</pages>
</citation>
<citation>
<authors>
<author>W A Martin</author>
<author>R J Fateman</author>
</authors>
<booktitle>Proceedings of Second Symposium on Symbolic Algebraic Manipulation</booktitle>
<date>1971</date>
<title>The MACSYMA System</title>
</citation>
<citation>
<authors>
<author>John Penix</author>
<author>Willem Visser</author>
<author>Eric Engstrom</author>
<author>Aaron Larson</author>
<author>Nicholas Weininger</author>
</authors>
<booktitle>In Proceedings of the 22nd International Conference on Software Engineering</booktitle>
<date>2000</date>
<title>Verification of time partitioning in the deos scheduler kernel</title>
<publisher>ACM Press</publisher>
</citation>
<citation>
<authors>
<author>J P C KLEIJNEN</author>
</authors>
<booktitle>In Proceedings of the 1995 Winter Simulation Conference</booktitle>
<location>Arlington, VA</location>
<date>1995</date>
<title>Sensitivity analysis and optimization in simulation: Design of experiments and case studies</title>
<pages>3--6</pages>
</citation>
<citation>
<authors>
<author>L Augustsson</author>
</authors>
<booktitle>In Proceedings of the 198J ACM Symposium on Lisp Functional Programming</booktitle>
<location>Austin Texas New York</location>
<date>1984</date>
<title>A Compiler for Lazy ML</title>
<publisher>ACM Press</publisher>
<pages>218--227</pages>
</citation>
<citation>
<authors>
<author>H Walker</author>
</authors>
<booktitle>in Computer Science, Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education</booktitle>
<date>1999</date>
<title>The Crisis in Academic Hiring</title>
</citation>
<citation>
<authors>
<author>R L Rivest</author>
<author>A Shamir</author>
<author>L Adleman</author>
</authors>
<date>1978</date>
<title>A method for obtaining digital signatures and bublic key cryptosystems</title>
<journal>Communications of the ACM</journal>
<pages>21--2</pages>
</citation>
<citation>
<authors>
<author>K Rimey</author>
<author>P N Hilfinger</author>
</authors>
<booktitle>Proceding of the 21st Annual Workshop on Microprogramming and Microarchitecture</booktitle>
<date>1988</date>
<title>A method for obtaining digital signatures and bublic key cryptosystems</title>
<pages>115</pages>
</citation>
<citation>
<authors>
<author>V Christophides</author>
<author>A Rizk</author>
</authors>
<booktitle>Proceedings of the European Conference on Hypermedia Technology ECHT '94</booktitle>
<location>Edinburgh New York UK</location>
<date>1994</date>
<title>Querying Structured Documents with Hypertext Links using OODBMS</title>
<pages>186--197</pages>
</citation>
<citation>
<authors>
<author>P W BLAME</author>
<author>J HASTAD</author>
</authors>
<booktitle>In Proceedings of the 19th ACM Symposium on Theory of Computing (New</booktitle>
<location>York</location>
<date></date>
<title>Optimal bounds for decision problems on the CRCW PRAM</title>
<publisher>ACM</publisher>
<pages>25--27</pages>
</citation>
<citation>
<authors>
<author>K E Coates</author>
<author>D L Dvorak</author>
<author>R M Watts</author>
</authors>
<booktitle>Proceedings of the Seventh Data Communications Symposium</booktitle>
<location>Mexico City, Mexico</location>
<date>1981</date>
<title>An Overview of BLN: A Bell Laboratories Computing Network</title>
<pages>224--229</pages>
</citation>
<citation>
<authors>
<author>M Weiser</author>
</authors>
<volume>18</volume>
<date>1993</date>
<title>Some computer science issues in ubiquitous computing</title>
<journal>Communications of the ACM</journal>
<pages>74--84</pages>
</citation>
<citation>
<authors>
<author>T Jebelean</author>
</authors>
<booktitle>in Proceedings of the International Symposium on Symbolic Algebraic Computation ISSAC 93</booktitle>
<date>1993</date>
<title>A Generalization of the Binary GCD Algorithm</title>
<pages>111--116</pages>
</citation>
<citation>
<authors>
<author>Y E IOANNIDIS</author>
<author>Y C KANG</author>
</authors>
<date>1990</date>
<title>Randomized algorithms for optimizing large join</title>
</citation>
<citation>
<authors>
<author>F BANCILHON</author>
<author>R RAMAKRISHNAN</author>
</authors>
<booktitle>in Proceedings of the ACM SIGMOD International Conference on Management of Data</booktitle>
<location>Washington</location>
<date></date>
<title>An amateur's introduction to recursive query processing strategies</title>
<publisher>ACM</publisher>
<pages>28--30</pages>
</citation>
<citation>
<authors>
<author>H Gomaa</author>
</authors>
<date>1984</date>
<title>A Software Design Method for Real-Time Systems</title>
<journal>Communications of the ACM</journal>
</citation>
<citation>
<authors>
<author>R P LaRowe Jr</author>
<author>J T Wilkes</author>
<author>C S Ellis</author>
</authors>
<booktitle>In Proceedings of he Symposium on the Principles Practice of Parallel Programming</booktitle>
<title>Exploiting operating system support for dynamic page placement on a NUMA shared memory multiprocessor</title>
<pages>122--132</pages>
</citation>
<citation>
<authors>
<author>R Hagmann</author>
</authors>
<booktitle>Proceedings of the llth ACM Symposium on Operating Systems Principles</booktitle>
<date>1987</date>
<title>Reimplementing the cedar file system using logging and group commit</title>
<pages>21--5</pages>
</citation>
<citation>
<authors>
<author>J B Goodenough</author>
<author>L Sha</author>
</authors>
<booktitle>Proceedings of the International Workshop of ReaI-Time Ada Issues</booktitle>
<date>1988</date>
<title>The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High Priority Ada Tasks</title>
</citation>
<citation>
<authors>
<author>Thomas H Cormen</author>
<author>David M Nicol</author>
</authors>
<date>1997</date>
<title>Out-of-core FFTs with parallel disks</title>
<journal>ACM SIGMETRICS Performance Evaluation Review</journal>
<pages>25--3</pages>
</citation>
<citation>
<authors>
<author>C Ware</author>
<author>S Osborne</author>
</authors>
<booktitle>Proceedings of the 1990 Symposium on Interactive 3D Graphics (Snowbird, Utah ). In ACM Computer Graphics</booktitle>
<volume>24</volume>
<date>1990</date>
<title>Exploration and virtual camera control in virtual three dimensional environments</title>
<pages>175--183</pages>
</citation>
<citation>
<authors>
<author>A Michail</author>
</authors>
<booktitle>In Proceedings of the 22nd International Conference on Software Engineering</booktitle>
<date>2000</date>
<title>Data mining library reuse patterns using generalized association rules</title>
</citation>
<citation>
<authors>
<author>P BONATTI</author>
<author>DE_CAPITANI DI_VIMERCATI S</author>
<author>P SAMARATI</author>
</authors>
<booktitle>In Proceedings of the Seventh ACM Conference on Computer Communication Security CCS, 2000</booktitle>
<location>Athens York, Greece</location>
<date>2000</date>
<title>A modular approach to composing access control policies</title>
<pages>164--173</pages>
</citation>
<citation>
<authors>
<author>R Kadia</author>
</authors>
<booktitle>In Proceedings of ACM SIGSOFT '92: Conference Fifth Symposium on Software Development Environments</booktitle>
<date>1999</date>
<title>Issues encountered in building a flexible software development environment: Lessons learned from the Arcadia project</title>
</citation>
<citation>
<authors>
<author>J H Saltzer</author>
<author>M D Schroeder</author>
</authors>
<booktitle>In Proceedings of the IEEE</booktitle>
<volume>63</volume>
<date>1975</date>
<title>The protection of and control of information sharing in computer systems</title>
</citation>
<citation>
<authors>
<author>C Consel</author>
<author>F Nol</author>
</authors>
<booktitle>In Proceedings 3rd Annual ACM Symposium on Principles of Programming Languages</booktitle>
<location>Petersburg, Fla</location>
<date>1996</date>
<title>A general approach for run-time specialization and its application to C</title>
<publisher>ACM Press</publisher>
<pages>145--156</pages>
</citation>
<citation>
<authors>
<author>A R Bruss</author>
<author>A R Meyer</author>
</authors>
<booktitle>Proceedings of the Tenth Annual ACM Symposium on Theory of Computing</booktitle>
<date>1978</date>
<title>On time-space classes and their relation to the theory of real addition</title>
<pages>233--239</pages>
</citation>
<citation>
<authors>
<author>W Wan</author>
<author>Perkowski</author>
</authors>
<booktitle>and Local Transformations and Its Application to FPGA Mapping, European Design Automation Conference</booktitle>
<title>M.: A New Approach to the Decomposition of Incompletely Specified Multi-Output Functions Based on Graph Coloring</title>
<pages>23</pages>
</citation>
<citation>
<authors>
<author>E Soloway</author>
</authors>
<volume>29</volume>
<title>Learning to Program -Learning to Construct Mechanisms and Explanations</title>
<journal>Communications of the ACM</journal>
</citation>
<citation>
<authors>
<author>K D Ashley</author>
<author>E L Rissland</author>
</authors>
<booktitle>Proceedings of 1st International Conference on Artificial Intelligence Law ICAIL-871</booktitle>
<location>New York</location>
<title>Accord: Generating Blue Book Citations in HYPO</title>
<publisher>ACM Press</publisher>
<pages>67--14</pages>
</citation>
<citation>
<authors>
<author>L G Williams</author>
</authors>
<booktitle>in Proceedings of the 10th International Conference on Sofnvare Engineering</booktitle>
<location>IEEE</location>
<date>1988</date>
<title>Software Process Modeling: A Behavioral Approach</title>
<pages>174--186</pages>
</citation>
<citation>
<authors>
<author>D A Van_Veldhuizen</author>
<author>G B Lamont</author>
</authors>
<booktitle>In Proceedings of the 1999 ACM Symposium on Applied Computing. ACM</booktitle>
<date>1999</date>
<title>Multiobjectire Evolutionary Algorithm Test Suites</title>
</citation>
<citation>
<authors>
<author>Joon S Park</author>
<author>Ravi Sandhu</author>
</authors>
<booktitle>In Proceedings of 4th ACM Workshop on Role-Based Access Control</booktitle>
<location>Fairfax, VA</location>
<date>1999</date>
<title>RBAC on the web by smart certificates</title>
<publisher>ACM</publisher>
<pages>1--9</pages>
</citation>
<citation>
<authors>
<author>John Heinlein</author>
</authors>
<booktitle>In Proceedings of the 6th International Conference on Architectural Support for Programming Languages Operating Systems, CA</booktitle>
<date>2000</date>
<title>Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor</title>
</citation>
<citation>
<authors>
<author>Michael J Carey</author>
<author>David J DeWitt</author>
<author>Jeffrey F Naughton</author>
</authors>
<booktitle>In Proceedings of the 1993 ACM-SIGMOD Conference on the Management of Data</booktitle>
<location>Washington York DC</location>
<date>1993</date>
<title>The 007 benchmark</title>
</citation>
<citation>
<authors>
<author>G J Holzmann</author>
<author>Margaret H Smith</author>
</authors>
<booktitle>In Proceedings of the 1999 international conference on Software engineering ICSE99</booktitle>
<location>Los Angeles, CA, USA</location>
<date>1999</date>
<title>A practical method for the verification of event-driven software</title>
<publisher>ACM Press</publisher>
<pages>597--607</pages>
</citation>
<citation>
<authors>
<author>S T Pan</author>
<author>K So</author>
<author>J T Rahmeh</author>
</authors>
<booktitle>in Proceedings of the Fifth International Conference on Architectural Support for Programming Languages Operating Systems</booktitle>
<date>1993</date>
<title>improving the accuracy of dynamic branch prediction using branch correlation</title>
<pages>76--84</pages>
</citation>
<citation>
<authors>
<author>S P Masticola</author>
<author>B G Ryder</author>
</authors>
<booktitle>Proceedings oJ the ACM/ONR Workshop on Parallel Distributed Debugging, ACM SIGPLAN Notices</booktitle>
<date>1991</date>
<title>A Model of Ada Programs for Static Deadlock Detection in Polynomial Time</title>
<pages>26--12</pages>
</citation>
<citation>
<authors>
<author>David F Bacon</author>
<author>Robert E Strom</author>
</authors>
<booktitle>Sequential Processes. ACM SiGPLAN Symposium on Principles Practice of Parallel Programming</booktitle>
<date>1991</date>
<title>Optimistic Parallelization of Communicating</title>
</citation>
<citation>
<authors>
<author>M Das</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design Implementation, 2000</booktitle>
<title>Unification-based pointer analysis with directional assignments</title>
</citation>
<citation>
<authors>
<author>R J Paul</author>
</authors>
<booktitle>In Proceedings of the 1992 Winter Simulation Conference</booktitle>
<location>San Diego</location>
<date>1992</date>
<title>The computer aided simulation modeling environment: An overview</title>
</citation>
<citation>
<authors>
<author>R Furuta</author>
<author>C Marshall</author>
<author>F Shipman</author>
<author>J Leggett</author>
<author>J</author>
</authors>
<booktitle>In Proceedings of the 1st ACM International Conference on Digital Libraries</booktitle>
<location>New York</location>
<date>1996</date>
<title>Physical objects in the digital library</title>
<publisher>ACM Press</publisher>
<pages>109--115</pages>
</citation>
<citation>
<authors>
<author>D Haines</author>
<author>W B Croft</author>
</authors>
<booktitle>In Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research Development in Information Retrieval</booktitle>
<date>1993</date>
<title>Relevance feedback and inference networks</title>
<pages>2--11</pages>
</citation>
<citation>
<authors>
<author>P Jouvelot</author>
<author>D K Gifford</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN Conference on Programming Language Design Implementation. ACM</booktitle>
<location>New York</location>
<date>1989</date>
<title>Reasoning about Continuations with Control Effects</title>
</citation>
<citation>
<authors>
<author>Toby Bloom</author>
<author>Stanley B Zdonik</author>
</authors>
<booktitle>In Conference Proceedings of the Workshop on Persistent Object Systems Their Design Implementation Use, Appin</booktitle>
<location>York Scotland</location>
<date>1987</date>
<title>Issues in the design of objectoriented database programming languages</title>
<pages>89--112</pages>
</citation>
<citation>
<authors>
<author>Michael Albers</author>
</authors>
<booktitle>In Proceedings of the Seventeenth Annual Conference of Computer Documentation</booktitle>
<location>New Orleans</location>
<date>1999</date>
<title>Information design considerations for improving situation awareness in complex problem-solving</title>
<pages>154--158</pages>
</citation>
<citation>
<authors>
<author>E Nygren</author>
<author>M Lind</author>
<author>M Johnson</author>
<author>B Sandblad</author>
</authors>
<booktitle>In Conference Proceedings for CH1'92, ACM Conference on Human Factors in Computing Systems</booktitle>
<date>1992</date>
<title>The an of the obvious' automatically processes components of the task of reading frequently used documents</title>
</citation>
<citation>
<authors>
<author>L SVOBODOVA</author>
</authors>
<booktitle>In Proceedings of the 8th ACM Symposium on Operating Systems Principles</booktitle>
<location>Pacific Grove, Calif</location>
<date>1981</date>
<title>A reliable object-oriented data repository for a distributed computer system</title>
<publisher>ACM</publisher>
<pages>47--58</pages>
</citation>
<citation>
<authors>
<author>G Ammons</author>
<author>J R Larus</author>
</authors>
<booktitle>in Proceedings of the SiGPLAN '98 Conference on Programming Language Design Implementation</booktitle>
<location>Montreal, Canada</location>
<date>1998</date>
<title>Improving Data-flow Analysis with Path Profiles</title>
<pages>72--84</pages>
</citation>
<citation>
<authors>
<author>R Stansifer</author>
<author>D Wetklow</author>
</authors>
<booktitle>In Proceedings of the ACM/SIGAPP Symposium on Applied Computing</booktitle>
<date>1993</date>
<title>Method reuse in typed object-oriented languages</title>
<pages>63--70</pages>
</citation>
<citation>
<authors>
<author>Phillip B Gibbons</author>
<author>Steven S Muchnick</author>
</authors>
<booktitle>Proceedings of the SIG-PLAN 1986 Symposium on Compiler Construction, ACM SIGPLAN Notices</booktitle>
<volume>21</volume>
<date>1986</date>
<title>Efficient instruction scheduling for a pipelined architecture</title>
</citation>
<citation>
<authors>
<author>W Landi</author>
<author>B G Ryder</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design Implementation</booktitle>
<volume>27</volume>
<location>San Francisco, CA</location>
<date>1992</date>
<title>A safe approximate algorithm for interprocedural pointer aliasing</title>
<pages>235--248</pages>
</citation>
<citation>
<authors>
<author>R COLE</author>
<author>M T GOODRICH</author>
</authors>
<booktitle>In Proceedings of the 4th ACM Symposium on Computational Geometry. ACM</booktitle>
<location>New York</location>
<date>1988</date>
<title>Optimal parallel algorithms for polygon and point-set problems</title>
<pages>201--210</pages>
</citation>
<citation>
<authors>
<author>C B Stunkel</author>
<author>W K Fuchs</author>
</authors>
<booktitle>in Proceedings of the International Conference on Measurement Modeling of Computer Systems</booktitle>
<date>1989</date>
<title>TRAPEDS: Producing traces for multicomputers via execution driven simulation</title>
<pages>70--78</pages>
</citation>
<citation>
<authors>
<author>David R Karger</author>
</authors>
<booktitle>In Proceedings of the 28th ACM Symposium on Theory of Computing. ACM, ACM</booktitle>
<location>Philadelphia PA</location>
<date>1996</date>
<title>Minimum cuts in near-linear time</title>
<publisher>Press</publisher>
</citation>
<citation>
<authors>
<author>D Agrawal</author>
<author>A El_Abbadi</author>
<author>A Singh</author>
<author>T Yurek</author>
</authors>
<booktitle>In proceedings of the 1997 ACM international conference on Management of Data</booktitle>
<date>1997</date>
<title>Efficient View Maintenance at Data Warehouses</title>
<pages>417--427</pages>
</citation>
<citation>
<authors>
<author>P A G Sivilotti</author>
</authors>
<booktitle>21st International Conference on Software Engineering ICSE</booktitle>
<date>1999</date>
<title>Specifying and testing the progress properties of distributed components</title>
</citation>
<citation>
<booktitle>In Proceedings of the 21st Annual International Symposium on Computer Architecture</booktitle>
<date>1994</date>
<title>Zarka Cvetanovic and Dileep Bhandarkar. Characterization of the Alpha AXP Performance Using TP and SPEC Workloads</title>
<pages>60--70</pages>
</citation>
<citation>
<authors>
<author>D A TURNER</author>
</authors>
<booktitle>In Proceedings of the 1981 Conference on Functional Programming Languages Computer Architecture. ACM</booktitle>
<date>1981</date>
<title>The semantic elegance of applicative languages</title>
<pages>85--92</pages>
</citation>
<citation>
<authors>
<author>P CousoT</author>
<author>R COUSOT</author>
</authors>
<booktitle>In Proceedings of the 4th ACM Symposium on the Principles of Programming Languages. ACM</booktitle>
<location>New York</location>
<date>1977</date>
<title>Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints</title>
</citation>
<citation>
<authors>
<author>M Rosenblum</author>
<author>J K Ousterhout</author>
</authors>
<booktitle>In Proceedings of the Thirteenth ACM Symposium on Operating System Principles</booktitle>
<date>1991</date>
<title>The design and implementation of a log-structured file system</title>
</citation>
<citation>
<authors>
<author>G JAESCHKE</author>
<author>H SCHEK</author>
</authors>
<booktitle>In Proceedings of the ACM SIGA CT-SIGMOD Symposium on Principles of Database Systems (Los</booktitle>
<location>Angeles</location>
<date>1982</date>
<title>Remarks on the algebra of non first normal form relations</title>
<pages>124--138</pages>
</citation>
<citation>
<authors>
<author>E Roberts</author>
</authors>
<booktitle>In Proceedings of the Thirty-first Annual SIGCSE Technical Symposium on Computer Science Education</booktitle>
<date>2000</date>
<title>Strategies for Encouraging Individual Achievement in Introductory Computer Science Courses</title>
<pages>285--299</pages>
</citation>
<citation>
<authors>
<author>F FICH</author>
<author>M HERLIHY</author>
<author>N SHAVIT</author>
</authors>
<booktitle>In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing Ithaca</booktitle>
<location>New York</location>
<date>1993</date>
<title>On the space complexity of randomized synchronization</title>
<publisher>ACM</publisher>
<pages>15--18</pages>
</citation>
<citation>
<authors>
<author>D J</author>
</authors>
<booktitle>Support."In Proceedings of the 1994 International Symposium on Software Testing Analysis</booktitle>
<location>Seattle, Washington</location>
<date>1994</date>
<title>Richardson."TAOS: Testing with Oracles and Analysis</title>
<pages>138--153</pages>
</citation>
<citation>
<authors>
<author>B ChazeUe</author>
</authors>
<booktitle>Proceedings of the First Annual ACM Symposium on Computational Geometry</booktitle>
<date>1985</date>
<title>New techniques for computing order statistics in Euclidean space</title>
<pages>125--134</pages>
</citation>
<citation>
<authors>
<author>Arun N Lokanathan</author>
<author>Jay B Brockman</author>
<author>John E Renaud</author>
</authors>
<booktitle>In Proceedings of the 33rd IEEE/ACM Design Automation Conference</booktitle>
<date>1996</date>
<title>A Methodology for Concurrent Fabrication Process/Cell Library Optimization</title>
</citation>
<citation>
<authors>
<author>Jeffrey S Poulin</author>
<author>Keith J Werkman</author>
</authors>
<booktitle>in conference proceedings of ACM SIGSOFT Symposium on Software Reusability SSR'95</booktitle>
<location>Seattle WA</location>
<date>1995</date>
<title>Melding Structured Abstracts and the World Wide Web for Retrieval of Reusable Components</title>
<pages>28--30</pages>
</citation>
<citation>
<authors>
<author>David R Cheriton</author>
<author>Willy Zwaenepoel</author>
</authors>
<booktitle>In Proceedings of the Ninth ACM Symposium on Operating Systems Principles</booktitle>
<date>1983</date>
<title>The distributed V kernel and its performance for diskless workstations</title>
<pages>129--140</pages>
</citation>
<citation>
<authors>
<author>J LAI</author>
<author>J VERGO</author>
</authors>
<booktitle>In Proceedings of the ACM Conference on Human Factors in Computing Systems (Atlanta, GA</booktitle>
<location>New York, NY</location>
<date>1997</date>
<title>MedSpeak: Report creation with continuous speech recognition</title>
<publisher>ACM Press</publisher>
<pages>22--27</pages>
</citation>
<citation>
<authors>
<author>R Guindon</author>
</authors>
<booktitle>In Proceedings of the ACM SIGCHI Conference Human Factors in Computer Systems</booktitle>
<date>1988</date>
<title>How to interface to advisory systems7 Users request help with a very simple language</title>
</citation>
<citation>
<authors>
<author>James Archibald</author>
<author>Jean-Loup Boer</author>
</authors>
<date>1986</date>
<title>Cache coherence protocols: Evaluation using a multiprocessor simulation model</title>
<journal>ACM Transactions on Computer Systems</journal>
<pages>4--4</pages>
</citation>
<citation>
<authors>
<author>Rob Kling</author>
</authors>
<volume>21</volume>
<date>1978</date>
<title>Value conflicts and social choice in electronic funds transfer systems developments</title>
<journal>Communications of the ACM</journal>
<pages>642--657</pages>
</citation>
<citation>
<authors>
<author>James Archibald</author>
<author>Jean-Loup Baer</author>
</authors>
<booktitle>In The 11th Annual International Symposium on Computer Architecture</booktitle>
<date>1984</date>
<title>An economical solution to the cache coherence problem</title>
<pages>355--362</pages>
</citation>
<citation>
<authors>
<author>Alan Borning</author>
</authors>
<booktitle>GM 2ansactions on Programming Languages and Systems</booktitle>
<date>1981</date>
<title>The programming language aspects of ThingLab, a constraint-oriented simulation laboratory. A</title>
<pages>3--4</pages>
</citation>
<citation>
<authors>
<author>D C Schmidt</author>
</authors>
<volume>38</volume>
<date>1995</date>
<title>Experience Using Design Patterns to Develop Reuseable Object-Oriented Communication Software</title>
<journal>Communications of the ACM Special Issue on Design Patterns</journal>
</citation>
<citation>
<authors>
<author>J M E HYLAND</author>
<author>C H L ONG</author>
</authors>
<booktitle>In Proceedings of the Conference on Functional Programming Languages Computer Architecture</booktitle>
<location>New York, NY, USA</location>
<date>1995</date>
<title>Pi-cMculus dialogue games and full abstraction for PCF</title>
<publisher>ACM Press</publisher>
<pages>96--107</pages>
</citation>
<citation>
<authors>
<author>M JAYARAM</author>
<author>G VARGHESE</author>
</authors>
<booktitle>In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (Calif</booktitle>
<location>New York</location>
<date>1997</date>
<title>The complexity of crash failures</title>
<publisher>ACM</publisher>
<pages>21--24</pages>
</citation>
<citation>
<authors>
<author>N FRANCEZ</author>
<author>D KOZEN</author>
</authors>
<booktitle>In Proceedings of the llth ACM Symposium on the Principles of Programming Languages</booktitle>
<location>Salt Lake City, Utah</location>
<date></date>
<title>Generalized fair termination</title>
<pages>15--18</pages>
</citation>
<citation>
<authors>
<author>Anders Bondorf</author>
<author>Jens Palsberg</author>
</authors>
<booktitle>In Proceedings of the 5th Conference on Functional Languages Computer Architecture</booktitle>
<date>1993</date>
<title>Compiling actions by partial evaluation</title>
<publisher>ACM</publisher>
<pages>308--320</pages>
</citation>
<citation>
<authors>
<author>H Schftze</author>
<author>C Silverstein</author>
</authors>
<booktitle>In Proceedings of the Annual International ACM SIGIR Conference on Research Development in Information Retrieval</booktitle>
<date>1997</date>
<title>Projections for efficient document clustering</title>
</citation>
<citation>
<authors>
<author>Anthony Savidis</author>
<author>Constantine Stephanidis</author>
</authors>
<booktitle>in Proceedings of CHI '95. ACM SIGCHI, ACM</booktitle>
<date>1995</date>
<title>Developing dual user interfaces for integrating blind and sighted users: the HOMER UIMS</title>
<publisher>Press</publisher>
</citation>
<citation>
<authors>
<author>G Tiruvuri</author>
<author>M t2hung</author>
</authors>
<date>1998</date>
<title>Estimation of lower bounds in scheduling algorithms for high-level synthesis</title>
<journal>ACM Transactions on Design Automation of Electronic Systems</journal>
<pages>3--2</pages>
</citation>
<citation>
<authors>
<author>J Brown</author>
<author>T C N Graham</author>
<author>T Wright</author>
</authors>
<booktitle>In Proceedings of Human Factors in Computing Systems CHf'98, ACM</booktitle>
<location>Los Angeles, USA</location>
<date>1998</date>
<title>The Vista Environment for the Coevolutionary Design of User Interfaces</title>
<publisher>Press</publisher>
</citation>
<citation>
<authors>
<author>P Pirolli</author>
</authors>
<booktitle>Proceedings of the Conference on Human Factors in Computing Systems, CHI '97</booktitle>
<location>Atlanta, GA</location>
<date>1997</date>
<title>Computational models of information scentfollowing in a very large browsable text collection</title>
<pages>3--10</pages>
</citation>
<citation>
<authors>
<author>P K DAVIS</author>
<author>R J HILLESTAD</author>
</authors>
<booktitle>In Proceedings of the 1993 Winter Simulation Conference, ACM</booktitle>
<location>New York</location>
<date>1993</date>
<title>Computational models of information scentfollowing in a very large browsable text collection</title>
</citation>
<citation>
<authors>
<author>Mihai Barbuceanu</author>
<author>Tom Gray</author>
<author>Serge Mankovski</author>
</authors>
<booktitle>In Proceedings of the Second International Conference on Autonmruus Agents Agents98</booktitle>
<date>1998</date>
<title>Coordinating with obligations</title>
<pages>62--69</pages>
</citation>
<citation>
<authors>
<author>J Magee</author>
<author>J Kramer</author>
</authors>
<booktitle>In Proceedings of the Fourth ACM SIGSOFT Symposium on the Foundations of zofiware Engineering</booktitle>
<date>1996</date>
<title>Dynamic structure in software architectures</title>
<publisher>ACM Press</publisher>
<pages>3--14</pages>
</citation>
<citation>
<authors>
<author>J D Choi</author>
<author>S L Min</author>
</authors>
<booktitle>Proceedings of Third ACM SIGPLAN Symposium on Principles Practice of Parallel Processing</booktitle>
<date>1991</date>
<title>Race method frontier: reproducing races in parallel-program debugging</title>
</citation>
<citation>
<authors>
<author>John B Smith</author>
<author>F Donelson Smith</author>
</authors>
<booktitle>Proceedings of the Third ACM Conference on Hyperiezt</booktitle>
<date>1991</date>
<title>ABC:A Hypermedia System for Artifact-Based Collaboration</title>
<pages>179--192</pages>
</citation>
<citation>
<authors>
<author>U Manber</author>
</authors>
<date>1997</date>
<title>A text compression scheme that allows fast searching directly in the compressed file</title>
<journal>ACM Transactions on Information Systems</journal>
<pages>15--2</pages>
</citation>
<citation>
<authors>
<author>A Aiken</author>
<author>E L Wimmers</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN Conference on Fundional Programming Languages Computer Architecture</booktitle>
<date>1993</date>
<title>Type inclusion constraints and type iafexence</title>
<pages>31--41</pages>
</citation>
<citation>
<authors>
<author>Gene T J Wuu</author>
<author>Arthur J Bernstein</author>
</authors>
<booktitle>In Proceedings of the 3rd Symposium on Principles of Distributed Computing</booktitle>
<location>Vancouver, Canada</location>
<date>1984</date>
<title>Efficient solutions to the replicated log and dictionary problems</title>
<pages>233--242</pages>
</citation>
<citation>
<authors>
<author>K L Clarkson</author>
</authors>
<booktitle>In Proceedings 29th IEEE Syrup on Foundations of Computer Science</booktitle>
<date>1988</date>
<title>A Las Vegas algorithm for linear programming when the dimension is small</title>
<pages>452--456</pages>
</citation>
<citation>
<authors>
<author>G Salton</author>
<author>M Smith</author>
</authors>
<booktitle>In SIGIR'89 Proceedings of the 12th Annual international ACMSIGIR Conference on RandD in Information Retreival</booktitle>
<title>on the application of syntactic methodologies in automatic text analysis</title>
</citation>
<citation>
<authors>
<author>R W Schwanke</author>
<author>R Z Altucher</author>
<author>M A PIandoff</author>
</authors>
<booktitle>Di5 covering, Visualizing, and Controlling Software Structure. In Proceedings of the Fifth International Workshop on Software Specification Design</booktitle>
<location>Pittsburgh, Pennsylvania</location>
<date>1989</date>
<pages>147--150</pages>
</citation>
<citation>
<authors>
<author>V Z Ogozalek</author>
</authors>
<volume>21</volume>
<date>1989</date>
<title>A comparison of Male and Female Computer Science Students' Attitudes Toward Computers</title>
<journal>ACM SIGCSE Bulletin</journal>
<pages>8--14</pages>
</citation>
<citation>
<authors>
<author>Bill Pottenger</author>
<author>Rudolf Eigenmann</author>
</authors>
<booktitle>Proceedings of the 9th ACM International Conference on $upercomputing</booktitle>
<location>Barcelona, Spain</location>
<date>1995</date>
<title>idiom Recognition in the Polaris Parallelizing Compiler</title>
<pages>444--448</pages>
</citation>
<citation>
<authors>
<author>Rajagopalan Desikan</author>
<author>Doug Burger</author>
<author>Stephen W Keckler</author>
</authors>
<booktitle>In Proceedings of the 28th Annual International Symposium on Computer Architecture</booktitle>
<date>2001</date>
<title>Measuring experimental error in microprocessor simulation</title>
<pages>266--277</pages>
</citation>
<citation>
<authors>
<author>Jon L White</author>
</authors>
<booktitle>ACM SIGPLAN '90 Conference on Programming Language Design Implementation</booktitle>
<date>1990</date>
<title>How to print floating-point numbers accurately</title>
<pages>25--6</pages>
</citation>
<citation>
<authors>
<author>D A Henderson</author>
<author>S K Card</author>
</authors>
<volume>5</volume>
<date>1986</date>
<title>Rooms: The Use of Multiple Virtual Workspaces to Reduce Space Contention in a Window-Based Graphical User Interface</title>
<journal>ACM Transactions on Graphics</journal>
<pages>211--243</pages>
</citation>
<citation>
<authors>
<author>Vijay Karamcheti</author>
<author>Andrew Chien</author>
</authors>
<booktitle>Proceedings of the 6th International Conference on Architectural Support for Programming Languages Operating Systems</booktitle>
<date>1994</date>
<title>Software Overhead in Messaging Layers: Where Does the Time Go</title>
<pages>51--60</pages>
</citation>
<citation>
<authors>
<author>Y Ogawa</author>
<author>T Matsuda</author>
</authors>
<booktitle>In Proceedings of the 20th Annual International ACM SIGIR Conference on Research Development in Information Retrieval</booktitle>
<location>Philadelphia</location>
<title>Overlapping statistical word indexing: A new indexing method for Japanese text</title>
<pages>226--234</pages>
</citation>
<citation>
<authors>
<author>N a MINSKY</author>
<author>D ROZENSHTEIN</author>
</authors>
<booktitle>In Proceedings of the Conference on Object-Oriented Programming Systems Languages Apphcatzons. ACM</booktitle>
<location>New York</location>
<date>1987</date>
<title>A law-based approach to object-oriented programming</title>
<pages>482--493</pages>
</citation>
<citation>
<authors>
<author>T Berlage</author>
</authors>
<booktitle>Proceedings of the ACM Symposium on User Interface Software Technology</booktitle>
<location>Monterey, CA</location>
<date></date>
<title>Using Taps to Separate the Application Code from the User Interface</title>
<pages>15--18</pages>
</citation>
<citation>
<authors>
<author>N Adams</author>
<author>J frees</author>
</authors>
<booktitle>In Proceedings of the ACM Conference on Lisp Functional Programming</booktitle>
<date>1988</date>
<title>Object-oriented programming in Scheme</title>
<pages>277--288</pages>
</citation>
<citation>
<authors>
<author>G L Peterson</author>
</authors>
<date>1983</date>
<title>A new solution to Lamport's concurrent programming problem using small shared variables</title>
<journal>ACM Transactions on Programming Languages Systems</journal>
<pages>5--1</pages>
</citation>
<citation>
<authors>
<author>C Consel</author>
<author>F Noel</author>
</authors>
<booktitle>In Conference Record of the 23rd Symposium on Principles of Programming Languages</booktitle>
<date>1996</date>
<title>A General Approach for Run-Time Specialization and its Application to C</title>
<pages>145--156</pages>
</citation>
<citation>
<authors>
<author>P K McKinley</author>
<author>A M Malenfant</author>
<author>J M Arango</author>
</authors>
<booktitle>in Proceedings of the ACM SIG-GROUP Conference on Supporting Group Work</booktitle>
<date>1999</date>
<title>Pavilion: A distributed middleware framework for collaborative web-based applications</title>
<pages>179--188</pages>
</citation>
<citation>
<authors>
<author>N Manjikian</author>
<author>Wayne M Loueks</author>
</authors>
<booktitle>In Proceedings of the 7th Workshop on Parallel Distributed Simulation</booktitle>
<location>San Diego, CA</location>
<date>1993</date>
<title>High performance parallel logic simulation on a network of workstations</title>
<pages>76--84</pages>
</citation>
<citation>
<authors>
<author>A C YAO</author>
</authors>
<booktitle>In Proceedings of the 13th Annual Symposium on Theory of Computing (Milwaukee, Wls.). ACM</booktitle>
<location>New York</location>
<date>1980</date>
<title>On the parallel computation for the knapsack problem</title>
<pages>123--127</pages>
</citation>
<citation>
<authors>
<author>D F Jerding</author>
<author>J T Stasko</author>
<author>T Ball</author>
</authors>
<booktitle>In Proceedings of the 19th International Conference on Software Engineering ICSE '97</booktitle>
<date>1997</date>
<title>Visualizing interactions in program executions</title>
<pages>360--371</pages>
</citation>
<citation>
<authors>
<author>M C Johnson</author>
<author>K Roy</author>
</authors>
<volume>18</volume>
<date>1997</date>
<title>Datapath scheduling with multiple supply voltages and level converters</title>
<journal>ACM Transactions on Design Automation of Electronic Systems</journal>
</citation>
<citation>
<authors>
<author>L LAMPORT</author>
</authors>
<booktitle>In Conference Record of the 7th Annual ACM Symposium on Principles of Programming Languages, LaB</booktitle>
<date>1980</date>
<title>Sometime is sometimes not never On the temporal logic of programs</title>
<pages>28--30</pages>
</citation>
<citation>
<authors>
<author>R S GLANVILLE</author>
<author>S L GRAHAM</author>
</authors>
<booktitle>In Proceedings o[ the 5th ACM Symposium on Principles o[ Programming Languages (Tucson, Ariz</booktitle>
<location>New York</location>
<date>1978</date>
<title>A new method for compiler code generation</title>
<publisher>ACM</publisher>
<pages>231--240</pages>
</citation>
<citation>
<authors>
<author>D Leven</author>
<author>M Sharir</author>
</authors>
<booktitle>in Two-Dimensional Space Amidst Polygonal Barriers, Proceedings of the 1st ACM Symposium on Computational Geometry</booktitle>
<date>1985</date>
<title>An Efficient and Simple Motion Planning Algorithm for a Ladder Moving</title>
<pages>211--227</pages>
</citation>
<citation>
<authors>
<author>A Korhonen</author>
<author>L Malmi</author>
</authors>
<booktitle>Proceedings of the 5th Annual SIGCSE/SIGCUE Conference on Innovation Technology in Computer Science Education</booktitle>
<location>Helsinki, Finland</location>
<date>2000</date>
<title>Algorithm Simulation with Automatic Assessment</title>
<pages>160--163</pages>
</citation>
<citation>
<authors>
<author>C Creveuil</author>
<author>G Roman</author>
</authors>
<date>1994</date>
<title>Formal specification and design of a message router</title>
<journal>ACM Transactions on Software Engineering Methodology</journal>
<pages>3--4</pages>
</citation>
<citation>
<authors>
<author>Edith Cohen</author>
<author>Nimrod Megiddo</author>
</authors>
<booktitle>Proceddings of the 21st ACM Annual Symposium on Theory of Computing</booktitle>
<date>1989</date>
<title>Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs</title>
<pages>523--534</pages>
</citation>
<citation>
<authors>
<author>K S BOOTH</author>
<author>G S Linear LEUKER</author>
</authors>
<booktitle>Proceedings 7th Annual ACM Symposium on Theory of Computing (Albuquerque, New Mex</booktitle>
<date>1975</date>
<title>algorithms to recognize interval graphs and test for the consecutive ones property</title>
<pages>255--265</pages>
</citation>
<citation>
<authors>
<author>G M Schneider</author>
</authors>
<volume>21</volume>
<date>1989</date>
<title>A quantitative evaluation of graduate programs in computer science in the United</title>
<journal>States Canada. ACM SIGCSE Bulletin</journal>
<pages>20--24</pages>
</citation>
<citation>
<authors>
<author>P W Glynn</author>
</authors>
<booktitle>In Proceedings of the 1983 Winter Simulation Conference</booktitle>
<date>1983</date>
<title>On the role of generalized semi-Markov processes in simulation output analysis</title>
<pages>39--42</pages>
</citation>
<citation>
<authors>
<author>V C SREEDHAR</author>
<author>G R GAO</author>
</authors>
<booktitle>In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</booktitle>
<date>1995</date>
<title>A linear time algorithm for placing 0b-nodes</title>
</citation>
<citation>
<authors>
<author>Brandon Goldfedder</author>
<author>Linda Rising</author>
</authors>
<date>1996</date>
<title>A training experience with patterns</title>
<journal>Communications of the ACM</journal>
<pages>39--10</pages>
</citation>
<citation>
<authors>
<author>T Bench-Capon</author>
<author>G Staniford</author>
</authors>
<booktitle>In Proceedings of the Fifth International Conference on Artificial Intelligence Law</booktitle>
<date>1995</date>
<title>PLAID -proactive legal assistance</title>
<pages>81--88</pages>
</citation>
<citation>
<authors>
<author>G Estrin</author>
</authors>
<booktitle>Proceedings of the Symposium on Design Automation Micro-Processors</booktitle>
<location>Palo Alto, California</location>
<date>1977</date>
<title>Modeling for Synthesis -The Gap Between Intent and Behavior</title>
</citation>
<citation>
<authors>
<author>A Lingas</author>
</authors>
<booktitle>Proceedings of the Second Annual ACM Symposium on Computational Geometry</booktitle>
<date>1986</date>
<title>On Approximating Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets</title>
<pages>72--79</pages>
</citation>
<citation>
<authors>
<author>L DEGEN</author>
<author>R MANNER</author>
<author>G SALOMON</author>
</authors>
<booktitle>In Proceedings of CHI '92 Conference on Human Factors in Computing Systems. ACM</booktitle>
<location>New York</location>
<date>1992</date>
<title>Working with audio: Integrating personal tape recorders and desktop computers</title>
<pages>413--418</pages>
</citation>
<citation>
<authors>
<author>Nimar S Arora</author>
<author>Robert D Blumofe</author>
<author>C Greg</author>
</authors>
<booktitle>In Proceedings of the 10nth Annual ACM Symposium on Parallel Algorithms Architectures SPAA, Puerto Vallarta</booktitle>
<location>Mexico</location>
<date>1998</date>
<title>Plaxton. Thread scheduling for multiprogrammed multiprocessors</title>
</citation>
<citation>
<booktitle>In Proceedings Conference on Functional Programming Languages Computer Architecture</booktitle>
<date>1995</date>
<title>Akihiko Takano and Erik Meijer. Shortcut deforestation in calculational form</title>
<pages>306--313</pages>
</citation>
<citation>
<authors>
<author>P WOLPER</author>
</authors>
<booktitle>In Proceedings of the 13th ACM Symposium on Principles of Programming Languages (Petersburg Beach, Fla</booktitle>
<location>New York</location>
<date>1986</date>
<title>Specifying interesting properties of programs in propositional temporal logic</title>
<publisher>ACM</publisher>
<pages>184--193</pages>
</citation>
<citation>
<authors>
<author>L Pliimer</author>
<author>G GrSger</author>
</authors>
<booktitle>Proceedings of the 4th ACM Workshop on Advances in GIS</booktitle>
<location>84, Roekville, Maryland</location>
<date></date>
<title>Nested Maps -a Formal Provably Correct Object Model for Spatial Aggregates</title>
<publisher>ACM Press</publisher>
<pages>77</pages>
</citation>
<citation>
<authors>
<author>J F Kelley</author>
</authors>
<booktitle>In Proceedings of the CHI 83 Conference on Human Factors in Computing Systems</booktitle>
<location>Boston, Mass New York</location>
<date></date>
<title>An empirical methodology for writing user-friendly natural language computer applications</title>
<publisher>ACM</publisher>
<pages>12--15</pages>
</citation>
<citation>
<authors>
<author>J Whaley</author>
<author>M Rinard</author>
</authors>
<booktitle>In Proceedings of the ACM Conference on Object-Oriented Programming Systems Languages Applications OOPSLA'99</booktitle>
<date>1999</date>
<title>Compositional pointer and escape analysis for Java programs</title>
<pages>187--206</pages>
</citation>
<citation>
<authors>
<author>R Farrow</author>
<author>A Stanculescu</author>
</authors>
<booktitle>In Proceedings of the SIGPLAN '89 Conference on Programming Language Design Implementation</booktitle>
<date>1989</date>
<title>A VHDL compiler based on attribute grammars</title>
<pages>120--130</pages>
</citation>
<citation>
<authors>
<author>Henry Massalin</author>
</authors>
<booktitle>in Proceedings of the Second International Conference on Architectural Support for Programming Languages Operating Systems ASPLOS II</booktitle>
<date>1987</date>
<title>Superoptimizer A Look at the Smallest Program</title>
<pages>122--126</pages>
</citation>
<citation>
<authors>
<author>W Gaver</author>
</authors>
<booktitle>In Proceedings Of ACM Conference On Computer Supported Collabo rative Work</booktitle>
<date>1992</date>
<title>The Affordances Of Media Spaces For Collaboration</title>
<pages>17--24</pages>
</citation>
<citation>
<authors>
<author>R E Grinter</author>
</authors>
<booktitle>in ACM Conference on Computer Supported Cooperative Work CSCW '98</booktitle>
<location>Seattle, Washington</location>
<date>1998</date>
<title>Recomposition: Putting It All Back Together Again</title>
<publisher>ACM Press</publisher>
</citation>
<citation>
<authors>
<author>D M Nicol</author>
<author>E Heidelberger</author>
</authors>
<volume>18</volume>
<date>1995</date>
<title>A comparative study of parallel algorithms for simulating continuous time markov chains</title>
<journal>ACM Transactions on Modeling Computer Simulation</journal>
<pages>326--354</pages>
</citation>
<citation>
<authors>
<author>James R Larus</author>
<author>Eric Schnarr</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design Implementation</booktitle>
<date>1995</date>
<title>EEL: machine-independent executable editing</title>
</citation>
<citation>
<authors>
<author>Clayton Lewis</author>
<author>D Charles Hair</author>
<author>Victor Schoenberg</author>
</authors>
<booktitle>In Proceedings of ACM CHI'89 Conference on Human Factors in Computing Systems</booktitle>
<date>1989</date>
<title>Generalization Consistency Control</title>
<pages>1--5</pages>
</citation>
<citation>
<authors>
<author>Brian Cantwell Smith</author>
</authors>
<booktitle>In Proceedings of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City</booktitle>
<date>1984</date>
<title>ReflSection and semantics in Lisp</title>
<publisher>ACM</publisher>
<pages>23--35</pages>
</citation>
<citation>
<authors>
<author>G Cooperman</author>
<author>M Tselman</author>
</authors>
<booktitle>Proceedings of International Symposium on Symbolic Algebraic Computation ISSAC '96, ACM</booktitle>
<date>1996</date>
<title>New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras using the Condensation Technique</title>
<publisher>Press</publisher>
<pages>1</pages>
</citation>
<citation>
<authors>
<author>Mark Holland</author>
<author>Garth A Gibson</author>
</authors>
<booktitle>In Proceedings of 5th Int Conf on Architectural Support for Programming Languages Operating Systems</booktitle>
<date>1992</date>
<title>Parity Ieclustering for Continuous Operation in Redundant Disk Arrays</title>
<pages>23--34</pages>
</citation>
<citation>
<authors>
<author>P Cousot</author>
<author>R Cousot A</author>
</authors>
<booktitle>In Proceedhags of the Fourth Annual Symposium on Principles of Programming Languages</booktitle>
<date></date>
<title>unified lattice model for the static analysis of programs by construction or approximation of fixpoints</title>
<publisher>ACM Press</publisher>
</citation>
<citation>
<authors>
<author>R Yuan</author>
<author>S K Biswas</author>
<author>L J French</author>
<author>J Li</author>
<author>D Raychaudhuri</author>
</authors>
<booktitle>in wireless ATM networks Mobile Networks and Applications. 7(3), Special Issue on Wireless ATM</booktitle>
<date>1996</date>
<title>A signaling and control architecture for mobility support</title>
<pages>287--298</pages>
</citation>
<citation>
<authors>
<author>Stone Don C</author>
<author>Seth Bergmann</author>
<author>Ganesh Baliga</author>
<author>A Michael Berman</author>
<author>John Schmalzel</author>
</authors>
<booktitle>Proceedings of the Thirtieth SIGCSE Technical Symposium of Computer Science Education</booktitle>
<date>1999</date>
<title>A CS1 Maze Lab using Joysticks and MIPPETs</title>
<pages>170--173</pages>
</citation>
<citation>
<authors>
<author>M Wray</author>
<author>V Belrose</author>
</authors>
<booktitle>Proceedings of the Fourth Symposium on the Virtual Reality Modeling Language</booktitle>
<date>1999</date>
<title>Avatars in Living Space</title>
<publisher>ACM</publisher>
<pages>13--19</pages>
</citation>
<citation>
<authors>
<author>D A Henderson</author>
<author>S K Card</author>
</authors>
<date>1986</date>
<title>Rooms: The Use of Multiple Virtual Workspaces to Reduce Space Contention in a Window-Based Graphical User interface</title>
<journal>ACM Transactions on Graphics</journal>
<pages>5--3</pages>
</citation>
<citation>
<authors>
<author>Brad Calder</author>
<author>Dirk Gmnwald</author>
</authors>
<booktitle>In 22nd Annual International Symposium of Computer Architecture</booktitle>
<date>1995</date>
<title>Next cache line and set prediction</title>
<publisher>ACM</publisher>
<pages>287--296</pages>
</citation>
<citation>
<authors>
<author>Edwina L Rissland</author>
<author>Jody J Daniels</author>
</authors>
<booktitle>In Proceedings 5th International Conference on Artificial Intelligence an Law</booktitle>
<date>1995</date>
<title>A Hybrid CBR-IR Approach to Legal Information Retrieval</title>
<publisher>ACM</publisher>
<pages>52--61</pages>
</citation>
<citation>
<authors>
<author>B E John</author>
<author>A Newell</author>
</authors>
<booktitle>Proceedings CHI'89 Human Factors in Computing Systems</booktitle>
<location>New York</location>
<date>1989</date>
<title>Cumulating From S-R compatibility to transcription typing</title>
<publisher>ACM Press</publisher>
<pages>109--114</pages>
</citation>
<citation>
<authors>
<author>Daniel P Huttenlocher</author>
</authors>
<booktitle>Applications, Proceedings of the 7th Annual Symposium on Computational Geometry</booktitle>
<date>1991</date>
<title>Klara Kedam and Micha Sharir. The Upper Envelope of Voronoi Surfaces and its</title>
<pages>194--203</pages>
</citation>
<citation>
<authors>
<author>M Wand</author>
<author>D P Fredman</author>
</authors>
<booktitle>In Proceedings Symposium on Lisp Functional Programming</booktitle>
<date>1986</date>
<title>The mystery of the tower revealed: a non-reflective description of the reflective tower</title>
<publisher>ACM</publisher>
<pages>298--307</pages>
</citation>
<citation>
<authors>
<author>C Ahlberg</author>
<author>B Shneiderman</author>
</authors>
<booktitle>in Proceedings of the ACM SIGCHI Conference on Human Factors in Computing System clebrating independence (Boston MA</booktitle>
<date>1994</date>
<title>Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays</title>
</citation>
<citation>
<authors>
<author>David B Leblang</author>
<author>Robert P Jr</author>
</authors>
<booktitle>In Proceedings of the ACM SIGSOFTISIGPLAN Software Engineering Symposiumm on Practical Software Development Environments</booktitle>
<title>Computer-Aided Software Engineering in a Distributed Workstation Environment</title>
<pages>104--1</pages>
</citation>
<citation>
<authors>
<author>Cary Gray</author>
<author>David Cheriton</author>
</authors>
<booktitle>In Proceedings of the Twelfth Symposium on Operating Systems Principles</booktitle>
<date>1989</date>
<title>Leases: An efficient faulttolerant mechanism for distributed file cache consistency</title>
<publisher>ACM</publisher>
<pages>202--210</pages>
</citation>
<citation>
<authors>
<author>A M Disney</author>
<author>P M Johnson</author>
</authors>
<booktitle>In Proceedings of the ACM SIGSOFT Sixth International Symposium on the Foundations of Software Engineering</booktitle>
<title>Investigating data quality problems in the PSP</title>
<pages>143--148</pages>
</citation>
<citation>
<authors>
<author>N KARMARKAR</author>
<author>Y N LAKSHMAN</author>
</authors>
<booktitle>In Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation ISSAC'96</booktitle>
<date>1996</date>
<title>Approximate polynomial greatest common divisors and nearest singular polynomials</title>
<pages>35--39</pages>
</citation>
<citation>
<authors>
<author>D R Engler</author>
<author>M F Kaashoek</author>
<author>J W</author>
</authors>
<booktitle>In Proceedings of the 15th ACM Symposium on Operating Systems Principles</booktitle>
<location>Colorado, USA</location>
<date>1995</date>
<title>O'Toole Jr. Exokernel: An Operating System Architecture for Application Level Resource Management</title>
<pages>251--266</pages>
</citation>
<citation>
<authors>
<author>L Vicci</author>
<author>S Brumback</author>
<author>K Keller</author>
<author>G Welch</author>
<author>G Bishop</author>
<author>D N Colucci</author>
</authors>
<booktitle>In Proceedings of the ACM Symposium on Virtual Reality Software Technology</booktitle>
<title>The hiball tracker: High-performance widearea tracking for virtual and augmented environments</title>
<pages>1--11</pages>
</citation>
<citation>
<authors>
<author>Pavel Curtis</author>
<author>James Rauen</author>
</authors>
<booktitle>ACM Conference on Lisp Functional Programming</booktitle>
<date>1990</date>
<title>A module system for Scheme</title>
<pages>13--19</pages>
</citation>
<citation>
<authors>
<author>Dorai Sitaram</author>
<author>Matthias Felleisen</author>
</authors>
<booktitle>In Proceedings 1990 Conference on LISP Functional Programming</booktitle>
<date>1990</date>
<title>Reasoning with continuations II: Full abstraction for models of control</title>
<pages>161--175</pages>
</citation>
<citation>
<authors>
<author>Nimrod Megiddo</author>
</authors>
<date>1984</date>
<title>Linear programming in linear time when the dimension is fixed</title>
<journal>Journal of the ACM</journal>
<pages>31--1</pages>
</citation>
<citation>
<authors>
<author>Tyson R Henry</author>
<author>Scott E Hudson</author>
</authors>
<booktitle>Proceedings of the ACM SIGGRAPH Symposium on User Interface Software</booktitle>
<location>Banff, Alberta, Canada</location>
<date>1988</date>
<title>Using Active Data in a UIMS</title>
<pages>167--178</pages>
</citation>
<citation>
<authors>
<author>T Saaao</author>
</authors>
<booktitle>In Proceedings of the 8th International Symposium on Multiple-Valued Logic</booktitle>
<date>1978</date>
<title>An application of multiple-valued logic to a design of programmable logic arrays</title>
</citation>
<citation>
<authors>
<author>K Pettis</author>
<author>R C Hansen</author>
</authors>
<booktitle>In Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design Implementation</booktitle>
<date>1990</date>
<title>Profile guided code positioning</title>
<pages>16--27</pages>
</citation>
<citation>
<authors>
<author>J ROMPEL</author>
</authors>
<booktitle>In Proceedings of the 22nd Annual ACM Symposium on the Theoo' of Computing. ACM</booktitle>
<location>New York</location>
<date>1990</date>
<title>One-way functions are necessary and sufficient for secure signatures</title>
<pages>387--394</pages>
</citation>
<citation>
<authors>
<author>J M Wing</author>
<author>M Vaziri-Farahani</author>
</authors>
<booktitle>In Proceedings of SIGSOFT'95 Third ACM SIGSOFT Symposium on the Foundations of Software Engineering</booktitle>
<date>1995</date>
<title>Model checking software systems: A case study</title>
<pages>128--139</pages>
</citation>
<citation>
<authors>
<author>S L Peyton Jones</author>
<author>Jon Salldld</author>
</authors>
<booktitle>In Proceedings of the 1989 Conference on Functional Programming Languages Computer Architecture</booktitle>
<date>1989</date>
<title>The Spineless Tagless G-machine</title>
</citation>
<citation>
<authors>
<author>F Lockwood Morris</author>
</authors>
<booktitle>In Proceedings of the First ACM Symposium on Principles of Programming Languages</booktitle>
<date>1973</date>
<title>Advice on structuring compilers and proving them correct</title>
<pages>144--152</pages>
</citation>
<citation>
<authors>
<author>J CONKLIN</author>
<author>M L BEGEMAN</author>
</authors>
<booktitle>In Proceedings of the ACM Conference on Computer-Supported Cooperative Work CSCW '88</booktitle>
<location>Portland, OR</location>
<date>1988</date>
<title>gIBIS: a hypertext tool for exploratory policy discussion</title>
<publisher>ACM Press</publisher>
<pages>26--28</pages>
</citation>
<citation>
<authors>
<author>J Reif</author>
<author>L G Valiant</author>
</authors>
<booktitle>Proceedings of the 15th Annual ACM Symposium on Theory of Computing</booktitle>
<location>Boston</location>
<date>1987</date>
<title>A Logarithmic Time Sort on Linear Size Networks</title>
<journal>Journal of the ACM</journal>
<pages>60--76</pages>
</citation>
<citation>
<authors>
<author>U Vazirani</author>
</authors>
<booktitle>In Proceedings of the 19 th Annual ACM Symposium on Theory of Computing</booktitle>
<location>New York City</location>
<date>1987</date>
<title>Efficiency considerations in using semi-random sources</title>
</citation>
<citation>
<authors>
<author>A C Yao</author>
</authors>
<booktitle>In Proceedings of the 13 th Annual ACM Symposium on Theory of Computing</booktitle>
<location>Milwaukee, Wisconsin</location>
<date>1981</date>
<title>The entropic limitations on VLSI computations</title>
<pages>308--311</pages>
</citation>
<citation>
<authors>
<author>Nimrod Megiddo</author>
</authors>
<date>1984</date>
<title>Linear programming in linear time when the dimension is fixed</title>
<journal>Journal of the ACM</journal>
<pages>31--1</pages>
</citation>
<citation>
<authors>
<author>Nimrod Megiddo</author>
</authors>
<date>1984</date>
<title>Linear programming in linear time when the dimension is fixed</title>
<journal>Journal of the ACM</journal>
<pages>31--1</pages>
</citation>
<citation>
<authors>
<author>Muneo Takahashi</author>
</authors>
<booktitle>Proceedings of the Eighth International Conference on Software Engineering</booktitle>
<date></date>
<title>Yuji Kamayachi (Nippon Telephone and Telegraph). "An Empirical Study of a Model for Program Error Prediction</title>
<pages>28--30</pages>
</citation>
<citation>
<authors>
<author>G M Lohman</author>
</authors>
<booktitle>Proceedings of the ACM SIGMOD International Conference on the Management of Data</booktitle>
<location>Chicago, IL</location>
<date>1988</date>
<title>Grammar-Like Functional Rules for Representing Query Optimization Alternatives</title>
<pages>18--27</pages>
</citation>
<citation>
<authors>
<author>Daniel P Huttenlocher</author>
</authors>
<booktitle>Applications, Proceedings of the 7th Annual Symposium on Computational Geometry</booktitle>
<date>1991</date>
<title>Klara Kedam and Micha Sharir. The Upper Envelope of Voronoi Surfaces and its</title>
<pages>194--203</pages>
</citation>
<citation>
<authors>
<author>M Wand</author>
<author>D P Fredman</author>
</authors>
<booktitle>In Proceedings Symposium on Lisp and Functional Programming</booktitle>
<date>1986</date>
<title>The mystery of the tower revealed: a non-reflective description of the reflective tower</title>
<publisher>ACM</publisher>
<pages>298--307</pages>
</citation>
<citation>
<authors>
<author>C Ahlberg</author>
<author>B Shneiderman</author>
</authors>
<booktitle>in Proceedings of the ACM SIGCHI Conference on Human Factors in Computing System clebrating independence (Boston MA</booktitle>
<date>1994</date>
<title>Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays</title>
</citation>
<citation>
<authors>
<author>David B Leblang</author>
<author>Robert P Chase</author>
</authors>
<booktitle>In Proceedings of the ACM SIGSOFTISIGPLAN Software Engineering Symposiumm on Practical Software Development Environments</booktitle>
<title>Computer-Aided Software Engineering in a Distributed Workstation Environment</title>
<pages>104--1</pages>
</citation>
<citation>
<authors>
<author>Cary Gray</author>
<author>David Cheriton</author>
</authors>
<booktitle>In Proceedings of the Twelfth Symposium on Operating Systems Principles</booktitle>
<date>1989</date>
<title>Leases An efficient faulttolerant mechanism for distributed file cache consistency</title>
<publisher>ACM</publisher>
<pages>202--210</pages>
</citation>
<citation>
<authors>
<author>A M Disney</author>
<author>P M Johnson</author>
</authors>
<booktitle>In Proceedings of the ACM SIGSOFT Sixth International Symposium on the Foundations of Software Engineering</booktitle>
<title>Investigating data quality problems in the PSP</title>
<pages>143--148</pages>
</citation>
<citation>
<authors>
<author>J Reif</author>
<author>L G Valiant</author>
</authors>
<volume>34</volume>
<location>Boston</location>
<date>1987</date>
<booktitle>Proceedings of the 15th Annual ACM Symposium on Theory of Computing</booktitle>
<title>A Logarithmic Time Sort on Linear Size Networks</title>
<journal>Journal of the ACM</journal>
<pages>60--76</pages>
</citation>
</citationList>
</algorithm>
