default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiron Ravner
Person information
- affiliation: Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Liron Ravner, Jiesen Wang
:
Estimating customer delay and tardiness sensitivity from periodic queue length observations. Queueing Syst. Theory Appl. 103(3-4): 241-274 (2023)- 2022
- [j11]Liron Ravner:
Queue input estimation from discrete workload observations. Queueing Syst. Theory Appl. 100(3-4): 541-543 (2022) - [i6]Liron Ravner:
Queue input estimation from discrete workload observations. CoRR abs/2202.10750 (2022) - 2021
- [j10]Sara Ghazanfari, Daphne van Leeuwen, Liron Ravner, Rudesindo Núñez-Queija:
Commuter behavior under travel time uncertainty. Perform. Evaluation 148: 102200 (2021) - [j9]Liron Ravner, Yutaka Sakuma:
Strategic arrivals to a queue with service rate uncertainty. Queueing Syst. Theory Appl. 97(3-4): 303-341 (2021) - [j8]Moshe Haviv, Liron Ravner:
A survey of queueing systems with strategic timing of arrivals. Queueing Syst. Theory Appl. 99(1-2): 163-198 (2021) - 2020
- [i5]Moshe Haviv, Liron Ravner:
A survey of queueing systems with strategic timing of arrivals. CoRR abs/2006.12053 (2020)
2010 – 2019
- 2019
- [j7]Onno J. Boxma, Offer Kella, Liron Ravner:
Fluid queues with synchronized output. Oper. Res. Lett. 47(6): 629-635 (2019) - [c2]Daphne van Leeuwen, Sara Ghazanfari, Liron Ravner, Rudesindo Núñez-Queija:
A bottleneck with randomly distorted arrival times. VALUETOOLS 2019: 55-62 - [i4]Liron Ravner, Yutaka Sakuma:
Strategic arrivals to a queue with service rate uncertainty. CoRR abs/1908.08322 (2019) - 2017
- [j6]Liron Ravner, Yoni Nazarathy:
Scheduling for a processor sharing system with linear slowdown. Math. Methods Oper. Res. 86(1): 71-102 (2017) - [j5]Offer Kella, Liron Ravner:
Lowest priority waiting time distribution in an accumulating priority Lévy queue. Oper. Res. Lett. 45(1): 40-45 (2017) - [i3]Amihai Glazer, Refael Hassin, Liron Ravner:
Equilibrium and efficient clustering of arrival times to a queue. CoRR abs/1701.04776 (2017) - 2016
- [j4]Moshe Haviv, Liron Ravner:
Strategic bidding in an accumulating priority queue: equilibrium analysis. Ann. Oper. Res. 244(2): 505-523 (2016) - [j3]Liron Ravner, Moshe Haviv, Hai Le Vu:
A strategic timing of arrivals to a linear slowdown processor sharing system. Eur. J. Oper. Res. 255(2): 496-504 (2016) - 2015
- [j2]Moshe Haviv, Liron Ravner:
Strategic timing of arrivals to a finite queue multi-server loss system. Queueing Syst. Theory Appl. 81(1): 71-96 (2015) - [i2]Liron Ravner, Moshe Haviv, Hai Le Vu:
A strategic timing of arrivals to a linear slowdown processor sharing system. CoRR abs/1508.03420 (2015) - [i1]Moshe Haviv, Liron Ravner:
Strategic Bidding in an Accumulating Priority Queue: Equilibrium Analysis. CoRR abs/1510.03575 (2015) - 2014
- [j1]Liron Ravner:
Equilibrium arrival times to a queue with order penalties. Eur. J. Oper. Res. 239(2): 456-468 (2014) - [c1]Liron Ravner, Moshe Haviv:
Equilibrium and socially optimal arrivals to a single server loss system. NetGCooP 2014: 119-126
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-04-24 23:16 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:
