Universal hashing in VLSI

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

    1 Citation (Scopus)

    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.

    Original languageEnglish (US)
    Title of host publicationVLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings
    EditorsJohn H. Reif
    PublisherSpringer Verlag
    Pages312-318
    Number of pages7
    ISBN (Print)9780387968186
    DOIs
    StatePublished - Jan 1 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

    Other

    Other3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988
    CountryGreece
    CityCorfu
    Period6/28/887/1/88

    Fingerprint

    Hashing
    Chip
    Random Function
    Linear Function
    Lifetime
    Strings

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Furer, M. (1988). Universal hashing in VLSI. In J. H. Reif (Ed.), VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings (pp. 312-318). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 319 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0040398
    Furer, Martin. / Universal hashing in VLSI. VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. editor / John H. Reif. Springer Verlag, 1988. pp. 312-318 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @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 = "1",
    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",

    }

    Furer, M 1988, Universal hashing in VLSI. in JH Reif (ed.), VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 319 LNCS, Springer Verlag, pp. 312-318, 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988, Corfu, Greece, 6/28/88. https://doi.org/10.1007/BFb0040398

    Universal hashing in VLSI. / Furer, Martin.

    VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. ed. / John H. Reif. Springer Verlag, 1988. p. 312-318 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 319 LNCS).

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

    TY - GEN

    T1 - Universal hashing in VLSI

    AU - Furer, Martin

    PY - 1988/1/1

    Y1 - 1988/1/1

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=35048853015&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=35048853015&partnerID=8YFLogxK

    U2 - 10.1007/BFb0040398

    DO - 10.1007/BFb0040398

    M3 - Conference contribution

    SN - 9780387968186

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 312

    EP - 318

    BT - VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings

    A2 - Reif, John H.

    PB - Springer Verlag

    ER -

    Furer M. Universal hashing in VLSI. In Reif JH, editor, VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Springer Verlag. 1988. p. 312-318. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0040398