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

Gianfranco Bilardi Vis

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

*2009
68EEGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: On approximating the ideal random access machine by physical machines. J. ACM 56(5): (2009)
2008
67 Alex Ramírez, Gianfranco Bilardi, Michael Gschwind: Proceedings of the 5th Conference on Computing Frontiers, 2008, Ischia, Italy, May 5-7, 2008 ACM 2008
66EEGianfranco Bilardi: Models for Parallel and Hierarchical On-Chip Computation. Euro-Par Workshops 2008: 127-128
65EESandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008)
2007
64EEGianfranco Bilardi: Models for parallel and hierarchical computation. Conf. Computing Frontiers 2007: 95-96
63EEGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri: Network-Oblivious Algorithms. IPDPS 2007: 1-10
2005
62EEGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione: The Potential of On-Chip Multiprocessing for QCD Machines. HiPC 2005: 386-397
61EEGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer. IPDPS 2005
60EEGianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On stalling in LogP. J. Parallel Distrib. Comput. 65(3): 307-312 (2005)
2003
59EEGianfranco Bilardi, Keshav Pingali: Algorithms for computing the static single assignment form. J. ACM 50(3): 375-425 (2003)
58EEGianfranco Bilardi, Giuseppe F. Italiano: Preface. J. Algorithms 49(1): 1 (2003)
2002
57EEMauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler: An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems. International Conference on Computational Science (1) 2002: 733-742
56EEGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: Optimal organizations for pipelined hierarchical memories. SPAA 2002: 109-116
2001
55EEGianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau: Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. Algorithm Engineering 2001: 26-38
54EEGianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs: Topic 06: Complexity Theory and Algorithms. Euro-Par 2001: 332
53EEGianfranco Bilardi, Enoch Peserico: A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. ICALP 2001: 128-139
52EEGianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. International Conference on Computational Science (2) 2001: 579-588
51EEGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: Computational power of pipelined memory hierarchies. SPAA 2001: 144-152
2000
50EEGianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On Stalling in LogP. IPDPS Workshops 2000: 109-115
49EEGianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto: On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58
1999
48EESandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-Universal Circuits with Constant Slowdown. ARVLSI 1999: 89-98
47EEGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci: A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par 1999: 543-551
46EEGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis: BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999)
45EEGianfranco Bilardi, Franco P. Preparata: Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. Theory Comput. Syst. 32(5): 531-559 (1999)
1998
44 Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings Springer 1998
43 Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. J. Parallel Distrib. Comput. 51(2): 75-88 (1998)
1997
42 Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim: Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings Springer 1997
41EEGianfranco Bilardi: Algorithms and Data Structures for Control Dependence and Related Compiler Problems. CIAC 1997: 1-2
40EEGianfranco Bilardi, Bruno Codenotti, G. Del Corso, Maria Cristina Pinotti, Giovanni Resta: Broadcast and Associative Operations on Fat-Trees. Euro-Par 1997: 196-207
39 Gianfranco Bilardi, Alexandru Nicolau, Joseph Hummel: A Systematic Approach to Branch Speculation. LCPC 1997: 394-411
38EEKeshav Pingali, Gianfranco Bilardi: Optimal Control Dependence Computation and the Roman Chariots Problem. ACM Trans. Program. Lang. Syst. 19(3): 462-491 (1997)
37 Gianfranco Bilardi, Franco P. Preparata: Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Syst. 30(6): 523-546 (1997)
1996
36 Gianfranco Bilardi, Keshav Pingali: Generalized Dominance and Control Dependence. PLDI 1996: 291-300
35 Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis: BSP vs LogP. SPAA 1996: 25-32
34 Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable Length Messages in Leveled Networks. IEEE Trans. Computers 45(6): 714-729 (1996)
1995
33EESandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242
32EEAlberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo: An International Masters in Software Engineering: Experience and Prospects. ICDE 1995: 556-557
31 Keshav Pingali, Gianfranco Bilardi: APT: A Data Structure for Optimal Control Dependence Computation. PLDI 1995: 32-46
30EEGianfranco Bilardi, Franco P. Preparata: Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. SPAA 1995: 185-194
29 Gianfranco Bilardi, Franco P. Preparata: Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS 1995: 1-12
28EEPaul Bay, Gianfranco Bilardi: Deterministic On-Line Routing on Area-Universal Networks. J. ACM 42(3): 614-640 (1995)
27 Gianfranco Bilardi, Franco P. Preparata: Horizons of Parallel Computation. J. Parallel Distrib. Comput. 27(2): 172-182 (1995)
26EEShyam Kapur, Gianfranco Bilardi: Language Learning Without Overgeneralization. Theor. Comput. Sci. 141(1&2): 151-162 (1995)
1994
25EEGianfranco Bilardi, Paul Bay: An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). ESA 1994: 413-423
24 Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn: A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994)
23 Kieran T. Herley, Gianfranco Bilardi: Deterministic Simulations of PRAMs on Bounded Degree Networks. SIAM J. Comput. 23(2): 276-292 (1994)
1993
22EESandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). ESA 1993: 49-60
1992
21 Franco P. Preparata, Gianfranco Bilardi: Horizons of Parallel Computation. 25th Anniversary of INRIA 1992: 155-174
20EEShyam Kapur, Gianfranco Bilardi: Language Learning from Stochastic Input. COLT 1992: 303-310
19EEShyam Kapur, Gianfranco Bilardi: Language Learning without Overgeneralization. STACS 1992: 245-256
18 Shyam Kapur, Gianfranco Bilardi: On Uniform Learnability of Language Families. Inf. Process. Lett. 44(1): 35-38 (1992)
1990
17 Paul Bay, Gianfranco Bilardi: Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) FOCS 1990: 297-306
16 Gianfranco Bilardi, Franco P. Preparata: Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. SIAM J. Comput. 19(2): 246-255 (1990)
1989
15EEGianfranco Bilardi, Abha Moitra: Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. ICALP 1989: 95-107
14EEGianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh: Optimal VLSI Architectures for Multidimensional DFT. SPAA 1989: 265-272
13 Gianfranco Bilardi: Merging and Sorting Networks with the Topology of the Omega Network. IEEE Trans. Computers 38(10): 1396-1403 (1989)
12EEGianfranco Bilardi, Franco P. Preparata: Size-time complexity of Boolean networks for prefix computations. J. ACM 36(2): 362-382 (1989)
11 Gianfranco Bilardi, Alexandru Nicolau: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. SIAM J. Comput. 18(2): 216-228 (1989)
1987
10 Gianfranco Bilardi, Franco P. Preparata: Size-Time Complexity of Boolean Networks for Prefix Computations STOC 1987: 436-442
1986
9 Gianfranco Bilardi, Franco P. Preparata: Digital Filtering in VLSI. Aegean Workshop on Computing 1986: 1-11
8 Gianfranco Bilardi, Franco P. Preparata: Area-Time Lower-Bound Techniques with Applications to Sorting. Algorithmica 1(1): 65-91 (1986)
1985
7EEGianfranco Bilardi, Franco P. Preparata: The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP 1985: 53-62
6 Gianfranco Bilardi, Franco P. Preparata: A Minimum Area VLSI Network for O(log n) Time Sorting. IEEE Trans. Computers 34(4): 336-343 (1985)
5 Gianfranco Bilardi, Gianfranco Cariolaro, R. Cristi: Mean value of the output of a discrete-time Volterra system driven by a Markov chain. IEEE Transactions on Information Theory 31(6): 838- (1985)
4 Gianfranco Bilardi, Franco P. Preparata: The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. 20(2): 55-59 (1985)
1984
3 Gianfranco Bilardi, Franco P. Preparata: A Minimum Area VLSI Network for O(log n) Time Sorting STOC 1984: 64-70
2 Gianfranco Bilardi, Franco P. Preparata: An Architecture for Bitonic Sorting with Optimal VLSI Performance. IEEE Trans. Computers 33(7): 646-651 (1984)
1 Gianfranco Bilardi, Xiaolong Jin: Permutation-Exchange Graphs That Emulate the Binary Cube. Mathematical Systems Theory 17(3): 193-198 (1984)

