Evaluating Best-Case and Worst-Case Variances When Bounds are Available. - George S. Fishman; Boris L. Granovsky; David S. Rubin (SIAM J. Sci. Comput., 1992)

Nonstationary Queues: Estimation of the Rate of Convergence. - Boris L. Granovsky; Alexander I. Zeifman (Queueing Syst. Theory Appl., 2004)

Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups. - Michael M. Erlihson; Boris L. Granovsky (Random Struct. Algorithms, 2004)

Random combinatorial structures: the convergent case. - Andrew D. Barbour; Boris L. Granovsky (J. Comb. Theory A, 2005)

Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof. - Boris L. Granovsky; Dudley Stark; Michael M. Erlihson (Adv. Appl. Math., 2008)

Coagulation Processes with Gibbsian Time Evolution. - Boris L. Granovsky; Alexander V. Kryvoshaev (J. Appl. Probab., 2012)

Asymptotic enumeration of decomposable combinatorial structures with multiple singularities (Abstract). - Boris L. Granovsky; Dudley Stark (Electron. Notes Discret. Math., 2013)

Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration. - Boris L. Granovsky; Dudley Stark (Electron. J. Comb., 2015)