Gianfranco Bilardi

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: Efficient Stack Distance Computation for a Class of Priority Replacement Policies. International Journal of Parallel Programming 41(3): 430-468 (2013)

Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri: A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par 2012: 676-687

Utpal Banerjee, Kyle A. Gallivan, Gianfranco Bilardi, Manolis Katevenis (Eds.): International Conference on Supercomputing, ICS'12, Venice, Italy, June 25-29, 2012. ACM 2012, isbn 978-1-4503-1316-2

Gianfranco Bilardi, Carlo Fantozzi: New Area-Time Lower Bounds for the Multidimensional DFT. CATS 2011: 111-120

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: Efficient stack distance computation for priority replacement policies. Conf. Computing Frontiers 2011: 2

Gianfranco Bilardi, Andrea Pietracaprina: Models of Computation, Theoretical. Encyclopedia of Parallel Computing 2011: 1150-1158

Gianfranco Bilardi, Geppino Pucci: Universality in VLSI Computation. Encyclopedia of Parallel Computing 2011: 2112-2118

Gianfranco Bilardi, Francesco Versaci: An Optimal Stack Policy for Paging with Stochastic Inputs. CoRR abs/1109.6643 (2011)

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: On approximating the ideal random access machine by physical machines. J. ACM 56(5) (2009)

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008)

Gianfranco Bilardi: Models for Parallel and Hierarchical On-Chip Computation. Euro-Par Workshops 2008: 127-128

Alex Ramírez, Gianfranco Bilardi, Michael Gschwind (Eds.): Proceedings of the 5th Conference on Computing Frontiers, 2008, Ischia, Italy, May 5-7, 2008. ACM 2008, isbn 978-1-60558-077-7

Gianfranco Bilardi: Models for parallel and hierarchical computation. Conf. Computing Frontiers 2007: 95-96

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri: Network-Oblivious Algorithms. IPDPS 2007: 1-10

Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On stalling in LogP. J. Parallel Distrib. Comput. 65(3): 307-312 (2005)

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione: The Potential of On-Chip Multiprocessing for QCD Machines. HiPC 2005: 386-397

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer. IPDPS 2005

Gianfranco Bilardi, Keshav Pingali: Algorithms for computing the static single assignment form. J. ACM 50(3): 375-425 (2003)

Gianfranco Bilardi, Giuseppe F. Italiano: Preface. J. Algorithms 49(1): 1 (2003)

Mauro 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

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: Optimal organizations for pipelined hierarchical memories. SPAA 2002: 109-116

Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs: Topic 06: Complexity Theory and Algorithms. Euro-Par 2001: 332

Gianfranco Bilardi, Enoch Peserico: A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. ICALP 2001: 128-139

Gianfranco 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

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik: Computational power of pipelined memory hierarchies. SPAA 2001: 144-152

Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau: Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. Algorithm Engineering 2001: 26-38

Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On Stalling in LogP. IPDPS Workshops 2000: 109-115

Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto: On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis: BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999)

Gianfranco Bilardi, Franco P. Preparata: Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. Theory Comput. Syst. 32(5): 531-559 (1999)

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-Universal Circuits with Constant Slowdown. ARVLSI 1999: 89-98

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci: A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par 1999: 543-551

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)

Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci (Eds.): Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Lecture Notes in Computer Science 1461, Springer 1998, isbn 3-540-64848-8

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)

Keshav Pingali, Gianfranco Bilardi: Optimal Control Dependence Computation and the Roman Chariots Problem. ACM Trans. Program. Lang. Syst. 19(3): 462-491 (1997)

Gianfranco Bilardi: Algorithms and Data Structures for Control Dependence and Related Compiler Problems. CIAC 1997: 1-2

Gianfranco Bilardi, Bruno Codenotti, G. Del Corso, Maria Cristina Pinotti, Giovanni Resta: Broadcast and Associative Operations on Fat-Trees. Euro-Par 1997: 196-207

Gianfranco Bilardi, Alexandru Nicolau, Joseph Hummel: A Systematic Approach to Branch Speculation. LCPC 1997: 394-411

Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim (Eds.): Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings. Lecture Notes in Computer Science 1253, Springer 1997, isbn 3-540-63138-0

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)

