Charles Knessl

Adv. Oper. Res., 2016

2015

Transient analysis of the Erlang A model.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2015

A note on the transition from diffusion with the flow to diffusion against the flow, for first passage times in singularly perturbed drift-diffusion models.

[BibT_eX]

[DOI]

Asymptot. Anal., 2015

2014

Erratum to: Wireless three-hop networks with stealing II: exact solutions through boundary value problems.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2014

First response to letter of G. Fayolle and R. Iasnogorodski.

[BibT_eX]

[DOI]

J. S. H. van Leeuwaarden

Queueing Syst. Theory Appl., 2014

A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence.

[BibT_eX]

[DOI]

Philippe Jacquet

Comb. Probab. Comput., 2014

Expected External Profile of PATRICIA Tries.

[BibT_eX]

[DOI]

Abram Magner

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Wireless three-hop networks with stealing II: exact solutions through boundary value problems.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2013

On spectral properties of finite population processor shared queues.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2013

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits.

[BibT_eX]

[DOI]

Adv. Oper. Res., 2013

2012

Counting Markov Types, Balanced Matrices, and Eulerian Graphs.

[BibT_eX]

[DOI]

Philippe Jacquet

IEEE Trans. Inf. Theory, 2012

On a Recurrence Arising in Graph Compression.

[BibT_eX]

[DOI]

Yongwook Choi

Electron. J. Comb., 2012

2011

Wireless Multihop Networks with Stealing: Large Buffer Asymptotics via the Ray Method.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 2011

An asymptotic form for the Stieltjes constants gammak(a) and for a sum Sgamma(n) appearing under the Li criterion.

[BibT_eX]

[DOI]

Mark W. Coffey

Math. Comput., 2011

An effective asymptotic formula for the Stieltjes constants.

[BibT_eX]

[DOI]

Mark W. Coffey

Math. Comput., 2011

On a free boundary problem for an American put option under the CEV process.

[BibT_eX]

[DOI]

Miao Xu

Appl. Math. Lett., 2011

Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case.

[BibT_eX]

[DOI]

Adv. Oper. Res., 2011

On some simple single server models of dynamic storage.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Queueing Theory and Network Applications, 2011

2010

Storage allocation under processor sharing I: exact solutions and asymptotics.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2010

On a processor sharing queue that models balking.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2010

Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2010

Wireless multi-hop networks with stealing: Large buffer asymptotics.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Teletraffic Congress, 2010

2009

Drift-Diffusion Past a Circle: Shadow Region Asymptotics.

[BibT_eX]

[DOI]

Sean Lynch

SIAM J. Appl. Math., 2009

A Two-Dimensional Diffusion Approximation for a Loss Model with Trunk Reservation.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 2009

On sojourn times in the finite capacity M/M/1 queue with processor sharing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

2008

Some first passage time problems for the shortest queue model.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2008

On the number of reachable configurations for the chessboard pebbling problem.

[BibT_eX]

[DOI]

Math. Comput. Model., 2008

A simple direct solution to a storage allocation model.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

2007

Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2007

2006

Ray Solution of a Singularly Perturbed Elliptic PDE with Applications to Communications Networks.

[BibT_eX]

[DOI]

Diego Dominici

SIAM J. Appl. Math., 2006

On the infinite server shortest queue problem: Non-symmetric case.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2006

On the Erlang Loss Model with Time Dependent Input.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2006

Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents.

[BibT_eX]

[DOI]

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 2005

Enumeration of Binary Trees and Universal Types.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2005

Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

On the number of full levels in tries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Some Asymptotic Results for the M/M/infinity Queue with Ranked Servers.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2004

A small elliptic perturbation of a backward-forward parabolic problem with applications to stochastic models.

[BibT_eX]

[DOI]

Diego Dominici

Appl. Math. Lett., 2004

2003

A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types.

[BibT_eX]

[DOI]

Doo Il Choi

SIAM J. Appl. Math., 2003

Heavy Traffic Analysis of Two Coupled Processors.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2003

Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2003

2002

The height of a binary search tree: the limiting distribution perspective.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2002

Limit laws for the height in PATRICIA tries.

[BibT_eX]

[DOI]

J. Algorithms, 2002

2001

A simple fluid model for servicing priority traffic.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2001

On Two-Dimensional Convection-Diffusion Past a Circle.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 2001

Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2001

Geometrical optics and chessboard pebbling.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2001

2000

Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Probability of Brownian Motion Hitting an Obstacle.

[BibT_eX]

[DOI]

Joseph B. Keller

SIAM J. Appl. Math., 2000

Asymptotic Analysis of A Backward-Forward Parabolic Problem for Data-Handling Systems.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 2000

A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Heights in Generalized Tries and PATRICIA Tries.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Two Tandem Queues with General Renewal Input II: Asymptotic Expansions for the Diffusion Model.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1999

Two Tandem Queues with General Renewal Input I: Diffusion Approximation and Integral Representations.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1999

Quicksort Algorithm Again Revisited.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 1999

1998

Heavy Traffic Analysis of a Markov-Modulated Queue with Finite Capacity and General Service Times.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1998

An explicit solution to a tandem queueing model.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 1998

Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations.

[BibT_eX]

[DOI]

Perform. Evaluation, 1998

A Note on the Asymptotic Behavior of the Depth of Tries.

[BibT_eX]

[DOI]

Algorithmica, 1998

Quicksort Again Revisited.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997

Integral Representations and Asymptotics for Infinite- and Finite-Capacity Queues Described by the Unfinished Work II.

[BibT_eX]

[DOI]

Xiaoqian Tan

SIAM J. Appl. Math., 1997

Integral Representations and Asymptotics for Infinite- and Finite-Capacity Queues Described by the Unfinished Work I.

[BibT_eX]

[DOI]

Xiaoqian Tan

SIAM J. Appl. Math., 1997

Asymptotic Analysis of the M/G/1 Queue with a Time-Dependent Arrival Rate.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 1997

1996

Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin II.

[BibT_eX]

[DOI]

Craig Steven Peters

SIAM J. Appl. Math., 1996

A Fork-Join Queueing Model: Diffusion Approximation, Integral Representations and Asymptotics.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 1996

1994

Heavy Traffic Asymptotics for a Gated, Infinite-Server Queue with Uniform Service Times.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1994

A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1994

Exact and Asymptotic Solutions for the Time-Dependent Problem of Collective Ruin I.

[BibT_eX]

[DOI]

Craig Steven Peters

SIAM J. Appl. Math., 1994

On the Distribution of the Maximum Number of Broken Machines for the Repairman Problem.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1994

Asymptotic behavior of high-order differences of the plane partition function.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1993

On the Transient Behavior of the Erlang Loss Model: Heavy Usage asymptotics.

[BibT_eX]

[DOI]

Shisheng Xie

SIAM J. Appl. Math., 1993

A Finite Capacity PS Queue Which Models Switching Times.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 1993

The conditional sojourn time distribution in the GI/M/1 processor-sharing queue in heavy traffic.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 1993

On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue.

[BibT_eX]

[DOI]

J. ACM, 1993

1992

Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

1991

Heavy-Traffic Analysis of the Sojourn Time in a Three Node Jackson Network with Overtaking.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 1991

1990

Asymptotic Expansions for Large Closed Queuing Networks

[BibT_eX]

[DOI]

J. ACM, January, 1990

An Integral Equation Approach to the M/G/2 Queue.

[BibT_eX]

[DOI]

Oper. Res., 1990

Refinements to Heavy Traffic Limit Theorems in Queueing Theory.

[BibT_eX]

[DOI]