@inproceedings{42937f36062049fcb4375dd82a02a56c,

title = "Universal hashing in VLSI",

abstract = "A problem is presented with deterministic VLSI complexity ATdet 2=Ω(N2), but Las Vegas complexity only ATLas Vegas 2=O (N poly(logN)). (The Las Vegas algorithm always decides correctly, but T is only the expected running time; A is the area of the chip). Previously ATLas Vegas 2=O(N3/2 poly(logN)) has been shown for a similar problem with a more complicated algorithm. Here, we use a simple universal hashing technique based on random linear functions. We hope this will give rise to other applications of universal hashing in VLSI. Our algorithm is very practical, because the random bits can even be wired into the chip. For every sequence of inputs during a chip's lifetime, the chances are high that the same short random bit string will always produce the result quickly.",

author = "Martin Furer",

year = "1988",

month = jan,

day = "1",

doi = "10.1007/BFb0040398",

language = "English (US)",

isbn = "9780387968186",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "312--318",

editor = "Reif, {John H.}",

booktitle = "VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings",

address = "Germany",

note = "3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 ; Conference date: 28-06-1988 Through 01-07-1988",

}