| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:522495550:4645 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:522495550:4645?format=raw |
LEADER: 04645mam a2200373 a 4500
001 1910665
005 20220609024632.0
008 970122t19961996gw 100 0 eng d
020 $a3540620346
035 $a(OCoLC)ocm36242624
035 $9AMA5550CU
035 $a(NNC)1910665
035 $a1910665
040 $aCUS$cCUS$dOrLoB-B
245 00 $aFoundations of software technology and theoretical computer science :$b16th conference, Hyderabad, India, December 18-20, 1996 : proceedings /$cV. Chandru, V. Vinay, eds.
260 $aBerlin ;$aNew York :$bSpringer,$c[1996], ©1996.
300 $axi, 386 pages :$billustrations ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aLecture notes in computer science ;$v1180
500 $a"FST and TCS 16"--Cover.
500 $a"The proceedings of the Sixteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science"--Pref.
504 $aIncludes bibliographical references and index.
505 00 $tCircuit Complexity before the Dawn of the New Millennium /$rEric Allender --$tA Lambda Calculus with Letrecs and Barriers /$rArvind, Jan-Willem Maessen and Rishiyur S. Nikhil [et al.] --$tTables /$rJ. Ian Munro --$tMechanized Formal Methods: Progress and Prospects /$rJohn Rushby --$tThe Parameter Space of the d-step Conjecture /$rJ. C. Lagarias, N. Prabhu and J. A. Reeds --$tOn the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees /$rG. Das, S. Kapoor and M. Smid --$tEfficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles /$rP. Mitra and S. C. Nandy --$tWeak Bisimulation and Model Checking for Basic Parallel Processes /$rR. Mayr --$tTesting Processes for Efficiency /$rK. Jain and S. Arun-Kumar --$tRegularity is Decidable for Normed PA Processes in Polynomial Time /$rA. Kucera --$tDynamic Maintenance of Shortest Path Trees in Simple Polygons /$rS. Kapoor and T. Singh --
505 80 $tClose Approximations of Minimum Rectangular Coverings /$rC. Levcopoulos and J. Gudmundsson --$tA New Competitive Algorithm for Agent Searching in Unknown Streets /$rP. Dasgupta, P. P. Chakrabarti and S. C. DeSarkar --$tOn the Design of Hybrid Control Systems Using Automata Models /$rD. V. Hung and W. Ji --$tConstraint Retraction in FD /$rP. Codognet, D. Diaz and F. Rossi --$tWinskel is (Almost) Right: Towards a Mechanized Semantics Textbooks /$rT. Nipkow --$tAn Optimal Deterministic Algorithm for Online b-Matching /$rB. Kalyanasundaram and K. Pruhs --$tTight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems /$rP. J. Varman and R. M. Verma --$tComplexity of the Gravitational Method for Linear Programming /$rT. L. Morin, N. Prabhu and Z. Zhang --$tOptimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors /$rB. J. Oommen and R. K. S. Loke --
505 80 $tMinimal Relative Normalization in Orthogonal Expression Reduction Systems /$rJ. Galuert and Z. Khashdashvili --$tTrace Consistency and Inevitability /$rR. Ramanujam --$tFinite State Implementations of Knowledge-Based Programs /$rR. van der Meyden --$tHigher-Order Proof by Consistency /$rH. Linnestad, C. Prehofer and O. Lysne --$tAdvocating Ownership /$rH. Fernau, K.-J. Lange and K. Reinhardt --$tNon-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits /$rR. Sengupta and H. Venkateswaran --$tLimitations of the QRQW and EREW PRAM Models /$rM. Kutylowski and K. Lorys --$tPinpointing Computation with Modular Queries in the Boolean Hierarchy /$rM. Agrawal, R. Beigel and T. Thierauf --$tCharacterization of Principal Type of Normal Forms in an Intersection Type System /$rE. Sayag and M. Mauny --$tCorrecting Type Errors in the Curry System /$rM. Gandhe, G. Venkatesh and A. Sanyal --$tImmediate Fixpoints and Their Use in Groundness Analysis /$rH. Sondergaard --
505 80 $tGraph Types for Monadic Mobile Processes /$rN. Yoshida.
650 0 $aComputer software$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2008101469
650 0 $aComputer science$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2008101220
700 1 $aChandru, Vijay,$d1953-$0http://id.loc.gov/authorities/names/n98085470
700 1 $aVinay, V.$0http://id.loc.gov/authorities/names/nr99009698
711 2 $aConference on Foundations of Software Technology and Theoretical Computer Science$n(16th :$d1996 :$cHyderabad, India)
830 0 $aLecture notes in computer science ;$v1180.$0http://id.loc.gov/authorities/names/n42015162
852 00 $boff,eng$hQA76.751$i.F692 1996g