default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernardo D'Auria
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Bernardo D'Auria
, Jose A. Salmeron:
Correction to: Anticipative information in a Brownian-Poisson market. Ann. Oper. Res. 332(1): 1165 (2024)- [j17]Bernardo D'Auria, Jose A. Salmeron:
Anticipative information in a Brownian-Poisson market. Ann. Oper. Res. 336(1-2): 1289-1314 (2024) - 2022
- [j16]Bernardo D'Auria, Ivo J. B. F. Adan, René Bekker, Vidyadhar G. Kulkarni:
An M/M/c queue with queueing-time dependent service rates. Eur. J. Oper. Res. 299(2): 566-579 (2022) - [j15]Bernardo D'Auria:
Conditioned tandem networks. Queueing Syst. Theory Appl. 100(3-4): 405-407 (2022) - 2021
- [j14]Maury Bramson, Bernardo D'Auria, Neil Walton:
Stability and Instability of the MaxWeight Policy. Math. Oper. Res. 46(4): 1611-1638 (2021) - 2020
- [j13]Ivo J. B. F. Adan, Bernardo D'Auria, Offer Kella:
Special volume on 'Recent Developments in Queueing Theory' of the third ECQT conference: part 2. Queueing Syst. Theory Appl. 94(1-2): 1-2 (2020)
2010 – 2019
- 2019
- [j12]Ivo J. B. F. Adan, Bernardo D'Auria, Offer Kella:
Special volume on 'Recent Developments in Queueing Theory' of the third ECQT conference. Queueing Syst. Theory Appl. 93(1-2): 1-2 (2019) - [i1]Maury Bramson, Bernardo D'Auria, Neil Walton:
Stability and Instability of the MaxWeight Policy. CoRR abs/1909.10825 (2019) - 2017
- [j11]Maury Bramson, Bernardo D'Auria, Neil Walton:
Proportional Switching in First-in, First-out Networks. Oper. Res. 65(2): 496-513 (2017) - 2016
- [j10]Ivo J. B. F. Adan, Bernardo D'Auria:
Sojourn Time in a Single-Server Queue with Threshold Service Rate Control. SIAM J. Appl. Math. 76(1): 197-216 (2016) - 2015
- [j9]Bernardo D'Auria, Spyridoula Kanta:
Pure threshold strategies for a two-node tandem network under partial information. Oper. Res. Lett. 43(5): 467-470 (2015) - 2013
- [j8]Jonatha Anselmi, Bernardo D'Auria, Neil Walton:
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. Math. Oper. Res. 38(3): 469-491 (2013) - 2012
- [j7]Bernardo D'Auria:
A short note on the monotonicity of the Erlang C formula in the Halfin-Whitt regime. Queueing Syst. Theory Appl. 71(4): 469-472 (2012)
2000 – 2009
- 2008
- [j6]Bernardo D'Auria:
M/M/infinity queues in semi-Markovian random environment. Queueing Syst. Theory Appl. 58(3): 221-237 (2008) - 2007
- [j5]Pasquale Avella, Bernardo D'Auria, Saverio Salerno, Igor Vasil'ev:
A computational study of local search algorithms for Italian high-school timetabling. J. Heuristics 13(6): 543-556 (2007) - [j4]Bernardo D'Auria:
Stochastic decomposition of the M/G/infinity queue in a random environment. Oper. Res. Lett. 35(6): 805-812 (2007) - 2006
- [j3]Pasquale Avella, Bernardo D'Auria, Saverio Salerno:
A LP-based heuristic for a time-constrained routing problem. Eur. J. Oper. Res. 173(1): 120-124 (2006) - 2005
- [b1]Bernardo D'Auria:
Analysis of queueing systems and networks in presence of long range dependance. University of Salerno, Italy, 2005 - [j2]Pasquale Avella, Maurizio Boccia, Bernardo D'Auria:
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. INFORMS J. Comput. 17(2): 183-191 (2005) - [j1]Bernardo D'Auria, Gennady Samorodnitsky:
Limit Behavior of Fluid Queues and Networks. Oper. Res. 53(6): 933-945 (2005) - 2003
- [c2]Giovannina Albano, Bernardo D'Auria, Saverio Salerno:
A webMathematica Application for Mathematics Learning. International Conference on Computational Science 2003: 754-763 - 2000
- [c1]Ciro D'Apice, Bernardo D'Auria, Rosanna Manzo, Saverio Salerno:
Using mathematica to simulate general queuing systems. ESM 2000: 23-25
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-06-10 20:31 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:
