000 | 04508nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-49382-2 | ||
003 | DE-He213 | ||
005 | 20240423132514.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 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
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 V. Arvind, R. Ramanujam. |
250 | _a1st ed. 1998. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
300 |
_aXII, 369 p. _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, _x1611-3349 ; _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 BisimulationChecking -- 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 | _aCompilers (Computer programs). | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aArvind, V. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRamanujam, R. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540653844 |
776 | 0 | 8 |
_iPrinted edition: _z9783662213940 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1530 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b71635 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188490 _d188490 |