Daniel P. Bovet - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2008

Hard Real-Time Performances in Multiprocessor-Embedded Systems Using ASMP-LinuxEmiliano Betti, Daniel P. Bovet, Marco Cesati, Roberto Gioiosa. ejes, 2008, 2008. [doi]

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, 2005. [doi]

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, 2002. [doi]

2001

A Real Bottom-Up Operatiing Systems CourseDaniel P. Bovet, Marco Cesati. sigops, 35(1):48-60, 2001.

2000

Understanding the Linux Kernel - from I/O ports to process managementDaniel P. Bovet, Marco Cesati. O Reilly, 2000.

1996

Parallel approximation of optimization problemsDaniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri. scoop 1996: 7-24

1995

Complexity Classes and Sparse OraclesDaniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri. jcss, 50(3):382-390, 1995.

1994

Optimal Centralized Algorithms for Store-and-Forward Deadlock AvoidanceJacek Blazewicz, Daniel P. Bovet, J. Brzezinski, Giorgio Gambosi, Maurizio Talamo. TC, 43(11):1333-1338, 1994.

Introduction to the theory of complexityDaniel P. Bovet, Pierluigi Crescenzi. Prentice Hall international series in computer science, Prentice Hall, 1994.

1992

On the Regularity of Languages on a Binary Alphabet Generated by Copying SystemsDaniel P. Bovet, Stefano Varricchio. ipl, 44(3):119-123, 1992.

A Uniform Approach to Define Complexity ClassesDaniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri. TCS, 104(2):263-283, 1992.

1991

Minimum-Delay Schedules in Layered NetworksDaniel P. Bovet, Pierluigi Crescenzi. ACTA, 28(5):453-461, 1991.

Complexity Classes and Sparse OraclesDaniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri. cocoon 1991: 102-108

1990

Deadlock Prediction in the Case of Dynamic RoutingDaniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi. ijfcs, 1(3):185-200, 1990.

1988

Parallelism and the Feedback Vertex Set ProblemDaniel P. Bovet, Sergio De Agostino, Rossella Petreschi. ipl, 28(2):81-85, 1988.

1987

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

On the Number of Switching Modes Generated by Time-Optimal Algorithms for SS/TDMA SystemsGiancarlo Bongiovanni, Daniel P. Bovet. tcom, 35(3):359-362, 1987. [doi]

1984

Deadlock-Resistant Flow Control Procedures for Store-and-Forward NetworksJacek Blazewicz, Daniel P. Bovet, Giorgio Gambosi. tcom, 32(8):884-887, 1984. [doi]

1979

Minimum Node Disjoint Path Covering for Circular-Arc GraphsMaurizio A. Bonuccelli, Daniel P. Bovet. ipl, 8(4):159-161, 1979.

1970

Legality and Other Properties of Graph Models of ComputationsJean-Loup Baer, Daniel P. Bovet, Gerald Estrin. JACM, 17(3):543-554, 1970. [doi]

On Static Memory Allocation in Computer SystemsDaniel P. Bovet, Gerald Estrin. TC, 19(6):492-503, 1970. [doi]

A Dynamic Memory Allocation AlgorithmDaniel P. Bovet, Gerald Estrin. TC, 19(5):403-411, 1970. [doi]

1968

Compilation of arithmetic expressions for parallel computationsJean-Loup Baer, Daniel P. Bovet. ifip 1968: 340-346

Sign in or sign up to see more results.

runs on WebDSL