Daniel P. Bovet

According to our database, Daniel P. Bovet authored at least 22 papers between 1968 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2008

Hard Real-Time Performances in Multiprocessor-Embedded Systems Using ASMP-Linux.

Emiliano Betti, Daniel P. Bovet, Marco Cesati, Roberto Gioiosa

EURASIP J. Embed. Syst., 2008

2005

Understanding the Linux Kernel - from I/O ports to process management: covers version 2.6 (3. ed.).

Daniel P. Bovet, Marco Cesati

O'Reilly, ISBN: 978-0-596-00565-8, 2005

2002

Understanding the Linux Kernel - from I / O ports to process management: covers Linux Kernel version 2.4 (2. ed.).

Daniel P. Bovet, Marco Cesati

O'Reilly, ISBN: 978-0-596-00213-8, 2002

2001

A Real Bottom-Up Operatiing Systems Course.

Daniel P. Bovet, Marco Cesati

ACM SIGOPS Oper. Syst. Rev., 2001

2000

Understanding the Linux Kernel - from I/O ports to process management.

Daniel P. Bovet, Marco Cesati

O'Reilly, ISBN: 978-0-596-00002-8, 2000

1996

Parallel approximation of optimization problems.

Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

1995

Complexity Classes and Sparse Oracles.

Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri

J. Comput. Syst. Sci., 1995

1994

Optimal Centralized Algorithms for Store-and-Forward Deadlock Avoidance.

Jacek Blazewicz, Daniel P. Bovet, Jerzy Brzezinski, Giorgio Gambosi, Maurizio Talamo

IEEE Trans. Computers, 1994

Introduction to the theory of complexity.

Daniel P. Bovet, Pierluigi Crescenzi

Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-915380-8, 1994

1992

A Uniform Approach to Define Complexity Classes.

Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri

Theor. Comput. Sci., 1992

On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.

Daniel P. Bovet, Stefano Varricchio

Inf. Process. Lett., 1992

1991

Minimum-Delay Schedules in Layered Networks.

Daniel P. Bovet, Pierluigi Crescenzi

Acta Informatica, 1991

1990

Deadlock Prediction in the Case of Dynamic Routing.

Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi

Int. J. Found. Comput. Sci., 1990

1988

Parallelism and the Feedback Vertex Set Problem.

Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi

Inf. Process. Lett., 1988

1987

On the Number of Switching Modes Generated by Time-Optimal Algorithms for SS/TDMA Systems.

Giancarlo Bongiovanni, Daniel P. Bovet

IEEE Trans. Commun., 1987

Minimal deadlock-free store-and-forward communication networks.

Gian Carlo Bongiovanni, Daniel P. Bovet

Networks, 1987

1984

Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks.

Jacek Blazewicz, Daniel P. Bovet, Giorgio Gambosi

IEEE Trans. Commun., 1984

1979

Minimum Node Disjoint Path Covering for Circular-Arc Graphs.

Maurizio A. Bonuccelli, Daniel P. Bovet

Inf. Process. Lett., 1979

1970

On Static Memory Allocation in Computer Systems.

Daniel P. Bovet, Gerald Estrin

IEEE Trans. Computers, 1970

A Dynamic Memory Allocation Algorithm.

Daniel P. Bovet, Gerald Estrin

IEEE Trans. Computers, 1970

Legality and Other Properties of Graph Models of Computations.

Jean-Loup Baer, Daniel P. Bovet, Gerald Estrin

J. ACM, 1970

1968

Compilation of arithmetic expressions for parallel computations.

Jean-Loup Baer, Daniel P. Bovet

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968