[NeurIPS'23] H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models.

Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html

Heavy-Hitter detection in P4 switch ASIC using Inter-Packet Gap

Reinforcement Learning (RL)-based routing algorithm for SDN networks created from scratch using Python.

Implementation for - Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches

Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics

Source code of "Network-Wide Routing-Oblivious Heavy Hitters" paper by Ran Ben Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, and Danny Raz (ACM/IEEE ANCS 2018).

Code for "PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries"

A novel approach based on Random Forests that quickly and accurately identifies elephant flows in programmable Data Planes.

Sliding-window and regular top-K sketches, based on HeavyKeeper

Efficient Flow Recording with InheritSketch on Programmable Switches (ICDCS2023)

Implementation of streaming algorithms (Misra-Gries & Lossy Counting) for getting frequent items from data streams.

Comparing the Double Space Saving DS to the Heavy Keeper DS for the real world input streams

PoC (Proof of Concept) caching optimization algorithm for graphical tree environment, written entirely in pure C++.

Demo app for the https://github.com/keilerkonzept/topk sliding top-k sketch library

My Thesis on the data structure Count-Min Sketch and it's applications.

P4 implementation of CMSIS, a heavy-hitter detection algorithm for programmable switches.