Tobias Christiani
Rasmus Pagh
ABSTRACT
We consider the following fundamental problems: Constructing k-independent hash functions with a space-time tradeoff close to Siegel's lower bound. Constructing representations of unbalanced expander graphs having small size and allowing fast computation of the neighbor function.
It is not hard to show that these problems are intimately connected in the sense that a good solution to one of them leads to a good solution to the other one. In this paper we exploit this connection to present efficient, recursive constructions of k-independent hash functions (and hence expanders with a small representation). While the previously most efficient construction (Thorup, FOCS 2013) needed time quasipolynomial in Siegel's lower bound, our time bound is just a logarithmic factor from the lower bound.
- A. Z. Broder, A. M. Frieze, and E. Upfal. Static and dynamic path selection on expander graphs: a random walk approach. Random Structures & Algorithms, 14(1):87--109, 1999. Google Scholar
Digital Library
- H. Burhman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? SIAM J. Comput., 31(6):1723--1744, 2002. Google ScholarDigital Library
- M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In Proc. STOC '02, pages 659--668, 2002. Google ScholarDigital Library
- J. L. Carter and M. N. Wegman. Universal classes of hash functions. In Proc. STOC '77, pages 106--112, 1977. Google ScholarDigital Library
- J. L. Carter and M. N. Wegman. New hash functions and their use in authentication and set equality. J. Comput. System Sci., 22(3):265--279, 1981.Google ScholarCross Ref
- B. Chor, O. Goldreich, J. Hastad, J. Freidmann, S. Rudich, and R. Smolensky. The bit extration problem or t-resilient functions. In Proc. FOCS '85, pages 396--407, 1985. Google ScholarDigital Library
- T. Christiani and R. Pagh. Generating k-independent variables in constant time. In Proc. FOCS '14, pages 196--205, 2014. Google ScholarDigital Library
- M. Dietz-felbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proc. ICALP '90, pages 6--19. 1990. Google ScholarDigital Library
- M. Dietzfelbinger. On randomness in hash functions (invited talk). In Proc. STACS '12, pages 25--28, 2012.Google Scholar
- M. Dietzfelbinger and P. Woelfel. Almost random graphs with simple hash functions. In Proc. STOC '03, pages 629--638, 2003. Google ScholarDigital Library
- V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes. J. ACM, 56(4):20:1--20:34, 2009. Google ScholarDigital Library
- T. Hagerup. Sorting and searching on the word RAM. In Proc. STACS '98, pages 366--398, 1998. Google ScholarDigital Library
- P. Indyk and A. Gilbert. Sparse recovery using sparse matrices. Proc. IEEE, 98(6):937--947, 2010.Google ScholarCross Ref
- A. Joffe. On a set of almost deterministic k-independent random variables. Ann. Prob., 2(1):161--162, 1974.Google ScholarCross Ref
- K. S. Kedlaya and C. Umans. Fast modular composition in any characteristic. In Proc. FOCS '08, pages 146--155, 2008. Google ScholarDigital Library
- B. W. Kernighan and D. M. Ritchie. The C Programming Language. Prentice Hall, Englewood Cliffs, New Jersey, second edition, 1988. Google ScholarDigital Library
- K. G. Larsen. Higher cell probe lower bounds for evaluating polynomials. In Proc. FOCS '12, pages 293--301, 2012. Google ScholarDigital Library
- P. B. Miltersen. Lower bounds for static dictionaries on RAMs with bit operations but no multiplications. In Proc. ICALP '96, pages 442--453, 1996. Google ScholarDigital Library
- A. Pagh and R. Pagh. Uniform hashing in constant time and optimal space. SIAM J. Comput., 38(1):85--96, 2008. Google ScholarDigital Library
- F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proc. FOCS '05, pages 285--294, 2005. Google ScholarDigital Library
- M. Patraşcu and M. Thorup. Dynamic integer sets with optimal rank, select, and predecessor search. In Proc. FOCS '14, pages 166--175, 2014. Google ScholarDigital Library
- A. Siegel. On universal classes of extremely random constant-time hash functions. SIAM J. Comput., 33(3):505--543, 2004. Google ScholarDigital Library
- A. Ta-Shma, C. Umans, and D. Zuckerman. Lossless condensers, unbalanced expanders, and extractors. Combinatorica, 27(2):213--240, 2007. Google ScholarDigital Library
- M. Thorup. Simple tabulation, fast expanders, double tabulation, and high independence. In Proc. FOCS '13, pages 90--99, 2013. Google ScholarDigital Library
Index Terms
- From Independence to Expansion and Back Again
Recommendations
Balls and Bins: Smaller Hash Families and Faster Evaluation
† Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)A fundamental fact in the analysis of randomized algorithms is that when $n$ balls are hashed into $n$ bins independently and uniformly at random, with high probability each bin contains at most $O(\log n/\log\log n)$ balls. In various applications, ...
k-Domination and k-Independence in Graphs: A Survey
In 1985, Fink and Jacobson gave a generalization of the concepts of domination and independence in graphs. For a positive integer k, a subset S of vertices in a graph G = (V, E) is k-dominating if every vertex of V − S is adjacent to at least k vertices ...
On k-independence in graphs with emphasis on trees
In a graph G=(V,E) of order n and maximum degree @D, a subset S of vertices is a k-independent set if the subgraph induced by S has maximum degree less or equal to k-1. The lower k-independence number i"k(G) is the minimum cardinality of a maximal k-...
Comments