| 000 | 05388nam a22005535i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-45841-8 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102009.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2002 gw | s |||| 0|eng d | ||
| 020 |
_a9783540458418 _9978-3-540-45841-8 |
||
| 024 | 7 |
_a10.1007/3-540-45841-7 _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 |
_aSTACS 2002 _h[electronic resource] : _b19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, France, March 14–16, 2002 Proceedings / _cedited by Helmut Alt, Afonso Ferreira. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
| 300 |
_aXIV, 660 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, _x0302-9743 ; _v2285 |
|
| 505 | 0 | _aInvited Papers -- Hyper-Encryption and Everlasting Security -- Models and Techniques for Communication in Dynamic Networks -- What Is a Theory? -- Algorithms -- A Space Lower Bound for Routing in Trees -- Labeling Schemes for Dynamic Tree Networks -- Tight Bounds for the Performance of Longest-in-System on DAGs -- Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling -- Balanced Coloring: Equally Easy for All Numbers of Colors? -- The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 -- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets -- On Dualization in Products of Forests -- An Asymptotic (ln ?/ ln ln ?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs -- Scheduling at Twilight the EasyWay -- Complexity of Multi-dimensional Loop Alignment -- A Probabilistic 3—SAT Algorithm Further Improved -- The Secret of Selective Game Tree Search, When Using Random-Error Evaluations -- Randomized Acceleration of Fundamental Matrix Computations -- Approximations for ATSP with Parametrized Triangle Inequality -- A New Diagram from Disks in the Plane -- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles -- Current Challenges -- On the Parameterized Intractability of Closest Substring and Related Problems -- On the Complexity of Protein Similarity Search under mRNA Structure Constraints -- Pure Dominance Constraints -- Improved Quantum Communication Complexity Bounds for Disjointness and Equality -- On Quantum Computation with Some Restricted Amplitudes -- A Quantum Goldreich-Levin Theorem with Cryptographic Applications -- On Quantum and Approximate Privacy -- On Quantum Versions of the Yao Principle -- Computational and Structural Complexity -- Describing Parameterized Complexity Classes -- On the Computational Power of Boolean Decision Lists -- How Many Missing Answers Can Be Tolerated by Query Learners? -- Games with a Uniqueness Property -- Bi-Immunity Separates Strong NP-Completeness Notions -- Complexity of Semi-algebraic Proofs -- A Lower Bound Technique for Restricted Branching Programs and Applications -- The Complexity of Constraints on Intervals and Lengths -- Automata and Formal Languages -- Nesting Until and Since in Linear Temporal Logic -- Comparing Verboseness for Finite Automata and Turing Machines -- On the Average Parallelism in Trace Monoids -- A Further Step towards a Theory of Regular MSC Languages -- Existential and Positive Theories of Equations in Graph Products -- The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL -- Recognizable Sets of Message Sequence Charts -- Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard -- On the Enumerative Sequences of Regular Languages on k Symbols -- Logic in Computer Science -- Ground Tree Rewriting Graphs of Bounded Tree Width -- Timed Control Synthesis for External Specifications -- Axiomatizing GSOS with Termination -- Axiomatising Tree-Interpretable Structures -- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity -- A Parametric Analysis of the State Explosion Problem in Model Checking -- Generalized Model-Checking over Locally Tree-Decomposable Classes -- Learnability and Definability in Trees and Similar Structures. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aInformation theory. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aData Structures. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 700 | 1 |
_aAlt, Helmut. _eeditor. |
|
| 700 | 1 |
_aFerreira, Afonso. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540432838 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2285 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-45841-7 |
| 942 |
_2EBK5606 _cEBK |
||
| 999 |
_c34900 _d34900 |
||