This article formalizes the amortized analysis of dynamic tables parameterized with their minimal and maximal load factors and the expansion and contraction factors. A full description is found in a companion paper [1]. theory Tables-real imports../Amortized-Complexity/Amor begin fun Ψ:: bool ⇒ real ⇒ real ⇒ real ⇒ real ⇒ nat ⇒ real where Ψ b i d x 1 x 2 n = (if n ≥ x 2 then i∗(n − x 2) else if n ≤ x 1 ∧ b then d∗(x 1 − n) else 0) declare real-of-nat-Suc[simp] real-of-nat-diff [simp] An automatic proof: lemma Psi-diff-Ins: 0 < i = ⇒ 0 < d = ⇒ Ψ b i d x 1 x 2 (Suc n) − Ψ b i d x 1 x 2 n ≤
A dynamic network is a special type of network composed of connected transactors which have repeated...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published ...
International audienceWe present a general framework for computing parameters of dynamic networks wh...
This article addresses the H2 norm accumulation problem of linearly coupled dynamical networks. An i...
Proof. The first inequality follows from the fact that any allocation of capacity that is feasible i...
This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the s...
This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the s...
A dynamic network is a special type of network which is comprised of connected transactors which hav...
We study dynamic rationing problems. In each period, a fixed group of agents hold claims over an ins...
In many modern data management scenarios, data is subject to frequent changes. In order to avoid cos...
We present a dynamic modelization of a relational database, when submitted to a sequence of queries ...
Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmet...
AbstractWe present a dynamic modelization of a relational database, when submitted to a sequence of ...
A dynamic network is a special type of network composed of connected transac-tors which have repeate...
Dynamic complexity classes such as DynFO, described by Immerman and Patnaik, have problems which are...
A dynamic network is a special type of network composed of connected transactors which have repeated...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published ...
International audienceWe present a general framework for computing parameters of dynamic networks wh...
This article addresses the H2 norm accumulation problem of linearly coupled dynamical networks. An i...
Proof. The first inequality follows from the fact that any allocation of capacity that is feasible i...
This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the s...
This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the s...
A dynamic network is a special type of network which is comprised of connected transactors which hav...
We study dynamic rationing problems. In each period, a fixed group of agents hold claims over an ins...
In many modern data management scenarios, data is subject to frequent changes. In order to avoid cos...
We present a dynamic modelization of a relational database, when submitted to a sequence of queries ...
Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmet...
AbstractWe present a dynamic modelization of a relational database, when submitted to a sequence of ...
A dynamic network is a special type of network composed of connected transac-tors which have repeate...
Dynamic complexity classes such as DynFO, described by Immerman and Patnaik, have problems which are...
A dynamic network is a special type of network composed of connected transactors which have repeated...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published ...
International audienceWe present a general framework for computing parameters of dynamic networks wh...