Gianfranco Bilardi

98 papers A* 11A 7B 9C 2Misc 3Journal 43Unranked 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
A universal bound on the space complexity of directed acyclic graph computations.
Inf. Process. Lett.
Gianfranco Bilardi, Lorenzo De Stefani
2024 J jnl
A universal bound on the space complexity of Directed Acyclic Graph computations.
CoRR
Gianfranco Bilardi, Lorenzo De Stefani
2023 — conf
FlexSEE: a Flexible Secure Execution Environment for protecting data-in-use.
CF
Jose Moreira, Jessica H. Tseng, Manoj Kumar, Eknath Ekanadham, Joefon Jann, Pratap C. Pattnaik, Gianfranco Bilardi, David Edelsohn, Henry M. Tufo
2022 J jnl
Bounds and Estimates on the Average Edit Distance.
CoRR
Gianfranco Bilardi, Michele Schimd
2022 — conf
The DAG Visit Approach for Pebbling and I/O Lower Bounds.
FSTTCS
Gianfranco Bilardi, Lorenzo De Stefani
2022 J jnl
The DAG Visit approach for Pebbling and I/O Lower Bounds.
CoRR
Gianfranco Bilardi, Lorenzo De Stefani
2021 J jnl
Encrypted Data Processing.
CoRR
Jessica H. Tseng, Gianfranco Bilardi, Kattamuri Ekanadham, Manoj Kumar, José E. Moreira, Pratap C. Pattnaik
2019 C conf
Bounds and Estimates on the Average Edit Distance.
SPIRE
Michele Schimd, Gianfranco Bilardi
2019 J jnl
Derivative grammars: a symbolic approach to parsing with derivatives.
Proc. ACM Program. Lang.
Ian Henriksen, Gianfranco Bilardi, Keshav Pingali
2019 A* conf
The I/O complexity of Toom-Cook integer multiplication.
SODA
Gianfranco Bilardi, Lorenzo De Stefani
2018 J jnl
A Lower Bound Technique for Communication in BSP.
ACM Trans. Parallel Comput.
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
2017 J jnl
A Lower Bound Technique for Communication in BSP.
CoRR
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
2017 — conf
Optimal On-Line Computation of Stack Distances for MIN and OPT.
Conf. Computing Frontiers
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2017 B conf
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation.
WADS
Gianfranco Bilardi, Lorenzo De Stefani
2016 J jnl
Network-Oblivious Algorithms.
J. ACM
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
2016 J jnl
The I/O complexity of Strassen's matrix multiplication with recomputation.
CoRR
Gianfranco Bilardi, Lorenzo De Stefani
2015 B conf
A Graphical Model for Context-Free Grammar Parsing.
CC
Keshav Pingali, Gianfranco Bilardi
2014 J jnl
Network-Oblivious Algorithms.
CoRR
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
2013 J jnl
Efficient Stack Distance Computation for a Class of Priority Replacement Policies.
Int. J. Parallel Program.
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2013 J jnl
Optimal eviction policies for stochastic address traces.
Theor. Comput. Sci.
Gianfranco Bilardi, Francesco Versaci
2012 — conf
A Lower Bound Technique for Communication on BSP with Application to the FFT.
Euro-Par
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
2012 A ed.
International Conference on Supercomputing, ICS'12, Venice, Italy, June 25-29, 2012
ICS
Utpal Banerjee, Kyle A. Gallivan, Gianfranco Bilardi, Manolis Katevenis
2011 J jnl
An Optimal Stack Policy for Paging with Stochastic Inputs
CoRR
Gianfranco Bilardi, Francesco Versaci
2011 — conf
Efficient stack distance computation for priority replacement policies.
Conf. Computing Frontiers
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2011 — ch.
Models of Computation, Theoretical.
Encyclopedia of Parallel Computing
Gianfranco Bilardi, Andrea Pietracaprina
2011 — conf
New Area-Time Lower Bounds for the Multidimensional DFT.
CATS
Gianfranco Bilardi, Carlo Fantozzi
2011 — ch.
Universality in VLSI Computation.
Encyclopedia of Parallel Computing
Gianfranco Bilardi, Geppino Pucci
2009 J jnl
On approximating the ideal random access machine by physical machines.
J. ACM
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2008 J jnl
Area-time tradeoffs for universal VLSI circuits.
Theor. Comput. Sci.
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
2008 — conf
Models for Parallel and Hierarchical On-Chip Computation.
Euro-Par Workshops
Gianfranco Bilardi
2008 — ed.
Proceedings of the 5th Conference on Computing Frontiers, 2008, Ischia, Italy, May 5-7, 2008
Conf. Computing Frontiers
Alex Ramírez, Gianfranco Bilardi, Michael Gschwind
2007 — ch.
Decomposable BSP.
Handbook of Parallel Computing
Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi
2007 — conf
Models for parallel and hierarchical computation.
Conf. Computing Frontiers
Gianfranco Bilardi
2007 A conf
Network-Oblivious Algorithms.
IPDPS
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
2005 A conf
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer.
IPDPS
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2005 J jnl
On stalling in LogP.
J. Parallel Distributed Comput.
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
2005 Misc conf
The Potential of On-Chip Multiprocessing for QCD Machines.
HiPC
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione
2003 J jnl
Algorithms for computing the static single assignment form.
J. ACM
Gianfranco Bilardi, Keshav Pingali
2003 J jnl
Preface.
J. Algorithms
Gianfranco Bilardi, Giuseppe F. Italiano
2002 Misc conf
An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems.
International Conference on Computational Science (1)
Mauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler
2002 B conf
Optimal organizations for pipelined hierarchical memories.
SPAA
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2001 A* conf
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies.
ICALP
Gianfranco Bilardi, Enoch Peserico
2001 B conf
Computational power of pipelined memory hierarchies.
SPAA
Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
2001 — conf
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance.
WAE
Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau
2001 Misc conf
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation.
International Conference on Computational Science (2)
Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
2001 — conf
Topic 06: Complexity Theory and Algorithms.
Euro-Par
Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs
2000 — conf
On Stalling in LogP.
IPDPS Workshops
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
2000 B conf
On the Space and Access Complexity of Computation DAGs.
WG
Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
1999 — conf
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing.
Euro-Par
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
1999 — conf
Area-Universal Circuits with Constant Slowdown.
ARVLSI
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
1999 J jnl
BSP versus LogP.
Algorithmica
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis
1999 J jnl
Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds.
Theory Comput. Syst.
Gianfranco Bilardi, Franco P. Preparata
1998 A ed.
Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings
ESA
Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci
1998 J jnl
Tight Bounds on Parallel List Marking.
J. Parallel Distributed Comput.
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
1997 — conf
A Systematic Approach to Branch Speculation.
LCPC
Gianfranco Bilardi, Alexandru Nicolau, Joe Hummel
1997 C conf
Algorithms and Data Structures for Control Dependence and Related Compiler Problems.
CIAC
Gianfranco Bilardi
1997 — conf
Broadcast and Associative Operations on Fat-Trees.
Euro-Par
Gianfranco Bilardi, Bruno Codenotti, Gianna Maria Del Corso, Maria Cristina Pinotti, Giovanni Resta
1997 J jnl
Optimal Control Dependence Computation and the Roman Chariots Problem.
ACM Trans. Program. Lang. Syst.
Keshav Pingali, Gianfranco Bilardi
1997 J jnl
Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds.
Theory Comput. Syst.
Gianfranco Bilardi, Franco P. Preparata
1997 — ed.
Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings
IRREGULAR
Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim
1996 B conf
BSP vs LogP.
SPAA
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis
1996 A* conf
Generalized Dominance and Control Dependence.
PLDI
Gianfranco Bilardi, Keshav Pingali
1996 J jnl
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
1995 A* conf
APT: A Data Structure for Optimal Control Dependence Computation.
PLDI
Keshav Pingali, Gianfranco Bilardi
1995 A* conf
An International Masters in Software Engineering: Experience and Prospects.
ICDE
Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo
1995 J jnl
Deterministic On-Line Routing on Area-Universal Networks.
J. ACM
Paul Bay, Gianfranco Bilardi
1995 J jnl
Horizons of Parallel Computation.
J. Parallel Distributed Comput.
Gianfranco Bilardi, Franco P. Preparata
1995 J jnl
Language Learning Without Overgeneralization.
Theor. Comput. Sci.
Shyam Kapur, Gianfranco Bilardi
1995 B conf
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation.
WADS
Gianfranco Bilardi, Franco P. Preparata
1995 — conf
Tight Bounds on Parallel List Marking.
Euro-Par
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
1995 B conf
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation.
SPAA
Gianfranco Bilardi, Franco P. Preparata
1994 J jnl
A Lower Bound for Area-Universal Graphs.
Inf. Process. Lett.
Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
1994 A conf
An Area Lower Bound for a Class of Fat-Trees (Extended Abstract).
ESA
Gianfranco Bilardi, Paul Bay
1994 J jnl
Deterministic Simulations of PRAMs on Bounded Degree Networks.
SIAM J. Comput.
Kieran T. Herley, Gianfranco Bilardi
1993 A conf
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
ESA
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
1992 — conf
Horizons of Parallel Computation.
25th Anniversary of INRIA
Franco P. Preparata, Gianfranco Bilardi
1992 A* conf
Language Learning from Stochastic Input.
COLT
Shyam Kapur, Gianfranco Bilardi
1992 A conf
Language Learning without Overgeneralization.
STACS
Shyam Kapur, Gianfranco Bilardi
1992 J jnl
On Uniform Learnability of Language Families.
Inf. Process. Lett.
Shyam Kapur, Gianfranco Bilardi
1991 J jnl
Optimal VLSI architectures for multidimensional DFT (preliminary version).
SIGARCH Comput. Archit. News
Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh
1990 J jnl
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size.
SIAM J. Comput.
Gianfranco Bilardi, Franco P. Preparata
1990 A* conf
Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract)
FOCS
Paul Bay, Gianfranco Bilardi
1989 J jnl
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines.
SIAM J. Comput.
Gianfranco Bilardi, Alexandru Nicolau
1989 J jnl
Merging and Sorting Networks with the Topology of the Omega Network.
IEEE Trans. Computers
Gianfranco Bilardi
1989 B conf
Optimal VLSI Architectures for Multidimensional DFT.
SPAA
Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh
1989 J jnl
Size-time complexity of Boolean networks for prefix computations.
J. ACM
Gianfranco Bilardi, Franco P. Preparata
1989 A* conf
Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions.
ICALP
Gianfranco Bilardi, Abha Moitra
1987 A* conf
Size-Time Complexity of Boolean Networks for Prefix Computations
STOC
Gianfranco Bilardi, Franco P. Preparata
1986 J jnl
Area-Time Lower-Bound Techniques with Applications to Sorting.
Algorithmica
Gianfranco Bilardi, Franco P. Preparata
1986 — conf
Digital Filtering in VLSI.
Aegean Workshop on Computing
Gianfranco Bilardi, Franco P. Preparata
1985 J jnl
A Minimum Area VLSI Network for
IEEE Trans. Computers
Gianfranco Bilardi, Franco P. Preparata
1985 J jnl
Mean value of the output of a discrete-time Volterra system driven by a Markov chain.
IEEE Trans. Inf. Theory
Gianfranco Bilardi, Gianfranco L. Cariolaro, Roberto Cristi
1985 A* conf
The Influence of Key Length on the Area-Time Complexity of Sorting.
ICALP
Gianfranco Bilardi, Franco P. Preparata
1985 J jnl
The VLSI Optimality of the AKS Sorting Network.
Inf. Process. Lett.
Gianfranco Bilardi, Franco P. Preparata
1984 A* conf
A Minimum Area VLSI Network for O(log n) Time Sorting
STOC
Gianfranco Bilardi, Franco P. Preparata
1984 J jnl
An Architecture for Bitonic Sorting with Optimal VLSI Performance.
IEEE Trans. Computers
Gianfranco Bilardi, Franco P. Preparata
1984 J jnl
Permutation-Exchange Graphs That Emulate the Binary Cube.
Math. Syst. Theory
Gianfranco Bilardi, Xiaolong Jin
1983 J jnl
Spectral Analysis of Functions of Markov Chains with Applications.
IEEE Trans. Commun.
Gianfranco Bilardi, Roberto Padovani, Gianfranco L. Pierobon