default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 96 matches
- 2023
- 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
- Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit Approach for Pebbling and I/O Lower Bounds. FSTTCS 2022: 7:1-7:23 - Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit approach for Pebbling and I/O Lower Bounds. CoRR abs/2210.01897 (2022) - Gianfranco Bilardi, Michele Schimd:
Bounds and Estimates on the Average Edit Distance. CoRR abs/2211.07644 (2022) - 2021
- Jessica H. Tseng, Gianfranco Bilardi, Kattamuri Ekanadham, Manoj Kumar, José E. Moreira, Pratap C. Pattnaik:
Encrypted Data Processing. CoRR abs/2109.09821 (2021) - 2019
- 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) - Gianfranco Bilardi, Lorenzo De Stefani:
The I/O complexity of Toom-Cook integer multiplication. SODA 2019: 2034-2052 - Michele Schimd, Gianfranco Bilardi:
Bounds and Estimates on the Average Edit Distance. SPIRE 2019: 91-106 - 2018
- 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
- Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Optimal On-Line Computation of Stack Distances for MIN and OPT. Conf. Computing Frontiers 2017: 237-246 - Gianfranco Bilardi, Lorenzo De Stefani:
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. WADS 2017: 181-192 - Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. CoRR abs/1707.02229 (2017) - 2016
- Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016) - Gianfranco Bilardi, Lorenzo De Stefani:
The I/O complexity of Strassen's matrix multiplication with recomputation. CoRR abs/1605.02224 (2016) - 2015
- Keshav Pingali, Gianfranco Bilardi:
A Graphical Model for Context-Free Grammar Parsing. CC 2015: 3-27 - 2014
- Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. CoRR abs/1404.3318 (2014) - 2013
- 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) - Gianfranco Bilardi, Francesco Versaci:
Optimal eviction policies for stochastic address traces. Theor. Comput. Sci. 514: 36-60 (2013) - 2012
- Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par 2012: 676-687 - 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
- Gianfranco Bilardi, Carlo Fantozzi:
New Area-Time Lower Bounds for the Multidimensional DFT. CATS 2011: 111-120 - Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Efficient stack distance computation for priority replacement policies. Conf. Computing Frontiers 2011: 2 - Gianfranco Bilardi, Andrea Pietracaprina:
Models of Computation, Theoretical. Encyclopedia of Parallel Computing 2011: 1150-1158 - Gianfranco Bilardi, Geppino Pucci:
Universality in VLSI Computation. Encyclopedia of Parallel Computing 2011: 2112-2118 - Gianfranco Bilardi, Francesco Versaci:
An Optimal Stack Policy for Paging with Stochastic Inputs. CoRR abs/1109.6643 (2011) - 2009
- 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
- Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci:
Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008) - Gianfranco Bilardi:
Models for Parallel and Hierarchical On-Chip Computation. Euro-Par Workshops 2008: 127-128 - 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
- Gianfranco Bilardi:
Models for parallel and hierarchical computation. Conf. Computing Frontiers 2007: 95-96
skipping 66 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-09 07:33 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint