Gianfranco Bilardi

According to our database, Gianfranco Bilardi authored at least 82 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2023

FlexSEE: a Flexible Secure Execution Environment for protecting data-in-use.

Jose Moreira, Jessica H. Tseng, Manoj Kumar, Eknath Ekanadham, Joefon Jann, Pratap C. Pattnaik, Gianfranco Bilardi, David Edelsohn, Henry M. Tufo

Proceedings of the 20th ACM International Conference on Computing Frontiers, 2023

2022

The DAG Visit Approach for Pebbling and I/O Lower Bounds.

Gianfranco Bilardi, Lorenzo De Stefani

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Encrypted Data Processing.

Jessica H. Tseng, Gianfranco Bilardi, Kattamuri Ekanadham, Manoj Kumar, José E. Moreira, Pratap C. Pattnaik

CoRR, 2021

2019

Derivative grammars: a symbolic approach to parsing with derivatives.

Ian Henriksen, Gianfranco Bilardi, Keshav Pingali

Proc. ACM Program. Lang., 2019

Bounds and Estimates on the Average Edit Distance.

Michele Schimd, Gianfranco Bilardi

Proceedings of the String Processing and Information Retrieval, 2019

The I/O complexity of Toom-Cook integer multiplication.

Gianfranco Bilardi, Lorenzo De Stefani

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

A Lower Bound Technique for Communication in BSP.

Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri

ACM Trans. Parallel Comput., 2018

2017

The I/O Complexity of Strassen's Matrix Multiplication with Recomputation.

Gianfranco Bilardi, Lorenzo De Stefani

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Optimal On-Line Computation of Stack Distances for MIN and OPT.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Proceedings of the Computing Frontiers Conference, 2017

2016

Network-Oblivious Algorithms.

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri

J. ACM, 2016

2015

A Graphical Model for Context-Free Grammar Parsing.

Keshav Pingali, Gianfranco Bilardi

Proceedings of the Compiler Construction - 24th International Conference, 2015

2013

Optimal eviction policies for stochastic address traces.

Gianfranco Bilardi, Francesco Versaci

Theor. Comput. Sci., 2013

Efficient Stack Distance Computation for a Class of Priority Replacement Policies.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Int. J. Parallel Program., 2013

2012

A Lower Bound Technique for Communication on BSP with Application to the FFT.

Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Universality in VLSI Computation.

Gianfranco Bilardi, Geppino Pucci

Proceedings of the Encyclopedia of Parallel Computing, 2011

Models of Computation, Theoretical.

Gianfranco Bilardi, Andrea Pietracaprina

Proceedings of the Encyclopedia of Parallel Computing, 2011

An Optimal Stack Policy for Paging with Stochastic Inputs

Gianfranco Bilardi, Francesco Versaci

CoRR, 2011

Efficient stack distance computation for priority replacement policies.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Proceedings of the 8th Conference on Computing Frontiers, 2011

New Area-Time Lower Bounds for the Multidimensional DFT.

Gianfranco Bilardi, Carlo Fantozzi

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2009

On approximating the ideal random access machine by physical machines.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

J. ACM, 2009

2008

Area-time tradeoffs for universal VLSI circuits.

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci

Theor. Comput. Sci., 2008

Models for Parallel and Hierarchical On-Chip Computation.

Gianfranco Bilardi

Proceedings of the Euro-Par 2008 Workshops, 2008

2007

Decomposable BSP.

Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Network-Oblivious Algorithms.

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Models for parallel and hierarchical computation.

Gianfranco Bilardi

Proceedings of the 4th Conference on Computing Frontiers, 2007

2005

On stalling in LogP.

Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci

J. Parallel Distributed Comput., 2005

An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

The Potential of On-Chip Multiprocessing for QCD Machines.

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione

Proceedings of the High Performance Computing, 2005

2003

Preface.

Gianfranco Bilardi, Giuseppe F. Italiano

J. Algorithms, 2003

Algorithms for computing the static single assignment form.

Gianfranco Bilardi, Keshav Pingali

J. ACM, 2003

2002

Optimal organizations for pipelined hierarchical memories.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems.

Mauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance.

Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau

Proceedings of the Algorithm Engineering, 2001

Computational power of pipelined memory hierarchies.

Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation.

Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci

Proceedings of the Computational Science - ICCS 2001, 2001

A Characterization of Temporal Locality and Its Portability across Memory Hierarchies.

Gianfranco Bilardi, Enoch Peserico

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Topic 06: Complexity Theory and Algorithms.

Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000

On the Space and Access Complexity of Computation DAGs.

Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999

Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds.

Gianfranco Bilardi, Franco P. Preparata

Theory Comput. Syst., 1999

BSP versus LogP.

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis

Algorithmica, 1999

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing.

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci

Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Area-Universal Circuits with Constant Slowdown.

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci

