Marco Cesati

Bhavishya Goel, Sally A. McKee, Roberto Gioiosa, Karan Singh, Major Bhadauria, Marco Cesati: Portable, scalable, per-core power estimation for intelligent resource management. Green Computing Conference 2010: 135-146

Emiliano Betti, Marco Cesati, Roberto Gioiosa, Francesco Piermaria: A global operating system for HPC clusters. CLUSTER 2009: 1-10

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)

Emanuele Di Saverio, Marco Cesati, Christian Di Biagio, Guido Pennella, Christian Engelmann: Distributed Real-Time Computing with Harness. PVM/MPI 2007: 281-288

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

Marco Cesati: The Turing way to parameterized complexity. J. Comput. Syst. Sci. 67(4): 654-685 (2003)

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

Marco Cesati: Perfect Code is W[1]-complete. Inf. Process. Lett. 81(3): 163-168 (2002)

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

Marco Cesati: Perfect Code is W[1]-complete. Electronic Colloquium on Computational Complexity (ECCC) 7(80) (2000)

Marco Cesati, Miriam Di Ianni: Parameterized Parallel Complexity. Euro-Par 1998: 892-896

Marco Cesati, Luca Trevisan: On the Efficiency of Polynomial Time Approximation Schemes. Inf. Process. Lett. 64(4): 165-171 (1997)

Marco Cesati, Miriam Di Ianni: Computation Models for Parameterized Complexity. Math. Log. Q. 43: 179-202 (1997)

Marco Cesati, Luca Trevisan: On the Efficiency of Polynomial Time Approximation Schemes. Electronic Colloquium on Computational Complexity (ECCC) 4(1) (1997)

Marco Cesati, Miriam Di Ianni: Parameterized Parallel Complexity. Electronic Colloquium on Computational Complexity (ECCC) 4(6) (1997)

Marco Cesati, Michael R. Fellows: Sparse Parameterized Problems. Ann. Pure Appl. Logic 82(1): 1-15 (1996)