Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/questa/questa52.bht:"
@article{DBLP:journals/questa/AltmanY06, author = {Eitan Altman and Uri Yechiali}, title = {Analysis of customers' impatience in queues with server vacations}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {4}, pages = {261--279}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-6134-x}, doi = {10.1007/S11134-006-6134-X}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/AltmanY06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/Anantharam06, author = {Venkat Anantharam}, title = {On the rod placement theorem of Rybko and Shlosman}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {3}, pages = {185--188}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5000-1}, doi = {10.1007/S11134-006-5000-1}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/Anantharam06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/ArgonA06, author = {Nilay Tanik Argon and Sigr{\'{u}}n Andrad{\'{o}}ttir}, title = {Partial Pooling in Tandem Lines with Cooperation and Blocking}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {1}, pages = {5--30}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-3101-5}, doi = {10.1007/S11134-006-3101-5}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/ArgonA06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/BrandtB06, author = {Andreas Brandt and Manfred Brandt}, title = {A sample path relation for the sojourn times in \emph{G}/\emph{G}/1-\emph{PS} systems and its applications}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {4}, pages = {281--286}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-6264-1}, doi = {10.1007/S11134-006-6264-1}, timestamp = {Fri, 23 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/questa/BrandtB06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/FossK06, author = {Serguei Foss and Dmitry Korshunov}, title = {Heavy Tails in Multi-Server Queue}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {1}, pages = {31--48}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-3613-z}, doi = {10.1007/S11134-006-3613-Z}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/FossK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/FossS06, author = {Serguei Foss and Art{\"{e}}m Sapozhnikov}, title = {Convergence rates in monotone separable stochastic networks}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {2}, pages = {125--137}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-4261-z}, doi = {10.1007/S11134-006-4261-Z}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/FossS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/KnesslY06, author = {Charles Knessl and Yongzhi (Peter) Yang}, title = {On the Erlang Loss Model with Time Dependent Input}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {1}, pages = {49--104}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-3753-1}, doi = {10.1007/S11134-006-3753-1}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/KnesslY06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/LiuK06, author = {Liqiang Liu and Vidyadhar G. Kulkarni}, title = {Explicit solutions for the steady state distributions in \emph{M/PH/}1 queues with workload dependent balking}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {4}, pages = {251--260}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-6084-3}, doi = {10.1007/S11134-006-6084-3}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/LiuK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/MacPheeM06, author = {Iain M. MacPhee and Lisa J. M{\"{u}}ller}, title = {Stability criteria for controlled queueing systems}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {3}, pages = {215--229}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5555-x}, doi = {10.1007/S11134-006-5555-X}, timestamp = {Thu, 08 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/MacPheeM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/Majewski06, author = {Kurt Majewski}, title = {Sample path large deviations for a family of long-range dependent traffic and associated queue length processes}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {1}, pages = {105--118}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-4262-y}, doi = {10.1007/S11134-006-4262-Y}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/Majewski06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/MandjesZ06, author = {Michel Mandjes and Bert Zwart}, title = {Large deviations of sojourn times in processor sharing queues}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {4}, pages = {237--250}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5567-6}, doi = {10.1007/S11134-006-5567-6}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/MandjesZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/ShangLL06, author = {Weixin Shang and Liming Liu and Quan{-}Lin Li}, title = {Tail asymptotics for the queue length in an {M/G/1} retrial queue}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {3}, pages = {193--198}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5223-1}, doi = {10.1007/S11134-006-5223-1}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/ShangLL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/TinnakornsrisuphapM06, author = {Peerapol Tinnakornsrisuphap and Armand M. Makowski}, title = {On the behavior of {ECN/RED} gateways under a large number of {TCP} flows: Limit theorems}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {4}, pages = {287--304}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-6704-y}, doi = {10.1007/S11134-006-6704-Y}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/TinnakornsrisuphapM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/TsoukatosM06, author = {Konstantinos P. Tsoukatos and Armand M. Makowski}, title = {Asymptotic optimality of the Round-Robin policy in multipath routing with resequencing}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {3}, pages = {199--214}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5554-y}, doi = {10.1007/S11134-006-5554-Y}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/TsoukatosM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/Tsybakov06, author = {Boris Tsybakov}, title = {Busy periods in M/M/infinity systems with heterogeneous servers}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {2}, pages = {153--156}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-4435-8}, doi = {10.1007/S11134-006-4435-8}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/Tsybakov06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/VericourtZ06, author = {Francis de V{\'{e}}ricourt and Yong{-}Pin Zhou}, title = {On the incomplete results for the heterogeneous server problem}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {3}, pages = {189--191}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5067-8}, doi = {10.1007/S11134-006-5067-8}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/VericourtZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/YaoK06, author = {Haishen Yao and Charles Knessl}, title = {On the infinite server shortest queue problem: Non-symmetric case}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {2}, pages = {157--177}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-5500-z}, doi = {10.1007/S11134-006-5500-Z}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/questa/YaoK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/questa/ZeifmanLOSS06, author = {Alexander I. Zeifman and Samantha Leorato and Enzo Orsingher and Yakov Satin and Galina Shilova}, title = {Some universal limits for nonhomogeneous birth and death processes}, journal = {Queueing Syst. Theory Appl.}, volume = {52}, number = {2}, pages = {139--151}, year = {2006}, url = {https://doi.org/10.1007/s11134-006-4353-9}, doi = {10.1007/S11134-006-4353-9}, timestamp = {Wed, 28 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/questa/ZeifmanLOSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.