KOBV Portal

Hits per page

hits 1 - 3 | 3 hits

Sorting

Online Resource

Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 ; proceedings (2010)

Ablaev, Farid [Sonstige] ; International Computer Science Symposium in Russia 5 2010 Kasan

Berlin [u.a.] : Springer

add to watchlist on the watchlist

Details

UID:

b3kat_BV036520486

Format: 1 Online-Ressource (XI, 396 S.)

ISBN: 9783642131820

Series Statement: Lecture notes in computer science 6072

Additional Edition: Erscheint auch als Druck-Ausgabe, Paperback ISBN 978-3-642-13181-3

Language: English

Subjects: Computer Science

RVK:

SS 4800

Keywords: Theoretische Informatik ; Konferenzschrift

DOI: 10.1007/978-3-642-13182-0

URL: Volltext

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Online Access

Open Access Request

BTU Cottbus

Online Resource

Computer Science – Theory and Applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings (2010)

Ablayev, Farid. [editor.] ; Mayr, Ernst W. [editor.] ; SpringerLink 〈Online service〉

Berlin, Heidelberg :Springer Berlin Heidelberg,

add to watchlist on the watchlist

Details

UID:

almahu_9947364139302882

Format: XI, 397 p. 49 illus. , online resource.

ISBN: 9783642131820

Series Statement: Lecture Notes in Computer Science, 6072

Note: Algorithms for Energy Management -- Sofic and Almost of Finite Type Tree-Shifts -- Proof-Based Design of Security Protocols -- Approximating the Minimum Length of Synchronizing Words Is Hard -- Realizability of Dynamic MSC Languages -- The max quasi-independent set Problem -- Equilibria in Quantitative Reachability Games -- Quotient Complexity of Closed Languages -- Right-Sequential Functions on Infinite Words -- Kernelization -- Zigzags in Turing Machines -- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems -- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online -- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata -- Time Optimal d-List Colouring of a Graph -- The Cantor Space as a Generic Model of Topologically Presented Knowledge -- Algorithmics – Is There Hope for a Unified Theory? -- Classifying Rankwidth k-DH-Graphs -- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms -- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem -- Balancing Bounded Treewidth Circuits -- Obtaining Online Ecological Colourings by Generalizing First-Fit -- Classical Simulation and Complexity of Quantum Computations -- Prefix-Free and Prefix-Correct Complexities with Compound Conditions -- Monotone Complexity of a Pair -- Symbolic Models for Single-Conclusion Proof Logics -- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA -- Advancing Matrix Computations with Randomized Preprocessing -- Transfinite Sequences of Constructive Predicate Logics -- The Quantitative Analysis of User Behavior Online — Data, Models and Algorithms -- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem -- Complexity of Propositional Proofs -- Quantization of Random Walks: Search Algorithms and Hitting Time -- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems -- Growth of Power-Free Languages over Large Alphabets -- A Partially Synchronizing Coloring -- An Encoding Invariant Version of Polynomial Time Computable Distributions -- Prehistoric Phenomena and Self-referentiality.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783642131813

Language: English

DOI: 10.1007/978-3-642-13182-0

URL: http://dx.doi.org/10.1007/978-3-642-13182-0

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Open Access Request

HU Berlin

Online Resource

Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16 - 20, 2010 ; proceedings (2010)

Ablayev, Farid ; Mayr, Ernst W. 1950- ; International Computer Science Symposium in Russia 5 2010 Kasan

Berlin [u.a.] : Springer

add to watchlist on the watchlist

Details

UID:

gbv_630434093

Format: Online-Ressource (XI, 396 S.)

Edition: Online-Ausg. 2010 Springer eBook collection. Computer science Electronic reproduction; Available via World Wide Web

ISBN: 9783642131820

Series Statement: Lecture notes in computer science 6072

Note: Literaturangaben , Electronic reproduction; Available via World Wide Web

Additional Edition: ISBN 3642131816

Additional Edition: ISBN 9783642131813

Additional Edition: Erscheint auch als Druck-Ausgabe Computer science - theory and applications Berlin : Springer, 2010 ISBN 3642131816

Additional Edition: ISBN 9783642131813

Language: English

Subjects: Computer Science

RVK:

SS 4800

Keywords: Theoretische Informatik ; Konferenzschrift

DOI: 10.1007/978-3-642-13182-0

URL: Volltext

URL: Volltext (lizenzpflichtig)

URL: Inhaltsverzeichnis

URL: Inhaltstext

Author information: Mayr, Ernst W. 1950-

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Online Access

Open Access Request

UB Potsdam

hits 1 - 3 | 3 hits

Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.

Did you mean 9783641231620?

Did you mean 9783641231828?

Did you mean 9783642031823?

Kooperativer Bibliotheksverbund

Berlin Brandenburg