Proceedings of the 18th Conference on Advanced Research in VLSI (ARVLSI '99), 1999

1998

Tight Bounds on Parallel List Marking.

Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade

J. Parallel Distributed Comput., 1998

1997

Optimal Control Dependence Computation and the Roman Chariots Problem.

Keshav Pingali, Gianfranco Bilardi

ACM Trans. Program. Lang. Syst., 1997

Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds.

Gianfranco Bilardi, Franco P. Preparata

Theory Comput. Syst., 1997

A Systematic Approach to Branch Speculation.

Gianfranco Bilardi, Alexandru Nicolau, Joe Hummel

Proceedings of the Languages and Compilers for Parallel Computing, 1997

Broadcast and Associative Operations on Fat-Trees.

Gianfranco Bilardi, Bruno Codenotti, Gianna Maria Del Corso, Maria Cristina Pinotti, Giovanni Resta

Proceedings of the Euro-Par '97 Parallel Processing, 1997

Algorithms and Data Structures for Control Dependence and Related Compiler Problems.

Gianfranco Bilardi

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

On Bufferless Routing of Variable Length Messages in Leveled Networks.

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe

IEEE Trans. Computers, 1996

BSP vs LogP.

Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Generalized Dominance and Control Dependence.

Gianfranco Bilardi, Keshav Pingali

Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI), 1996

1995

Language Learning Without Overgeneralization.

Shyam Kapur, Gianfranco Bilardi

Theor. Comput. Sci., 1995

Horizons of Parallel Computation.

Gianfranco Bilardi, Franco P. Preparata

J. Parallel Distributed Comput., 1995

Deterministic On-Line Routing on Area-Universal Networks.

Paul Bay, Gianfranco Bilardi

J. ACM, 1995

Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation.

Gianfranco Bilardi, Franco P. Preparata

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation.

Gianfranco Bilardi, Franco P. Preparata

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

APT: A Data Structure for Optimal Control Dependence Computation.

Keshav Pingali, Gianfranco Bilardi

Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation (PLDI), 1995

An International Masters in Software Engineering: Experience and Prospects.

Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo

Proceedings of the Eleventh International Conference on Data Engineering, 1995

1994

Deterministic Simulations of PRAMs on Bounded Degree Networks.

Kieran T. Herley, Gianfranco Bilardi

SIAM J. Comput., 1994

A Lower Bound for Area-Universal Graphs.

Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn

Inf. Process. Lett., 1994

An Area Lower Bound for a Class of Fat-Trees (Extended Abstract).

Gianfranco Bilardi, Paul Bay

Proceedings of the Algorithms, 1994

1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

On Uniform Learnability of Language Families.

Shyam Kapur, Gianfranco Bilardi

Inf. Process. Lett., 1992

Language Learning from Stochastic Input.

Shyam Kapur, Gianfranco Bilardi

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Optimal VLSI architectures for multidimensional DFT (preliminary version).

Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh

SIGARCH Comput. Archit. News, 1991

1990

Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size.

Gianfranco Bilardi, Franco P. Preparata

SIAM J. Comput., 1990

Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract)

Paul Bay, Gianfranco Bilardi

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Merging and Sorting Networks with the Topology of the Omega Network.

Gianfranco Bilardi

IEEE Trans. Computers, 1989

Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines.

Gianfranco Bilardi, Alexandru Nicolau

SIAM J. Comput., 1989

Size-time complexity of Boolean networks for prefix computations.

Gianfranco Bilardi, Franco P. Preparata

J. ACM, 1989

Optimal VLSI Architectures for Multidimensional DFT.

Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions.

Gianfranco Bilardi, Abha Moitra

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1986

Area-Time Lower-Bound Techniques with Applications to Sorting.

Gianfranco Bilardi, Franco P. Preparata

Algorithmica, 1986

Digital Filtering in VLSI.

Gianfranco Bilardi, Franco P. Preparata

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Mean value of the output of a discrete-time Volterra system driven by a Markov chain.

Gianfranco Bilardi, Gianfranco L. Cariolaro, Roberto Cristi

IEEE Trans. Inf. Theory, 1985

A Minimum Area VLSI Network for <i>O</i>(log <i>n</i>) Time Sorting.

Gianfranco Bilardi, Franco P. Preparata

IEEE Trans. Computers, 1985

The VLSI Optimality of the AKS Sorting Network.

Gianfranco Bilardi, Franco P. Preparata

Inf. Process. Lett., 1985

The Influence of Key Length on the Area-Time Complexity of Sorting.

Gianfranco Bilardi, Franco P. Preparata

Proceedings of the Automata, 1985

1984

An Architecture for Bitonic Sorting with Optimal VLSI Performance.

Gianfranco Bilardi, Franco P. Preparata

IEEE Trans. Computers, 1984

Permutation-Exchange Graphs That Emulate the Binary Cube.

Gianfranco Bilardi, Xiaolong Jin

Math. Syst. Theory, 1984

A Minimum Area VLSI Network for O(log n) Time Sorting

Gianfranco Bilardi, Franco P. Preparata

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Spectral Analysis of Functions of Markov Chains with Applications.

Gianfranco Bilardi, Roberto Padovani, Gianfranco L. Pierobon

IEEE Trans. Commun., 1983