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
    Online Resource
    Online Resource
    STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings (2003)
    Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg
    Details
    UID:
    gbv_1649190581
    Format: Online-Ressource
    ISBN: 9783540364948
    Series Statement: Lecture Notes in Computer Science 2607
    Content: This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing
    Additional Edition: ISBN 9783540006237
    Additional Edition: Buchausg. u.d.T. STACS (20 : 2003 : Berlin) STACS 2003 Berlin : Springer, 2003 ISBN 3540006230
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Konferenzschrift ; Konferenzschrift
    DOI: 10.1007/3-540-36494-3
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Inhaltstext
    URL: Volltext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 2
    Book
    Book
    Proceedings (2003)
    Berlin [u.a.] : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13485446
    Format: XVII, 700 Seiten , graph. Darst. , 24 cm
    ISBN: 3540006230
    Series Statement: Lecture notes in computer science 2607
    Note: Text engl.
    Language: English
    Keywords: Theoretische Informatik ; Kongress ; Berlin 〈2003〉 ; Kongress ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Berlin VÖBB/ZLB get availability status
  • 3
    Book
    Book
    STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003 ; proceedings (2003)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV016548384
    Format: XV, 700 S. , graph. Darst.
    ISBN: 3540006230
    Series Statement: Lecture notes in computer science 2607
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Konferenzschrift
    Author information: Habib, Michel 1951-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    BTU Cottbus get availability status
  • 4
    Book
    Book
    STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003 ; proceedings (2003)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almafu_BV016548384
    Format: XV, 700 S. : , graph. Darst.
    ISBN: 3-540-00623-0
    Series Statement: Lecture notes in computer science 2607
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Konferenzschrift
    Author information: Habib, Michel 1951-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    FU Berlin get availability status
  • 5
    Book
    Book
    STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003; proceedings (2003)
    Berlin : Springer
    Details
    UID:
    gbv_1603886621
    Format: XVII, 700 S. , graph. Darst.
    ISBN: 3540006230
    Series Statement: Lecture notes in computer science 2607
    Note: Literaturangaben
    Additional Edition: Online-Ausg. Alt, Helmut STACS 2003 Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2003 ISBN 9783540364948
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Theoretische Informatik ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Cover
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
  • 6
    Online Resource
    Online Resource
    STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920436602882
    Format: XVIII, 706 p. , online resource.
    ISBN: 9783540364948
    Series Statement: Lecture Notes in Computer Science, 2607
    Note: Invited Papers -- Logic as a Query Language: From Frege to XML -- How Does Computer Science Change Molecular Biology? -- Contributed Papers -- Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer -- Rectangle Visibility Graphs: Characterization, Construction, and Compaction -- Approximating Geometric Bottleneck Shortest Paths -- Optimization in Arrangements -- Complete Classifications for the Communication Complexity of Regular Languages -- The Commutation with Codes and Ternary Sets of Words -- On the Confluence of Linear Shallow Term Rewrite Systems -- Wadge Degrees of ?-Languages of Deterministic Turing Machines -- Faster Deterministic Broadcasting in Ad Hoc Radio Networks -- Private Computations in Networks: Topology versus Randomness -- On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements -- Lattice Reduction by Random Sampling and Birthday Methods -- On the Ultimate Complexity of Factorials -- On the Effective Jordan Decomposability -- Fast Algorithms for Extended Regular Expression Matching and Searching -- Algorithms for Transposition Invariant String Matching (Extended Abstract) -- On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets -- Some Results on Derandomization -- On the Representation of Boolean Predicates of the Diffie-Hellman Function -- Quantum Circuits with Unbounded Fan-out -- Analysis of the Harmonic Algorithm for Three Servers -- Non-clairvoyant Scheduling for Minimizing Mean Slowdown -- Space Efficient Hash Tables with Worst Case Constant Access Time -- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure -- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs -- Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs -- Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids -- Algebraic Characterizations of Small Classes of Boolean Functions -- On the Difficulty of Some Shortest Path Problems -- Representing Graph Metrics with Fewest Edges -- Computing Shortest Paths with Uncertainty -- Solving Order Constraints in Logarithmic Space -- The Inversion Problem for Computable Linear Operators -- Algebras of Minimal Rank over Arbitrary Fields -- Evolutionary Algorithms and the Maximum Matching Problem -- Alternative Algorithms for Counting All Matchings in Graphs -- Strong Stability in the Hospitals/Residents Problem -- The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete -- Decidable Theories of Cayley-Graphs -- The Complexity of Resolution with Generalized Symmetry Rules -- Colouring Random Graphs in Expected Polynomial Time -- An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation -- Finding Large Independent Sets in Polynomial Expected Time -- Distributed Soft Path Coloring -- Competing Provers Yield Improved Karp-Lipton Collapse Results -- One Bit of Advice -- Strong Reductions and Immunity for Exponential Time -- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers -- Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem -- Cake-Cutting Is Not a Piece of Cake -- The Price of Truth: Frugality in Truthful Mechanisms -- Untameable Timed Automata! -- The Intrinsic Universality Problem of One-Dimensional Cellular Automata -- On Sand Automata -- Adaptive Sorting and the Information Theoretic Lower Bound -- A Discrete Subexponential Algorithm for Parity Games -- Cryptographically Sound and Machine-Assisted Verification of Security Protocols -- Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540006237
    Language: English
    DOI: 10.1007/3-540-36494-3
    URL: http://dx.doi.org/10.1007/3-540-36494-3
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 7
    Online Resource
    Online Resource
    STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621032802882
    Format: XVIII, 706 p. , online resource.
    Edition: 1st ed. 2003.
    ISBN: 9783540364948
    Series Statement: Lecture Notes in Computer Science, 2607
    Note: Invited Papers -- Logic as a Query Language: From Frege to XML -- How Does Computer Science Change Molecular Biology? -- Contributed Papers -- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer -- Rectangle Visibility Graphs: Characterization, Construction, and Compaction -- Approximating Geometric Bottleneck Shortest Paths -- Optimization in Arrangements -- Complete Classifications for the Communication Complexity of Regular Languages -- The Commutation with Codes and Ternary Sets of Words -- On the Confluence of Linear Shallow Term Rewrite Systems -- Wadge Degrees of ?-Languages of Deterministic Turing Machines -- Faster Deterministic Broadcasting in Ad Hoc Radio Networks -- Private Computations in Networks: Topology versus Randomness -- On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements -- Lattice Reduction by Random Sampling and Birthday Methods -- On the Ultimate Complexity of Factorials -- On the Effective Jordan Decomposability -- Fast Algorithms for Extended Regular Expression Matching and Searching -- Algorithms for Transposition Invariant String Matching (Extended Abstract) -- On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets -- Some Results on Derandomization -- On the Representation of Boolean Predicates of the Diffie-Hellman Function -- Quantum Circuits with Unbounded Fan-out -- Analysis of the Harmonic Algorithm for Three Servers -- Non-clairvoyant Scheduling for Minimizing Mean Slowdown -- Space Efficient Hash Tables with Worst Case Constant Access Time -- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure -- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs -- Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs -- Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids -- Algebraic Characterizations of Small Classes of Boolean Functions -- On the Difficulty of Some Shortest Path Problems -- Representing Graph Metrics with Fewest Edges -- Computing Shortest Paths with Uncertainty -- Solving Order Constraints in Logarithmic Space -- The Inversion Problem for Computable Linear Operators -- Algebras of Minimal Rank over Arbitrary Fields -- Evolutionary Algorithms and the Maximum Matching Problem -- Alternative Algorithms for Counting All Matchings in Graphs -- Strong Stability in the Hospitals/Residents Problem -- The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete -- Decidable Theories of Cayley-Graphs -- The Complexity of Resolution with Generalized Symmetry Rules -- Colouring Random Graphs in Expected Polynomial Time -- An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation -- Finding Large Independent Sets in Polynomial Expected Time -- Distributed Soft Path Coloring -- Competing Provers Yield Improved Karp-Lipton Collapse Results -- One Bit of Advice -- Strong Reductions and Immunity for Exponential Time -- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers -- Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem -- Cake-Cutting Is Not a Piece of Cake -- The Price of Truth: Frugality in Truthful Mechanisms -- Untameable Timed Automata! -- The Intrinsic Universality Problem of One-Dimensional Cellular Automata -- On Sand Automata -- Adaptive Sorting and the Information Theoretic Lower Bound -- A Discrete Subexponential Algorithm for Parity Games -- Cryptographically Sound and Machine-Assisted Verification of Security Protocols -- Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662193976
    Additional Edition: Printed edition: ISBN 9783540006237
    Language: English
    DOI: 10.1007/3-540-36494-3
    URL: https://doi.org/10.1007/3-540-36494-3
    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 3440046230?
Did you mean 3540002634?
Did you mean 3540000623?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages