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 13 public repositories matching this topic...
-
Updated
Jan 4, 2026 - C++
Van Emde Boas tree implementation that I did for a university course
-
Updated
Oct 22, 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
Basic C++ implementation of Van Emde Boas Tree
-
Updated
Jul 15, 2019 - C++
This is a Java implementation of the Van Emde Boas (vEB) tree data structure as taught in MIT OpenCourseWare and described in Introduction to Algorithms (CLRS) 4th Edition.
-
Updated
Apr 20, 2025 - Java
Van EmdeBoas Tree, AVL tree, Red Black Tree
-
Updated
Nov 18, 2020 - C++
High-performance sparse bitset implementation using VEB trees
-
Updated
Feb 23, 2026 - C++
-
Updated
Dec 22, 2025 - C++
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++
This library contains some of the Advanced Data Structures such as van Emde Boas trees, Suffix Trees, Fibonacci Heaps and other data structures
java bloom-filter kd-tree data-structures kd-trees longest-common-prefix segment-tree pairing-heap fibonacci-heap suffix-tree suffix-array advanced-data-structures linkcut-tree van-emde-boas-tree k-dimensional-trees
-
Updated
Apr 5, 2026 - Java
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."