Probability and computing: randomized algorithms and probabilistic analysis

By H. Niederreiter. Mathematics of Computation, 2006

464 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/bbacd16d02bacd75e5c63e42ada5ea89a74e0f3d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Sarvar Patel
2. Mariana Raykova
3. Karn Seth
4. M. Yung
5. Ben Kreuter
6. Mihaela Ion
7. Shobhit Saxena
8. Ahmet Erhan Nergiz

Citations in the corpus

• On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications (2019, methodology): “[38] is a good reference on setting the Bloom Filter parameters.”
• Efficient and Quasi-accurate Multiparty Private Set Union (2018, unknown): “The false-positive probability p is p = { 1− (1− 1 m ) }k ≈ {1− e− kw m }k [11].”