25.08.2013 Views

EURANDOM

EURANDOM

EURANDOM

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2009-062 Extreme value theory, Poisson-Dirichlet distributions and<br />

FPP on random networks<br />

2009-061 Refined square-root staffing for call centers with impatient<br />

customers<br />

<strong>EURANDOM</strong> Annual Report 2009 20<br />

G. Hooghiemstra<br />

S. Bhamidi<br />

R. v.d. Hofstad<br />

B. Zhang<br />

J. v. Leeuwaarden<br />

B. Zwart<br />

2009-060 Triangular M/G/1-type and tree-like QBD Markov chains B. van Houdt<br />

J. van Leeuwaarden<br />

2009-059 Rare events asymptotics for a random walk in the quarter<br />

plane<br />

F. Guillemin<br />

J. van Leeuwaarden<br />

2009-058 TCP and ISO-stationary transformations J. van Leeuwaarden<br />

A. Löpker<br />

T. Ott<br />

2009-057 Sojourn time tails in the single server queue with heavytailed<br />

service times<br />

2009-056 Improving the Delta-hedging risk-adjusted rerformance: the<br />

standard VG voltility space model<br />

2009-055 A saturated tree network of polling stations with flow control<br />

2009-054 Workload-dependent capacity in production-to-order systems<br />

2009-053 Hospital admission planning to optimize major resources<br />

utilization under uncertainty<br />

2009-052 Improving operational effectiveness of tactical master plans<br />

for emergency and elective patients under stochastic demand<br />

and capacitated resources<br />

2009-051 Budget Allocation for Permanent and Contingent Capacity<br />

under Stochastic Demand<br />

2009-050 Asset backed securities: Risks, Ratings and Quantitative<br />

Modelling<br />

2009-049 First passage process of a Markov additive process, with applications<br />

to reflection problems<br />

2009-048 First passage of time-reversible spectrally-negative Markov<br />

additive processes<br />

2009-047 Novel scaling limits for critical inhomogeneous random<br />

graphs<br />

O. Boxma<br />

D. Denisov<br />

F. Guillaume<br />

W. Schoutens<br />

P. Beekhuizen<br />

J. Resing<br />

N. Dellaert<br />

G. Mincsovics<br />

N. Dellaert<br />

J. Jeunet<br />

I. Adan<br />

J. Bekkers<br />

N. Dellaert<br />

J. Jeunet<br />

J. Vissers<br />

N. Dellaert<br />

J. Jeunet<br />

G. Mincsovics<br />

H. Jönsson<br />

W. Schoutens<br />

B. D’Auria<br />

J. Ivanovs<br />

O. Kella<br />

M. Mandjes<br />

J. Ivanovs<br />

M. Mandjes<br />

S. Bhamidi<br />

R. van der Hofstad<br />

J. van Leeuwaarden<br />

2009-046 On a processor sharing queue that models balking Q. Zhen<br />

J. van Leeuwaarden<br />

Ch. Knessl<br />

RSS<br />

QPA<br />

QPA<br />

QPA<br />

QPA<br />

QPA<br />

MRM<br />

QPA<br />

QPA<br />

QPA<br />

QPA<br />

QPA<br />

MRM<br />

2009-045 The Variance of Departure Processes: Puzzling Behavior and Y. Nazarathy<br />

Open Problems<br />

QPA<br />

2009-044 Scaling limits for critical inhomogeneous random graphs S. Bhamidi QPA<br />

QPA<br />

QPA<br />

RSS<br />

RSS

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!