STACS 2002 (Record no. 34900)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 05388nam a22005535i 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783540458418 |
-- | 978-3-540-45841-8 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 004.0151 |
245 10 - TITLE STATEMENT | |
Title | STACS 2002 |
Sub Title | 19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, France, March 14–16, 2002 Proceedings / |
Statement of responsibility, etc | edited by Helmut Alt, Afonso Ferreira. |
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication | Berlin, Heidelberg : |
Name of publisher | Springer Berlin Heidelberg, |
Year of publication | 2002. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XIV, 660 p. |
Other physical details | online resource. |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Computer Science, |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | Invited 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 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Data structures (Computer science). |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Information theory. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computational complexity. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer graphics. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Theory of Computation. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Data Structures. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Graphics. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Discrete Mathematics in Computer Science. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Alt, Helmut. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Ferreira, Afonso. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/3-540-45841-7 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | E-BOOKS |
264 #1 - | |
-- | Berlin, Heidelberg : |
-- | Springer Berlin Heidelberg, |
-- | 2002. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
-- | 0302-9743 ; |
Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
---|---|---|---|---|---|---|---|
IMSc Library | EBK5606 | http://dx.doi.org/10.1007/3-540-45841-7 | E-BOOKS |