![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Daniel P. Bovet
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j16]Emiliano Betti, Daniel P. Bovet, Marco Cesati
, Roberto Gioiosa:
Hard Real-Time Performances in Multiprocessor-Embedded Systems Using ASMP-Linux. EURASIP J. Embed. Syst. 2008 (2008) - 2005
- [b4]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 - 2002
- [b3]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 - 2001
- [j15]Daniel P. Bovet, Marco Cesati
:
A Real Bottom-Up Operatiing Systems Course. ACM SIGOPS Oper. Syst. Rev. 35(1): 48-60 (2001) - 2000
- [b2]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
1990 – 1999
- 1997
- [e1]Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista:
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 [contents] - 1996
- [c3]Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 - 1995
- [j14]Daniel P. Bovet, Pierluigi Crescenzi
, Riccardo Silvestri:
Complexity Classes and Sparse Oracles. J. Comput. Syst. Sci. 50(3): 382-390 (1995) - 1994
- [b1]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 - [j13]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) - 1992
- [j12]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) - [j11]Daniel P. Bovet, Pierluigi Crescenzi
, Riccardo Silvestri:
A Uniform Approach to Define Complexity Classes. Theor. Comput. Sci. 104(2): 263-283 (1992) - 1991
- [j10]Daniel P. Bovet, Pierluigi Crescenzi
:
Minimum-Delay Schedules in Layered Networks. Acta Informatica 28(5): 453-461 (1991) - [c2]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
Complexity Classes and Sparse Oracles. SCT 1991: 102-108 - 1990
- [j9]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)
1980 – 1989
- 1988
- [j8]Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi:
Parallelism and the Feedback Vertex Set Problem. Inf. Process. Lett. 28(2): 81-85 (1988) - 1987
- [j7]Gian Carlo Bongiovanni, Daniel P. Bovet:
Minimal deadlock-free store-and-forward communication networks. Networks 17(2): 187-200 (1987) - [j6]Giancarlo Bongiovanni, Daniel P. Bovet:
On the Number of Switching Modes Generated by Time-Optimal Algorithms for SS/TDMA Systems. IEEE Trans. Commun. 35(3): 359-362 (1987) - 1984
- [j5]Jacek Blazewicz
, Daniel P. Bovet, Giorgio Gambosi:
Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks. IEEE Trans. Commun. 32(8): 884-887 (1984)
1970 – 1979
- 1979
- [j4]Maurizio A. Bonuccelli, Daniel P. Bovet:
Minimum Node Disjoint Path Covering for Circular-Arc Graphs. Inf. Process. Lett. 8(4): 159-161 (1979) - 1970
- [j3]Jean-Loup Baer, Daniel P. Bovet, Gerald Estrin:
Legality and Other Properties of Graph Models of Computations. J. ACM 17(3): 543-554 (1970) - [j2]Daniel P. Bovet, Gerald Estrin:
A Dynamic Memory Allocation Algorithm. IEEE Trans. Computers 19(5): 403-411 (1970) - [j1]Daniel P. Bovet, Gerald Estrin:
On Static Memory Allocation in Computer Systems. IEEE Trans. Computers 19(6): 492-503 (1970)
1960 – 1969
- 1968
- [c1]Jean-Loup Baer, Daniel P. Bovet:
Compilation of arithmetic expressions for parallel computations. IFIP Congress (1) 1968: 340-346
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint