1. Stochastic Enumeration Method for Counting NP-Hard Problems

   • Reuven Rubinstein

   OriginalPaper 27 July 2011 Pages: 249 - 291

2. On the Convergence Rate of Random Permutation Sampler and ECR Algorithm in Missing Data Models

   • Panagiotis Papastamoulis
   • George Iliopoulos

   OriginalPaper 29 June 2011 Pages: 293 - 304

3. Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems

   • Emmanuelle Anceaume
   • François Castella
   • Bruno Sericola

   OriginalPaper 30 June 2011 Pages: 305 - 332

4. The Weak Convergence Theorem for the Distribution of the Maximum of a Gaussian Random Walk and Approximation Formulas for its Moments

   • Fikri Gökpınar
   • Tahir Khaniyev
   • Zulfiyya Mammadova

   OriginalPaper 13 July 2011 Pages: 333 - 347

5. Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs

   • Kiyoshi Inoue
   • Sigeo Aki
   • Balakrishnan Narayanaswamy

   OriginalPaper 06 August 2011 Pages: 349 - 362

6. Omnibus Sequences, Coupon Collection, and Missing Word Counts

   • Sunil Abraham
   • Greg Brockman
   • Anant P. Godbole

   OriginalPaper 27 August 2011 Pages: 363 - 378

7. Weighting Cusums for Increased Power Near the End Points

   • Christopher S. Withers
   • Saralees Nadarajah

   OriginalPaper 27 August 2011 Pages: 379 - 405

8. On Dynamic Generalized Linear Models with Applications

   • Sourish Das
   • Dipak K. Dey

   OriginalPaper 05 October 2011 Pages: 407 - 421

9. Tandem Queues with Impatient Customers for Blood Screening Procedures

   • Shaul K. Bar-Lev
   • Hans Blanc
   • David Perry

   OriginalPaper 08 September 2011 Pages: 423 - 451

10. On Finite Markov Chain Imbedding and Its Applications

    • Tung-Lung Wu

    OriginalPaper 04 December 2011 Pages: 453 - 465

11. The Decay Parameter and Invariant Measures for Markovian Bulk-Arrival Queues with Control at Idle Time

    • Li Junping
    • Chen Anyue

    OriginalPaper 02 October 2011 Pages: 467 - 484