LEADER 04148oam  2200589   450 
001 996465889003316
005 20210806163512.0
010   $a3-540-49382-4
024 7 $a10.1007/b71635
035   $a(CKB)1000000000211030
035   $a(SSID)ssj0000323295
035   $a(PQKBManifestationID)11223088
035   $a(PQKBTitleCode)TC0000323295
035   $a(PQKBWorkID)10300114
035   $a(PQKB)10060744
035   $a(DE-He213)978-3-540-49382-2
035   $a(MiAaPQ)EBC3087570
035   $a(MiAaPQ)EBC6494975
035   $a(PPN)155219766
035   $a(EXLCZ)991000000000211030
100   $a20210806d1998      uy             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 00$aFoundations of software technology and theoretical computer science $e18th conference, chennai, india, december 17-19, 1998 : proceedings /$fedited by V. Arvind and R. Ramanujam
205   $a1st ed. 1998.
210  1$aBerlin, Germany :$cSpringer,$d[1998]
210  4$d©1998
215   $a1 online resource (XII, 369 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1530
300   $aIncludes index.
311   $a3-540-65384-8 
327   $aInvited Talk 1 -- Descriptive Complexity and Model Checking -- Session 1(a) -- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem -- A Hamiltonian Approach to the Assignment of Non-reusable Frequencies -- Session 1(b) -- Deadlock Sensitive Types for Lambda Calculus with Resources -- On encoding p? in m? -- Session 2(a) -- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets -- Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling -- Session 2(b) -- A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems -- Testing Theories for Asynchronous Languages -- Invited Talk 2 -- Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation -- Session 3 -- Optimal Regular Tree Pattern Matching Using Pushdown Automata -- Locating Matches of Tree Patterns in Forests -- Session 4 -- Benefits of Tree Transducers for Optimizing Functional Programs -- Implementable Failure Detectors in Asynchronous Systems -- Invited Talk 3 -- BRICS and Quantum Information Processing -- Session 5(a) -- Martingales and Locality in Distributed Computing -- Space Efficient Suffix Trees -- Session 5(b) -- Formal Verification of an O.S. Submodule -- Infinite Probabilistic and Nonprobabilistic Testing -- Session 6(a) -- On Generating Strong Elimination Orderings of Strongly Chordal Graphs -- A Parallel Approximation Algorithm for Minimum Weight Triangulation -- Session 6(b) -- The Power of Reachability Testing for Timed Automata -- Recursive Mean-Value Calculus -- Invited Talk 4 -- Efficient Formal Verification of Hierarchical Descriptions -- Invited Talk 5 -- Proof Rules for Model Checking Systems with Data -- Session 7 -- Partial Order Reductions for Bisimulation Checking -- First-Order-CTL Model Checking -- Session 8(a) -- On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms -- Remarks on Graph Complexity -- Session 8(b) -- On the Confluence of Trace Rewriting Systems -- A String-Rewriting Characterization of Muller and Schupp?s Context-Free Graphs -- Session 9 -- Different Types of Monotonicity for Restarting Automata -- A Kleene Iteration for Parallelism -- Invited Talk 6 -- Quantum Computation and Information.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1530
606   $aMolecular computers
606   $aComputer software
606   $aComputer science
615  0$aMolecular computers.
615  0$aComputer software.
615  0$aComputer science.
676   $a511.3
702   $aRamanujam$b R.
702   $aArvind$b V.
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bUtOrBLW
906   $aBOOK
912   $a996465889003316
996   $aFoundations of software technology and theoretical computer science$9383921
997   $aUNISA