팔로우
Gianfranco Bilardi
Gianfranco Bilardi
Professor of Computer Science and Engineering, University of Padova
dei.unipd.it의 이메일 확인됨
제목
인용
인용
연도
Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines
G Bilardi, A Nicolau
SIAM Journal on Computing 18 (2), 216-228, 1989
1821989
BSP vs LogP
G Bilardi, KT Herley, A Pietracaprina, G Pucci, P Spirakis
Proceedings of the eighth annual ACM symposium on Parallel algorithms and …, 1996
142*1996
Horizons of parallel computation
G Bilardi, FP Preparata
Journal of Parallel and Distributed Computing 27 (2), 172-182, 1995
1101995
Algorithms for computing the static single assignment form
G Bilardi, K Pingali
Journal of the ACM (JACM) 50 (3), 375-425, 2003
862003
Spectral analysis of functions of Markov chains with applications
G Bilardi, R Padovani, G Pierobon
IEEE Transactions on Communications 31 (7), 853-861, 1983
831983
Optimal control dependence computation and the Roman chariots problem
K Pingali, G Bilardi
ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (3), 462-491, 1997
821997
A critique of network speed in VLSI models of computation
G Bilardi, M Pracchi, FP Preparata
IEEE Journal of Solid-State Circuits 17 (4), 696-702, 1982
801982
A critique and an appraisal of VLSI models of computation
G Bilardi, M Pracchi, FP Preparata
VLSI Systems and Computations, 81-88, 1981
731981
A minimum area VLSI network for O (logn) time sorting
G Bilardi, FP Preparata
Proceedings of the sixteenth annual ACM symposium on Theory of computing, 64-70, 1984
711984
A frontal solver tuned for fully coupled non‐linear hygro‐thermo‐mechanical problems
M Bianco, G Bilardi, F Pesavento, G Pucci, BA Schrefler
International Journal for Numerical Methods in Engineering 57 (13), 1801-1818, 2003
632003
A framework for generalized control dependence
G Bilardi, K Pingali
Proceedings of the ACM SIGPLAN 1996 conference on Programming language …, 1996
591996
Deterministic simulations of PRAMs on bounded degree networks
KT Herley, G Bilardi
SIAM Journal on Computing 23 (2), 276-292, 1994
591994
Area-time lower-bound techniques with applications to sorting
G Bilardi, FP Preparata
Algorithmica 1, 65-91, 1986
481986
A characterization of temporal locality and its portability across memory hierarchies
G Bilardi, E Peserico
International Colloquium on Automata, Languages, and Programming, 128-139, 2001
472001
Merging and sorting networks with the topology of the Omega network
G Bilardi
Cornell University, 1987
461987
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds
G Bilardi, FP Preparata
Theory of Computing Systems 32 (5), 531-559, 1999
451999
An architecture for bitonic sorting with optimal VLSI performnance
G Bilardi, FP Preparata
IEEE transactions on computers 100 (7), 646-651, 1984
411984
APT: A data structure for optimal control dependence computation
K Pingali, G Bilardi
Proceedings of the ACM SIGPLAN 1995 conference on Programming language …, 1995
401995
On the effectiveness of D-BSP as a bridging model of parallel computation
G Bilardi, C Fantozzi, A Pietracaprina, G Pucci
Computational Science-ICCS 2001: International Conference San Francisco, CA …, 2001
392001
On the space and access complexity of computation DAGs
G Bilardi, A Pietracaprina, P D’Alberto
Graph-Theoretic Concepts in Computer Science: 26th International Workshop …, 2000
372000
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20