Vincenzo Bonifaci

From MaRDI portal
Person:255295

Available identifiers

zbMath Open bonifaci.vincenzoDBLP89/3843WikidataQ102304679 ScholiaQ102304679MaRDI QIDQ255295

List of research outcomes





PublicationDate of PublicationType
Egalitarian roommate allocations: complexity and stability2025-01-08Paper
Physarum-inspired multi-commodity flow dynamics2022-05-17Paper
A Laplacian approach to \(\ell_1\)-norm minimization2021-08-09Paper
Algorithms for hierarchical and semi-partitioned parallel scheduling2021-06-30Paper
On the Convergence Time of a Natural Dynamics for Linear Programming2020-11-25Paper
On the convergence time of a natural dynamics for linear programming2020-04-09Paper
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors2020-01-03Paper
Two results on slime mold computations2019-05-21Paper
\textit{Physarum} can compute shortest paths2019-05-14Paper
https://portal.mardi4nfdi.de/entity/Q57433942019-05-10Paper
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling2017-07-27Paper
Scheduling Real-Time Mixed-Criticality Jobs2017-07-12Paper
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems2017-06-08Paper
A revised model of fluid transport optimization in \textit{Physarum polycephalum}2017-02-10Paper
Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems2016-03-24Paper
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm2016-03-09Paper
Algorithms and complexity for periodic real-time scheduling2014-12-05Paper
Minimizing flow time in the wireless gathering problem2014-09-09Paper
Partitioned EDF scheduling on a few types of unrelated multiprocessors2014-07-14Paper
https://portal.mardi4nfdi.de/entity/Q54177132014-05-22Paper
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds2013-08-07Paper
Physarum can compute shortest paths: a short proof2013-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49107122013-03-19Paper
Feasibility analysis of sporadic real-time multiprocessor task systems2012-12-06Paper
Complexity and approximation in reoptimization2012-09-05Paper
A constant-approximate feasibility test for multiprocessor real-time scheduling2012-04-26Paper
Efficiency of Restricted Tolls in Non-atomic Network Routing Games2011-10-28Paper
Mixed-Criticality Scheduling of Sporadic Task Systems2011-09-16Paper
Budgeted matching and budgeted matroid intersection via the gasoline puzzle2011-06-17Paper
Stackelberg Routing in Arbitrary Networks2011-04-27Paper
The distributed wireless gathering problem2011-02-21Paper
Improved multiprocessor global schedulability analysis2010-09-20Paper
Feasibility analysis of sporadic real-time multiprocessor task systems2010-09-06Paper
Scheduling Real-Time Mixed-Criticality Jobs2010-09-03Paper
The online prize-collecting traveling salesman problem2010-04-19Paper
Data Gathering in Wireless Networks2010-02-09Paper
Online \(k\)-server routing problems2009-09-02Paper
On the power of lookahead in on-line server routing problems2008-12-12Paper
An approximation algorithm for the wireless gathering problem2008-11-27Paper
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling2008-11-25Paper
The on-line asymmetric traveling salesman problem2008-08-08Paper
The complexity of uniform Nash equilibria and related regular subgraph problems2008-07-31Paper
The Distributed Wireless Gathering Problem2008-07-10Paper
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle2008-06-10Paper
Online k-Server Routing Problems2008-02-21Paper
An Approximation Algorithm for the Wireless Gathering Problem2007-09-07Paper
An adversarial queueing model for online server routing2007-09-03Paper
Theory and Applications of Models of Computation2007-04-30Paper
Algorithms and Data Structures2006-10-25Paper
Fundamentals of Computation Theory2006-10-20Paper
https://portal.mardi4nfdi.de/entity/Q30473092004-08-12Paper

Research outcomes over time

This page was built for person: Vincenzo Bonifaci