Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bonuccelli, Maurizio A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of minimum length scheduling for precedence constrained messages in distributed systems
Piera Barcaccia
,
Maurizio A. Bonuccelli
,
Miriam di Ianni
IEEE Transactions on Parallel and Distributed Systems
11
(10), 2000, pp. 1090-1102
EDD algoritm performance guarantee for periodic hard-real-time scheduling in distributed systems
Maurizio A. Bonuccelli
,
M. Claudia Clò
Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS/SPDP'99 (San Juan, Puerto Rico, April 12-16, 1999)
, 1999, pp. 668-677
Minimum length scheduling of precedence constrained messages in distributed systems
Piera Barcaccia
,
Maurizio A. Bonuccelli
,
Miriam Di Ianni
Lecture Notes in Computer Science
1124
, 1996, pp. 594-601
Reconfigurable tree architectures for gracefully degradable VLSI systems
Alan A. Bertossi
,
Maurizio A. Bonuccelli
,
Marco Roccetti
Journal Parallel Distributed Computing
23
(3), 1994, pp. 264-277
Some parallel algorithms on interval graphs
Alan A. Bertossi
,
Maurizio A. Bonuccelli
Discrete Applied Mathematics
16
, 1987, pp. 101-111
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
Alan A. Bertossi
,
Maurizio A. Bonuccelli
Discrete Applied Mathematics
12
, 1985, pp. 195-201
Dominating sets and domatic number of circular arc graphs
Maurizio A. Bonuccelli
Discrete Applied Mathematics
12
, 1985, pp. 203-213
An
O(n^2)
algorithm for coloring proper circular arc graphs
James B. Orlin
,
Maurizio A. Bonuccelli
,
Daniel P. Bovet
SIAM Journal on Algebraic Discrete Methods
2
(2), 1981, June, pp. 88-93