Daniel P. Bovet

Emiliano Betti, Daniel P. Bovet, Marco Cesati, Roberto Gioiosa: Hard Real-Time Performances in Multiprocessor-Embedded Systems Using ASMP-Linux. EURASIP J. Emb. Sys. 2008 (2008)

Daniel P. Bovet, Marco Cesati: Understanding the Linux Kernel - from I/O ports to process management: covers version 2.6 (3. ed.). O'Reilly 2005, isbn 978-0-596-00565-8, pp. I-XVI, 1-923

Daniel P. Bovet, Marco Cesati: Understanding the Linux Kernel - from I / O ports to process management: covers Linux Kernel version 2.4 (2. ed.). O'Reilly 2002, isbn 978-0-596-00213-8, pp. I-XV, 1-765

Daniel P. Bovet, Marco Cesati: A Real Bottom-Up Operatiing Systems Course. Operating Systems Review 35(1): 48-60 (2001)

Daniel P. Bovet, Marco Cesati: Understanding the Linux Kernel - from I/O ports to process management. O'Reilly 2000, isbn 978-0-596-00002-8, pp. I-XVI, 1-684

Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista (Eds.): Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings. Lecture Notes in Computer Science 1203, Springer 1997, isbn 3-540-62592-5

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

Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: Complexity Classes and Sparse Oracles. J. Comput. Syst. Sci. 50(3): 382-390 (1995)

Daniel P. Bovet, Pierluigi Crescenzi: Introduction to the theory of complexity. Prentice Hall international series in computer science, Prentice Hall 1994, isbn 978-0-13-915380-8, pp. I-XI, 1-282

Jacek Blazewicz, Daniel P. Bovet, Jerzy Brzezinski, Giorgio Gambosi, Maurizio Talamo: Optimal Centralized Algorithms for Store-and-Forward Deadlock Avoidance. IEEE Trans. Computers 43(11): 1333-1338 (1994)

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)

Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: A Uniform Approach to Define Complexity Classes. Theor. Comput. Sci. 104(2): 263-283 (1992)

Daniel P. Bovet, Pierluigi Crescenzi: Minimum-Delay Schedules in Layered Networks. Acta Inf. 28(5): 453-461 (1991)

Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: Complexity Classes and Sparse Oracles. Structure in Complexity Theory Conference 1991: 102-108

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)

Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi: Parallelism and the Feedback Vertex Set Problem. Inf. Process. Lett. 28(2): 81-85 (1988)

Gian Carlo Bongiovanni, Daniel P. Bovet: Minimal deadlock-free store-and-forward communication networks. Networks 17(2): 187-200 (1987)

Maurizio A. Bonuccelli, Daniel P. Bovet: Minimum Node Disjoint Path Covering for Circular-Arc Graphs. Inf. Process. Lett. 8(4): 159-161 (1979)

Jean-Loup Baer, Daniel P. Bovet, Gerald Estrin: Legality and Other Properties of Graph Models of Computations. J. ACM 17(3): 543-554 (1970)

Jean-Loup Baer, Daniel P. Bovet: Compilation of arithmetic expressions for parallel computations. IFIP Congress (1) 1968: 340-346