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

STACS 93

Overview of attention for book
Cover of 'STACS 93'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Causal and distributed semantics for concurrent processes
  3. Altmetric Badge
    Chapter 2 Editorial note
  4. Altmetric Badge
    Chapter 3 Alternation for two-way machines with sublogarithmic space
  5. Altmetric Badge
    Chapter 4 Separating the lower levels of the sublogarithmic space hierarchy
  6. Altmetric Badge
    Chapter 5 Locating P/poly optimally in the extended low hierarchy
  7. Altmetric Badge
    Chapter 6 Measure, stochasticity, and the density of hard languages
  8. Altmetric Badge
    Chapter 7 Halting problem of one binary Horn clause is undecidable
  9. Altmetric Badge
    Chapter 8 Decidability and undecidability results for duration calculus
  10. Altmetric Badge
    Chapter 9 Defining λ-typed λ-calculi by axiomatizing the typing relation
  11. Altmetric Badge
    Chapter 10 The complexity of logic-based abduction
  12. Altmetric Badge
    Chapter 11 Treewidth of chordal bipartite graphs
  13. Altmetric Badge
    Chapter 12 On paths in networks with valves
  14. Altmetric Badge
    Chapter 13 Scheduling interval ordered tasks in parallel
  15. Altmetric Badge
    Chapter 14 An O(√n)-worst-case-time solution to the granularity problem
  16. Altmetric Badge
    Chapter 15 The synthesis problem of Petri nets
  17. Altmetric Badge
    Chapter 16 General refinement and recursion operators for the Petri Box calculus
  18. Altmetric Badge
    Chapter 17 On fairness in distributed automated deduction
  19. Altmetric Badge
    Chapter 18 Divide-and-conquer algorithms on the hypercube
  20. Altmetric Badge
    Chapter 19 A first-order isomorphism theorem
  21. Altmetric Badge
    Chapter 20 Splittings, robustness and structure of complete sets
  22. Altmetric Badge
    Chapter 21 Defying upward and downward separation
  23. Altmetric Badge
    Chapter 22 Counting, selecting, and sorting by query-bounded machines
  24. Altmetric Badge
    Chapter 23 Cancellation in context-free languages: Enrichment by reduction
  25. Altmetric Badge
    Chapter 24 Counting overlap-free binary words
  26. Altmetric Badge
    Chapter 25 The limit set of recognizable substitution systems
  27. Altmetric Badge
    Chapter 26 Partially commutative Lyndon words
  28. Altmetric Badge
    Chapter 27 Parallel architectures: Design and efficient use
  29. Altmetric Badge
    Chapter 28 Weighted closest pairs
  30. Altmetric Badge
    Chapter 29 Rectilinear path queries in a simple rectilinear polygon
  31. Altmetric Badge
    Chapter 30 Parallel algorithm for the matrix chain product and the optimal triangulation problems (extended abstract)
  32. Altmetric Badge
    Chapter 31 Multi-list ranking: complexity and applications
  33. Altmetric Badge
    Chapter 32 Exact algorithms for a geometric packing problem (extended abstract)
  34. Altmetric Badge
    Chapter 33 A decomposition theorem for probabilistic transition systems
  35. Altmetric Badge
    Chapter 34 Local automata and completion
  36. Altmetric Badge
    Chapter 35 Efficient compression of wavelet coefficients for smooth and fractal-like data
  37. Altmetric Badge
    Chapter 36 On the equivalence of two-way pushdown automata and counter machines over bounded languages
  38. Altmetric Badge
    Chapter 37 Computability properties of low-dimensional dynamical systems
  39. Altmetric Badge
    Chapter 38 Fixed-parameter intractability II (extended abstract)
  40. Altmetric Badge
    Chapter 39 Limits on the power of parallel random access machines with weak forms of write conflict resolution
  41. Altmetric Badge
    Chapter 40 On using oracles that compute values
  42. Altmetric Badge
    Chapter 41 Multicounter automata with sublogarithmic reversal bounds
  43. Altmetric Badge
    Chapter 42 Structured operational semantics for concurrency and hierarchy
  44. Altmetric Badge
    Chapter 43 The complexity of verifying functional programs
  45. Altmetric Badge
    Chapter 44 Towards the formal design of self-stabilizing distributed algorithms
  46. Altmetric Badge
    Chapter 45 Axiomatizations of temporal logics on trace systems
  47. Altmetric Badge
    Chapter 46 Capabilities and complexity of computations with integer division
  48. Altmetric Badge
    Chapter 47 Extended locally definable acceptance types
  49. Altmetric Badge
    Chapter 48 Gap-definability as a closure property
  50. Altmetric Badge
    Chapter 49 On the logical definability of some rational trace languages
  51. Altmetric Badge
    Chapter 50 Solving systems of set constraints using tree automata
  52. Altmetric Badge
    Chapter 51 Complement problems and tree automata in AC-like theories (extended abstract)
  53. Altmetric Badge
    Chapter 52 Transparent (holographic) proofs
  54. Altmetric Badge
    Chapter 53 Computing symmetric functions with AND/OR circuits and a single MAJORITY gate
  55. Altmetric Badge
    Chapter 54 Threshold circuits for iterated multiplication: Using AC 0 for free
  56. Altmetric Badge
    Chapter 55 Circuits with monoidal gates
  57. Altmetric Badge
    Chapter 56 A non-probabilistic switching lemma for the Sipser function
  58. Altmetric Badge
    Chapter 57 Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
  59. Altmetric Badge
    Chapter 58 On syntactic congruences for ω —languages
  60. Altmetric Badge
    Chapter 59 A polynomial time algorithm for the equivalence of two morphisms on ω-regular languages
  61. Altmetric Badge
    Chapter 60 Locally threshold testable languages of infinite words
  62. Altmetric Badge
    Chapter 61 Deterministic asynchronous automata for infinite traces
  63. Altmetric Badge
    Chapter 62 Recursive automata on infinite words
  64. Altmetric Badge
    Chapter 63 A complexity theoretic approach to incremental computation
  65. Altmetric Badge
    Chapter 64 Precise average case complexity
  66. Altmetric Badge
    Chapter 65 The bit probe complexity measure revisited
  67. Altmetric Badge
    Chapter 66 Language learning with some negative information
  68. Altmetric Badge
    Chapter 67 Language learning with a bounded number of mind changes
  69. Altmetric Badge
    Chapter 68 Efficient sharing of many secrets
  70. Altmetric Badge
    Chapter 69 The KIV system a tool for formal program development
  71. Altmetric Badge
    Chapter 70 1st Grade — A system for implementation, testing and animation of graph algorithms
  72. Altmetric Badge
    Chapter 71 The program verifier Tatzelwurm
  73. Altmetric Badge
    Chapter 72 LEDA a library of efficient data types and algorithms
  74. Altmetric Badge
    Chapter 73 Defining λ-typed λ-calculi by axiomatizing the typing relation
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

q&a
1 Q&A thread
Summary Q&A
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
STACS 93
Published by
Springer Science & Business Media, February 1993
DOI 10.1007/3-540-56503-5
ISBNs
978-3-54-056503-1, 978-3-54-047574-3
Editors

Enjalbert, P., Finkel, A., Wagner, K. W.

View on publisher site Google Preview

This page is provided by Altmetric.