This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

Produktinformation

Utgivningsdatum2014-05-15
Mått155 x 235 x 23 mm
Vikt622 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor389
FörlagSpringer International Publishing AG
ISBN9783319066851

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik

Finding All Solutions of Equations in Free Groups and Monoids with Involution.- Algorithmic Meta Theorems for Sparse Graph Classes.- The Lattice of Definability.- Counting Popular Matchings in House Allocation Problems.- Vertex Disjoint Paths in Upward Planar Graphs.- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.- Testing low degree trigonometric polynomials.- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees.- A Fast Branching Algorithm for Cluster Vertex Deletion.- Separation Logic with One Quantified Variable.- Notions of metric dimension of corona products.- On the Complexity of Computing Two Nonlinearity Measures.- Model Checking for String Problems.- Semiautomatic Structures.- The Query Complexity of Witness Finding.- Primal implication as encryption.- Processing Succinct Matrices and Vectors.- Constraint Satisfaction with Counting Quantifiers.- Dynamic Complexity of Planar 3-connected Graph Isomorphism.- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions.- First-Order Logic on CPDA Graphs.- Recognizing two-sided contexts in cubic time.- A Parameterized Algorithm for Packing Overlapping Subgraphs.- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles.- The Connectivity of Boolean Satisfiability.- Randomized communication complexity of approximating Kolmogorov complexity.- Space Saving by Dynamic Algebraization.

Mer från samma författare

My Childhood in Pieces

Edward Hirsch

Inbunden, 2025

449 kr

How to Read a Poem: And Fall in Love with Poetry

Edward Hirsch

Häftad, 2000

259 kr

Demon and the Angel

Edward Hirsch

Häftad, 2003

429 kr

100 Poems To Break Your Heart

Edward Hirsch

Häftad, 2023

319 kr

The Living Fire: New and Selected Poems

Edward Hirsch

Häftad, 2011

489 kr

Wild Gratitude

Edward Hirsch

Häftad, 2003

319 kr

William Maxwell Portrait

Charles Baxter, Michael Collier, Edward Hirsch

Inbunden, 2004

709 kr

Making of a Sonnet

Eavan Boland, Edward Hirsch

Häftad, 2009

539 kr

Night Music: Poems

L. E. Sissman, Edward Hirsch

Häftad, 1999

239 kr

Essential Poet's Glossary, The

Edward Hirsch

Häftad, 2017

389 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Del 8476

Titus Andronicus

William Shakespeare, Dieter Wessels

Häftad

159 kr

Computer Science -- Theory and Applications

Edward Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii

Häftad, 2012

729 kr

Computer Science -- Theory and Applications

Farid M. Ablaev, Ernst W. Mayr

Häftad, 2010

729 kr

Del 10304

Computer Science – Theory and Applications

Pascal Weil

Häftad, 2017

749 kr

Computer Science -- Theory and Applications

Dima Grigoriev, John Harrison, Edward A. Hirsch

Häftad, 2006

1 489 kr

Del 10846

Computer Science – Theory and Applications

Fedor V. Fomin, Vladimir V. Podolskii

Häftad, 2018

1 449 kr

Computer Science - Theory and Applications

Anna Frid, Andrei S. Morozov, Andrey Rybalchenko, Klaus W. Wagner

Häftad, 2009

749 kr

Computer Science - Theory and Applications

Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, Anatol Slissenko

Häftad, 2008

749 kr

Del 13296

Computer Science – Theory and Applications

Alexander S. Kulikov, Sofya Raskhodnikova

Häftad, 2022

1 119 kr

Del 12159

Computer Science – Theory and Applications

Henning Fernau

Häftad, 2020

729 kr

Del 8476 i serien Lecture Notes in Computer Science

Computer Science - Theory and Applications

9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings

Häftad, Engelska, 2014

AvEdward Hirsch,Sergei O. Kuznetsov,Jean-Éric Pin,Nikolay Vereshchagin

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

1 119 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

1 449 kr

Skickas inom 10-15 vardagar

Häftad

1 489 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2014-05-15
Mått155 x 235 x 23 mm
Vikt622 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor389
FörlagSpringer International Publishing AG
ISBN9783319066851

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik

Finding All Solutions of Equations in Free Groups and Monoids with Involution.- Algorithmic Meta Theorems for Sparse Graph Classes.- The Lattice of Definability.- Counting Popular Matchings in House Allocation Problems.- Vertex Disjoint Paths in Upward Planar Graphs.- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.- Testing low degree trigonometric polynomials.- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees.- A Fast Branching Algorithm for Cluster Vertex Deletion.- Separation Logic with One Quantified Variable.- Notions of metric dimension of corona products.- On the Complexity of Computing Two Nonlinearity Measures.- Model Checking for String Problems.- Semiautomatic Structures.- The Query Complexity of Witness Finding.- Primal implication as encryption.- Processing Succinct Matrices and Vectors.- Constraint Satisfaction with Counting Quantifiers.- Dynamic Complexity of Planar 3-connected Graph Isomorphism.- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions.- First-Order Logic on CPDA Graphs.- Recognizing two-sided contexts in cubic time.- A Parameterized Algorithm for Packing Overlapping Subgraphs.- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles.- The Connectivity of Boolean Satisfiability.- Randomized communication complexity of approximating Kolmogorov complexity.- Space Saving by Dynamic Algebraization.