𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 623 || Polynomial hash functions are reliable

✍ Scribed by Kuich, W.

Book ID
125446808
Publisher
Springer Berlin Heidelberg
Year
1992
Weight
1002 KB
Category
Article
ISBN
3540472789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto
[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 5126 || On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
✍ Aceto, Luca; DamgΓ₯rd, Ivan; Goldberg, Leslie Ann; HalldΓ³rsson, MagnΓΊs M.; IngΓ³lf πŸ“‚ Article πŸ“… 2008 πŸ› Springer Berlin Heidelberg 🌐 English βš– 505 KB

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully rev