Mathematical models to analyze Lua hybrid tables

DOI10.1016/J.TCS.2025.115264MaRDI QIDQ6985818zbMATH OpenFDO

Authors Conrado Martínez, Cyril Nicaud, Pablo Rotondo

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115264

zbMATH Keywords

algorithm engineeringdata structureshash tablesLuaprobabilistic analysis of algorithms

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05) Analysis of algorithms (68W40)

Cites work

• A probabilistic model revealing shortcomings in Lua's hybrid tables
• Concentration inequalities. A nonasymptotic theory of independence
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• On the worst-case complexity of TimSort
• Strategies for stable merge sorting
• The tail of the hypergeometric distribution

This page was built for publication: Mathematical models to analyze Lua hybrid tables

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