Universal hashing in VLSI

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations


    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.

    Original languageEnglish (US)
    Title of host publicationVLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings
    EditorsJohn H. Reif
    PublisherSpringer Verlag
    Number of pages7
    ISBN (Print)9780387968186
    StatePublished - 1988
    Event3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 - Corfu, Greece
    Duration: Jun 28 1988Jul 1 1988

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume319 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Other3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)


    Dive into the research topics of 'Universal hashing in VLSI'. Together they form a unique fingerprint.

    Cite this