| 000 | 04856nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-44450-3 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132436.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2000 gw | s |||| 0|eng d | ||
| 020 |
_a9783540444503 _9978-3-540-44450-3 |
||
| 024 | 7 |
_a10.1007/3-540-44450-5 _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 |
_aFST TCS 2000: Foundations of Software Technology and Theoretical Science _h[electronic resource] : _b20th Conference, New Delhi, India, December13-15, 2000 Proceedings / _cedited by Sanjiv Kapoor, Sanjiva Prasad. |
| 250 | _a1st ed. 2000. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2000. |
|
| 300 |
_aXIV, 538 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 ; _v1974 |
|
| 505 | 0 | _aInvited Presentations -- Model Checking: Theory into Practice -- An Algebra for XML Query -- Irregularities of Distribution, Derandomization, and Complexity Theory -- Rewriting Logic as a Metalogical Framework -- Frequency Assignment in Mobile Phone Systems -- Data Provenance: Some Basic Issues -- Contributions -- Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition -- On-Line Edge-Coloring with a Fixed Number of Colors -- On Approximability of the Independent/Connected Edge Dominating Set Problems -- Model Checking CTL Properties of Pushdown Systems -- A Decidable Dense Branching-Time Temporal Logic -- Fair Equivalence Relations -- Arithmetic Circuits and Polynomial Replacement Systems -- Depth-3 Arithmetic Circuits for S inn su2 (X) and Extensions of the Graham-Pollack Theorem -- The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite -- Combining Semantics with Non-standard Interpreter Hierarchies -- Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping -- Dynamically Ordered Probabilistic Choice Logic Programming -- Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems -- Planar Graph Blocking for External Searching -- A Complete Fragment of Higher-Order Duration ?-Calculus -- A Complete Axiomatisation for Timed Automata -- Text Sparsification via Local Maxima -- Approximate Swapped Matching -- A Semantic Theory for Heterogeneous System Design -- Formal Verification of the Ricart-Agrawala Algorithm -- On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation -- ? in2 sup -Completeness: A Classical Approach for New Results -- Is the Standard Proof System for SAT P-Optimal?.-A General Framework for Types in Graph Rewriting -- The Ground Congruence for Chi Calculus -- Inheritance in the Join Calculus -- Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints -- Dynamic Spectrum Allocation: The Impotency of Duration Notification -- The Fine Structure of Game Lambda Models -- Strong Normalization of Second Order Symmetric ?-Calculus -- Scheduling to Minimize the Average Completion Time of Dedicated Tasks -- Hunting for Functionally Analogous Genes -- Keeping Track of the Latest Gossip in Shared Memory Systems -- Concurrent Knowledge and Logical Clock Abstractions -- Decidable Hierarchies of Starfree Languages -- Prefix Languages of Church-Rosser Languages. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aMathematics of Computing. |
| 700 | 1 |
_aKapoor, Sanjiv. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aPrasad, Sanjiva. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540414131 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662203217 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1974 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44450-5 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c187790 _d187790 |
||