X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science ; Antibes - Juan les Pins, France, March 14-16, 2002 ; proceedings (2002)
    Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London :Springer,
    Details
    UID:
    almafu_BV014150788
    Format: XIV, 660 S.
    ISBN: 3-540-43283-3
    Series Statement: Lecture notes in computer science 2285
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Konferenzschrift ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Inhaltsverzeichnis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    FU Berlin get availability status
    BTU Cottbus get availability status
    TU Berlin get availability status
  • 2
    Online Resource
    Online Resource
    STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, France, March 14–16, 2002 Proceedings (2002)
    Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg
    Details
    UID:
    gbv_164926576X
    Format: Online-Ressource
    ISBN: 9783540458418 , 3540432833
    Series Statement: Lecture Notes in Computer Science 2285
    Content: This book constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and structural complexity, automata and formal languages, and logic in computer science
    Note: Literaturangaben
    Additional Edition: ISBN 9783540432838
    Additional Edition: Buchausg. u.d.T. STACS (19 : 2002 : Antibes; Juan-les-Pins) STACS 2002 Berlin : Springer, 2002 ISBN 3540432833
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Theoretische Informatik ; Konferenzschrift
    DOI: 10.1007/3-540-45841-7
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 3
    Book
    Book
    STACS 2002 : proceedings (2002)
    Berlin : Springer
    Details
    UID:
    gbv_342121529
    Format: XIV, 660 S. , graph. Darst. , 24 cm
    ISBN: 3540432833
    Series Statement: Lecture notes in computer science 2285
    Note: Literaturangaben
    Additional Edition: Erscheint auch als Online-Ausgabe Alt, Helmut STACS 2002 Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2002 ISBN 9783540458418
    Additional Edition: ISBN 3540432833
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Theoretische Informatik ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Cover
    URL: Inhaltstext
    URL: http://www.loc.gov/catdir/enhancements/fy0817/2002022193-d.html
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
  • 4
    Book
    Book
    Proceedings (2002)
    Berlin [u.a.] : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13392672
    Format: XIV, 660 Seiten , graph. Darst. , 24 cm
    ISBN: 3540432833
    Series Statement: Lecture notes in computer science 2285
    Note: Literaturangaben , Text engl.
    Language: English
    Keywords: Theoretische Informatik ; Kongress ; Antibes 〈2002〉 ; Kongress ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Berlin VÖBB/ZLB get availability status
  • 5
    Online Resource
    Online Resource
    STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, France, March 14–16, 2002 Proceedings (2002)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920458402882
    Format: XIV, 660 p. , online resource.
    ISBN: 9783540458418
    Series Statement: Lecture Notes in Computer Science, 2285
    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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540432838
    Language: English
    DOI: 10.1007/3-540-45841-7
    URL: http://dx.doi.org/10.1007/3-540-45841-7
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 6
    Online Resource
    Online Resource
    STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings (2002)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621361602882
    Format: XIV, 660 p. , online resource.
    Edition: 1st ed. 2002.
    ISBN: 9783540458418
    Series Statement: Lecture Notes in Computer Science, 2285
    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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662180501
    Additional Edition: Printed edition: ISBN 9783540432838
    Language: English
    DOI: 10.1007/3-540-45841-7
    URL: https://doi.org/10.1007/3-540-45841-7
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 3540102833?
Did you mean 3540342834?
Did you mean 3540243283?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages