Perfect hashing, graph entropy, and circuit complexity

This publication has 19 references indexed in Scilit:

• Optimal separations between concurrent-write parallel machines
  Published by Association for Computing Machinery (ACM) ,1989
• Fredman–Komlós bounds and information theory
  SIAM Journal on Algebraic Discrete Methods, 1986
• Almost optimal lower bounds for small depth circuits
  Published by Association for Computing Machinery (ACM) ,1986
• An optimal parallel algorithm for integer sorting
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Storing a Sparse Table with 0 (1) Worst Case Access Time
  Journal of the ACM, 1984
• Constant Depth Reducibility
  SIAM Journal on Computing, 1984
• On the Size of Separating Systems and Families of Perfect Hash Functions
  SIAM Journal on Algebraic Discrete Methods, 1984
• $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
  SIAM Journal on Computing, 1982
• The covering problem of complete uniform hypergraphs
  Discrete Mathematics, 1979
• Universal classes of hash functions
  Journal of Computer and System Sciences, 1979