Amortized Complexity Verified (Q2945642)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Amortized Complexity Verified	scientific article

Statements

scholarly article

0 references

Amortized Complexity Verified (English)

0 references

0 references

Interactive Theorem Proving

0 references

publication date

14 September 2015

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-22102-1_21

0 references

Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation

0 references

0 references

The pairing heap: A new form of self-adjusting heap

0 references

Verifying Nonlinear Real Formulas Via Sums of Squares

0 references

Parallel reductions in \(\lambda\)-calculus

0 references

Static prediction of heap space usage for first-order functional programs

0 references

The derivation of a tighter bound for top-down skew heaps

0 references

Purely Functional Data Structures

0 references

A systematic analysis of splaying

0 references

Self-adjusting binary search trees

0 references

Self-Adjusting Heaps

0 references

Amortized Computational Complexity

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-22102-1_21

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2945642

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2945642&oldid=36200651"