### Abstract

A problem is presented with deterministic VLSI complexity AT_{det}
^{2}=Ω(N^{2}), but Las Vegas complexity only AT_{Las 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 AT_{Las Vegas}
^{2}=O(N^{3/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 language | English (US) |
---|---|

Title of host publication | VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings |

Editors | John H. Reif |

Publisher | Springer Verlag |

Pages | 312-318 |

Number of pages | 7 |

ISBN (Print) | 9780387968186 |

DOIs | |

State | Published - Jan 1 1988 |

Event | 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 - Corfu, Greece Duration: Jun 28 1988 → Jul 1 1988 |

### Publication series

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

Volume | 319 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 |
---|---|

Country | Greece |

City | Corfu |

Period | 6/28/88 → 7/1/88 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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

}

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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

AN - SCOPUS:35048853015

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 -