default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl Sigman
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j25]Karl Sigman:
Comparing backwards and forwards random walk maxima. Queueing Syst. Theory Appl. 100(3-4): 349-351 (2022)- 2019
- [j24]Karl Sigman
, Ward Whitt:
Marked point processes in discrete time. Queueing Syst. Theory Appl. 92(1-2): 47-81 (2019) - 2017
- [j23]Marcus Ang, Karl Sigman, Jing-Sheng Song, Hanqin Zhang:
Closed-Form Approximations for Optimal (r, q) and (S, T) Policies in a Parallel Processing Environment. Oper. Res. 65(5): 1414-1428 (2017) - 2016
- [j22]Karl Sigman:
Using the M/G/1 queue under processor sharing for exact simulation of queues. Ann. Oper. Res. 241(1-2): 23-34 (2016) - 2012
- [j21]Karl Sigman:
Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for ρ<c. Queueing Syst. Theory Appl. 70(1): 37-43 (2012) - [j20]Vineet Goyal, Karl Sigman:
On simulating a class of Bernstein polynomials. ACM Trans. Model. Comput. Simul. 22(2): 12:1-12:5 (2012) - 2011
- [j19]Karl Sigman, Ward Whitt:
Heavy-traffic limits for nearly deterministic queues: stationary distributions. Queueing Syst. Theory Appl. 69(2): 145-173 (2011) - 2010
- [j18]Karl Sigman, Ward Whitt:
Heavy-traffic limits for nearly deterministic queues. SIGMETRICS Perform. Evaluation Rev. 38(2): 15-17 (2010) - 2007
- [j17]Karl Sigman, Uri Yechiali:
Stationary remaining service time conditional on queue length. Oper. Res. Lett. 35(5): 581-583 (2007) - [j16]Varun Gupta, Mor Harchol-Balter, Karl Sigman, Ward Whitt:
Analysis of join-the-shortest-queue routing for web server farms. Perform. Evaluation 64(9-12): 1062-1081 (2007) - [j15]Varun Gupta, Karl Sigman, Mor Harchol-Balter, Ward Whitt:
Insensitivity for PS server farms with JSQ routing. SIGMETRICS Perform. Evaluation Rev. 35(2): 24-26 (2007) - 2004
- [j14]Jan Cosyn, Karl Sigman:
Stochastic Networks: Admission and Routing Using Penalty Functions. Queueing Syst. Theory Appl. 48(3-4): 237-262 (2004) - 2002
- [j13]Mor Harchol-Balter, Karl Sigman, Adam Wierman:
Asymptotic convergence of scheduling policies with respect to slowdown. Perform. Evaluation 49(1/4): 241-256 (2002) - [j12]Mor Harchol-Balter, Karl Sigman, Adam Wierman:
Understanding the slowdown of large jobs in an M/GI/1 system. SIGMETRICS Perform. Evaluation Rev. 30(3): 9-11 (2002) - 1999
- [j11]Karl Sigman:
Editorial Introduction - Queues with Heavy-Tailed Distributions. Queueing Syst. Theory Appl. 33(1-3): 1-3 (1999) - [j10]Tao Huang, Karl Sigman:
Steady-State Asymptotics for Tandem, Split-Match and Other Feedforward Queues with Heavy Tailed Service. Queueing Syst. Theory Appl. 33(1-3): 233-259 (1999) - [j9]Karl Sigman:
Appendix: A Primer on Heavy-Tailed Distributions. Queueing Syst. Theory Appl. 33(1-3): 261-275 (1999) - 1998
- [j8]Alan Scheller-Wolf, Karl Sigman:
Moments in Tandem Queues. Oper. Res. 46(3): 378-380 (1998) - 1997
- [j7]Alan Scheller-Wolf, Karl Sigman:
Delay Moments for FIFO GI/GI/s Queues. Queueing Syst. Theory Appl. 25(1-4): 77-95 (1997) - [j6]Alan Scheller-Wolf, Karl Sigman:
New Bounds for Expected Delay in FIFO GI/GI/c Queues. Queueing Syst. Theory Appl. 26(1-2): 169-186 (1997) - 1993
- [j5]Karl Sigman, Ronald W. Wolff:
A Review of Regenerative Processes. SIAM Rev. 35(2): 269-288 (1993) - 1992
- [j4]Karl Sigman, David Simchi-Levi:
Light traffic heuristic for anM/G/1 queue with limited inventory. Ann. Oper. Res. 40(1): 371-380 (1992) - [j3]Karl Sigman:
Light traffic for workload in queues. Queueing Syst. Theory Appl. 11(4): 429-442 (1992) - 1990
- [j2]Karl Sigman:
One-Dependent Regenerative Processes and Queues in Continuous Time. Math. Oper. Res. 15(1): 175-189 (1990) - 1988
- [j1]Karl Sigman:
Queues as Harris Recurrent Markov Chains. Queueing Syst. Theory Appl. 3(2): 179-198 (1988)
Conference and Workshop Papers
- 2022
- [c1]Erol Gelenbe, Karl Sigman:
IoT Traffic Shaping and the Massive Access Problem*. ICC 2022: 2732-2737
Editorship
- 2013
- [e1]Guy Latouche, Vaidyanathan Ramaswami, Jay Sethuraman, Karl Sigman, Mark S. Squillante, David D. Yao:
Matrix-Analytic Methods in Stochastic Models, Seventh International Conference on Matrix Analytic Methods in Stochastic Models, MAM 2011, Columbia University, New York, NY, USA, 13-16 June 2011. Springer Proceedings in Mathematics & Statistics 27, Springer 2013, ISBN 978-1-4614-4908-9 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
