↓ Skip to main content

Computer Science -- Theory and Applications

Overview of attention for book
Cover of 'Computer Science -- Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Propositional Proofs in Frege and Extended Frege Systems (Abstract)
  3. Altmetric Badge
    Chapter 2 Circuit Complexity Meets Ontology-Based Data Access
  4. Altmetric Badge
    Chapter 3 NEXP -Completeness and Universal Hardness Results for Justification Logic
  5. Altmetric Badge
    Chapter 4 A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes
  6. Altmetric Badge
    Chapter 5 Generalized LR Parsing for Grammars with Contexts
  7. Altmetric Badge
    Chapter 6 On Compiling Structured CNFs to OBDDs
  8. Altmetric Badge
    Chapter 7 Satisfiability of ECTL* with Tree Constraints
  9. Altmetric Badge
    Chapter 8 On Growth and Fluctuation of k -Abelian Complexity
  10. Altmetric Badge
    Chapter 9 A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
  11. Altmetric Badge
    Chapter 10 Editing to a Planar Graph of Given Degrees
  12. Altmetric Badge
    Chapter 11 On the Satisfiability of Quantum Circuits of Small Treewidth
  13. Altmetric Badge
    Chapter 12 Equations over Free Inverse Monoids with Idempotent Variables
  14. Altmetric Badge
    Chapter 13 A Logical Characterization of Timed Pushdown Languages
  15. Altmetric Badge
    Chapter 14 An In-Place Priority Queue with O (1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop
  16. Altmetric Badge
    Chapter 15 Resolution Complexity of Perfect Matching Principles for Sparse Graphs
  17. Altmetric Badge
    Chapter 16 Operations on Self-Verifying Finite Automata
  18. Altmetric Badge
    Chapter 17 Automath Type Inclusion in Barendregt’s Cube
  19. Altmetric Badge
    Chapter 18 Circuit Lower Bounds for Average-Case MA
  20. Altmetric Badge
    Chapter 19 Making Randomness Public in Unbounded-Round Information Complexity
  21. Altmetric Badge
    Chapter 20 First-Order Logic Definability of Free Languages
  22. Altmetric Badge
    Chapter 21 Representation of (Left) Ideal Regular Languages by Synchronizing Automata
  23. Altmetric Badge
    Chapter 22 Some Properties of Antistochastic Strings
  24. Altmetric Badge
    Chapter 23 Approximation and Exact Algorithms for Special Cases of Connected f -Factors
  25. Altmetric Badge
    Chapter 24 Rewriting Higher-Order Stack Trees
  26. Altmetric Badge
    Chapter 25 Interacting with Modal Logics in the Coq Proof Assistant
  27. Altmetric Badge
    Chapter 26 Delay Games with WMSO $$+$$ + U Winning Conditions
  28. Altmetric Badge
    Chapter 27 Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Computer Science -- Theory and Applications
Published by
Springer International Publishing, June 2015
DOI 10.1007/978-3-319-20297-6
ISBNs
978-3-31-920296-9, 978-3-31-920297-6
Editors

Beklemishev, Lev D., Musatov, Daniil V.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Student > Ph. D. Student 1 50%
Readers by discipline Count As %
Arts and Humanities 1 50%
Computer Science 1 50%