مرکز منطقه ای اطلاع رساني علوم و فناوري - An O(n log n) algorithm for the generalized birthday problem

Title of article :

An O(n log n) algorithm for the generalized birthday problem

Author/Authors :

Frank K. Hwang، نويسنده , , Paul E. Wright، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 1997

Pages :

From page :

443

To page :

451

Keywords :

Clustering , Birthday problems , complexity , Reliability

Journal title :

Computational Statistics and Data Analysis

Serial Year :

1997

Journal title :

Computational Statistics and Data Analysis

Record number :

153508

Link To Document :