<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>04332mam a2200373 a 4500</leader>
  <controlfield tag="001">1910665</controlfield>
  <controlfield tag="003">BD-DhUL</controlfield>
  <controlfield tag="005">20140806153653.0</controlfield>
  <controlfield tag="008">970122s1996    gw            100 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">3540620346</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(OCoLC)ocm36242624</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(NNC)1910665</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">CUS</subfield>
    <subfield code="c">CUS</subfield>
    <subfield code="d">OrLoB-B</subfield>
    <subfield code="d">BD-DhUL</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.3</subfield>
    <subfield code="b">FOU</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
    <subfield code="a">Foundations of software technology and theoretical computer science :</subfield>
    <subfield code="b">16th conference, Hyderabad, India, December 18-20, 1996 : proceedings /</subfield>
    <subfield code="c">V. Chandru, V. Vinay, eds.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Berlin ;</subfield>
    <subfield code="a">New York :</subfield>
    <subfield code="b">Springer,</subfield>
    <subfield code="c">c1996.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xi, 386 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">24 cm.</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Lecture notes in computer science ;</subfield>
    <subfield code="v">1180</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">"FST and TCS 16"--Cover.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">"The proceedings of the Sixteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science"--Pref.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="t">Circuit Complexity before the Dawn of the New Millennium /</subfield>
    <subfield code="r">Eric Allender --</subfield>
    <subfield code="t">A Lambda Calculus with Letrecs and Barriers /</subfield>
    <subfield code="r">Arvind, Jan-Willem Maessen and Rishiyur S. Nikhil [et al.] --</subfield>
    <subfield code="t">Tables /</subfield>
    <subfield code="r">J. Ian Munro --</subfield>
    <subfield code="t">Mechanized Formal Methods: Progress and Prospects /</subfield>
    <subfield code="r">John Rushby --</subfield>
    <subfield code="t">The Parameter Space of the d-step Conjecture /</subfield>
    <subfield code="r">J. C. Lagarias, N. Prabhu and J. A. Reeds --</subfield>
    <subfield code="t">On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees /</subfield>
    <subfield code="r">G. Das, S. Kapoor and M. Smid --</subfield>
    <subfield code="t">Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles /</subfield>
    <subfield code="r">P. Mitra and S. C. Nandy --</subfield>
    <subfield code="t">Weak Bisimulation and Model Checking for Basic Parallel Processes /</subfield>
    <subfield code="r">R. Mayr --</subfield>
    <subfield code="t">Testing Processes for Efficiency /</subfield>
    <subfield code="r">K. Jain and S. Arun-Kumar --</subfield>
    <subfield code="t">Regularity is Decidable for Normed PA Processes in Polynomial Time /</subfield>
    <subfield code="r">A. Kucera --</subfield>
    <subfield code="t">Dynamic Maintenance of Shortest Path Trees in Simple Polygons /</subfield>
    <subfield code="r">S. Kapoor and T. Singh --</subfield>
  </datafield>
  <datafield tag="505" ind1="8" ind2="0">
    <subfield code="t">Close Approximations of Minimum Rectangular Coverings /</subfield>
    <subfield code="r">C. Levcopoulos and J. Gudmundsson --</subfield>
    <subfield code="t">A New Competitive Algorithm for Agent Searching in Unknown Streets /</subfield>
    <subfield code="r">P. Dasgupta, P. P. Chakrabarti and S. C. DeSarkar --</subfield>
    <subfield code="t">On the Design of Hybrid Control Systems Using Automata Models /</subfield>
    <subfield code="r">D. V. Hung and W. Ji --</subfield>
    <subfield code="t">Constraint Retraction in FD /</subfield>
    <subfield code="r">P. Codognet, D. Diaz and F. Rossi --</subfield>
    <subfield code="t">Winskel is (Almost) Right: Towards a Mechanized Semantics Textbooks /</subfield>
    <subfield code="r">T. Nipkow --</subfield>
    <subfield code="t">An Optimal Deterministic Algorithm for Online b-Matching /</subfield>
    <subfield code="r">B. Kalyanasundaram and K. Pruhs --</subfield>
    <subfield code="t">Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems /</subfield>
    <subfield code="r">P. J. Varman and R. M. Verma --</subfield>
    <subfield code="t">Complexity of the Gravitational Method for Linear Programming /</subfield>
    <subfield code="r">T. L. Morin, N. Prabhu and Z. Zhang --</subfield>
    <subfield code="t">Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors /</subfield>
    <subfield code="r">B. J. Oommen and R. K. S. Loke --</subfield>
  </datafield>
  <datafield tag="505" ind1="8" ind2="0">
    <subfield code="t">Minimal Relative Normalization in Orthogonal Expression Reduction Systems /</subfield>
    <subfield code="r">J. Galuert and Z. Khashdashvili --</subfield>
    <subfield code="t">Trace Consistency and Inevitability /</subfield>
    <subfield code="r">R. Ramanujam --</subfield>
    <subfield code="t">Finite State Implementations of Knowledge-Based Programs /</subfield>
    <subfield code="r">R. van der Meyden --</subfield>
    <subfield code="t">Higher-Order Proof by Consistency /</subfield>
    <subfield code="r">H. Linnestad, C. Prehofer and O. Lysne --</subfield>
    <subfield code="t">Advocating Ownership /</subfield>
    <subfield code="r">H. Fernau, K.-J. Lange and K. Reinhardt --</subfield>
    <subfield code="t">Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits /</subfield>
    <subfield code="r">R. Sengupta and H. Venkateswaran --</subfield>
    <subfield code="t">Limitations of the QRQW and EREW PRAM Models /</subfield>
    <subfield code="r">M. Kutylowski and K. Lorys --</subfield>
    <subfield code="t">Pinpointing Computation with Modular Queries in the Boolean Hierarchy /</subfield>
    <subfield code="r">M. Agrawal, R. Beigel and T. Thierauf --</subfield>
    <subfield code="t">Characterization of Principal Type of Normal Forms in an Intersection Type System /</subfield>
    <subfield code="r">E. Sayag and M. Mauny --</subfield>
    <subfield code="t">Correcting Type Errors in the Curry System /</subfield>
    <subfield code="r">M. Gandhe, G. Venkatesh and A. Sanyal --</subfield>
    <subfield code="t">Immediate Fixpoints and Their Use in Groundness Analysis /</subfield>
    <subfield code="r">H. Sondergaard --</subfield>
  </datafield>
  <datafield tag="505" ind1="8" ind2="0">
    <subfield code="t">Graph Types for Monadic Mobile Processes /</subfield>
    <subfield code="r">N. Yoshida.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer software</subfield>
    <subfield code="v">Congresses.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer science</subfield>
    <subfield code="v">Congresses.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Chandru, Vijay,</subfield>
    <subfield code="d">1953-</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Vinay, V.</subfield>
  </datafield>
  <datafield tag="711" ind1="2" ind2=" ">
    <subfield code="a">Conference on Foundations of Software Technology and Theoretical Computer Science</subfield>
    <subfield code="n">(16th :</subfield>
    <subfield code="d">1996 :</subfield>
    <subfield code="c">Hyderabad, India)</subfield>
  </datafield>
  <datafield tag="830" ind1=" " ind2="0">
    <subfield code="a">Lecture notes in computer science ;</subfield>
    <subfield code="v">1180.</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2=" ">
    <subfield code="a">AUTH</subfield>
    <subfield code="b">TOC</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">981</subfield>
    <subfield code="d">981</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="6">005_300000000000000_FOU</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">NFIC</subfield>
    <subfield code="9">1678</subfield>
    <subfield code="a">DUSL</subfield>
    <subfield code="b">DUSL</subfield>
    <subfield code="c">GEN</subfield>
    <subfield code="d">1999-12-04</subfield>
    <subfield code="e">Purchase</subfield>
    <subfield code="g">0.00</subfield>
    <subfield code="o">005.3 FOU</subfield>
    <subfield code="p">387661</subfield>
    <subfield code="r">2014-08-06</subfield>
    <subfield code="w">2014-08-06</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
