Hashing lazy numbers

DOI10.1007/BF02307374MaRDI QIDQ1340859zbMATH OpenFDO

Authors M. O. Benouamer, P. Jaillon, J.-M. Moreau, Dominique Michelucci

Publication date 20 December 1994

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

computational geometrysymbolic calculusHash codinglazy evaluationslazy numbers

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Lazy algorithms for exact real arithmetic
• scientific article; zbMATH DE number 953038
• The complexity of hashing with lazy deletion
• Generating power of lazy semantics
• A Queueing Analysis of Hashing with Lazy Deletion

Cites work

• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3766957 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• Hashing lazy numbers

Cited in

(3)

• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• Hashing lazy numbers
• Robustness and Randomness

This page was built for publication: Hashing lazy numbers

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