Gianfranco Bilardi, Keshav Pingali: Generalized Dominance and Control Dependence. PLDI 1996: 291-300

Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis: BSP vs LogP. SPAA 1996: 25-32

Paul Bay, Gianfranco Bilardi: Deterministic On-Line Routing on Area-Universal Networks. J. ACM 42(3): 614-640 (1995)

Gianfranco Bilardi, Franco P. Preparata: Horizons of Parallel Computation. J. Parallel Distrib. Comput. 27(2): 172-182 (1995)

Shyam Kapur, Gianfranco Bilardi: Language Learning Without Overgeneralization. Theor. Comput. Sci. 141(1&2): 151-162 (1995)

Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242

Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo: An International Masters in Software Engineering: Experience and Prospects. ICDE 1995: 556-557

Keshav Pingali, Gianfranco Bilardi: APT: A Data Structure for Optimal Control Dependence Computation. PLDI 1995: 32-46

Gianfranco Bilardi, Franco P. Preparata: Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. SPAA 1995: 185-194

Gianfranco Bilardi, Franco P. Preparata: Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS 1995: 1-12

Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn: A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994)

Kieran T. Herley, Gianfranco Bilardi: Deterministic Simulations of PRAMs on Bounded Degree Networks. SIAM J. Comput. 23(2): 276-292 (1994)

Gianfranco Bilardi, Paul Bay: An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). ESA 1994: 413-423

Sandeep 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

Shyam Kapur, Gianfranco Bilardi: On Uniform Learnability of Language Families. Inf. Process. Lett. 44(1): 35-38 (1992)

Shyam Kapur, Gianfranco Bilardi: Language Learning from Stochastic Input. COLT 1992: 303-310

Franco P. Preparata, Gianfranco Bilardi: Horizons of Parallel Computation. 25th Anniversary of INRIA 1992: 155-174

Shyam Kapur, Gianfranco Bilardi: Language Learning without Overgeneralization. STACS 1992: 245-256

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)

Paul Bay, Gianfranco Bilardi: Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract). FOCS 1990: 297-306

Gianfranco Bilardi, Franco P. Preparata: Size-time complexity of Boolean networks for prefix computations. J. ACM 36(2): 362-382 (1989)

Gianfranco Bilardi, Alexandru Nicolau: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. SIAM J. Comput. 18(2): 216-228 (1989)

Gianfranco Bilardi: Merging and Sorting Networks with the Topology of the Omega Network. IEEE Trans. Computers 38(10): 1396-1403 (1989)

Gianfranco Bilardi, Abha Moitra: Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. ICALP 1989: 95-107

Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh: Optimal VLSI Architectures for Multidimensional DFT. SPAA 1989: 265-272

Gianfranco Bilardi, Franco P. Preparata: Size-Time Complexity of Boolean Networks for Prefix Computations. STOC 1987: 436-442

Gianfranco Bilardi, Franco P. Preparata: Area-Time Lower-Bound Techniques with Applications to Sorting. Algorithmica 1(1): 65-91 (1986)

Gianfranco Bilardi, Franco P. Preparata: Digital Filtering in VLSI. Aegean Workshop on Computing 1986: 1-11

Gianfranco Bilardi, Franco P. Preparata: The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. 20(2): 55-59 (1985)

Gianfranco Bilardi, Franco P. Preparata: A Minimum Area VLSI Network for O(log n) Time Sorting. IEEE Trans. Computers 34(4): 336-343 (1985)

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-841 (1985)

Gianfranco Bilardi, Franco P. Preparata: The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP 1985: 53-62

Gianfranco Bilardi, Xiaolong Jin: Permutation-Exchange Graphs That Emulate the Binary Cube. Mathematical Systems Theory 17(3): 193-198 (1984)

Gianfranco Bilardi, Franco P. Preparata: An Architecture for Bitonic Sorting with Optimal VLSI Performance. IEEE Trans. Computers 33(7): 646-651 (1984)

Gianfranco Bilardi, Franco P. Preparata: A Minimum Area VLSI Network for O(log n) Time Sorting. STOC 1984: 64-70