default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. B. Dieker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j15]A. B. Dieker, Soumyadip Ghosh, Mark S. Squillante:
Optimal Resource Capacity Management for Stochastic Networks. Oper. Res. 65(1): 221-241 (2017)- [j14]A. B. Dieker, Guido Lagos
:
A dichotomy for sampling barrier-crossing events of random walks with regularly varying tails. J. Appl. Probab. 54(4): 1213-1232 (2017) - 2015
- [j13]A. B. Dieker, Santosh S. Vempala:
Stochastic Billiards for Sampling from the Boundary of a Convex Set. Math. Oper. Res. 40(4): 888-901 (2015) - 2014
- [j12]A. B. Dieker, Marc Lelarge:
Editorial introduction. Queueing Syst. Theory Appl. 77(2): 113-114 (2014) - [j11]Jim G. Dai, A. B. Dieker, Xuefeng Gao:
Validity of heavy-traffic steady-state approximations in many-server queues with abandonment. Queueing Syst. Theory Appl. 78(1): 1-29 (2014) - [i1]A. B. Dieker, Santosh S. Vempala:
Stochastic billiards for sampling from the boundary of a convex set. CoRR abs/1410.5775 (2014) - 2013
- [j10]A. B. Dieker, J. Shin:
From Local to Global Stability in Stochastic Processing Networks Through Quadratic Lyapunov Functions. Math. Oper. Res. 38(4): 638-664 (2013) - [j9]A. B. Dieker, Tonghoon Suk:
Diffusion approximations for large-scale buffered systems. SIGMETRICS Perform. Evaluation Rev. 41(3): 49-51 (2013) - 2011
- [j8]Jim G. Dai, A. B. Dieker:
Nonnegativity of solutions to the basic adjoint relationship for some diffusion processes. Queueing Syst. Theory Appl. 68(3-4): 295-303 (2011) - 2010
- [j7]A. B. Dieker, Jon Warren:
Series Jackson Networks and Noncrossing Probabilities. Math. Oper. Res. 35(2): 257-266 (2010) - [j6]A. B. Dieker:
Interlacings for Random Walks on Weighted Graphs and the Interchange Process. SIAM J. Discret. Math. 24(1): 191-206 (2010)
2000 – 2009
- 2008
- [j5]A. B. Dieker, Soumyadip Ghosh, Mark S. Squillante:
Capacity optimization in feedforward Brownian networks. SIGMETRICS Perform. Evaluation Rev. 36(2): 137-139 (2008) - 2007
- [j4]Krzysztof Debicki, A. B. Dieker, Tomasz Rolski:
Quasi-Product Forms for Lévy-Driven Fluid Networks. Math. Oper. Res. 32(3): 629-647 (2007) - 2006
- [b1]A. B. Dieker:
Extremes and fluid queues. University of Twente, Enschede, Netherlands, 2006 - [j3]A. B. Dieker, Marc Lelarge:
Tails for (max, plus) recursions under subexponentiality. Queueing Syst. Theory Appl. 53(4): 213-230 (2006) - [j2]A. B. Dieker, Michel Mandjes:
Fast simulation of overflow probabilities in a queue with Gaussian input. ACM Trans. Model. Comput. Simul. 16(2): 119-151 (2006) - 2005
- [j1]A. B. Dieker:
Reduced-Load Equivalence for Queues with Gaussian Input. Queueing Syst. Theory Appl. 49(3-4): 405-414 (2005)
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:22 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:
