Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to
yield the desired theoretical guarantees are often neither simple nor practical. Here we show …

In the framework of Wegman and Carter, ak-independent hash function maps any k keys
independently. It is known that 5-independent hashing provides good expected performance …

People counting has many applications in smart buildings. For example, adjusting HVAC
systems based on the number of occupants in each room can save a significant amount of …

Non-volatile memory technologies (NVMs) are promising candidates for building future
memory systems, due to their advantages of high density, high scalability, and requiring …

Emerging non-volatile memory technologies (NVMs) have been considered as promising
candidates for replacing DRAM and SRAM, due to their advantages of high density, high …

Many tasks in computer systems could be abstracted as distributing items into buckets, so
that the allocation of items across buckets is as balanced as possible, and furthermore …

Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many
celebrated approximation algorithms, commonly adopted in industrial practice for large …

Hashing is a basic tool for dimensionality reduction employed in several aspects of machine
learning. However, the perfomance analysis is often carried out under the abstract …

We consider the Similarity Sketching problem: Given a universe [u]={0,..., u-1} we want a
random function S map** subsets A of [u] into vectors S (A) of size t, such that similarity is …

The linear-probing hash table is one of the oldest and most widely used data structures in
computer science. However, linear probing famously comes with a major draw-back: as …