Daniel P. Bovet

According to our database1, Daniel P. Bovet
  • authored at least 23 papers between 1968 and 2008.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2008
Hard Real-Time Performances in Multiprocessor-Embedded Systems Using ASMP-Linux.
EURASIP J. Emb. Sys., 2008

2005
Understanding the Linux Kernel - from I/O ports to process management: covers version 2.6 (3. ed.).
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.).
O'Reilly, ISBN: 978-0-596-00213-8, 2002

2001
A Real Bottom-Up Operatiing Systems Course.
Operating Systems Review, 2001

2000
Understanding the Linux Kernel - from I/O ports to process management.
O'Reilly, ISBN: 978-0-596-00002-8, 2000

1996
Parallel approximation of optimization problems.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

1995
Complexity Classes and Sparse Oracles.
J. Comput. Syst. Sci., 1995

1994
Optimal Centralized Algorithms for Store-and-Forward Deadlock Avoidance.
IEEE Trans. Computers, 1994

Introduction to the theory of complexity.
Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-915380-8, 1994

1992
A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci., 1992

On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.
Inf. Process. Lett., 1992

1991
Minimum-Delay Schedules in Layered Networks.
Acta Inf., 1991

Complexity Classes and Sparse Oracles.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990
Deadlock Prediction in the Case of Dynamic Routing.
Int. J. Found. Comput. Sci., 1990

1988
Parallelism and the Feedback Vertex Set Problem.
Inf. Process. Lett., 1988

1987
On the Number of Switching Modes Generated by Time-Optimal Algorithms for SS/TDMA Systems.
IEEE Trans. Communications, 1987

Minimal deadlock-free store-and-forward communication networks.
Networks, 1987

1984
Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks.
IEEE Trans. Communications, 1984

1979
Minimum Node Disjoint Path Covering for Circular-Arc Graphs.
Inf. Process. Lett., 1979

1970
On Static Memory Allocation in Computer Systems.
IEEE Trans. Computers, 1970

A Dynamic Memory Allocation Algorithm.
IEEE Trans. Computers, 1970

Legality and Other Properties of Graph Models of Computations.
J. ACM, 1970

1968
Compilation of arithmetic expressions for parallel computations.
IFIP Congress (1), 1968


  Loading...