Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (1996)

by Noga Alon , Moni Naor
Venue:Algorithmica
Citations:61 - 5 self

Documents Related by Co-Citation

222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
820 Matrix multiplication via arithmetic progressions – D Coppersmith, S Winograd - 1987
1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
83 All Pairs Almost Shortest Paths – Dorit Dor, Shay Halperin, Uri Zwick - 1996
36 All-Pairs Small-Stretch Paths – Edith Cohen, Uri Zwick - 1997
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
64 Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths – David R. Karger, Daphne Koller, Steven J. Phillips - 1993
14 All pairs shortest paths and the essential subgraph – C C McGeoch - 1995
69 Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication) – D. Aingworth, C. Chekuri, R. Motwani - 1996
29 Explicit constructions of exponential sizedfamilies of k-independent sets – N ALON - 1986
47 On the size of separating systems and families of perfect hash functions – M L Fredman, J Komlós - 1984
86 Finding a minimum circuit in a graph – A Itai, M Rodeh - 1978
304 Distributed Computing: A Locality-Sensitive Approach – D Peleg - 2000
73 Fast algorithms for constructing t-spanners and paths with stretch t – Edith Cohen - 1998
43 Near-linear time construction of sparse neighborhood covers – Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg - 1998
18 Sub-cubic Cost Algorithms for the All Pairs Shortest Path Problem – Tadao Takaoka - 1995
8 Witnesses for boolean matrix multiplication – Z Galil, O Margalit - 1993
20 All pairs shortest distances for graphs with small integer length edges – Z Galil, O Margalit - 1997