default search action
Petar Momcilovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Jiachen Xi, Alfredo Garcia, Petar Momcilovic:
Regularized Q-Learning with Linear Function Approximation. CoRR abs/2401.15196 (2024) - 2022
- [j35]Predrag R. Jelenkovic, Jané Kondev
, Lishibanya Mohapatra
A Probabilistic Approach to Growth Networks. Oper. Res. 70(6): 3386-3402 (2022) - [j34]Yehor Blokhin, Sergiy Butenko
On maximum ratio clique relaxations. Networks 80(4): 440-465 (2022) - [j33]Predrag R. Jelenkovic, Petar Momcilovic:
Scaling regimes of growth networks. Queueing Syst. Theory Appl. 100(3-4): 313-315 (2022) - [j32]Junfei Huang
Appointment-driven service systems with many servers. Queueing Syst. Theory Appl. 100(3-4): 529-531 (2022) - 2020
- [j31]Avishai Mandelbaum, Petar Momcilovic, Nikolaos Trichakis
Data-Driven Appointment-Scheduling Under Uncertainty: The Case of an Infusion Unit in a Cancer Center. Manag. Sci. 66(1): 243-270 (2020) - [j30]Noa Zychlinski
Bed Blocking in Hospitals Due to Scarce Capacity in Geriatric Institutions - Cost Minimization via Fluid Models. Manuf. Serv. Oper. Manag. 22(2): 396-411 (2020) - [j29]Jun Pei, Amir Motaei, Petar Momcilovic:
A note on a limit interchange for many-server queues. Oper. Res. Lett. 48(2): 147-151 (2020)
2010 – 2019
- 2019
- [j28]Anton Kocheturov
Extended vertical lists for temporal pattern mining from multivariate time series. Expert Syst. J. Knowl. Eng. 36(5) (2019) - 2018
- [j27]Noa Zychlinski
Time-varying many-server finite-queues in tandem: Comparing blocking mechanisms via fluid models. Oper. Res. Lett. 46(5): 492-499 (2018) - [j26]Noa Zychlinski
Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection. Queueing Syst. Theory Appl. 89(1-2): 15-47 (2018) - [j25]Petar Momcilovic, Amir Motaei
QED limits for many-server systems under a priority policy. Queueing Syst. Theory Appl. 90(1-2): 125-159 (2018) - [i2]Meghan Brennan, Sahil Puri, Tezcan Ozrazgat-Baslanti, Rajendra Rana Bhat, Zheng Feng, Petar Momcilovic, Xiaolin Li, Daisy Zhe Wang, Azra Bihorac:
Comparing Clinical Judgment with MySurgeryRisk Algorithm for Preoperative Risk Assessment: A Pilot Study. CoRR abs/1804.03258 (2018) - [i1]Anton Kocheturov, Petar Momcilovic, Azra Bihorac, Panos M. Pardalos:
Extended Vertical Lists for Temporal Pattern Mining from Multivariate Time Series. CoRR abs/1804.10025 (2018) - 2017
- [j24]Avishai Mandelbaum, Petar Momcilovic:
Personalized queues: the customer view, via a fluid model of serving least-patient first. Queueing Syst. Theory Appl. 87(1-2): 23-53 (2017) - 2014
- [j23]Avishai Mandelbaum, Petar Momcilovic:
Performance-based routing. Oper. Res. Lett. 42(6-7): 418-423 (2014) - [j22]Yoojin Choi, Petar Momcilovic:
On the departure process of the linear loss network. Queueing Syst. Theory Appl. 78(2): 155-187 (2014) - 2013
- [j21]Edward G. Coffman Jr., Petar Momcilovic:
A particle process underlying SSD storage structures. SIGMETRICS Perform. Evaluation Rev. 41(3): 58-60 (2013) - 2012
- [j20]Avishai Mandelbaum, Petar Momcilovic, Yulia Tseytlin:
On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers. Manag. Sci. 58(7): 1273-1291 (2012) - [j19]Avishai Mandelbaum, Petar Momcilovic:
Queues with Many Servers and Impatient Customers. Math. Oper. Res. 37(1): 41-65 (2012) - [c8]Yoojin Choi, Petar Momcilovic:
On a critical regime for linear finite-buffer networks. Allerton Conference 2012: 730-737 - 2011
- [j18]Petar Momcilovic, Mark S. Squillante:
Linear loss networks. Queueing Syst. Theory Appl. 68(2): 111-131 (2011) - [j17]Li-Yen Chen, Petar Momcilovic:
On Scalability of Routing Tables in Dense Flat-Label Wireless Networks. IEEE Trans. Inf. Theory 57(7): 4302-4314 (2011) - [j16]Yoojin Choi, Petar Momcilovic:
On Effectiveness of Application-Layer Coding. IEEE Trans. Inf. Theory 57(10): 6673-6691 (2011)
2000 – 2009
- 2009
- [c7]Yoojin Choi, Petar Momcilovic:
On Effectiveness of Application-Layer Coding. INFOCOM 2009: 433-441 - 2008
- [j15]Avishai Mandelbaum, Petar Momcilovic:
Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime. Math. Oper. Res. 33(3): 561-586 (2008) - [j14]Petar Momcilovic, Mark S. Squillante:
On throughput in stochastic linear loss networks. SIGMETRICS Perform. Evaluation Rev. 36(2): 125-127 (2008) - [c6]Petar Momcilovic, Mark S. Squillante:
On throughput in linear wireless networks. MobiHoc 2008: 199-208 - 2007
- [j13]Petar Momcilovic:
A distributed switch scheduling algorithm. Perform. Evaluation 64(9-12): 1053-1061 (2007) - [j12]Predrag R. Jelenkovic, Petar Momcilovic, Mark S. Squillante:
Scalability of wireless networks. IEEE/ACM Trans. Netw. 15(2): 295-308 (2007) - [c5]Petar Momcilovic:
Scalability of Routing Tables in Wireless Networks. INFOCOM 2007: 1262-1270 - 2006
- [c4]Predrag R. Jelenkovic, Petar Momcilovic, Mark S. Squillante:
Buffer Scalability of Wireless Networks. INFOCOM 2006 - 2004
- [j11]Predrag R. Jelenkovic, Petar Momcilovic:
Large Deviations of Square Root Insensitive Random Sums. Math. Oper. Res. 29(2): 398-406 (2004) - [j10]Yuliy M. Baryshnikov
Flood search under the California Split rule. Oper. Res. Lett. 32(3): 199-206 (2004) - [j9]Predrag R. Jelenkovic, Petar Momcilovic, Bert Zwart:
Reduced Load Equivalence under Subexponentiality. Queueing Syst. Theory Appl. 46(1-2): 97-112 (2004) - [j8]Predrag R. Jelenkovic, Avishai Mandelbaum, Petar Momcilovic:
Heavy Traffic Limits for Queues with Many Deterministic Servers. Queueing Syst. Theory Appl. 47(1-2): 53-69 (2004) - [j7]David Gamarnik, Petar Momcilovic:
An asymptotic optimality of the transposition rule for linear lists. SIGMETRICS Perform. Evaluation Rev. 32(2): 33-34 (2004) - [j6]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic:
Self assembly times in DNA-based computation. SIGMETRICS Perform. Evaluation Rev. 32(2): 35-37 (2004) - [c3]Yuliy M. Baryshnikov
DNA-Based Computation Times. DNA 2004: 14-23 - 2003
- [j5]Predrag R. Jelenkovic, Petar Momcilovic:
Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue. Math. Oper. Res. 28(3): 587-608 (2003) - 2002
- [j4]Eyjólfur Ingi Ásgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, David J. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe:
Closed On-Line Bin Packing. Acta Cybern. 15(3): 361-367 (2002) - [j3]Predrag R. Jelenkovic, Petar Momcilovic:
Finite buffer queue with generalized processor sharing and heavy-tailed input processes. Comput. Networks 40(3): 433-443 (2002) - [j2]Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic:
The Dyadic Stream Merging Algorithm. J. Algorithms 43(1): 120-137 (2002) - [j1]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein:
Flood search under the California split strategy. SIGMETRICS Perform. Evaluation Rev. 30(3): 15-16 (2002) - [c2]Predrag R. Jelenkovic, Petar Momcilovic:
Resource Sharing with Subexponential Distributions. INFOCOM 2002: 1316-1325 - 2001
- [c1]Predrag R. Jelenkovic, Petar Momcilovic:
Capacity Regions for Network Multiplexers with Heavy-tailed Fluid On-off Sources. INFOCOM 2001: 289-298
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-10-07 22:24 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: