scientific article; zbMATH DE number 7650130

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.63MaRDI QIDQ5875523

Shyam Narayanan

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

momentsrandom walkschaining\(k\)-wise independence

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of the distribution of the supremum of a centered random walk. Application to the local score
• Universal classes of hash functions
• The space complexity of approximating the frequency moments
• An introduction to MCMC for machine learning
• Random walks with \(k\)-wise independent increments
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
• Optimal Streaming and Tracking Distinct Elements with High Probability
• Linear Probing with Constant Independence
• The best constants in the Khintchine inequality
• On the k -Independence Required by Linear Probing and Minwise Independence
• Continuous Monitoring of l_p Norms in Data Streams
• Beating CountSketch for heavy hitters in insertion streams
• On the best constant in Marcinkiewicz-Zygmund inequality