↓ Skip to main content

STACS 92

Overview of attention for book
Cover of 'STACS 92'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 169 Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives
  3. Altmetric Badge
    Chapter 170 The parallel complexity of tree embedding problems (extended abstract)
  4. Altmetric Badge
    Chapter 171 A theory of strict P -completeness
  5. Altmetric Badge
    Chapter 172 Fast and optimal simulations between CRCW PRAMs
  6. Altmetric Badge
    Chapter 173 Suitability of the propositional temporal logic to express properties of real-time systems
  7. Altmetric Badge
    Chapter 174 Axiomatizations of backtracking
  8. Altmetric Badge
    Chapter 175 Joining k - and l -recognizable sets of natural numbers
  9. Altmetric Badge
    Chapter 176 On the performance of networks with multiple busses
  10. Altmetric Badge
    Chapter 177 Efficient algorithms for solving systems of linear equations and path problems
  11. Altmetric Badge
    Chapter 178 Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
  12. Altmetric Badge
    Chapter 179 A simplified technique for hidden-line elimination in terrains
  13. Altmetric Badge
    Chapter 180 A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
  14. Altmetric Badge
    Chapter 181 Equality and disequality constraints on direct subterms in tree automata
  15. Altmetric Badge
    Chapter 182 Deterministic regular languages
  16. Altmetric Badge
    Chapter 183 The extended low hierarchy is an infinite hierarchy
  17. Altmetric Badge
    Chapter 184 Locally definable acceptance types for polynomial time machines
  18. Altmetric Badge
    Chapter 185 The theory of the polynomial many-one degrees of recursive sets is undecidable
  19. Altmetric Badge
    Chapter 186 A plane-sweep algorithm for finding a closest pair among convex planar objects
  20. Altmetric Badge
    Chapter 187 Linear approximation of simple objects
  21. Altmetric Badge
    Chapter 188 Language learning without overgeneralization
  22. Altmetric Badge
    Chapter 189 The log-star revolution
  23. Altmetric Badge
    Chapter 190 Separating counting communication complexity classes
  24. Altmetric Badge
    Chapter 191 A nonlinear lower bound on the practical combinational complexity
  25. Altmetric Badge
    Chapter 192 Characterizations of some complexity classes between Θ 2 p and Δ 2 p
  26. Altmetric Badge
    Chapter 193 On complexity classes and algorithmically random languages
  27. Altmetric Badge
    Chapter 194 New time hierarchy results for deterministic TMS
  28. Altmetric Badge
    Chapter 195 Unconditional Byzantine agreement for any number of faulty processors
  29. Altmetric Badge
    Chapter 196 Broadcasting in butterfly and debruijn networks
  30. Altmetric Badge
    Chapter 197 Interval approximations of message causality in distributed executions
  31. Altmetric Badge
    Chapter 198 On the approximability of the maximum common subgraph problem
  32. Altmetric Badge
    Chapter 199 The complexity of colouring circle graphs
  33. Altmetric Badge
    Chapter 200 Graph isomorphism is low for PP
  34. Altmetric Badge
    Chapter 201 A simple linear time algorithm for triangulating three-colored graphs
  35. Altmetric Badge
    Chapter 202 On locally optimal alignments in genetic sequences
  36. Altmetric Badge
    Chapter 203 Secure commitment against a powerful adversary
  37. Altmetric Badge
    Chapter 204 Communication efficient Zero-knowledge Proofs of knowledge
  38. Altmetric Badge
    Chapter 205 Four results on randomized incremental constructions
  39. Altmetric Badge
    Chapter 206 Enclosing many boxes by an optimal pair of boxes
  40. Altmetric Badge
    Chapter 207 Performance driven k -layer wiring
  41. Altmetric Badge
    Chapter 208 Synthesis for testability: Binary Decision Diagrams
  42. Altmetric Badge
    Chapter 209 Compression and entropy
  43. Altmetric Badge
    Chapter 210 Iterative devices generating infinite words
  44. Altmetric Badge
    Chapter 211 On the factorization conjecture
  45. Altmetric Badge
    Chapter 212 Conditional semi-Thue systems for presenting monoids
  46. Altmetric Badge
    Chapter 213 A combinatorial bound for linear programming and related problems
  47. Altmetric Badge
    Chapter 214 In-place linear probing sort
  48. Altmetric Badge
    Chapter 215 Speeding up two string-matching algorithms
  49. Altmetric Badge
    Chapter 216 The ANIGRAF system
  50. Altmetric Badge
    Chapter 217 A programming language for symbolic computation of regular languages, automata and semigroups
  51. Altmetric Badge
    Chapter 218 ΜSPEED: a system for the specification and verification of microprocessors
  52. Altmetric Badge
    Chapter 219 A discrete event simulator of communication algorithms in interconnection networks
  53. Altmetric Badge
    Chapter 220 ALPHA DU CENTAUR: An environment for the design of systolic arrays
  54. Altmetric Badge
    Chapter 221 Verification of communicating processes by means of automata reduction and abstraction
  55. Altmetric Badge
    Chapter 222 Distributed system simulator (DSS)
  56. Altmetric Badge
    Chapter 223 An interactive proof tool for process algebras
  57. Altmetric Badge
    Chapter 224 SPECI90 A term rewriting and narrowing system
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
5 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
STACS 92
Published by
Springer Science & Business Media, February 1992
DOI 10.1007/3-540-55210-3
ISBNs
978-3-54-055210-9, 978-3-54-046775-5
Editors

Finkel, Alain, Jantzen, Matthias

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 20%
Unknown 4 80%
Readers by discipline Count As %
Computer Science 1 20%
Unknown 4 80%