default search action
Rami Atar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j30]Rami Atar
, Weining Kang, Haya Kaspi, Kavita Ramanan:
Long-Time Limit of Nonlinearly Coupled Measure-Valued Equations that Model Many-Server Queues with Reneging. SIAM J. Math. Anal. 55(6): 7189-7239 (2023) - 2022
- [j29]Rami Atar
Large Deviations for the Single-Server Queue and the Reneging Paradox. Math. Oper. Res. 47(1): 232-258 (2022) - [j28]Rami Atar, Eyal Castiel
Parallel server systems in extended heavy traffic. Queueing Syst. Theory Appl. 100(3-4): 277-279 (2022) - 2021
- [j27]Rami Atar
Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information. Math. Oper. Res. 46(1): 268-300 (2021)
2010 – 2019
- 2019
- [j26]Rami Atar, Isaac Keslassy
Subdiffusive Load Balancing in Time-Varying Queueing Systems. Oper. Res. 67(6): 1678-1698 (2019) - [j25]Mor Armony
Asymptotically Optimal Appointment Schedules. Math. Oper. Res. 44(4): 1345-1380 (2019) - [j24]Rami Atar, Isaac Keslassy
Replicate to the shortest queues. Queueing Syst. Theory Appl. 92(1-2): 1-23 (2019) - 2018
- [j23]Rami Atar
Workload-Dependent Dynamic Priority for the Multiclass Queue with Reneging. Math. Oper. Res. 43(2): 494-515 (2018) - [j22]Rami Atar, Anat Lev-Ari
Optimizing buffer size for the retrial queue: two state space collapse results in heavy traffic. Queueing Syst. Theory Appl. 90(3-4): 225-255 (2018) - 2017
- [j21]Rami Atar, Subhamay Saha
An ɛ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic. Math. Oper. Res. 42(3): 626-647 (2017) - [j20]Rami Atar, Subhamay Saha
Optimality of the generalized $$\varvec{c\mu }$$ c μ rule in the moderate deviation regime. Queueing Syst. Theory Appl. 87(1-2): 113-130 (2017) - 2016
- [j19]Rami Atar, Asaf Cohen:
A Differential Game for a Multiclass Queueing Model in the Moderate-Deviation Heavy-Traffic Regime. Math. Oper. Res. 41(4): 1354-1380 (2016) - [j18]Rami Atar, Gal Mendelson
On the non-Markovian multiclass queue under risk-sensitive cost. Queueing Syst. Theory Appl. 84(3-4): 265-278 (2016) - 2015
- [j17]Rami Atar, Kenny Chowdhary, Paul Dupuis:
Robust Bounds on Risk-Sensitive Functionals via Rényi Divergence. SIAM/ASA J. Uncertain. Quantification 3(1): 18-33 (2015) - [j16]Rami Atar, Anup Biswas
Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline. Math. Oper. Res. 40(3): 683-702 (2015) - [j15]Rami Atar, Neri Merhav:
Information-Theoretic Applications of the Logarithmic Probability Comparison Bound. IEEE Trans. Inf. Theory 61(10): 5366-5386 (2015) - [c6]Rami Atar, Neri Merhav:
Information-theoretic applications of the logarithmic probability comparison bound. ISIT 2015: 735-739 - 2014
- [j14]Rami Atar, Haya Kaspi, Nahum Shimkin:
Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy. Math. Oper. Res. 39(3): 672-696 (2014) - [j13]Rami Atar, Israel Cidon, Mark Shifrin
MDP based optimal pricing for a cloud computing queueing model. Perform. Evaluation 78: 1-6 (2014) - [i2]Rami Atar, Neri Merhav:
Information-theoretic applications of the logarithmic probability comparison bound. CoRR abs/1412.6769 (2014) - 2013
- [j12]Rami Atar, Anindya Goswami
Risk-Sensitive Control for the Parallel Server Model. SIAM J. Control. Optim. 51(6): 4363-4386 (2013) - [c5]Mark Shifrin, Rami Atar, Israel Cidon:
Optimal scheduling in the hybrid-cloud. IM 2013: 51-59 - 2012
- [j11]Rami Atar:
A Diffusion Regime with Nondegenerate Slowdown. Oper. Res. 60(2): 490-500 (2012) - [j10]Rami Atar, Tsachy Weissman:
Mutual Information, Relative Entropy, and Estimation in the Poisson Channel. IEEE Trans. Inf. Theory 58(3): 1302-1318 (2012) - [c4]Rami Atar, Avishai Mandelbaum, Asaf Zviran:
Control of Fork-Join Networks in heavy traffic. Allerton Conference 2012: 823-830 - 2011
- [j9]Rami Atar, Chanit Giat, Nahum Shimkin:
On the asymptotic optimality of the cμ/θ rule under ergodic cost. Queueing Syst. Theory Appl. 67(2): 127-144 (2011) - [j8]Rami Atar, Yair Y. Shaki, Adam Shwartz
A blind policy for equalizing cumulative idleness. Queueing Syst. Theory Appl. 67(4): 275-293 (2011) - [j7]Rami Atar, Nir Solomon:
Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown. Queueing Syst. Theory Appl. 69(3-4): 217-235 (2011) - [c3]Rami Atar, Tsachy Weissman:
Mutual information, relative entropy, and estimation in the Poisson channel. ISIT 2011: 708-712 - [i1]Rami Atar, Tsachy Weissman:
Mutual Information, Relative Entropy, and Estimation in the Poisson Channel. CoRR abs/1101.0302 (2011) - 2010
- [j6]Rami Atar, Chanit Giat, Nahum Shimkin:
The cµ/theta Rule for Many-Server Queues with Abandonment. Oper. Res. 58(5): 1427-1439 (2010)
2000 – 2009
- 2009
- [j5]Rami Atar, Avi Mandelbaum, Gennady Shaikhet:
Simplified Control Problems for Multiclass Many-Server Queueing Systems. Math. Oper. Res. 34(4): 795-812 (2009) - 2008
- [j4]Rami Atar, Adam Shwartz
Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times. Math. Oper. Res. 33(4): 899-909 (2008) - [c2]Rami Atar:
A diffusion regime with nondegenerate slowdown. VALUETOOLS 2008: 57 - [c1]Rami Atar, Chanit Giat, Nahum Shimkin:
The cμ/θ rule. VALUETOOLS 2008: 58 - 2004
- [j3]Rami Atar, Adam Shwartz, Paul Dupuis:
Explicit Solution for a Network Control Problem in the Large Deviation Regime. Queueing Syst. Theory Appl. 46(1-2): 159-176 (2004) - [j2]Rami Atar, Avi Mandelbaum, Martin I. Reiman:
A Brownian control problem for a simple queueing system in the Halfin-Whitt regime. Syst. Control. Lett. 51(3-4): 269-275 (2004) - 2003
- [j1]Rami Atar, Paul Dupuis, Adam Shwartz
An Escape-Time Criterion for Queueing Networks: Asymptotic Risk-Sensitive Control via Differential Games. Math. Oper. Res. 28(4): 801-835 (2003)
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-08-05 20:23 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: