LEADER 04423oam 2200565 450 001 996466344703316 005 20210714184008.0 010 $a3-540-46691-6 024 7 $a10.1007/3-540-46691-6 035 $a(CKB)1000000000211332 035 $a(SSID)ssj0000323281 035 $a(PQKBManifestationID)11212805 035 $a(PQKBTitleCode)TC0000323281 035 $a(PQKBWorkID)10296803 035 $a(PQKB)11174774 035 $a(DE-He213)978-3-540-46691-8 035 $a(MiAaPQ)EBC3073073 035 $a(MiAaPQ)EBC6485649 035 $a(PPN)155221574 035 $a(EXLCZ)991000000000211332 100 $a20210714d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aFoundations of software technology and theoretical computer science $e19th conference, Chennai, India, December 13-15, 1999 : proceedings /$fC. Pandu Rangan, V. Raman, R. Ramanujam (editors) 205 $a1st ed. 1999. 210 1$aBerlin ;$aHeidelberg ;$aNew York :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (XII, 460 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1738 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66836-5 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk 1 -- Recent Developments in the Theory of Arrangements of Surfaces -- Session 1(a) -- Dynamic Compressed Hyperoctrees with Application to the N-body Problem -- Largest Empty Rectangle among a Point Set -- Session 1(b) -- Renaming Is Necessary in Timed Regular Expressions -- Product Interval Automata: A Subclass of Timed Automata -- Session 2(a) -- The Complexity of Rebalancing a Binary Search Tree -- Fast Allocation and Deallocation with an Improved Buddy System -- Session 2(b) -- Optimal Bounds for Transformations of ?-Automata -- CTL+ Is Exponentially More Succinct than CTL -- Invited Talk 2 -- A Top-Down Look at a Secure Message -- Session 3 -- Explaining Updates by Minimal Sums -- A Foundation for Hybrid Knowledge Bases -- Session 4 -- Hoare Logic for Mutual Recursion and Local Variables -- Invited Talk 3 -- Explicit Substitutions and Programming Languages -- Session 5(a) -- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings -- A Randomized Algorithm for Flow Shop Scheduling -- Session 5(b) -- Synthesizing Distributed Transition Systems from Global Specifications -- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata -- Session 6 -- Implicit Temporal Query Languages: Towards Completeness -- On the Undecidability of Some Sub-classical First-Order Logics -- Invited Talk 4 -- How to Compute with DNA -- Session 7(a) -- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles -- Protecting Facets in Layered Manufacturing -- Session 7(b) -- The Receptive Distributed ?-Calculus -- Series and Parallel Operations on Pomsets -- Session 8 -- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus -- Invited Talk 5 -- Graph Isomorphism: Its Complexity and Algorithms -- Session 9(a) -- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables -- Lower Bounds for Linear Transformed OBDDs and FBDDs -- Session 9(b) -- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems -- Graded Modalities and Resource Bisimulation -- Session 10(a) -- The Non-recursive Power of Erroneous Computation -- Analysis of Quantum Functions -- Session 10(b) -- On Sets Growing Continuously -- Model Checking Knowledge and Time in Systems with Perfect Recall -- FST&TCS ? ISAAC Joint Session Talks -- The Engineering of Some Bipartite Matching Programs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1738 606 $aSoftware engineering$vCongresses 615 0$aSoftware engineering 676 $a005.1 702 $aPandu Rangan$b C.$f1955- 702 $aRaman$b V. 702 $aRamanujam$b R. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996466344703316 996 $aFoundations of software technology and theoretical computer science$9383921 997 $aUNISA