3 papers
cs.DM2018
A Note On the Size of Largest Bins Using Placement With Linear Transformations
Martin Babka
We study the placement of n balls into n bins where balls and bins are represented as two vector spaces over Z 2 . The placement is done according to a linear transformation betwee…
cs.DS2014
Expected number of uniformly distributed balls in a most loaded bin using placement with simple linear functions
Martin Babka
We estimate the size of a most loaded bin in the setting when the balls are placed into the bins using a random linear function in a finite field. The balls are chosen from a trans…
cs.DS2012
On Online Labeling with Polynomially Many Labels
Martin Babka, Jan Bulánek, Vladimír Čunát +2
In the online labeling problem with parameters n and m we are presented with a sequence of n keys from a totally ordered universe U and must assign each arriving key a label from t…