Computer Science – Theory and Applications
Springer International Publishing (Verlag)
978-3-319-58746-2 (ISBN)
The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing.
Type Theory and Formalization of Mathematics.- Advances in Parameterized Verification of Population Protocols.- Verification of Quantum Computation and the Price of Trust.- Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs.- Concatenation Hierarchies: New Bottle, Old Wine.- Can We Locally Compute Sparse Connected Subgraphs.- Palindromic Decompositions with Gaps and Errors.- Cascade Heaps: Towards Time-Optimal Extractions.- Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets.- Parameterized Counting of Trees, Forests and Matroid Bases.- Generalized Dyck Shifts.- Green's Relations in Finite Transformation Semigroups.- Nondeterministic Unitary OBDDs.- Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).- Turing Degree Spectra of Minimal Subshifts.- Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams.- Dynamic stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals.- The Transformation Monoid of a Partially Lossy Queue.- Approximation Algorithms for the Maximum Carpool Matching Problem.- The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC=0.- On Algorithmic Statistics for Space-bounded Algorithms.- Popularity in the Generalized Hospital Residents Setting.- Edit Distance Neighbourhoods of Input-driven Pushdown Automata.- The (Minimum) Rank of Typical Fooling-set Matrices.- On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem.- Dag-like Communication and Its Applications.- The Descriptive Complexity of Subgraph Isomorphism Without Numerics.- On a Generalization of Horn Constraint Systems.
| Erscheinungsdatum | 30.05.2017 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | X, 337 p. 30 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 534 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Algorithms & Data Structures • algorithms and data structures • Algorithms & data structures • algorithms for concurrent and distributed systems, • algorithms for concurrent and distributed systems, networks • Applications • applications of logic to computer science • combinatorial optimization • combinatorics in computer science • Computational Complexity • computer architecture & logic design • Computer architecture & logic design • Computer programming / software engineering • Computer Science • conference proceedings • Constraint Solving • cryptography • current challenges such as quantum computing • data structures • Discrete Mathematics • Discrete mathematics in computer science • formal and algorithmic aspects of bio-informatics • formal languages and automata • Informatics • Logics and meanings of programs • Mathematical logic and formal languages • Mathematical theory of computation • Maths for computer scientists • Research |
| ISBN-10 | 3-319-58746-3 / 3319587463 |
| ISBN-13 | 978-3-319-58746-2 / 9783319587462 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
