Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV036033702
    Format: 1 Online-Ressource (VII, 260 S.) , graph. Darst.
    ISBN: 354010576X , 038710576X
    Series Statement: Lecture notes in computer science 104
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Informatik ; Konferenzschrift
    Author information: Deussen, Peter 1935-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    gbv_595132162
    Format: Online-Ressource (VII, 260 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540385615
    Series Statement: Lecture notes in computer science 104
    Content: On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P — complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series — Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings.
    Note: Literaturangaben , Beitr. teilw. dt., teilw. engl., teilw. franz.
    Additional Edition: ISBN 354010576X
    Additional Edition: ISBN 038710576X
    Additional Edition: ISBN 9783540105763
    Additional Edition: Erscheint auch als Druck-Ausgabe Theoretical computer science Berlin : Springer, 1981 ISBN 354010576X
    Additional Edition: ISBN 038710576X
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Informatik ; Kongress ; Informatik ; Informatik ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_BV003376260
    Format: VII, 260 S. : , graph. Darst.
    ISBN: 3-540-10576-X , 0-387-10576-X
    Series Statement: Lecture notes in computer science 104
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Informatik ; Konferenzschrift ; Konferenzschrift
    Author information: Deussen, Peter 1935-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almahu_9947920875002882
    Format: X, 266 p. , online resource.
    ISBN: 9783540385615
    Series Statement: Lecture Notes in Computer Science, 104
    Note: On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P — complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series — Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540105763
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almahu_9948621049302882
    Format: X, 266 p. , online resource.
    Edition: 1st ed. 1981.
    ISBN: 9783540385615
    Series Statement: Lecture Notes in Computer Science, 104
    Note: On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P - complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series - Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662175682
    Additional Edition: Printed edition: ISBN 9783540105763
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649198361
    Format: Online-Ressource
    ISBN: 9783540385615
    Series Statement: Lecture Notes in Computer Science 104
    Additional Edition: ISBN 9783540105763
    Additional Edition: Buchausg. u.d.T. Theoretical computer science Berlin : Springer, 1981 ISBN 354010576X
    Additional Edition: ISBN 038710576X
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Informatik ; Informatik ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edocfu_9959186271702883
    Format: 1 online resource (X, 266 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38561-4
    Series Statement: Lecture Notes in Computer Science, 104
    Note: Bibliographic Level Mode of Issuance: Monograph , On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P — complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series — Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10576-X
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edoccha_9959186271702883
    Format: 1 online resource (X, 266 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38561-4
    Series Statement: Lecture Notes in Computer Science, 104
    Note: Bibliographic Level Mode of Issuance: Monograph , On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P — complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series — Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10576-X
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    gbv_021872147
    Format: VII, 260 S. , graph. Darst.
    ISBN: 354010576X , 038710576X
    Series Statement: Lecture notes in computer science 104
    Note: Literaturangaben , Beitr. teilw. dt., teilw. engl., teilw. franz.
    Additional Edition: Online-Ausg. Theoretical computer science Berlin [u.a.] : Springer, 1981 ISBN 9783540385615
    Additional Edition: Erscheint auch als Online-Ausgabe Deussen, P. Theoretical Computer Science Berlin, Heidelberg : Springer Berlin Heidelberg, 1981 ISBN 9783540385615
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Informatik ; Kongress ; Informatik ; Kongress ; Informatik ; Informatik ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Author information: Deussen, Peter 1935-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186271702883
    Format: 1 online resource (X, 266 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38561-4
    Series Statement: Lecture Notes in Computer Science, 104
    Note: Bibliographic Level Mode of Issuance: Monograph , On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P — complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series — Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10576-X
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540150763?
Did you mean 9783440105733?
Did you mean 9783540005773?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages