default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianfranco Bilardi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c48]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: 329-336- 2022
- [c47]Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit Approach for Pebbling and I/O Lower Bounds. FSTTCS 2022: 7:1-7:23 - [i7]Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit approach for Pebbling and I/O Lower Bounds. CoRR abs/2210.01897 (2022) - [i6]Gianfranco Bilardi, Michele Schimd:
Bounds and Estimates on the Average Edit Distance. CoRR abs/2211.07644 (2022) - 2021
- [i5]Jessica H. Tseng, Gianfranco Bilardi, Kattamuri Ekanadham, Manoj Kumar, José E. Moreira, Pratap C. Pattnaik:
Encrypted Data Processing. CoRR abs/2109.09821 (2021)
2010 – 2019
- 2019
- [j34]Ian Henriksen, Gianfranco Bilardi, Keshav Pingali:
Derivative grammars: a symbolic approach to parsing with derivatives. Proc. ACM Program. Lang. 3(OOPSLA): 127:1-127:28 (2019) - [c46]Gianfranco Bilardi, Lorenzo De Stefani:
The I/O complexity of Toom-Cook integer multiplication. SODA 2019: 2034-2052 - [c45]Michele Schimd, Gianfranco Bilardi:
Bounds and Estimates on the Average Edit Distance. SPIRE 2019: 91-106 - 2018
- [j33]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. ACM Trans. Parallel Comput. 4(3): 14:1-14:27 (2018) - 2017
- [c44]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Optimal On-Line Computation of Stack Distances for MIN and OPT. Conf. Computing Frontiers 2017: 237-246 - [c43]Gianfranco Bilardi, Lorenzo De Stefani:
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. WADS 2017: 181-192 - [i4]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. CoRR abs/1707.02229 (2017) - 2016
- [j32]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016) - [i3]Gianfranco Bilardi, Lorenzo De Stefani:
The I/O complexity of Strassen's matrix multiplication with recomputation. CoRR abs/1605.02224 (2016) - 2015
- [c42]Keshav Pingali, Gianfranco Bilardi:
A Graphical Model for Context-Free Grammar Parsing. CC 2015: 3-27 - 2014
- [i2]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. CoRR abs/1404.3318 (2014) - 2013
- [j31]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Efficient Stack Distance Computation for a Class of Priority Replacement Policies. Int. J. Parallel Program. 41(3): 430-468 (2013) - [j30]Gianfranco Bilardi, Francesco Versaci:
Optimal eviction policies for stochastic address traces. Theor. Comput. Sci. 514: 36-60 (2013) - 2012
- [c41]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par 2012: 676-687 - [e4]Utpal Banerjee, Kyle A. Gallivan, Gianfranco Bilardi, Manolis Katevenis:
International Conference on Supercomputing, ICS'12, Venice, Italy, June 25-29, 2012. ACM 2012, ISBN 978-1-4503-1316-2 [contents] - 2011
- [c40]Gianfranco Bilardi, Carlo Fantozzi:
New Area-Time Lower Bounds for the Multidimensional DFT. CATS 2011: 111-120 - [c39]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Efficient stack distance computation for priority replacement policies. Conf. Computing Frontiers 2011: 2 - [r3]Gianfranco Bilardi, Andrea Pietracaprina:
Models of Computation, Theoretical. Encyclopedia of Parallel Computing 2011: 1150-1158 - [r2]Gianfranco Bilardi, Geppino Pucci:
Universality in VLSI Computation. Encyclopedia of Parallel Computing 2011: 2112-2118 - [i1]Gianfranco Bilardi, Francesco Versaci:
An Optimal Stack Policy for Paging with Stochastic Inputs. CoRR abs/1109.6643 (2011)
2000 – 2009
- 2009
- [j29]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
On approximating the ideal random access machine by physical machines. J. ACM 56(5): 27:1-27:57 (2009) - 2008
- [j28]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci:
Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008) - [c38]Gianfranco Bilardi:
Models for Parallel and Hierarchical On-Chip Computation. Euro-Par Workshops 2008: 127-128 - [e3]Alex Ramírez, Gianfranco Bilardi, Michael Gschwind:
Proceedings of the 5th Conference on Computing Frontiers, 2008, Ischia, Italy, May 5-7, 2008. ACM 2008, ISBN 978-1-60558-077-7 [contents] - 2007
- [c37]Gianfranco Bilardi:
Models for parallel and hierarchical computation. Conf. Computing Frontiers 2007: 95-96 - [c36]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri:
Network-Oblivious Algorithms. IPDPS 2007: 1-10 - [r1]Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi:
Decomposable BSP. Handbook of Parallel Computing 2007 - 2005
- [j27]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On stalling in LogP. J. Parallel Distributed Comput. 65(3): 307-312 (2005) - [c35]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione:
The Potential of On-Chip Multiprocessing for QCD Machines. HiPC 2005: 386-397 - [c34]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer. IPDPS 2005 - 2003
- [j26]Gianfranco Bilardi, Keshav Pingali:
Algorithms for computing the static single assignment form. J. ACM 50(3): 375-425 (2003) - [j25]Gianfranco Bilardi, Giuseppe F. Italiano:
Preface. J. Algorithms 49(1): 1 (2003) - 2002
- [c33]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: 733-742 - [c32]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Optimal organizations for pipelined hierarchical memories. SPAA 2002: 109-116 - 2001
- [c31]Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs:
Topic 06: Complexity Theory and Algorithms. Euro-Par 2001: 332 - [c30]Gianfranco Bilardi, Enoch Peserico:
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. ICALP 2001: 128-139 - [c29]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: 579-588 - [c28]Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Computational power of pipelined memory hierarchies. SPAA 2001: 144-152 - [c27]Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau:
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. WAE 2001: 26-38 - 2000
- [c26]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On Stalling in LogP. IPDPS Workshops 2000: 109-115 - [c25]Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto:
On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58
1990 – 1999
- 1999
- [j24]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) - [j23]Gianfranco Bilardi, Franco P. Preparata:
Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. Theory Comput. Syst. 32(5): 531-559 (1999) - [c24]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci:
Area-Universal Circuits with Constant Slowdown. ARVLSI 1999: 89-98 - [c23]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci:
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par 1999: 543-551 - 1998
- [j22]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): 75-88 (1998) - [e2]Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci:
Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Lecture Notes in Computer Science 1461, Springer 1998, ISBN 3-540-64848-8 [contents] - 1997
- [j21]Gianfranco Bilardi, Franco P. Preparata:
Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Syst. 30(6): 523-546 (1997) - [j20]Keshav Pingali, Gianfranco Bilardi:
Optimal Control Dependence Computation and the Roman Chariots Problem. ACM Trans. Program. Lang. Syst. 19(3): 462-491 (1997) - [c22]Gianfranco Bilardi:
Algorithms and Data Structures for Control Dependence and Related Compiler Problems. CIAC 1997: 1-2 - [c21]Gianfranco Bilardi, Bruno Codenotti, Gianna Maria Del Corso, Maria Cristina Pinotti, Giovanni Resta:
Broadcast and Associative Operations on Fat-Trees. Euro-Par 1997: 196-207 - [c20]Gianfranco Bilardi, Alexandru Nicolau, Joe Hummel:
A Systematic Approach to Branch Speculation. LCPC 1997: 394-411 - [e1]Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim:
Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings. Lecture Notes in Computer Science 1253, Springer 1997, ISBN 3-540-63138-0 [contents] - 1996
- [j19]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): 714-729 (1996) - [c19]Gianfranco Bilardi, Keshav Pingali:
Generalized Dominance and Control Dependence. PLDI 1996: 291-300 - [c18]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis:
BSP vs LogP. SPAA 1996: 25-32 - 1995
- [j18]Paul Bay, Gianfranco Bilardi:
Deterministic On-Line Routing on Area-Universal Networks. J. ACM 42(3): 614-640 (1995) - [j17]Gianfranco Bilardi, Franco P. Preparata:
Horizons of Parallel Computation. J. Parallel Distributed Comput. 27(2): 172-182 (1995) - [j16]Shyam Kapur, Gianfranco Bilardi:
Language Learning Without Overgeneralization. Theor. Comput. Sci. 141(1&2): 151-162 (1995) - [c17]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242 - [c16]Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo:
An International Masters in Software Engineering: Experience and Prospects. ICDE 1995: 556-557 - [c15]Keshav Pingali, Gianfranco Bilardi:
APT: A Data Structure for Optimal Control Dependence Computation. PLDI 1995: 32-46 - [c14]Gianfranco Bilardi, Franco P. Preparata:
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. SPAA 1995: 185-194 - [c13]Gianfranco Bilardi, Franco P. Preparata:
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS 1995: 1-12 - 1994
- [j15]Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn:
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994) - [j14]Kieran T. Herley, Gianfranco Bilardi:
Deterministic Simulations of PRAMs on Bounded Degree Networks. SIAM J. Comput. 23(2): 276-292 (1994) - [c12]Gianfranco Bilardi, Paul Bay:
An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). ESA 1994: 413-423 - 1993
- [c11]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: 49-60 - 1992
- [j13]Shyam Kapur, Gianfranco Bilardi:
On Uniform Learnability of Language Families. Inf. Process. Lett. 44(1): 35-38 (1992) - [c10]Shyam Kapur, Gianfranco Bilardi:
Language Learning from Stochastic Input. COLT 1992: 303-310 - [c9]Franco P. Preparata, Gianfranco Bilardi:
Horizons of Parallel Computation. 25th Anniversary of INRIA 1992: 155-174 - [c8]Shyam Kapur, Gianfranco Bilardi:
Language Learning without Overgeneralization. STACS 1992: 245-256 - 1991
- [j12]Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh:
Optimal VLSI architectures for multidimensional DFT (preliminary version). SIGARCH Comput. Archit. News 19(1): 45-52 (1991) - 1990
- [j11]Gianfranco Bilardi, Franco P. Preparata:
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. SIAM J. Comput. 19(2): 246-255 (1990) - [c7]Paul Bay, Gianfranco Bilardi:
Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract). FOCS 1990: 297-306
1980 – 1989
- 1989
- [j10]Gianfranco Bilardi, Franco P. Preparata:
Size-time complexity of Boolean networks for prefix computations. J. ACM 36(2): 362-382 (1989) - [j9]Gianfranco Bilardi, Alexandru Nicolau:
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. SIAM J. Comput. 18(2): 216-228 (1989) - [j8]Gianfranco Bilardi:
Merging and Sorting Networks with the Topology of the Omega Network. IEEE Trans. Computers 38(10): 1396-1403 (1989) - [c6]Gianfranco Bilardi, Abha Moitra:
Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. ICALP 1989: 95-107 - [c5]Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh:
Optimal VLSI Architectures for Multidimensional DFT. SPAA 1989: 265-272 - 1987
- [c4]Gianfranco Bilardi, Franco P. Preparata:
Size-Time Complexity of Boolean Networks for Prefix Computations. STOC 1987: 436-442 - 1986
- [j7]Gianfranco Bilardi, Franco P. Preparata:
Area-Time Lower-Bound Techniques with Applications to Sorting. Algorithmica 1(1): 65-91 (1986) - [c3]Gianfranco Bilardi, Franco P. Preparata:
Digital Filtering in VLSI. Aegean Workshop on Computing 1986: 1-11 - 1985
- [j6]Gianfranco Bilardi, Franco P. Preparata:
The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. 20(2): 55-59 (1985) - [j5]Gianfranco Bilardi, Franco P. Preparata:
A Minimum Area VLSI Network for O(log n) Time Sorting. IEEE Trans. Computers 34(4): 336-343 (1985) - [j4]Gianfranco Bilardi, Gianfranco L. Cariolaro, Roberto Cristi:
Mean value of the output of a discrete-time Volterra system driven by a Markov chain. IEEE Trans. Inf. Theory 31(6): 838-841 (1985) - [c2]Gianfranco Bilardi, Franco P. Preparata:
The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP 1985: 53-62 - 1984
- [j3]Gianfranco Bilardi, Xiaolong Jin:
Permutation-Exchange Graphs That Emulate the Binary Cube. Math. Syst. Theory 17(3): 193-198 (1984) - [j2]Gianfranco Bilardi, Franco P. Preparata:
An Architecture for Bitonic Sorting with Optimal VLSI Performance. IEEE Trans. Computers 33(7): 646-651 (1984) - [c1]Gianfranco Bilardi, Franco P. Preparata:
A Minimum Area VLSI Network for O(log n) Time Sorting. STOC 1984: 64-70 - 1983
- [j1]Gianfranco Bilardi, Roberto Padovani, Gianfranco L. Pierobon:
Spectral Analysis of Functions of Markov Chains with Applications. IEEE Trans. Commun. 31(7): 853-861 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
