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
23
views
0
references
Top references
cited by
0
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,153
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Automata, Languages and Programming
other
Editor(s):
Lars Arge
,
Christian Cachin
,
Tomasz Jurdziński
,
Andrzej Tarlecki
Publication date
(Print):
2007
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-540-73419-2
ISBN (Electronic):
978-3-540-73420-8
Publication date (Print):
2007
DOI:
10.1007/978-3-540-73420-8
SO-VID:
406d3f74-7968-4870-a4d7-ef6a16a3107f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 316
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
pp. 40
Mechanism Design for Fractional Scheduling on Unrelated Machines
pp. 375
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
pp. 423
Ring Signatures of Sub-linear Size Without Random Oracles
pp. 472
Co-Logic Programming: Extending Logic Programming with Coinduction
pp. 509
Succinct Ordinal Trees Based on Tree Covering
pp. 901
A Combinatorial Theorem for Trees
Similar content
2,153
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