Go implementation of the van Emde Boas tree data structure: Priority queue for positive whole numbers in O(log log u) time.
-
Updated
Nov 5, 2023 - Go
#
van-emde-boas-tree
Here are 8 public repositories matching this topic...
Van Emde Boas tree implementation that I did for a university course
-
Updated
Oct 22, 2019 - C++
Van EmdeBoas Tree, AVL tree, Red Black Tree
-
Updated
Nov 18, 2020 - C++
Basic C++ implementation of Van Emde Boas Tree
-
Updated
Jul 15, 2019 - C++
My bachelor's and master's theses
stationary-data self-supervised-learning van-emde-boas-tree retrieval-augmented neurohashing neurocoding assotiative-memory metamemory o1-knn source-knowledge
-
Updated
Aug 10, 2023 - TeX
An implementation of the van Emde Boas tree data structure, yielding extremely fast asymptotic runtime complexities for queries: O(log(log(n)))
-
Updated
Feb 6, 2023 - C++
Improve this page
Add a description, image, and links to the van-emde-boas-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the van-emde-boas-tree topic, visit your repo's landing page and select "manage topics."