Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
45
views
0
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,672
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Automata, Languages, and Programming
other
Editor(s):
Artur Czumaj
,
Kurt Mehlhorn
,
Andrew Pitts
,
Roger Wattenhofer
Publication date
(Print):
2012
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Author and book information
Book
ISBN (Print):
978-3-642-31584-8
ISBN (Electronic):
978-3-642-31585-5
Publication date (Print):
2012
DOI:
10.1007/978-3-642-31585-5
SO-VID:
57ee0f18-d645-4ee4-87a0-a66c4858f389
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 42
Streaming Tree Transducers
pp. 636
Online Mechanism Design (Randomized Rounding on the Fly)
pp. 165
A Saturation Method for Collapsible Pushdown Systems
pp. 263
Exponential Lower Bounds and Separation for Query Rewriting
pp. 561
Byzantine Agreement with a Rational Adversary
pp. 573
Random Hyperbolic Graphs: Degree Sequence and Clustering
pp. 598
Counting Arbitrary Subgraphs in Data Streams
pp. 660
Distributed Algorithms for Network Diameter and Girth
Similar content
2,672
Low-power, high-speed, and area-efficient sequential circuits by quantum-dot cellular automata: T-latch and counter study
Authors:
Mohammad Gholami
,
Zaman Amirzadeh
The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
Authors:
Fred Lunnon
Efficient and Robust SRAM Cell Design Based on Quantum-Dot Cellular Automata
Authors:
Saeid Azimi
,
Shaahin Angizi
,
Mohammad Hossein Moaiyeri
See all similar
Cited by
4
Quantum causal graph dynamics
Authors:
Pablo Arrighi
,
Simon Martiel
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis
Authors:
Oliver Garbe
,
Paweł Urzyczyn
,
Moritz Martens
…
Computing Expected Runtimes for Constant Probability Programs
Authors:
Jürgen Giesl
,
Peter Giesl
,
Marcel Hark
See all cited by