3 papers
math.PR2017
Asymmetric Rényi Problem
Michael Drmota, Abram Magner, Wojciech Szpankowski
In 1960 Rényi in his Michigan State University lectures asked for the number of random queries necessary to recover a hidden bijective labeling of distinct objects. In each que…
cs.SI2016
Combining Density and Overlap (CoDO): A New Method for Assessing the Significance of Overlap Among Subgraphs
Abram Magner, Shahin Mohammadi, Ananth Grama
Algorithms for detecting clusters (including overlapping clusters) in graphs have received significant attention in the research community. A closely related important aspect of th…
math.PR2016
Asymmetric Rényi Problem and PATRICIA Tries
Michael Drmota, Abram Magner, Wojciech Szpankowski
In 1960, Rényi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels an…