dblp.uni-trier.dewww.uni-trier.de

Paolo D'Alberto

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
12EEPaolo D'Alberto, Alexandru Nicolau: Adaptive Winograd's matrix multiplications. ACM Trans. Math. Softw. 36(1): (2009)
2008
11EEFranz Franchetti, Yevgen Voronenko, Peter A. Milder, Srinivas Chellappa, Marek R. Telgarsky, Hao Shen, Paolo D'Alberto, Frédéric de Mesmay, James C. Hoe, José M. F. Moura, Markus Püschel: Domain-specific library generation for parallel software and hardware platforms. IPDPS 2008: 1-5
2007
10EEPaolo D'Alberto, Peter A. Milder, Aliaksei Sandryhaila, Franz Franchetti, James C. Hoe, José M. F. Moura, Markus Püschel, Jeremy R. Johnson: Generating FPGA-Accelerated DFT Libraries. FCCM 2007: 173-184
9EEPaolo D'Alberto, Markus Püschel, Franz Franchetti: Performance/Energy Optimization of DSP Transforms on the XScale Processor. HiPEAC 2007: 201-214
8EEPaolo D'Alberto, Alexandru Nicolau: Adaptive Strassen's matrix multiplication. ICS 2007: 284-292
7EEPaolo D'Alberto, Alexandru Nicolau: R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks. Algorithmica 47(2): 203-213 (2007)
2005
6EEPaolo D'Alberto, Alexandru Nicolau, Alexander V. Veidenbaum, Rajesh K. Gupta: Line Size Adaptivity Analysis of Parameterized Loop Nests for Direct Mapped Data Cache. IEEE Trans. Computers 54(2): 185-197 (2005)
2004
5EEArun Kejariwal, Paolo D'Alberto, Alexandru Nicolau, Constantine D. Polychronopoulos: A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces. LCPC 2004: 102-116
4EEPaolo D'Alberto, Alexandru Nicolau: JuliusC: A Practical Approach for the Analysis of Divide-and-Conquer Algorithms. LCPC 2004: 117-131
2003
3EEPaolo D'Alberto, Alexandru Nicolau, Alexander V. Veidenbaum: A Data Cache with Dynamic Mapping. LCPC 2003: 436-450
2001
2EEGianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau: Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. Algorithm Engineering 2001: 26-38
2000
1EEGianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto: On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58

Coauthor Index

1Gianfranco Bilardi [1] [2]
2Srinivas Chellappa [11]
3Franz Franchetti [9] [10] [11]
4Rajesh K. Gupta (Rajesh Gupta) [6]
5James C. Hoe [10] [11]
6Jeremy R. Johnson [10]
7Arun Kejariwal [5]
8Frédéric de Mesmay [11]
9Peter A. Milder [10] [11]
10José M. F. Moura [10] [11]
11Alexandru Nicolau (Alex Nicolau) [2] [3] [4] [5] [6] [7] [8] [12]
12Andrea Pietracaprina [1]
13Constantine D. Polychronopoulos [5]
14Markus Püschel [9] [10] [11]
15Aliaksei Sandryhaila [10]
16Hao Shen [11]
17Marek R. Telgarsky [11]
18Alexander V. Veidenbaum [3] [6]
19Yevgen Voronenko [11]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)