Gianfranco Bilardi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 81 from 81

2023

FlexSEE: a Flexible Secure Execution Environment for protecting data-in-useJose Moreira, Jessica H. Tseng, Manoj Kumar, Eknath Ekanadham, Joefon Jann, Pratap C. Pattnaik, Gianfranco Bilardi, David Edelsohn, Henry M. Tufo. cf 2023: 329-336 [doi]

2022

The DAG Visit Approach for Pebbling and I/O Lower BoundsGianfranco Bilardi, Lorenzo De Stefani. fsttcs 2022: [doi]

2019

The I/O complexity of Toom-Cook integer multiplicationGianfranco Bilardi, Lorenzo De Stefani. soda 2019: 2034-2052 [doi]

Derivative grammars: a symbolic approach to parsing with derivativesIan Henriksen, Gianfranco Bilardi, Keshav Pingali. PACMPL, 3(OOPSLA), 2019. [doi]

Bounds and Estimates on the Average Edit DistanceMichele Schimd, Gianfranco Bilardi. spire 2019: 91-106 [doi]

2018

A Lower Bound Technique for Communication in BSPGianfranco Bilardi, Michele Scquizzato, Francesco Silvestri 0001. topc, 4(3), 2018. [doi]

2017

The I/O Complexity of Strassen's Matrix Multiplication with RecomputationGianfranco Bilardi, Lorenzo De Stefani. wads 2017: 181-192 [doi]

Optimal On-Line Computation of Stack Distances for MIN and OPTGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. cf 2017: 237-246 [doi]

2016

Network-Oblivious AlgorithmsGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri 0001. JACM, 63(1):3, 2016. [doi]

2015

A Graphical Model for Context-Free Grammar ParsingKeshav Pingali, Gianfranco Bilardi. CC 2015: 3-27 [doi]

2013

Efficient Stack Distance Computation for a Class of Priority Replacement PoliciesGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. ijpp, 41(3):430-468, 2013. [doi]

Optimal eviction policies for stochastic address tracesGianfranco Bilardi, Francesco Versaci. TCS, 514:36-60, 2013. [doi]

2012

A Lower Bound Technique for Communication on BSP with Application to the FFTGianfranco Bilardi, Michele Scquizzato, Francesco Silvestri. europar 2012: 676-687 [doi]

2011

New Area-Time Lower Bounds for the Multidimensional DFTGianfranco Bilardi, Carlo Fantozzi. cats 2011: 111-120 [doi]

Efficient stack distance computation for priority replacement policiesGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. cf 2011: 2 [doi]

2009

On approximating the ideal random access machine by physical machinesGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. JACM, 56(5), 2009. [doi]

2008

Area-time tradeoffs for universal VLSI circuitsSandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci. TCS, 408(2-3):143-150, 2008. [doi]

Models for Parallel and Hierarchical On-Chip ComputationGianfranco Bilardi. europar 2009: 127-128 [doi]

2007

Models for parallel and hierarchical computationGianfranco Bilardi. cf 2007: 95-96 [doi]

Network-Oblivious AlgorithmsGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri. ipps 2007: 1-10 [doi]

2005

2003

Algorithms for computing the static single assignment formGianfranco Bilardi, Keshav Pingali. JACM, 50(3):375-425, 2003. [doi]

PrefaceGianfranco Bilardi, Giuseppe F. Italiano. jal, 49(1):1, 2003. [doi]

2002

An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical ProblemsMauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler. iccS 2002: 733-742 [doi]

Optimal organizations for pipelined hierarchical memoriesGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. spaa 2002: 109-116 [doi]

2001

2000

On the Space and Access Complexity of Computation DAGsGianfranco Bilardi, Andrea Pietracaprina, Paolo D Alberto. criwg 2000: 47-58 [doi]

On Stalling in LogPGianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci. ipps 2000: 109-115 [doi]

1999

1998

Tight Bounds on Parallel List MarkingSandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade. jpdc, 51(2):75-88, 1998.

1997

1996

On Bufferless Routing of Variable Length Messages in Leveled NetworksSandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe. TC, 45(6):714-729, 1996.

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

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

1995

An International Masters in Software Engineering: Experience and ProspectsAlberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo. icde 1995: 556-557 [doi]

Deterministic On-Line Routing on Area-Universal NetworksPaul Bay, Gianfranco Bilardi. JACM, 42(3):614-640, 1995. [doi]

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

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

Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message PropagationGianfranco Bilardi, Franco P. Preparata. spaa 1995: 185-194 [doi]

Horizons of Parallel ComputationGianfranco Bilardi, Franco P. Preparata. jpdc, 27(2):172-182, 1995.

Language Learning Without OvergeneralizationShyam Kapur, Gianfranco Bilardi. TCS, 141(1&2):151-162, 1995. [doi]

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

1994

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

A Lower Bound for Area-Universal GraphsGianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn. ipl, 51(2):101-105, 1994.

Deterministic Simulations of PRAMs on Bounded Degree NetworksKieran T. Herley, Gianfranco Bilardi. SICOMP, 23(2):276-292, 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. esa 1993: 49-60

1992

On Uniform Learnability of Language FamiliesShyam Kapur, Gianfranco Bilardi. ipl, 44(1):35-38, 1992.

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

Language Learning from Stochastic InputShyam Kapur, Gianfranco Bilardi. colt 1992: 303-310 [doi]

Horizons of Parallel ComputationFranco P. Preparata, Gianfranco Bilardi. inria 1992: 155-174

1991

Optimal VLSI architectures for multidimensional DFT (preliminary version)Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh. sigarch, 19(1):45-52, 1991. [doi]

1990

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

Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear SizeGianfranco Bilardi, Franco P. Preparata. SICOMP, 19(2):246-255, 1990.

1989

1987

Size-Time Complexity of Boolean Networks for Prefix ComputationsGianfranco Bilardi, Franco P. Preparata. stoc 1987: 436-442

1986

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

Digital Filtering in VLSIGianfranco Bilardi, Franco P. Preparata. awoc 1986: 1-11

1985

A Minimum Area VLSI Network for ::::O::::(log ::::n::::) Time SortingGianfranco Bilardi, Franco P. Preparata. TC, 34(4):336-343, 1985.

Mean value of the output of a discrete-time Volterra system driven by a Markov chainGianfranco Bilardi, Gianfranco Cariolaro, R. Cristi. TIT, 31(6):838, 1985.

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

The VLSI Optimality of the AKS Sorting NetworkGianfranco Bilardi, Franco P. Preparata. ipl, 20(2):55-59, 1985.

1984

An Architecture for Bitonic Sorting with Optimal VLSI PerformanceGianfranco Bilardi, Franco P. Preparata. TC, 33(7):646-651, 1984.

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

Permutation-Exchange Graphs That Emulate the Binary CubeGianfranco Bilardi, Xiaolong Jin. mst, 17(3):193-198, 1984.

1983

Spectral Analysis of Functions of Markov Chains with ApplicationsGianfranco Bilardi, Roberto Padovani, Gianfranco L. Pierobon. tcom, 31(7):853-861, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL