Let G(n,m) be an undirected random graph with n vertices and m multiedges that may include loops, where each edge is realized by choosing its two vertices independently and uniformly at random with replacement from the set of all n vertices. The random graph G(n,m) is said to be k-orientable, where k â‰¥ 2 is an integer, if there exists an orientation of theâ€¦ (More)

2008 The 9th International Conference for Youngâ€¦

2008

We analyze the performance of the randomized multiple- choice allocation process in the fixed density model. We show that the allocation process leads to O(log log n) expected maximal bin load when Theta(n) balls are allocated into n bins, where each ball is inserted into the less loaded bin among two bins chosen independently and according to two fixed butâ€¦ (More)

We present an algorithm for hashing Î±n elements into a table with n separate chains that requires O(1) deterministic worst-case insert time, and O(1) expected worst-case search time for constant Î±. We exploit the connection between two-way chaining and random graph theory in our techniques.

2008 The 9th International Conference for Youngâ€¦

2008

Let G(n,m) be an undirected random graph with n vertices and m multiedges that may include loops, where each edge is realized by choosing its two vertices independently and uniformly at random with replacement from the set of all n vertices. The random graph G(n,m) is said to be k-orientable, where k ges 2 is an integer, if there exists an orientation ofâ€¦ (More)