Author of the publication

The matching, birthday and the strong birthday problem: a contemporary review

. Journal of Statistical Planning and Inference, 130 (1-2): 377--389 (Mar 1, 2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Compromise designs in heteroscedastic linear models, , and . Journal of Statistical Planning and Inference, 32 (3): 363--384 (September 1992)Sample size problems in ANOVA Bayesian point of view, and . Journal of Statistical Planning and Inference, 65 (2): 335--347 (Dec 15, 1997)A sparse Johnson: Lindenstrauss transform, , and . STOC, page 341-350. ACM, (2010)Spam or ham?: characterizing and detecting fraudulent "not spam" reports in web mail systems., , , and . CEAS, page 210-219. ACM, (2011)Optimal hashing schemes for entity matching., , , , and . WWW, page 295-306. International World Wide Web Conferences Steering Committee / ACM, (2013)A Portable Personality Recognizer Based on Affective State Classification Using Spectral Fusion of Features., , , , , and . IEEE Trans. Affect. Comput., 9 (3): 330-342 (2018)Online story scheduling in web advertising., , , and . SODA, page 1275-1284. SIAM, (2009)Learning Entangled Single-Sample Gaussians., , , and . SODA, page 511-522. SIAM, (2014)Task-Specific Representation Learning for Web-Scale Entity Disambiguation., , , , and . AAAI, page 5812-5819. AAAI Press, (2018)Selecting Diverse Features via Spectral Regularization., , and . NIPS, page 1592-1600. (2012)