Multipurpose C library and persistent key/value storage

extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

System Programming projects on Multiprocessing, Multithreading, FIFO Pipes, Network Sockets, Bash Scripting & building Data Structures

Basic data structures in C with useful comments and explanations

Simple LZSS+RLE+RC32 compression algorithm realization (C/C++/Rust/Go).

A complete LSM tree key-value storage engine written in Go. Implements SSTables, memtables, and write-ahead logging with a modern Wails and React desktop interface

Skip list implementation in OCaml

Various skip list implementations

Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on

A Skip List is a Probabilistic Data Structure Allowing for Efficient Searching, Insertion, and Deletion of Elements Within a Sorted Sequence, Mostly used with Balanced Search Trees (AVL, Red-Black) Due to its Comparable Average-Case Performance (O log n)

תירגולים ומימושים למבני נתונים ואלגוריתמים

System for handling / tracking / updating / querying of vaccination data using advanced data structures (skip lists, bloom filters)

Golang Advanced Data Structures

Detailed explanations and implementations of some of my favorite specialized data structures and algorithms.

Advanced Algorithms and Data Structures FER labs

implementation project for many high-important algorithm topic

The idea is to create and compare self organising list with skip list

A sample of my work from CS 3345 (Data Structures and Introduction to Algorithmic Analysis) at the University of Texas at Dallas.

A KV storage based on skiplist.

Project to show performance comparison of AVL tree against SkipList in different cases

Estruturas de Dados Avançadas: B-Tree + Skip List Math Expression Parser e Compilador completo com AST

A detailed explanation and C++ code for the skip list data structure.

Java implementations of advanced data structures and algorithms: Indexable Skip List with Rank/Select, universal hash functions (Carter–Wegman, DHKP), hash tables (chaining & linear probing), and a custom ADT design with efficient operations. Includes experimental analysis of performance under different load factors.

Highly flexible worst-case O(log n) intrusive skip list

No description provided.

implementing skip list in java language

A high-performance C++ backend engine for the Arcadia MMORPG, featuring custom implementations of Hash Tables, Skip Lists, Red-Black Trees, and Graph algorithms without STL containers. Developed for the CS321 Capstone at Cairo University.

Key-value storage engine in Go with caching, compaction and probabilistic data structures.

Assignment 3 of Randomized Algorithms course (Master in Innovation and Research in Informatics), Fall 2022

Data Structures Library is a C# class library featuring a range of fundamental data structures, from basic stacks and queues to advanced trees and heaps. It's crafted for use in various applications and serves as an educational resource for those learning about data structures.