Gianfranco Bilardi - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

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]

Proceedings of the 5th Conference on Computing Frontiers, 2008, Ischia, Italy, May 5-7, 2008Alex Ramírez, Gianfranco Bilardi, Michael Gschwind, editors, ACM, 2008.

2007

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

Models for parallel and hierarchical computationGianfranco Bilardi. cf 2007: 95-96 [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 Stalling in LogPGianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci. ipps 2000: 109-115 [doi]

On the Space and Access Complexity of Computation DAGsGianfranco Bilardi, Andrea Pietracaprina, Paolo D Alberto. criwg 2000: 47-58 [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.

Algorithms - ESA 98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, ProceedingsGianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci, editors, Volume 1461 of Lecture Notes in Computer Science, Springer, 1998.

1997

Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR 97, Paderborn, Germany, June 12-13, 1997, ProceedingsGianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim, editors, Volume 1253 of Lecture Notes in Computer Science, Springer, 1997.

Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper BoundsGianfranco Bilardi, Franco P. Preparata. mst, 30(6):523-546, 1997.

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

A Systematic Approach to Branch SpeculationGianfranco Bilardi, Alexandru Nicolau, Joseph Hummel. lcpc 1998: 394-411

Algorithms and Data Structures for Control Dependence and Related Compiler ProblemsGianfranco Bilardi. ciac 1997: 1-2

Optimal Control Dependence Computation and the Roman Chariots ProblemKeshav Pingali, Gianfranco Bilardi. TOPLAS, 19(3):462-491, 1997. [doi]

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.

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

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

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. siamcomp, 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

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. siamcomp, 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.

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.

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.

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.

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