MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Gianfranco Bilardi – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

16 documents found, showing 1 through 10. Next 10 →

ATOM

The Static Single Assignment Form and its Computation
by Gianfranco Bilardi, Keshav Pingali — 1999
…The Static Single Assignment Form and its Computation Gianfranco Bilardi Keshav Pingali DEI…
Cited by 1 (0 self) – Add To MetaCart

Optimal Control Dependence Computation and the Roman Chariots Problem
by Keshav Pingali, Gianfranco Bilardi — 1997 — ACM Transactions on Programming Languages and Systems
… University and GIANFRANCO BILARDI Universit`a di Padova, Italy, and University of Illinois, Chicago…
Cited by 15 (3 self) – Add To MetaCart

Fractal matrix multiplication: a case study on portability of cache performance
by Gianfranco Bilardi, Alex Nicolau — 2001 — in Workshop on Algorithm Engineering 2001
… Fractal Matrix Multiplication: a Case Study on Portability of Cache Performance Gianfranco…
Cited by 13 (1 self) – Add To MetaCart

BSP vs LogP
by Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul Spirakis, Prof Gianfranco Bilardi — 1996
…BSP vs LogP 1 Gianfranco Bilardi 2;3 Kieran T. Herley 4 Andrea Pietracaprina 5 Geppino Pucci…
Cited by 25 (3 self) – Add To MetaCart

Horizons of Parallel Computation
by Gianfranco Bilardi, Gianfranco Bilardi, Franco P. Preparata, Franco P. Preparata — 1993 — Journal of Parallel and Distributed Computing
…Horizons of Parallel Computation Gianfranco Bilardi and Franco P. Preparata Department of Computer…
Cited by 38 (2 self) – Add To MetaCart

Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
by Franco Preparata, Gianfranco Bilardi, Gianfranco Bilardi, Franco P. Preparata — 1995 — Theory of Computing Systems
… Propagation: Part I, Upper Bounds Gianfranco Bilardi Franco P. Preparata y Abstract Upper bounds…
Cited by 5 (2 self) – Add To MetaCart

On the effectiveness of D-BSP as a bridging model of parallel computation
by Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci — 2001 — IN PROC. OF THE INT. CONFERENCE ON COMPUTATIONAL SCIENCE, LNCS 2074
…On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation ? Gianfranco Bilardi…
Cited by 6 (3 self) – Add To MetaCart

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing (Extended Abstract)
by Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci — 1999 — In Proc. of EUROPAR 99, LNCS 1685
… Computing ? (Extended Abstract) Gianfranco Bilardi, Andrea Pietracaprina, and Geppino Pucci Dipartimento…
Cited by 9 (8 self) – Add To MetaCart

Network-Oblivious Algorithms
by Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri — 2007 — IN PROC. OF 21ST INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM
…Network-Oblivious Algorithms ∗ Gianfranco Bilardi 1,2 , Andrea Pietracaprina 1 , Geppino Pucci 1…
Cited by 2 (2 self) – Add To MetaCart

A Lower Bound for Area--Universal Graphs
by Gianfranco Bilardi Shiva, Devdatt Dubhashi, K. Mehlhorn — 1994
…A Lower Bound for Area--Universal Graphs Gianfranco Bilardi y Shiva Chaudhuri z Devdatt…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB