LEADER 05572nam 22007455 450 001 996465976203316 005 20200704170626.0 010 $a3-540-49631-9 024 7 $a10.1007/3-540-62034-6 035 $a(CKB)1000000000234570 035 $a(SSID)ssj0000323293 035 $a(PQKBManifestationID)11937902 035 $a(PQKBTitleCode)TC0000323293 035 $a(PQKBWorkID)10296804 035 $a(PQKB)10569931 035 $a(DE-He213)978-3-540-49631-1 035 $a(PPN)155233203 035 $a(EXLCZ)991000000000234570 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundations of Software Technology and Theoretical Computer Science$b[electronic resource] $e16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings /$fedited by Vijay Chandru, V. Vinay 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (XIII, 395 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1180 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-62034-6 327 $aCircuit complexity before the dawn of the new millennium -- A lambda calculus with letrecs and barriers -- Tables -- Mechanized formal methods: Progress and prospects -- The parameter space of the d-step conjecture -- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees -- Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles -- Weak bisimulation and model checking for Basic Parallel Processes -- Testing processes for efficiency -- Regularity is decidable for normed PA processes in polynomial time -- Dynamic maintenance of shortest path trees in simple polygons -- Close approximations of minimum rectangular coverings -- A new competitive algorithm for agent searching in unknown streets -- On the design of hybrid control systems using automata models -- Constraint retraction in FD -- Winskel is (almost) right -- An optimal deterministic algorithm for online b-matching -- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems -- Complexity of the gravitational method for linear programming -- Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors -- Minimal relative normalization in orthogonal expression reduction systems -- Trace consistency and inevitability -- Finite state implementations of knowledge-based programs -- Higher-order proof by consistency -- Advocating ownership -- Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits -- Limitations of the QRQW and EREW PRAM models -- Pinpointing computation with modular queries in the Boolean hierarchy -- Characterization of the principal type of normal forms in an intersection type system -- Correcting type errors in the Curry System -- Immediate fixpoints and their use in groundness analysis -- Graph types for monadic mobile processes. 330 $aThis book constitutes the refereed proceedings of the 16th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS '96, held in Hyderabad, India, in December 1996. The volume presents 28 revised full papers selected from a total of 98 submissions; also included are four invited contributions. The papers are organized in topical sections on computational geometry, process algebras, program semantics, algorithms, rewriting and equational-temporal logics, complexity theory, and type theory. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1180 606 $aComputers 606 $aSoftware engineering 606 $aComputer logic 606 $aAlgorithms 606 $aMathematical logic 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aMathematical Logic and Formal Languages. 615 24$aComputer Graphics. 676 $a004.0151 702 $aChandru$b Vijay$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVinay$b V$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465976203316 996 $aFoundations of software technology and theoretical computer science$9383921 997 $aUNISA