S
Zodix
Study
Academic Library
Search
Shelves
Open access
Sign in
Search or jump to…
⌘K
Jonatha Anselmi · Study
Home
/
Author
Jonatha Anselmi
7 works
· latest 2020
· 3 institutions
cluster: provisional
ORCID 0000-0001-5541-5631
Follow
Suggest an ORCID correction
h-index
7
i10
7
Citations
123
Works here
7
09
10
11
13
19
20
Most cited in this library
Optimal routing in parallel, non-observable queues and the price of anarchy revisited
2010 · 24 citations
The price of forgetting in parallel and non-observable queues
2011 · 21 citations
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
2013 · 19 citations
Power-of-d-Choices with Memory: Fluid Limit and Optimality
2020 · 19 citations
Improved approximations for the Erlang loss model
2009 · 14 citations
Works
7 shown
Power-of-d-Choices with Memory: Fluid Limit and Optimality
Mathematics of Operations Research
·
2020
·
2 authors
·
Open access
19
citations
Asymptotically Optimal Size-Interval Task Assignments
IEEE Transactions on Parallel and Distributed Systems
·
2019
·
2 authors
·
Open access
13
citations
Heavy-traffic revenue maximization in parallel multiclass queues
Performance Evaluation
·
2013
·
2 authors
·
Open access
13
citations
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Mathematics of Operations Research
·
2013
·
3 authors
·
Open access
19
citations
The price of forgetting in parallel and non-observable queues
Performance Evaluation
·
2011
·
2 authors
·
Open access
21
citations
Optimal routing in parallel, non-observable queues and the price of anarchy revisited
International Teletraffic Congress
·
2010
·
2 authors
·
other
·
Open access
24
citations
Improved approximations for the Erlang loss model
Queueing Systems
·
2009
·
4 authors
14
citations