| 2001 |
|---|
| 14 | | Daniel P. Bovet,
Marco Cesati:
A Real Bottom-Up Operatiing Systems Course.
Operating Systems Review 35(1): 48-60 (2001) |
| 1997 |
|---|
| 13 | | Gian Carlo Bongiovanni,
Daniel P. Bovet,
Giuseppe Di Battista:
Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings
Springer 1997 |
| 1996 |
|---|
| 12 | | Daniel P. Bovet,
Andrea E. F. Clementi,
Pierluigi Crescenzi,
Riccardo Silvestri:
Parallel approximation of optimization problems.
Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 |
| 1995 |
|---|
| 11 | | Daniel P. Bovet,
Pierluigi Crescenzi,
Riccardo Silvestri:
Complexity Classes and Sparse Oracles.
J. Comput. Syst. Sci. 50(3): 382-390 (1995) |
| 1994 |
|---|
| 10 | | Jacek Blazewicz,
Daniel P. Bovet,
J. Brzezinski,
Giorgio Gambosi,
Maurizio Talamo:
Optimal Centralized Algorithms for Store-and-Forward Deadlock Avoidance.
IEEE Trans. Computers 43(11): 1333-1338 (1994) |
| 1992 |
|---|
| 9 | | Daniel P. Bovet,
Stefano Varricchio:
On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.
Inf. Process. Lett. 44(3): 119-123 (1992) |
| 8 | | Daniel P. Bovet,
Pierluigi Crescenzi,
Riccardo Silvestri:
A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci. 104(2): 263-283 (1992) |
| 1991 |
|---|
| 7 | | Daniel P. Bovet,
Pierluigi Crescenzi,
Riccardo Silvestri:
Complexity Classes and Sparse Oracles.
Structure in Complexity Theory Conference 1991: 102-108 |
| 6 | | Daniel P. Bovet,
Pierluigi Crescenzi:
Minimum-Delay Schedules in Layered Networks.
Acta Inf. 28(5): 453-461 (1991) |
| 1990 |
|---|
| 5 | | Daniel P. Bovet,
Miriam Di Ianni,
Pierluigi Crescenzi:
Deadlock Prediction in the Case of Dynamic Routing.
Int. J. Found. Comput. Sci. 1(3): 185-200 (1990) |
| 1988 |
|---|
| 4 | | Daniel P. Bovet,
Sergio De Agostino,
Rossella Petreschi:
Parallelism and the Feedback Vertex Set Problem.
Inf. Process. Lett. 28(2): 81-85 (1988) |
| 1979 |
|---|
| 3 | | Maurizio A. Bonuccelli,
Daniel P. Bovet:
Minimum Node Disjoint Path Covering for Circular-Arc Graphs.
Inf. Process. Lett. 8(4): 159-161 (1979) |
| 1970 |
|---|
| 2 | EE | Jean-Loup Baer,
Daniel P. Bovet,
Gerald Estrin:
Legality and Other Properties of Graph Models of Computations.
J. ACM 17(3): 543-554 (1970) |
| 1968 |
|---|
| 1 | | Jean-Loup Baer,
Daniel P. Bovet:
Compilation of arithmetic expressions for parallel computations.
IFIP Congress (1) 1968: 340-346 |
