Layered hashing algorithm for real-time systems

DOI10.1007/S00224-010-9297-0zbMATH Open1254.68100OpenAlexW1992253014MaRDI QIDQ692912FDOQ692912

Matan Mandelbrod

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9297-0

zbMATH Keywords

resource allocationhashingreal-time algorithms

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms
• How asymmetry helps load balancing
• Balanced Allocations
• Cuckoo hashing
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Less hashing, same performance: Building a better Bloom filter
• Balanced allocation and dictionaries with tightly packed constant size bins
• Cuckoo hashing: Further analysis

Cited In (1)

• Cryptographic Hash Algorithms Based on Time Averaging Techniques

This page was built for publication: Layered hashing algorithm for real-time systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692912)