A QoS-based selection approach of autonomic grid services. - Jonatha Anselmi; Danilo Ardagna; Paolo Cremonesi (SOCP@HPDC, 2007)

Approximate Solution of Multiclass Queuing Networks with Region Constraints. - Jonatha Anselmi; Giuliano Casale; Paolo Cremonesi (MASCOTS, 2007)

Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck. - Jonatha Anselmi; Paolo Cremonesi (ASMTA, 2008)

Bounding the Performance of BCMP Networks with Load-Dependent Stations. - Jonatha Anselmi; Paolo Cremonesi (MASCOTS, 2008)

Service Consolidation with End-to-End Response Time Constraints. - Jonatha Anselmi; Edoardo Amaldi; Paolo Cremonesi (EUROMICRO-SEAA, 2008)

A new framework supporting the bottleneck analysis of multiclass queueing networks. - Jonatha Anselmi (VALUETOOLS, 2008)

Performance Evaluation of Work Stealing for Streaming Applications. - Jonatha Anselmi; Bruno Gaujal (OPODIS, 2009)

On the Consolidation of Data-Centers with Performance Constraints. - Jonatha Anselmi; Paolo Cremonesi; Edoardo Amaldi (QoSA, 2009)

Improved approximations for the Erlang loss model. - Jonatha Anselmi; Yingdong Lu; Mayank Sharma; Mark S. Squillante (Queueing Syst. Theory Appl., 2009)

Improved Approximations for Stochastic Loss Networks. - Jonatha Anselmi; Yingdong Lu; Mayank Sharma; Mark S. Squillante (SIGMETRICS Perform. Evaluation Rev., 2009)

The price of anarchy in parallel queues revisited. - Jonatha Anselmi; Bruno Gaujal (SIGMETRICS, 2010)

Optimal routing in parallel, non-observable queues and the price of anarchy revisited. - Jonatha Anselmi; Bruno Gaujal (ITC, 2010)

A unified framework for the bottleneck analysis of multiclass queueing networks. - Jonatha Anselmi; Paolo Cremonesi (Perform. Evaluation, 2010)

Competition yields efficiency in load balancing games. - Jonatha Anselmi; Urtzi Ayesta; Adam Wierman (Perform. Evaluation, 2011)

The price of forgetting in parallel and non-observable queues. - Jonatha Anselmi; Bruno Gaujal (Perform. Evaluation, 2011)

Energy-aware capacity scaling in virtualized environments with performance guarantees. - Jonatha Anselmi; Ina Maria Verloop (Perform. Evaluation, 2011)

On the efficiency of perfect simulation in monotone queueing networks. - Jonatha Anselmi; Bruno Gaujal (SIGMETRICS Perform. Evaluation Rev., 2011)

Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. - Jonatha Anselmi; Bernardo D'Auria; Neil Walton (Math. Oper. Res., 2013)

Heavy-traffic revenue maximization in parallel multiclass queues. - Jonatha Anselmi; Giuliano Casale (Perform. Evaluation, 2013)

Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies. - Jonatha Anselmi; Bruno Gaujal; Tommaso Nesti (CoRR, 2014)

Generalized Nash equilibria for SaaS/PaaS Clouds. - Jonatha Anselmi; Danilo Ardagna; Mauro Passacantando (Eur. J. Oper. Res., 2014)

Efficiency of simulation in monotone hyper-stable queueing networks. - Jonatha Anselmi; Bruno Gaujal (Queueing Syst. Theory Appl., 2014)

The economics of the cloud: price competition and congestion. - Jonatha Anselmi; Danilo Ardagna; John C. S. Lui; Adam Wierman; Yunjian Xu; Zichao Yang (SIGMETRICS Perform. Evaluation Rev., 2014)

Decentralized Proportional Load Balancing. - Jonatha Anselmi; Neil Walton (SIAM J. Appl. Math., 2016)

Piecewise optimal trajectories of observer for bearings-only tracking by quantization. - Huilong Zhang; François Dufour; Jonatha Anselmi; Dann Laneuville; Adrien Negre (FUSION, 2017)

Asymptotically optimal open-loop load balancing. - Jonatha Anselmi (Queueing Syst. Theory Appl., 2017)

The Economics of the Cloud. - Jonatha Anselmi; Danilo Ardagna; John C. S. Lui; Adam Wierman; Yunjian Xu; Zichao Yang (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2017)

Power-of-d-Choices with Memory: Fluid Limit and Optimality. - Jonatha Anselmi; François Dufour (CoRR, 2018)

Computable approximations for average Markov decision processes in continuous time. - Jonatha Anselmi; François Dufour; Tomás Prieto-Rumeau (J. Appl. Probab., 2018)

Asymptotically Optimal Size-Interval Task Assignments. - Jonatha Anselmi; Josu Doncel (IEEE Trans. Parallel Distributed Syst., 2019)

Power-of-d-Choices with Memory: Fluid Limit and Optimality. - Jonatha Anselmi; François Dufour (Math. Oper. Res., 2020)

Combining Size-Based Load Balancing with Round-Robin for Scalable Low Latency. - Jonatha Anselmi (IEEE Trans. Parallel Distributed Syst., 2020)

Optimal speed profile of a DVFS processor under soft deadlines. - Jonatha Anselmi; Bruno Gaujal; Louis-Sébastien Rebuffi (Perform. Evaluation, 2021)

Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size. - Jonatha Anselmi; Bruno Gaujal (MASCOTS, 2022)

Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. - Jonatha Anselmi; Bruno Gaujal; Louis-Sébastien Rebuffi (NeurIPS, 2022)

Replication vs speculation for load balancing. - Jonatha Anselmi (Queueing Syst. Theory Appl., 2022)

Stability and Optimization of Speculative Queueing Networks. - Jonatha Anselmi; Neil Walton (IEEE/ACM Trans. Netw., 2022)

A Stochastic Approach for Scheduling AI Training Jobs in GPU-Based Systems. - Federica Filippini; Jonatha Anselmi; Danilo Ardagna; Bruno Gaujal (IEEE Trans. Cloud Comput., 2024)

Load Balancing with Job-Size Testing: Performance Improvement or Degradation? - Jonatha Anselmi; Josu Doncel (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2024)

Asynchronous Load Balancing and Auto-Scaling: Mean-Field Limit and Optimal Design. - Jonatha Anselmi (IEEE/ACM Trans. Netw., 2024)

Learning optimal admission control in partially observable queueing networks. - Jonatha Anselmi; Bruno Gaujal; Louis-Sébastien Rebuffi (Queueing Syst. Theory Appl., 2024)

Dispatching and scheduling multi-server jobs for throughput optimality. - Jonatha Anselmi; Josu Doncel (SIGMETRICS Perform. Evaluation Rev., 2025)

Balanced Splitting: A Framework for Achieving Zero-Wait in the Multiserver-Job Model. - Jonatha Anselmi; Josu Doncel (IEEE Trans. Parallel Distributed Syst., 2025)