marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-03-10 22:48:12

Browse source
This commit is contained in:
Marco Realacci 2025-03-10 22:48:12 +01:00
parent 1b85c91be0
commit 83724a8eb7
1 changed files with 2 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md
View file

@ -103,4 +103,5 @@ lock(i) :=
**Lemma 2:** DATE's bounds are $[0, n]$ **Lemma 2:** DATE's bounds are $[0, n]$
*Proof:* *Proof:*
For the upper bound, it's trivial: DATE is either decreased or set to $n$. For the upper bound, it's trivial: DATE is either decreased or set to $n$.
... ...