[PDF][PDF] The computational complexity of universal hashing
Proceedings of the twenty-second annual ACM …, 1990 - dl.acm.org
Abstract Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit
strings requires a time-space tradeoff of TS= f~(nm). The bound holds in the general …
strings requires a time-space tradeoff of TS= f~(nm). The bound holds in the general …
[引用][C] The computational complexity of universal hashing
Y MANSOUR, N NISAN… - Theoretical computer …, 1993 - pascal-francis.inist.fr
The computational complexity of universal hashing CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
[PDF][PDF] The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Theoretical Computer Science, 1993 - core.ac.uk
Abstract Mansour, Y., N. Nisan and P. Tiwari, The computational complexity of universal
hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter …
hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter …
[PDF][PDF] The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Theoretical Computer Science, 1993 - academia.edu
Abstract Mansour, Y., N. Nisan and P. Tiwari, The computational complexity of universal
hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter …
hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter …
The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Proceedings Fifth Annual Structure in …, 1990 - computer.org
Summary form only given. Any implementation of Carter-Wegman universal hashing from nb
strings to mb strings requires a time-space tradeoff of TS= Omega (nm). The bound holds in …
strings to mb strings requires a time-space tradeoff of TS= Omega (nm). The bound holds in …
[引用][C] The Computational Complexity of Universal Hashing
Y MANSOUR - STOC'90, Proceedings of the twenty-second annual …, 1990 - cir.nii.ac.jp
The Computational Complexity of Universal Hashing | CiNii Research CiNii 国立情報学
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Theoretical Computer Science, 1993 - Elsevier
Abstract Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit
strings requires a time-space tradeoff of TS= Ω (nm). The bound holds in the general …
strings requires a time-space tradeoff of TS= Ω (nm). The bound holds in the general …
The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Proceedings Fifth Annual …, 1990 - ieeexplore.ieee.org
Summary form only given. Any implementation of Carter-Wegman universal hashing from nb
strings to mb strings requires a time-space tradeoff of TS= Omega (nm). The bound holds in …
strings to mb strings requires a time-space tradeoff of TS= Omega (nm). The bound holds in …
[引用][C] The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Theoretical Computer Science, 1993 - dl.acm.org
The computational complexity of universal hashing | Theoretical Computer Science skip to main
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …
[PDF][PDF] The computational complexity of universal hashing
Y Mansour, N Nisan, P Tiwari - Theoretical Computer Science, 1993 - academia.edu
Abstract Mansour, Y., N. Nisan and P. Tiwari, The computational complexity of universal
hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter …
hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter …