<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Foundations of software technology and theoretical computer science</title>
    <subTitle>16th conference, Hyderabad, India, December 18-20, 1996 : proceedings</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Chandru, Vijay</namePart>
    <namePart type="date">1953-</namePart>
  </name>
  <name type="personal">
    <namePart>Vinay, V.</namePart>
  </name>
  <name type="conference">
    <namePart>Conference on Foundations of Software Technology and Theoretical Computer Science 1996 : Hyderabad, India)</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">conference publication</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">gw</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Berlin</placeTerm>
    </place>
    <place>
      <placeTerm type="text">New York</placeTerm>
    </place>
    <publisher>Springer</publisher>
    <dateIssued>c1996</dateIssued>
    <dateIssued encoding="marc">1996</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xi, 386 p. : ill. ; 24 cm.</extent>
  </physicalDescription>
  <tableOfContents>Circuit Complexity before the Dawn of the New Millennium / Eric Allender -- A Lambda Calculus with Letrecs and Barriers / Arvind, Jan-Willem Maessen and Rishiyur S. Nikhil [et al.] -- Tables / J. Ian Munro -- Mechanized Formal Methods: Progress and Prospects / John Rushby -- The Parameter Space of the d-step Conjecture / J. C. Lagarias, N. Prabhu and J. A. Reeds -- On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees / G. Das, S. Kapoor and M. Smid -- Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles / P. Mitra and S. C. Nandy -- Weak Bisimulation and Model Checking for Basic Parallel Processes / R. Mayr -- Testing Processes for Efficiency / K. Jain and S. Arun-Kumar -- Regularity is Decidable for Normed PA Processes in Polynomial Time / A. Kucera -- Dynamic Maintenance of Shortest Path Trees in Simple Polygons / S. Kapoor and T. Singh --</tableOfContents>
  <tableOfContents>Close Approximations of Minimum Rectangular Coverings / C. Levcopoulos and J. Gudmundsson -- A New Competitive Algorithm for Agent Searching in Unknown Streets / P. Dasgupta, P. P. Chakrabarti and S. C. DeSarkar -- On the Design of Hybrid Control Systems Using Automata Models / D. V. Hung and W. Ji -- Constraint Retraction in FD / P. Codognet, D. Diaz and F. Rossi -- Winskel is (Almost) Right: Towards a Mechanized Semantics Textbooks / T. Nipkow -- An Optimal Deterministic Algorithm for Online b-Matching / B. Kalyanasundaram and K. Pruhs -- Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems / P. J. Varman and R. M. Verma -- Complexity of the Gravitational Method for Linear Programming / T. L. Morin, N. Prabhu and Z. Zhang -- Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors / B. J. Oommen and R. K. S. Loke --</tableOfContents>
  <tableOfContents>Minimal Relative Normalization in Orthogonal Expression Reduction Systems / J. Galuert and Z. Khashdashvili -- Trace Consistency and Inevitability / R. Ramanujam -- Finite State Implementations of Knowledge-Based Programs / R. van der Meyden -- Higher-Order Proof by Consistency / H. Linnestad, C. Prehofer and O. Lysne -- Advocating Ownership / H. Fernau, K.-J. Lange and K. Reinhardt -- Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits / R. Sengupta and H. Venkateswaran -- Limitations of the QRQW and EREW PRAM Models / M. Kutylowski and K. Lorys -- Pinpointing Computation with Modular Queries in the Boolean Hierarchy / M. Agrawal, R. Beigel and T. Thierauf -- Characterization of Principal Type of Normal Forms in an Intersection Type System / E. Sayag and M. Mauny -- Correcting Type Errors in the Curry System / M. Gandhe, G. Venkatesh and A. Sanyal -- Immediate Fixpoints and Their Use in Groundness Analysis / H. Sondergaard --</tableOfContents>
  <tableOfContents>Graph Types for Monadic Mobile Processes / N. Yoshida.</tableOfContents>
  <note type="statement of responsibility">V. Chandru, V. Vinay, eds.</note>
  <note>"FST and TCS 16"--Cover.</note>
  <note>"The proceedings of the Sixteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science"--Pref.</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <topic>Computer software</topic>
    <topic>Congresses</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computer science</topic>
    <topic>Congresses</topic>
  </subject>
  <classification authority="ddc">005.3 FOU</classification>
  <relatedItem type="series">
    <titleInfo>
      <title>Lecture notes in computer science ; 1180</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">3540620346</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">CUS</recordContentSource>
    <recordCreationDate encoding="marc">970122</recordCreationDate>
    <recordChangeDate encoding="iso8601">20140806153653.0</recordChangeDate>
    <recordIdentifier source="BD-DhUL">1910665</recordIdentifier>
  </recordInfo>
</mods>
