Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Automata, Languages and Programming: 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings > Average case complexity
Automata, Languages and Programming: 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings |
Javier Leach Albert; Burkhard Monien; Mario Rodriguez Artalejo
Springer Berlin Heidelberg
Automata, Languages and Programming: 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings
Average case complexity
Authors

Yuri Gurevich

ARI Id

1664215164033_792523

Access

Not Available Free

Pages

615-628

DOI

10.1007/3-540-54233-7_168

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-54233-7_168

Table of Contents of Book
Showing 1 to 20 of 62 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
On the semantics of logic programs
Maurizio Gabbrielli; Giorgio Levi
1-19
Logic programming with recurrence domains
Hong Chen; Jieh Hsiang
20-34
Extensional embedding of a strongly stable model of PCF
Antonio Bucciarelli; Thomas Ehrhard
35-46
Uniform ideals and strictness analysis
Christine Ernoult; Alan Mycroft
47-59
Logical and computational aspects of programming with sets/bags/lists
Val Breazu-Tannen; Ramesh Subrahmanyam
60-75
Safety for branching time semantics
A. Bouajjani; J. C. Fernandez; S. Graf; C. Rodriguez; J. Sifakis
76-92
Program composition and modular verification
Limor Fix; Nissim Francez; Orna Grumberg
93-114
Model-checking for probabilistic real-time systems
Rajeev Alur; Costas Courcoubetis; David Dill
115-126
Computing behavioural relations, logically
Rance Cleaveland; Bernhard Steffen
127-138
The power of reconfiguration
Y. Ben-Asher; D. Peleg; R. Ramaswami; A. Schuster
139-150
General resolution of tseitin formulas is hard
Jean-Denis Fouks
151-162
Program checkers for probability generation
Sampath Kannan; Andrew Yao
163-173
Running time to recognize nonregular languages by 2-way probabilistic automata
Jānis Kaņeps; Rūsiņš Freivalds
174-185
Statistics on random trees
R. Casas; J. Díaz; C. Martinez
186-203
The expressive power of implicit specifications
Kim Guldstrand Larsen
204-216
CCS + time = an interleaving model for real time systems
Wang Yi
217-228
On confluent semi-commutations — Decidability and complexity results
Volker Diekert; Edward Ochmanski; Klaus Reinhardt
229-241
Lazard's factorizations of free partially commutative monoids
Gérard Duchamp; Daniel Krob
242-253
A Kleene theorem for infinite trace languages
Paul Gastin; Antoine Petit; Wieslaw Zielonka
254-266
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 62 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings