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
5
views
14
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,379
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Interactive Theorem Proving
Amortized Complexity Verified
other
Author(s):
Tobias Nipkow
Publication date
(Online):
August 19 2015
Publisher:
Springer International Publishing
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
ScienceOpen Research
Most cited references
14
Record
: found
Abstract
: not found
Article
: not found
Self-adjusting binary search trees
Daniel Sleator
,
Robert Tarjan
(1985)
0
comments
Cited
95
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Amortized Computational Complexity
Robert Tarjan
(1985)
0
comments
Cited
51
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Multivariate amortized resource analysis
Klaus Aehlig
,
Martin R. Hofmann
,
Jan Hoffmann
(2012)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
August 19 2015
Pages
: 310-324
DOI:
10.1007/978-3-319-22102-1_21
SO-VID:
d2859ede-c35d-4347-b88f-608691fe8533
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 227
Learning to Parse on Aligned Corpora (Rough Diamond)
pp. 375
ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages
pp. 310
Amortized Complexity Verified
pp. 325
Foundational Property-Based Testing
Similar content
2,379
Energy-efficient Amortized Inference with Cascaded Deep Classifiers
Authors:
Jiaqi Guan
,
Yang Liu
,
Qiang Liu
…
Personalized Federated Learning via Amortized Bayesian Meta-Learning
Authors:
Shiyu Liu
,
Shaogao Lv
,
Dun Zeng
…
PKC Based Broadcast Authentication using Signature Amortization for WSNs
Authors:
Y Liu
,
J Li
,
M. Guizani
See all similar
Cited by
4
Verified Analysis of Random Binary Tree Structures
Authors:
Manuel Eberl
,
Max Haslbeck
,
Tobias Nipkow
Analysis of Logarithmic Amortised Complexity
Authors:
Georg Moser
,
Martin Hofmann
Automated Amortised Resource Analysis for Term Rewrite Systems
Authors:
Georg Moser
,
Manuel Schneckenreither
See all cited by