Coauthor Index

1Alberto Apostolico [32]
2Paul Bay [17] [25] [28]
3Sandeep N. Bhatt [22] [33] [34] [43] [48] [65]
4Mauro Bianco [57]
5Franco Bombi [32]
6Gianfranco Cariolaro [5]
7Shiva Chaudhuri [24]
8Bruno Codenotti [40]
9G. Del Corso [40]
10R. Cristi [5]
11Paolo D'Alberto [49] [55]
12Richard A. DeMillo [32]
13Devdatt P. Dubhashi [24]
14Kattamuri Ekanadham [51] [56] [61] [68]
15Carlo Fantozzi [52]
16Rainer Feldmann [54]
17Afonso Ferreira [42]
18Michael Gschwind [67]
19Kieran T. Herley [23] [33] [35] [43] [46] [50] [54] [60]
20Scot W. Hornick [14]
21Joseph Hummel [39]
22Giuseppe F. Italiano [44] [58]
23Xiaolong Jin [1]
24Shyam Kapur [18] [19] [20] [26]
25Reinhard Lüling [42]
26Bruce M. Maggs [54]
27Kurt Mehlhorn [24]
28Abha Moitra [15]
29Alexandru Nicolau (Alex Nicolau) [11] [39] [55]
30Pratap Pattnaik [51] [56] [61] [68]
31Francesco Pesavento [57]
32Enoch Peserico [53]
33Andrea Pietracaprina [35] [44] [46] [47] [49] [50] [52] [60] [62] [63]
34Keshav Pingali [31] [36] [38] [59]
35Maria Cristina Pinotti [40]
36Franco P. Preparata [2] [3] [4] [6] [7] [8] [9] [10] [12] [16] [21] [27] [29] [30] [37] [45]
37Geppino Pucci [22] [33] [34] [35] [43] [44] [46] [47] [48] [50] [52] [57] [60] [62] [63] [65]
38Alex Ramírez [67]
39Abhiram G. Ranade [22] [33] [34] [43]
40Giovanni Resta [40]
41José D. P. Rolim [42]
42Arnold L. Rosenberg [22] [34]
43Majid Sarrafzadeh [14]
44Sebastiano Fabio Schifano [62]
45Bernhard A. Schrefler [57]
46Eric J. Schwabe [22] [34]
47Francesco Silvestri [63]
48Paul G. Spirakis [35] [46]
49Raffaele Tripiccione [62]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)