default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe Ottaviano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c17]Michele Bevilacqua, Giuseppe Ottaviano, Patrick S. H. Lewis, Scott Yih, Sebastian Riedel, Fabio Petroni:
Autoregressive Search Engines: Generating Substrings as Document Identifiers. NeurIPS 2022- [i7]Michele Bevilacqua, Giuseppe Ottaviano, Patrick S. H. Lewis, Wen-tau Yih, Sebastian Riedel, Fabio Petroni:
Autoregressive Search Engines: Generating Substrings as Document Identifiers. CoRR abs/2204.10628 (2022) - 2020
- [j3]Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast scalable construction of ([compressed] static | minimal perfect hash) functions. Inf. Comput. 273: 104517 (2020) - [c16]Jui-Ting Huang, Ashish Sharma, Shuying Sun, Li Xia, David Zhang, Philip Pronin
, Janani Padmanabhan, Giuseppe Ottaviano, Linjun Yang:
Embedding-based Retrieval in Facebook Search. KDD 2020: 2553-2561 - [i6]Jui-Ting Huang, Ashish Sharma, Shuying Sun, Li Xia, David Zhang, Philip Pronin, Janani Padmanabhan, Giuseppe Ottaviano, Linjun Yang:
Embedding-based Retrieval in Facebook Search. CoRR abs/2006.11632 (2020)
2010 – 2019
- 2017
- [c15]Antonio Mallia, Giuseppe Ottaviano, Elia Porciani, Nicola Tonellotto, Rossano Venturini:
Faster BlockMax WAND with Variable-sized Blocks. SIGIR 2017: 625-634 - 2016
- [c14]Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita:
Compressing Graphs and Indexes with Recursive Graph Bisection. KDD 2016: 1535-1544 - [c13]Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast Scalable Construction of (Minimal Perfect Hash) Functions. SEA 2016: 339-352 - [i5]Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita:
Compressing Graphs and Indexes with Recursive Graph Bisection. CoRR abs/1602.08820 (2016) - [i4]Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast Scalable Construction of (Minimal Perfect Hash) Functions. CoRR abs/1603.04330 (2016) - 2015
- [j2]Alberto De Francesco, Claudia Di Napoli, Maurizio Giordano, Giuseppe Ottaviano, Raffaele Perego, Nicola Tonellotto:
MIDAS: a cloud platform for SOA testing as a service. Int. J. High Perform. Comput. Netw. 8(3): 285-300 (2015) - [c12]Giuseppe Ottaviano, Nicola Tonellotto, Rossano Venturini:
Optimal Space-time Tradeoffs for Inverted Indexes. WSDM 2015: 47-56 - [c11]Roi Blanco, Giuseppe Ottaviano, Edgar Meij:
Fast and Space-Efficient Entity Linking for Queries. WSDM 2015: 179-188 - 2014
- [j1]Roberto Grossi, Giuseppe Ottaviano:
Fast Compressed Tries through Path Decompositions. ACM J. Exp. Algorithmics 19(1) (2014) - [c10]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. DCC 2014: 352-361 - [c9]Alberto De Francesco, Claudia Di Napoli, Maurizio Giordano, Giuseppe Ottaviano, Raffaele Perego, Nicola Tonellotto:
A SOA Testing Platform on the Cloud: The MIDAS Experience. INCoS 2014: 659-664 - [c8]Giuseppe Ottaviano, Rossano Venturini:
Partitioned Elias-Fano indexes. SIGIR 2014: 273-282 - 2013
- [b1]Giuseppe Ottaviano:
Space-Efficient Data Structures for Collections of Textual Data. University of Pisa, Italy, 2013 - [c7]Giuseppe Ottaviano, Pushmeet Kohli:
Compressible Motion Fields. CVPR 2013: 2251-2258 - [c6]Roberto Grossi, Giuseppe Ottaviano:
Design of Practical Succinct Data Structures for Large Data Collections. SEA 2013: 5-17 - [c5]Bo-June Paul Hsu, Giuseppe Ottaviano:
Space-efficient data structures for Top-k completion. WWW 2013: 583-594 - [i3]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. CoRR abs/1312.0526 (2013) - 2012
- [c4]Giuseppe Ottaviano, Roberto Grossi:
Fast Compressed Tries through Path Decompositions. ALENEX 2012: 65-74 - [c3]Roberto Grossi, Giuseppe Ottaviano:
The wavelet trie: maintaining an indexed sequence of strings in compressed space. PODS 2012: 203-214 - [i2]Roberto Grossi, Giuseppe Ottaviano:
The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space. CoRR abs/1204.3581 (2012) - 2011
- [c2]Giuseppe Ottaviano, Roberto Grossi:
Semi-indexing semi-structured data in tiny space. CIKM 2011: 1485-1494 - [i1]Roberto Grossi, Giuseppe Ottaviano:
Fast Compressed Tries through Path Decompositions. CoRR abs/1111.5220 (2011) - 2010
- [c1]Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano:
Fun with Olympiad in Algorithmics. FUN 2010: 1-2
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-04-25 05:34 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:
