default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianfranco Bilardi
- > Home > Persons > Gianfranco Bilardi
Publications
- 2016
[j32]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016)- 2014
- [i2]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. CoRR abs/1404.3318 (2014) - 2011
- [r2]Gianfranco Bilardi, Geppino Pucci:
Universality in VLSI Computation. Encyclopedia of Parallel Computing 2011: 2112-2118 - 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) - 2007
- [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 - 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 - 2001
- [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 - 2000
- [c26]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On Stalling in LogP. IPDPS Workshops 2000: 109-115 - 1999
- [j24]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. Algorithmica 24(3-4): 405-422 (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] - 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) - [c18]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis:
BSP vs LogP. SPAA 1996: 25-32 - 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 - 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
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:
