Queues as Harris Recurrent Markov Chains. - Karl Sigman (Queueing Syst. Theory Appl., 1988)

One-Dependent Regenerative Processes and Queues in Continuous Time. - Karl Sigman (Math. Oper. Res., 1990)

Light traffic heuristic for anM/G/1 queue with limited inventory. - Karl Sigman; David Simchi-Levi (Ann. Oper. Res., 1992)

Light traffic for workload in queues. - Karl Sigman (Queueing Syst. Theory Appl., 1992)

A Review of Regenerative Processes. - Karl Sigman; Ronald W. Wolff (SIAM Rev., 1993)

Delay Moments for FIFO GI/GI/s Queues. - Alan Scheller-Wolf; Karl Sigman (Queueing Syst. Theory Appl., 1997)

New Bounds for Expected Delay in FIFO GI/GI/c Queues. - Alan Scheller-Wolf; Karl Sigman (Queueing Syst. Theory Appl., 1997)

Moments in Tandem Queues. - Alan Scheller-Wolf; Karl Sigman (Oper. Res., 1998)

Steady-State Asymptotics for Tandem, Split-Match and Other Feedforward Queues with Heavy Tailed Service. - Tao Huang; Karl Sigman (Queueing Syst. Theory Appl., 1999)

Editorial Introduction - Queues with Heavy-Tailed Distributions. - Karl Sigman (Queueing Syst. Theory Appl., 1999)

Appendix: A Primer on Heavy-Tailed Distributions. - Karl Sigman (Queueing Syst. Theory Appl., 1999)

Asymptotic convergence of scheduling policies with respect to slowdown. - Mor Harchol-Balter; Karl Sigman; Adam Wierman (Perform. Evaluation, 2002)

Understanding the slowdown of large jobs in an M/GI/1 system. - Mor Harchol-Balter; Karl Sigman; Adam Wierman (SIGMETRICS Perform. Evaluation Rev., 2002)

Stochastic Networks: Admission and Routing Using Penalty Functions. - Jan Cosyn; Karl Sigman (Queueing Syst. Theory Appl., 2004)

Stationary remaining service time conditional on queue length. - Karl Sigman; Uri Yechiali (Oper. Res. Lett., 2007)

Analysis of join-the-shortest-queue routing for web server farms. - Varun Gupta 004; Mor Harchol-Balter; Karl Sigman; Ward Whitt (Perform. Evaluation, 2007)

Insensitivity for PS server farms with JSQ routing. - Varun Gupta 004; Karl Sigman; Mor Harchol-Balter; Ward Whitt (SIGMETRICS Perform. Evaluation Rev., 2007)

Heavy-traffic limits for nearly deterministic queues. - Karl Sigman; Ward Whitt (SIGMETRICS Perform. Evaluation Rev., 2010)

Heavy-traffic limits for nearly deterministic queues: stationary distributions. - Karl Sigman; Ward Whitt (Queueing Syst. Theory Appl., 2011)

Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for ρ<c. - Karl Sigman (Queueing Syst. Theory Appl., 2012)

On simulating a class of Bernstein polynomials. - Vineet Goyal; Karl Sigman (ACM Trans. Model. Comput. Simul., 2012)

Using the M/G/1 queue under processor sharing for exact simulation of queues. - Karl Sigman (Ann. Oper. Res., 2016)

Closed-Form Approximations for Optimal (r, q) and (S, T) Policies in a Parallel Processing Environment. - Marcus Ang; Karl Sigman; Jing-Sheng Song 001; Hanqin Zhang (Oper. Res., 2017)

Marked point processes in discrete time. - Karl Sigman; Ward Whitt (Queueing Syst. Theory Appl., 2019)

IoT Traffic Shaping and the Massive Access Problem*. - Erol Gelenbe; Karl Sigman (ICC, 2022)

Comparing backwards and forwards random walk maxima. - Karl Sigman (Queueing Syst. Theory Appl., 2022)

On an Adaptive-Quasi-Deterministic Transmission Policy Queueing Model. - Jacob Bergquist; Erol Gelenbe; Karl Sigman (MASCOTS, 2024)