LEADER 05865nam 22007335 450 001 996466150603316 005 20200701172950.0 010 $a3-540-49054-X 024 7 $a10.1007/3-540-58715-2 035 $a(CKB)1000000000234212 035 $a(SSID)ssj0000323253 035 $a(PQKBManifestationID)11242980 035 $a(PQKBTitleCode)TC0000323253 035 $a(PQKBWorkID)10299457 035 $a(PQKB)11520625 035 $a(DE-He213)978-3-540-49054-8 035 $a(PPN)155167545 035 $a(EXLCZ)991000000000234212 100 $a20121227d1994 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] $e14th Conference, Madras, India, December 15 - 17, 1994. Proceedings /$fedited by P.S. Thiagarajan 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XII, 460 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v880 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-58715-2 327 $aEfficient resolution of singularities of plane curves -- On the interactive complexity of graph reliability -- Matching upper and lower bounds for simulations of several tapes on one multidimensional tape -- The complexity of computing over quasigroups -- Non-commutative computation, depth reduction, and skew circuits (extended abstract) -- Inductive definitions and type theory an introduction (preliminary version) -- Interpreter verification for a functional language -- An epistemic foundation for logic programming with uncertainty -- On typed calculi with a merge operator -- Incremental algorithms for the single-source shortest path problem -- An O(n) algorithm for realizing degree sequences -- Coloring semi-random graphs in polynomial expected time -- Finite-state strategies in regular infinite games -- Location of the largest empty rectangle among arbitrary obstacles -- Efficient parallel and linear time sequential split decomposition (extended abstract) -- Algorithms for convex visibility problems -- Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems -- Localities and failures (extended summary) -- Priority and abstraction in process algebra -- On the computational power of operators in ICSP with fairness -- Decidability of timed language-inclusion for networks of real-time communicating sequential processes -- My favorite ten complexity theorems of the past decade -- Solving a unification problem under constrained substitutions using tree automata -- Automata-driven efficient subterm unification -- Randomized approximation algorithms in combinatorial optimization -- A limited-backtrack greedy schema for approximation algorithms -- On approximation scheme preserving reductibility and its applications -- Approximation schemes using L-reductions -- An explanation of splaying -- Proving non-reachability by modulo-place-invariants -- Soundness and completeness of UNITY logic -- Efficient algorithms for the transformation between different types of binary decision diagrams -- Extending the limits of sequentially phased reasoning -- Foundations for faster external sorting -- Branching rules for satisfiability -- Using linear arithmetic procedure for generating induction schemes. 330 $aThis volume presents the proceedings of the 14th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FST&TCS-14, held in Madras, India in December 1994. Besides the five invited papers by well-known researchers, it includes 31 full refereed research papers selected out of a total of 140 submissions. The papers contribute to the whole area of theoretical computer science with an emphasis on algorithms and complexity. Other topics covered are program semantics, program verification, formal logic, computational geometry, concurrency, unification, and discrete mathematics. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v880 606 $aComputers 606 $aSoftware engineering 606 $aAlgorithms 606 $aComputer logic 606 $aCombinatorics 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 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aCombinatorics. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aCombinatorics. 615 24$aComputer Graphics. 676 $a004.0151 702 $aThiagarajan$b P.S$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466150603316 996 $aFoundations of software technology and theoretical computer science$9383921 997 $aUNISA