From b4317b944c50e077fd8d2ea8ae2429baa91bab6a Mon Sep 17 00:00:00 2001 From: Karl Gaissmaier Date: Mon, 18 Dec 2023 17:16:42 +0100 Subject: [PATCH] typo --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 4182a09..a5c9378 100644 --- a/README.md +++ b/README.md @@ -48,7 +48,7 @@ Due to the nature of treaps the lookups and updates can be concurrently decouple without delayed rebalancing, promising to be a perfect match for a software-router or firewall. To familiarize yourself with treaps, see the extraordinarily good lectures from -Pavel Mravin about Algorithms and Datastructures e.g. "[Treaps, implicit keys]" +Pavel Marvin about Algorithms and Datastructures e.g. "[Treaps, implicit keys]" or follow [some links about treaps] from one of the inventors. Especially useful is the paper "[Fast Set Operations Using Treaps]" by Guy E. Blelloch and Margaret Reid-Miller.