Gianfranco Bilardi

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 15

Top Topics

Top Venues

Proc. ACM Program. Lang.

Publications

Jose Moreira, Jessica H. Tseng, Manoj Kumar, Eknath Ekanadham, Joefon Jann, Pratap C. Pattnaik, Gianfranco Bilardi, David Edelsohn, Henry M. Tufo
FlexSEE: a Flexible Secure Execution Environment for protecting data-in-use. CF (2023)
Gianfranco Bilardi, Lorenzo De Stefani
The DAG Visit approach for Pebbling and I/O Lower Bounds. CoRR (2022)
Gianfranco Bilardi, Michele Schimd
Bounds and Estimates on the Average Edit Distance. CoRR (2022)
Gianfranco Bilardi, Lorenzo De Stefani
The DAG Visit Approach for Pebbling and I/O Lower Bounds. FSTTCS (2022)
Jessica Tseng, Gianfranco Bilardi, Kattamuri Ekanadham, Manoj Kumar, José E. Moreira, P. C. Pattnaik
Encrypted Data Processing. CoRR (2021)
Gianfranco Bilardi, Lorenzo De Stefani
The I/O complexity of Toom-Cook integer multiplication. SODA (2019)
Michele Schimd, Gianfranco Bilardi
Bounds and Estimates on the Average Edit Distance. SPIRE (2019)
Ian Henriksen, Gianfranco Bilardi, Keshav Pingali
Derivative grammars: a symbolic approach to parsing with derivatives. Proc. ACM Program. Lang. 3 (OOPSLA) (2019)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication in BSP. ACM Trans. Parallel Comput. 4 (3) (2018)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication in BSP. CoRR (2017)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
Optimal On-Line Computation of Stack Distances for MIN and OPT. Conf. Computing Frontiers (2017)
Gianfranco Bilardi, Lorenzo De Stefani
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. WADS (2017)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. J. ACM 63 (1) (2016)
Gianfranco Bilardi, Lorenzo De Stefani
The I/O complexity of Strassen's matrix multiplication with recomputation. CoRR (2016)
Keshav Pingali, Gianfranco Bilardi
A Graphical Model for Context-Free Grammar Parsing. CC (2015)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. CoRR (2014)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
Efficient Stack Distance Computation for a Class of Priority Replacement Policies. Int. J. Parallel Program. 41 (3) (2013)
Gianfranco Bilardi, Francesco Versaci
Optimal eviction policies for stochastic address traces. Theor. Comput. Sci. 514 (2013)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par (2012)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
Efficient stack distance computation for priority replacement policies. Conf. Computing Frontiers (2011)
Gianfranco Bilardi, Carlo Fantozzi
New Area-Time Lower Bounds for the Multidimensional DFT. CATS (2011)
Gianfranco Bilardi, Francesco Versaci
An Optimal Stack Policy for Paging with Stochastic Inputs CoRR (2011)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
On approximating the ideal random access machine by physical machines. J. ACM 56 (5) (2009)
Gianfranco Bilardi
Models for Parallel and Hierarchical On-Chip Computation. Euro-Par Workshops (2008)
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408 (2-3) (2008)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
Network-Oblivious Algorithms. IPDPS (2007)
Gianfranco Bilardi
Models for parallel and hierarchical computation. Conf. Computing Frontiers (2007)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione
The Potential of On-Chip Multiprocessing for QCD Machines. HiPC (2005)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer. IPDPS (2005)
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
On stalling in LogP. J. Parallel Distributed Comput. 65 (3) (2005)
Gianfranco Bilardi, Giuseppe F. Italiano
Preface. J. Algorithms 49 (1) (2003)
Gianfranco Bilardi, Keshav Pingali
Algorithms for computing the static single assignment form. J. ACM 50 (3) (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)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
Optimal organizations for pipelined hierarchical memories. SPAA (2002)
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
Computational power of pipelined memory hierarchies. SPAA (2001)
Gianfranco Bilardi, Enoch Peserico
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. ICALP (2001)
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)
Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs
Topic 06: Complexity Theory and Algorithms. Euro-Par (2001)
Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. WAE (2001)
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
On Stalling in LogP. IPDPS Workshops (2000)
Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
On the Space and Access Complexity of Computation DAGs. WG (2000)
Gianfranco Bilardi, Franco P. Preparata
Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. Theory Comput. Syst. 32 (5) (1999)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis
BSP versus LogP. Algorithmica 24 (3-4) (1999)
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
Area-Universal Circuits with Constant Slowdown. ARVLSI (1999)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par (1999)
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
Tight Bounds on Parallel List Marking. J. Parallel Distributed Comput. 51 (2) (1998)
Gianfranco Bilardi, Bruno Codenotti, G. Del Corso, Maria Cristina Pinotti, Giovanni Resta
Broadcast and Associative Operations on Fat-Trees. Euro-Par (1997)
Keshav Pingali, Gianfranco Bilardi
Optimal Control Dependence Computation and the Roman Chariots Problem. ACM Trans. Program. Lang. Syst. 19 (3) (1997)
Gianfranco Bilardi, Franco P. Preparata
Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Syst. 30 (6) (1997)
Gianfranco Bilardi, Alexandru Nicolau, Joe Hummel
A Systematic Approach to Branch Speculation. LCPC (1997)
Gianfranco Bilardi
Algorithms and Data Structures for Control Dependence and Related Compiler Problems. CIAC (1997)
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) (1996)
Gianfranco Bilardi, Keshav Pingali
Generalized Dominance and Control Dependence. PLDI (1996)
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis
BSP vs LogP. SPAA (1996)
Shyam Kapur, Gianfranco Bilardi
Language Learning Without Overgeneralization. Theor. Comput. Sci. 141 (1&2) (1995)
Gianfranco Bilardi, Franco P. Preparata
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS (1995)
Gianfranco Bilardi, Franco P. Preparata
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. SPAA (1995)
Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo
An International Masters in Software Engineering: Experience and Prospects. ICDE (1995)
Paul Bay, Gianfranco Bilardi
Deterministic On-Line Routing on Area-Universal Networks. J. ACM 42 (3) (1995)
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
Tight Bounds on Parallel List Marking. Euro-Par (1995)
Gianfranco Bilardi, Franco P. Preparata
Horizons of Parallel Computation. J. Parallel Distributed Comput. 27 (2) (1995)
Keshav Pingali, Gianfranco Bilardi
APT: A Data Structure for Optimal Control Dependence Computation. PLDI (1995)
Gianfranco Bilardi, Paul Bay
An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). ESA (1994)
Kieran T. Herley, Gianfranco Bilardi
Deterministic Simulations of PRAMs on Bounded Degree Networks. SIAM J. Comput. 23 (2) (1994)
Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51 (2) (1994)
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)
Shyam Kapur, Gianfranco Bilardi
Language Learning without Overgeneralization. STACS (1992)
Franco P. Preparata, Gianfranco Bilardi
Horizons of Parallel Computation. 25th Anniversary of INRIA (1992)
Shyam Kapur, Gianfranco Bilardi
Language Learning from Stochastic Input. COLT (1992)
Shyam Kapur, Gianfranco Bilardi
On Uniform Learnability of Language Families. Inf. Process. Lett. 44 (1) (1992)
Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh
Optimal VLSI architectures for multidimensional DFT (preliminary version). SIGARCH Comput. Archit. News 19 (1) (1991)
Gianfranco Bilardi, Franco P. Preparata
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. SIAM J. Comput. 19 (2) (1990)
Paul Bay, Gianfranco Bilardi
Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) FOCS (1990)
Gianfranco Bilardi, Abha Moitra
Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. ICALP (1989)
Gianfranco Bilardi
Merging and Sorting Networks with the Topology of the Omega Network. IEEE Trans. Computers 38 (10) (1989)
Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh
Optimal VLSI Architectures for Multidimensional DFT. SPAA (1989)
Gianfranco Bilardi, Alexandru Nicolau
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. SIAM J. Comput. 18 (2) (1989)
Gianfranco Bilardi, Franco P. Preparata
Size-time complexity of Boolean networks for prefix computations. J. ACM 36 (2) (1989)
Gianfranco Bilardi, Franco P. Preparata
Size-Time Complexity of Boolean Networks for Prefix Computations STOC (1987)
Gianfranco Bilardi, Franco P. Preparata
Area-Time Lower-Bound Techniques with Applications to Sorting. Algorithmica 1 (1) (1986)
Gianfranco Bilardi, Franco P. Preparata
Digital Filtering in VLSI. Aegean Workshop on Computing (1986)
Gianfranco Bilardi, Franco P. Preparata
The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP (1985)
Gianfranco Bilardi, Franco P. Preparata
) Time Sorting. IEEE Trans. Computers 34 (4) (1985)
Gianfranco Bilardi, Gianfranco L. Cariolaro, R. Cristi
Mean value of the output of a discrete-time Volterra system driven by a Markov chain. IEEE Trans. Inf. Theory 31 (6) (1985)
Gianfranco Bilardi, Franco P. Preparata
The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. 20 (2) (1985)
Gianfranco Bilardi, Franco P. Preparata
An Architecture for Bitonic Sorting with Optimal VLSI Performance. IEEE Trans. Computers 33 (7) (1984)
Gianfranco Bilardi, Franco P. Preparata
A Minimum Area VLSI Network for O(log n) Time Sorting STOC (1984)
Gianfranco Bilardi, Xiaolong Jin
Permutation-Exchange Graphs That Emulate the Binary Cube. Math. Syst. Theory 17 (3) (1984)
Gianfranco Bilardi, Roberto Padovani, Gianfranco L. Pierobon
Spectral Analysis of Functions of Markov Chains with Applications. IEEE Trans. Commun. 31 (7) (1983)