000 04296nam a22005415i 4500
001 978-3-540-49382-2
003 DE-He213
005 20160624102042.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540493822
_9978-3-540-49382-2
024 7 _a10.1007/b71635
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aFoundations of Software Technology and Theoretical Computer Science
_h[electronic resource] :
_b18th Conference, Chennai, India, December 17-19, 1998. Proceedings /
_cedited by Vikraman Arvind, Sundar Ramanujam.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1998.
300 _aXII, 369 pp.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1530
505 0 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aInformation theory.
650 0 _aComputational complexity.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aArvind, Vikraman.
_eeditor.
700 1 _aRamanujam, Sundar.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540653844
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1530
856 4 0 _uhttp://dx.doi.org/10.1007/b71635
942 _2EBK6758
_cEBK
999 _c36052
_d36052