Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Mathematical Foundations of Computer Science 1996: 21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings > Models of DNA computation
Mathematical Foundations of Computer Science 1996: 21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings |
Wojciech Penczek; Andrzej Szalas
Springer Berlin Heidelberg
Mathematical Foundations of Computer Science 1996: 21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings
Models of DNA computation
Authors

Alan Gibbons; Martyn Amos; David Hodgson

ARI Id

1664670332473_2661891

Access

Not Available Free

Pages

18-36

DOI

10.1007/3-540-61550-4_138

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-61550-4_138

Table of Contents of Book
Showing 1 to 20 of 47 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Word level model checking
Edmund M. Clarke Jr.
1-1
Code problems on traces
Volker Diekert; Anca Muscholl
2-17
Models of DNA computation
Alan Gibbons; Martyn Amos; David Hodgson
18-36
Theory and practice of action semantics
Peter D. Mosses
37-61
Linear time temporal logics over Mazurkiewicz traces
Madhavan Mukund; P. S. Thiagarajan
62-92
Partial order reduction: Model-checking using representatives
Doron Peled
93-112
Nonmonotonic rule systems: Forward chaining, constraints, and complexity
Jeffrey B. Remmel
113-113
Mind the gap! Abstract versus concrete models of specifications
Donald Sannella; Andrzej Tarlecki
114-134
A sequent calculus for subtyping polymorphic types
Jerzy Tiuryn
135-155
Kolmogorov complexity: Recent research in Moscow
Vladimir A. Uspensky
156-166
A modal logic for data analysis
Philippe Balbiani
167-179
From specifications to programs: A fork-algebraic approach to bridge the gap
Gabriel A. Baum; Marcelo F. Frias; Armando M. Haeberer; Pablo E. Martínez López
180-191
Logic of predicates with explicit substitutions
Marek A. Bednarczyk
192-205
On the query complexity of sets
Richard Beigel; William Gasarch; Martin Kummer; Georgia Martin; Timothy McNicholl; Frank Stephan
206-217
A Lambda Calculus of incomplete objects
Viviana Bono; Michele Bugliesi; Luigi Liquori
218-229
Bisimilarity problems requiring exponential time (Extended abstract)
Michele Boreale; Luca Trevisan
230-241
Linear dynamic Kahn networks are deterministic
Arie de Bruin; S. H. Nienhuys-Cheng
242-254
Shortest path problems with time constraints
X. Cai; T. Kloks; C. K. Wong
255-266
Parallel Alternating-Direction Access Machine
Bogdan S. Chlebus; Artur Czumaj; Leszek Gasieniec; Mirosław Kowaluk; Wojciech Plandowski
267-278
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 47 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings