X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Buch
    Buch
    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
    Umfang: XIV, 660 S.
    ISBN: 3-540-43283-3
    Serie: Lecture notes in computer science 2285
    Anmerkung: Literaturangaben
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    SS 4800
    Schlagwort(e): Theoretische Informatik ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Inhaltsverzeichnis
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Cover
    URL: Inhaltstext
    URL: http://www.loc.gov/catdir/enhancements/fy0817/2002022193-d.html
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    FU Berlin get availability status
    UB Potsdam get availability status
    BTU Cottbus get availability status
    TU Berlin get availability status
  • 2
    Online-Ressource
    Online-Ressource
    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
    Umfang: XIV, 660 p. , online resource.
    ISBN: 9783540458418
    Serie: Lecture Notes in Computer Science, 2285
    Anmerkung: 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
    Weitere Ausg.: Printed edition: ISBN 9783540432838
    Sprache: Englisch
    DOI: 10.1007/3-540-45841-7
    URL: http://dx.doi.org/10.1007/3-540-45841-7
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
  • 3
    Online-Ressource
    Online-Ressource
    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
    Umfang: XIV, 660 p. , online resource.
    Ausgabe: 1st ed. 2002.
    ISBN: 9783540458418
    Serie: Lecture Notes in Computer Science, 2285
    Anmerkung: 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
    Weitere Ausg.: Printed edition: ISBN 9783662180501
    Weitere Ausg.: Printed edition: ISBN 9783540432838
    Sprache: Englisch
    DOI: 10.1007/3-540-45841-7
    URL: https://doi.org/10.1007/3-540-45841-7
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
  • 4
    Online-Ressource
    Online-Ressource
    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
    Umfang: Online-Ressource
    ISBN: 9783540458418 , 3540432833
    Serie: Lecture Notes in Computer Science 2285
    Inhalt: 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
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 9783540432838
    Weitere Ausg.: Buchausg. u.d.T. STACS (19 : 2002 : Antibes; Juan-les-Pins) STACS 2002 Berlin : Springer, 2002 ISBN 3540432833
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    SS 4800
    Schlagwort(e): 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
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Online Zugang
    Open Access Wunsch
    UB Potsdam
  • 5
    Buch
    Buch
    Proceedings (2002)
    Berlin [u.a.] : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13392672
    Umfang: XIV, 660 Seiten , graph. Darst. , 24 cm
    ISBN: 3540432833
    Serie: Lecture notes in computer science 2285
    Anmerkung: Literaturangaben , Text engl.
    Sprache: Englisch
    Schlagwort(e): Theoretische Informatik ; Kongress ; Antibes 〈2002〉 ; Kongress ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    Berlin VÖBB/ZLB get availability status
Nichts oder nicht das Richtige gefunden? Bitte überprüfen Sie Ihre Suchanfrage oder benutzen Sie den Fernleihindex.
Meinten Sie 9783540432883?
Meinten Sie 9783540122838?
Meinten Sie 9783540232438?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz