2009 |
12 | EE | Paolo D'Alberto,
Alexandru Nicolau:
Adaptive Winograd's matrix multiplications.
ACM Trans. Math. Softw. 36(1): (2009) |
2008 |
11 | EE | Franz 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 |
10 | EE | Paolo 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 |
9 | EE | Paolo D'Alberto,
Markus Püschel,
Franz Franchetti:
Performance/Energy Optimization of DSP Transforms on the XScale Processor.
HiPEAC 2007: 201-214 |
8 | EE | Paolo D'Alberto,
Alexandru Nicolau:
Adaptive Strassen's matrix multiplication.
ICS 2007: 284-292 |
7 | EE | Paolo 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 |
6 | EE | Paolo 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 |
5 | EE | Arun Kejariwal,
Paolo D'Alberto,
Alexandru Nicolau,
Constantine D. Polychronopoulos:
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces.
LCPC 2004: 102-116 |
4 | EE | Paolo D'Alberto,
Alexandru Nicolau:
JuliusC: A Practical Approach for the Analysis of Divide-and-Conquer Algorithms.
LCPC 2004: 117-131 |
2003 |
3 | EE | Paolo D'Alberto,
Alexandru Nicolau,
Alexander V. Veidenbaum:
A Data Cache with Dynamic Mapping.
LCPC 2003: 436-450 |
2001 |
2 | EE | Gianfranco Bilardi,
Paolo D'Alberto,
Alexandru Nicolau:
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance.
Algorithm Engineering 2001: 26-38 |
2000 |
1 | EE | Gianfranco Bilardi,
Andrea Pietracaprina,
Paolo D'Alberto:
On the Space and Access Complexity of Computation DAGs.
WG 2000: 47-58 |