SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution

DOI10.1145/3497876MaRDI QIDQ5102064zbMATH OpenOpenAlexWikidataFDO

Authors Marcelo Vaz Netto, Sahudy Montenegro González

Publication date 6 September 2022

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3497876

zbMATH Keywords

linear collisionsperfect hashingPoisson distributionsearch algorithmsequential search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• On iterative collision search for LPN and subset sum
• Optimization of sequential-parallel search for objects for the model of the distributed Poisson flow of their appearance
• Optimal Randomized Comparison Based Algorithms for Collision
• A stochastic line search method with expected complexity analysis
• Stochastic search with Poisson and deterministic resetting
• SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS
• Parallel collision search with cryptanalytic applications
• A Collision PSO for Search of Periodic Points

Cites work

• Hash, Displace, and Compress
• scientific article; zbMATH DE number 3245041 (Why is no real title available?)
• Introduction to algorithms.
• Poisson twister generator by cumulative frequency technology

This page was built for publication: SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution

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