default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdriano Di Pasquale
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c14]Iolanda Mangone, Nicolas Radomski, Adriano Di Pasquale, Andrea Santurbano, Paolo Calistri, Cesare Cammà, Kitty Maassen:
Refinement of the COHESIVE Information System towards a Unified Ontology of Food Terms for the Public Health Organizations. JOWO 2021
2000 – 2009
- 2004
- [c13]Marco Comerio
, Flavio De Paoli, Simone Grega, Carlo Batini, Cesare Di Francesco, Adriano Di Pasquale:
A service re-design methodology for multi-channel adaptation. ICSOC 2004: 11-20 - [c12]Carlo Batini, Marco Comerio, Flavio De Paoli, Cesare Di Francesco, Adriano Di Pasquale, Simone Grega:
Metodologie ed esperienze di sviluppo di applicazioni multicanale nell'anagrafe bovina. SEBD 2004: 178-189 - 2003
- [b1]Adriano Di Pasquale:
Design and analysis of scalable and distributed data structures. Sapienza University of Rome, Italy, 2003 - [c11]Adriano Di Pasquale, Luca Forlizzi, Christian S. Jensen, Yannis Manolopoulos, Enrico Nardelli, Dieter Pfoser, Guido Proietti, Simonas Saltenis, Yannis Theodoridis, Theodoros Tzouramanis, Michael Vassilakopoulos:
Access Methods and Query Processing Techniques. Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003: 203-261 - [c10]Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti:
Quality of Service in Wireless Networks. IPDPS 2003: 224 - 2002
- [c9]Adriano Di Pasquale, Enrico Nardelli, Guido Proietti:
An Improved Upper Bound for Scalable Distributed Search Trees. WDAS 2002: 15-28 - [c8]Adriano Di Pasquale, Michele Flammini, Enrico Nardelli:
Allocation Problems in Scalable Distributed Data Structures. WDAS 2002: 133-142 - 2001
- [c7]Adriano Di Pasquale, Enrico Nardelli:
A Very Efficient Order Preserving Scalable Distributed Data Structure. DEXA 2001: 186-199 - [c6]Adriano Di Pasquale, Enrico Nardelli:
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs. SOFSEM 2001: 211-222 - [e1]Adriano Di Pasquale, Fabrizio Luccio, Enrico Nardelli:
Distributed Data & Structures 3, Records of the 3rd International Meeting (WDAS 2000), L'Aquilia, Italy, 23 June 2000, in conjunction with SIROCCO 2000. Proceedings in Informatics 9, Carleton Scientific 2001, ISBN 1-894145-08-9 [contents] - 2000
- [c5]Adriano Di Pasquale, Enrico Nardelli:
Distributed Searching of k-Dimensional Data with Almost Constant Costs. ADBIS-DASFAA 2000: 239-250 - [c4]Adriano Di Pasquale, Fabrizio Luccio, Enrico Nardelli:
Introduction: Distributed Data & Structures 3. WDAS 2000 - [c3]Adriano Di Pasquale, Enrico Nardelli:
An Amoritized Lower Bound for Distributed Searching of k-dimensional Data. WDAS 2000: 71-85 - [c2]Adriano Di Pasquale, Enrico Nardelli:
Scalable Distributed Data Structures: A Survey. WDAS 2000: 87-111
1990 – 1999
- 1999
- [c1]Adriano Di Pasquale, Enrico Nardelli:
Fully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs. WDAS 1999: 73-90
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-24 23:12 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:
