↓ Skip to main content
What is this page? Embed badge

Mathematical Foundations of Computer Science 2002

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 2002'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Global Development via Local Observational Construction Steps
  3. Altmetric Badge
    Chapter 2 Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps
  4. Altmetric Badge
    Chapter 3 Applications of Finite Automata
  5. Altmetric Badge
    Chapter 4 Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
  6. Altmetric Badge
    Chapter 5 Low Stretch Spanning Trees
  7. Altmetric Badge
    Chapter 6 On Radiocoloring Hierarchically Specified Planar Graphs: % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOfdaryqr1ngBPrginfgDObYtUvgaiuaacqWFpepucqWFse-ucqWF % pepucqWFaeFqcqWFce-qcqWFWesraaa!4989! $$ \mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E} $$ -Completeness and Approximations
  8. Altmetric Badge
    Chapter 7 Finite Domain Constraint Satisfaction Using Quantum Computation
  9. Altmetric Badge
    Chapter 8 Fast Algorithms with Algebraic Monge Properties
  10. Altmetric Badge
    Chapter 9 Packing Edges in Random Regular Graphs
  11. Altmetric Badge
    Chapter 10 A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
  12. Altmetric Badge
    Chapter 11 Matroid Intersections, Polymatroid Inequalities, and Related Problems
  13. Altmetric Badge
    Chapter 12 Accessibility in Automata on Scattered Linear Orderings
  14. Altmetric Badge
    Chapter 13 On Infinite Terms Having a Decidable Monadic Theory
  15. Altmetric Badge
    Chapter 14 A Chomsky-Like Hierarchy of Infinite Graphs
  16. Altmetric Badge
    Chapter 15 Competitive Analysis of On-line Stream Merging Algorithms
  17. Altmetric Badge
    Chapter 16 Coloring k -Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
  18. Altmetric Badge
    Chapter 17 On Word Equations in One Variable
  19. Altmetric Badge
    Chapter 18 Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
  20. Altmetric Badge
    Chapter 19 Two-Way Finite State Transducers with Nested Pebbles
  21. Altmetric Badge
    Chapter 20 Optimal Non-preemptive Semi-online Scheduling on Two Related Machines
  22. Altmetric Badge
    Chapter 21 More on Weighted Servers or Fifo is Better than Lru
  23. Altmetric Badge
    Chapter 22 On Maximizing the Throughput of Multiprocessor Tasks
  24. Altmetric Badge
    Chapter 23 Some Results on Random Unsatisfiable k -Sat Instances and Approximation Algorithms Applied to Random Structures
  25. Altmetric Badge
    Chapter 24 Evolutive Tandem Repeats Using Hamming Distance
  26. Altmetric Badge
    Chapter 25 Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
  27. Altmetric Badge
    Chapter 26 Computing Partial Information out of Intractable One — The First Digit of 2 n at Base 3 as an Example
  28. Altmetric Badge
    Chapter 27 Algorithms for Computing Small NFAs
  29. Altmetric Badge
    Chapter 28 Space-Economical Construction of Index Structures for All Suffixes of a String
  30. Altmetric Badge
    Chapter 29 An Explicit Lower Bound of 5 n − o ( n ) for Boolean Circuits
  31. Altmetric Badge
    Chapter 30 Computational Complexity in the Hyperbolic Plane
  32. Altmetric Badge
    Chapter 31 On a Mereological System for Relational Software Specifications
  33. Altmetric Badge
    Chapter 32 An Optimal Lower Bound for Resolution with 2-Conjunctions
  34. Altmetric Badge
    Chapter 33 Improved Parameterized Algorithms for Planar Dominating Set
  35. Altmetric Badge
    Chapter 34 Optimal Free Binary Decision Diagrams for Computation of EAR n
  36. Altmetric Badge
    Chapter 35 Unification Modulo Associativity and Idempotency Is NP-complete
  37. Altmetric Badge
    Chapter 36 On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
  38. Altmetric Badge
    Chapter 37 An Improved Algorithm for the Membership Problem for Extended Regular Expressions
  39. Altmetric Badge
    Chapter 38 Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis
  40. Altmetric Badge
    Chapter 39 Derivation of Rational Expressions with Multiplicity
  41. Altmetric Badge
    Chapter 40 Hypothesis-Founded Semantics for Datalog Programs with Negation
  42. Altmetric Badge
    Chapter 41 On the Problem of Scheduling Flows on Distributed Networks
  43. Altmetric Badge
    Chapter 42 Unit Testing for Casl Architectural Specifications
  44. Altmetric Badge
    Chapter 43 Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems
  45. Altmetric Badge
    Chapter 44 The Complexity of Tree Multicolorings
  46. Altmetric Badge
    Chapter 45 On Verifying Fair Lossy Channel Systems
  47. Altmetric Badge
    Chapter 46 Parameterized Counting Problems
  48. Altmetric Badge
    Chapter 47 On the Construction of Effective Random Sets
  49. Altmetric Badge
    Chapter 48 On the Structure of the Simulation Order of Proof Systems
  50. Altmetric Badge
    Chapter 49 Comorphism-Based Grothendieck Logics
  51. Altmetric Badge
    Chapter 50 Finite Test-Sets for Overlap-Free Morphisms
  52. Altmetric Badge
    Chapter 51 Characterizing Simpler Recognizable Sets of Integers
  53. Altmetric Badge
    Chapter 52 Towards a Cardinality Theorem for Finite Automata
  54. Altmetric Badge
    Chapter 53 An Approximation Semantics for the Propositional Mu-Calculus
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 Mendeley
Summary Wikipedia Dimensions citations
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
Mathematical Foundations of Computer Science 2002
Published by
Springer Berlin Heidelberg, August 2002
DOI 10.1007/3-540-45687-2
ISBNs
978-3-54-044040-6, 978-3-54-045687-2
Editors

Diks, Krzysztof, Rytter, Wojciech

View on publisher site Google Preview
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Canada 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 100%
Professor > Associate Professor 1 100%
Readers by discipline Count As %
Computer Science 2 200%

This page is provided by Altmetric.