Petar Momcilovic

CoRR, 2024

2022

A Probabilistic Approach to Growth Networks.

[BibT_eX]

[DOI]

Jané Kondev

Lishibanya Mohapatra

Oper. Res., November, 2022

Scaling regimes of growth networks.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2022

Appointment-driven service systems with many servers.

[BibT_eX]

[DOI]

Junfei Huang

Queueing Syst. Theory Appl., 2022

On maximum ratio clique relaxations.

[BibT_eX]

[DOI]

Networks, 2022

2020

A note on a limit interchange for many-server queues.

[BibT_eX]

[DOI]

Jun Pei

Amir Motaei

Oper. Res. Lett., 2020

Bed Blocking in Hospitals Due to Scarce Capacity in Geriatric Institutions - Cost Minimization via Fluid Models.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2020

Data-Driven Appointment-Scheduling Under Uncertainty: The Case of an Infusion Unit in a Cancer Center.

[BibT_eX]

[DOI]

Manag. Sci., 2020

2019

Extended vertical lists for temporal pattern mining from multivariate time series.

[BibT_eX]

[DOI]

Expert Syst. J. Knowl. Eng., 2019

2018

Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection.

[BibT_eX]

[DOI]

Noa Zychlinski

Queueing Syst. Theory Appl., 2018

QED limits for many-server systems under a priority policy.

[BibT_eX]

[DOI]

Amir Motaei

Queueing Syst. Theory Appl., 2018

Time-varying many-server finite-queues in tandem: Comparing blocking mechanisms via fluid models.

[BibT_eX]

[DOI]

Noa Zychlinski

Oper. Res. Lett., 2018

Comparing Clinical Judgment with MySurgeryRisk Algorithm for Preoperative Risk Assessment: A Pilot Study.

[BibT_eX]

[DOI]

Meghan Brennan

Sahil Puri

Tezcan Ozrazgat-Baslanti

CoRR, 2018

2017

Personalized queues: the customer view, via a fluid model of serving least-patient first.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2017

2014

On the departure process of the linear loss network.

[BibT_eX]

[DOI]

Yoojin Choi

Queueing Syst. Theory Appl., 2014

Performance-based routing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

2013

A particle process underlying SSD storage structures.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2013

2012

Queues with Many Servers and Impatient Customers.

[BibT_eX]

[DOI]

Math. Oper. Res., 2012

On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers.

[BibT_eX]

[DOI]

Yulia Tseytlin

Manag. Sci., 2012

On a critical regime for linear finite-buffer networks.

[BibT_eX]

[DOI]

Yoojin Choi

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

On Effectiveness of Application-Layer Coding.

[BibT_eX]

[DOI]

Yoojin Choi

IEEE Trans. Inf. Theory, 2011

On Scalability of Routing Tables in Dense Flat-Label Wireless Networks.

[BibT_eX]

[DOI]

Li-Yen Chen

IEEE Trans. Inf. Theory, 2011

Linear loss networks.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2011

2008

On throughput in stochastic linear loss networks.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2008

Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

On throughput in linear wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

2007

Scalability of wireless networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

A distributed switch scheduling algorithm.

[BibT_eX]

[DOI]

Perform. Evaluation, 2007

Scalability of Routing Tables in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Buffer Scalability of Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2004

An asymptotic optimality of the transposition rule for linear lists.

[BibT_eX]

[DOI]

David Gamarnik

SIGMETRICS Perform. Evaluation Rev., 2004

Self assembly times in DNA-based computation.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2004

Reduced Load Equivalence under Subexponentiality.

[BibT_eX]

[DOI]

Bert Zwart

Queueing Syst. Theory Appl., 2004

Heavy Traffic Limits for Queues with Many Deterministic Servers.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2004

Flood search under the California Split rule.

[BibT_eX]

[DOI]

Dan Rubenstein

Oper. Res. Lett., 2004

Large Deviations of Square Root Insensitive Random Sums.

[BibT_eX]

[DOI]

Math. Oper. Res., 2004

DNA-Based Computation Times.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2003

Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue.

[BibT_eX]

[DOI]

Math. Oper. Res., 2003

2002

Flood search under the California split strategy.

[BibT_eX]

[DOI]

Dan Rubenstein

SIGMETRICS Perform. Evaluation Rev., 2002

The Dyadic Stream Merging Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Finite buffer queue with generalized processor sharing and heavy-tailed input processes.

[BibT_eX]

[DOI]

Comput. Networks, 2002

Closed On-Line Bin Packing.

[BibT_eX]

[DOI]

Eyjólfur Ingi Ásgeirsson

Urtzi Ayesta

Acta Cybern., 2002

Resource Sharing with Subexponential Distributions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001

Capacity Regions for Network Multiplexers with Heavy-tailed Fluid On-off Sources.

[BibT_eX]

[DOI]