Vincenzo Bonifaci

Orcid: 0000-0001-9038-6901

According to our database1, Vincenzo Bonifaci authored at least 66 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On a Voter Model with Context-Dependent Opinion Adoption.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Physarum-inspired multi-commodity flow dynamics.
Theor. Comput. Sci., 2022

2021
An Entropic Gradient Structure in the Network Dynamics of a Slime Mold.
Symmetry, 2021

Algorithms for hierarchical and semi-partitioned parallel scheduling.
J. Comput. Syst. Sci., 2021

A Laplacian approach to ℓ <sub>1</sub>-norm minimization.
Comput. Optim. Appl., 2021

2020
Physarum Multi-Commodity Flow Dynamics.
CoRR, 2020

On the Convergence Time of a Natural Dynamics for Linear Programming.
Algorithmica, 2020

2019
A Generalized Parallel Task Model for Recurrent Real-Time Processes.
ACM Trans. Parallel Comput., 2019

Two results on slime mold computations.
Theor. Comput. Sci., 2019

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors.
J. Sched., 2019

2018
Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Prize Collecting Traveling Salesman and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling.
IEEE Trans. Computers, 2017

Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems.
IEEE Trans. Computers, 2017

A scheduling model inspired by control theory.
Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017

2016
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm.
Real Time Syst., 2016

A revised model of fluid transport optimization in Physarum polycephalum.
CoRR, 2016

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities.
Proceedings of the 28th Euromicro Conference on Real-Time Systems, 2016

ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors.
Proceedings of the 28th Euromicro Conference on Real-Time Systems, 2016

2015
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems.
J. ACM, 2015

Memory-processor co-scheduling in fixed priority systems.
Proceedings of the 23rd International Conference on Real Time Networks and Systems, 2015

Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems.
Proceedings of the 27th Euromicro Conference on Real-Time Systems, 2015

The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks.
Proceedings of the 27th Euromicro Conference on Real-Time Systems, 2015

P. polycephalum Can Compute Shortest Paths.
Proceedings of the BICT 2015, 2015

2013
Partitioned EDF scheduling on a few types of unrelated multiprocessors.
Real Time Syst., 2013

Physarum can compute shortest paths: A short proof.
Inf. Process. Lett., 2013

Andrew Adamatzky: Physarum Machines: Computers from Slime Mould - World Scientific Publishing, 2010, ISBN: 978-981-4327-58-9.
Genet. Program. Evolvable Mach., 2013

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks.
Proceedings of the IEEE 34th Real-Time Systems Symposium, 2013

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Feasibility Analysis in the Sporadic DAG Task Model.
Proceedings of the 25th Euromicro Conference on Real-Time Systems, 2013

Algorithms for Auctions and Games.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Scheduling Real-Time Mixed-Criticality Jobs.
IEEE Trans. Computers, 2012

Algorithms and complexity for periodic real-time scheduling.
ACM Trans. Algorithms, 2012

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
CoRR, 2012

Scheduling Unrelated Machines of Few Different Types
CoRR, 2012

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
Algorithmica, 2012

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.
Algorithmica, 2012

Physarum can compute shortest paths.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A Generalized Parallel Task Model for Recurrent Real-time Processes.
Proceedings of the 33rd IEEE Real-Time Systems Symposium, 2012

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems.
Proceedings of the 24th Euromicro Conference on Real-Time Systems, 2012

2011
The distributed wireless gathering problem.
Theor. Comput. Sci., 2011

Minimizing flow time in the wireless gathering problem.
ACM Trans. Algorithms, 2011

Budgeted matching and budgeted matroid intersection via the gasoline puzzle.
Math. Program., 2011

Efficiency of Restricted Tolls in Non-atomic Network Routing Games.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Mixed-Criticality Scheduling of Sporadic Task Systems.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Improved multiprocessor global schedulability analysis.
Real Time Syst., 2010

Stackelberg Routing in Arbitrary Networks.
Math. Oper. Res., 2010

Data Gathering in Wireless Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Online <i>k</i>-Server Routing Problems.
Theory Comput. Syst., 2009

Implementation of a Speedup-Optimal Global EDF Schedulability Test.
Proceedings of the 21st Euromicro Conference on Real-Time Systems, 2009

2008
The complexity of uniform Nash equilibria and related regular subgraph problems.
Theor. Comput. Sci., 2008

On the power of lookahead in on-line server routing problems.
Theor. Comput. Sci., 2008

An approximation algorithm for the wireless gathering problem.
Oper. Res. Lett., 2008

The on-line asymmetric traveling salesman problem.
J. Discrete Algorithms, 2008

The online Prize-Collecting Traveling Salesman Problem.
Inf. Process. Lett., 2008

Minimizing Average Flow Time in Sensor Data Gathering.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
Prize-Collecting Traveling Salesman and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

An adversarial queueing model for online server routing.
Theor. Comput. Sci., 2007

2006
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance.
Proceedings of the Theory and Applications of Models of Computation, 2006

Visual editing of animated algorithms: the Leonardo Web builder.
Proceedings of the working conference on Advanced visual interfaces, 2006

2005
Portraying Algorithms with Leonardo Web.
Proceedings of the Web Information Systems Engineering - WISE 2005 Workshops, 2005

Game-Theoretic Analysis of Internet Switching with Selfish Users.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

New Results on the Complexity of Uniformly Mixed Nash Equilibria.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
A Java-based system for building animated presentations over the Web.
Sci. Comput. Program., 2004

2001
S.P.Q.R. Legged Team.
Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001


  Loading...