Adriano Di Pasquale

Orcid: 0000-0002-9328-3972

According to our database1, Adriano Di Pasquale authored at least 15 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Refinement of the COHESIVE Information System towards a Unified Ontology of Food Terms for the Public Health Organizations.
Proceedings of the Joint Ontology Workshops 2021 Episode VII: The Bolzano Summer of Knowledge co-located with the 12th International Conference on Formal Ontology in Information Systems (FOIS 2021), 2021

2004
Metodologie ed esperienze di sviluppo di applicazioni multicanale nell'anagrafe bovina.
Proceedings of the Twelfth Italian Symposium on Advanced Database Systems, 2004

A service re-design methodology for multi-channel adaptation.
Proceedings of the Service-Oriented Computing, 2004

2003
Design and analysis of scalable and distributed data structures.
PhD thesis, 2003

Quality of Service in Wireless Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Access Methods and Query Processing Techniques.
Proceedings of the Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003

2002
An Improved Upper Bound for Scalable Distributed Search Trees.
Proceedings of the Distributed Data & Structures 4, 2002

Allocation Problems in Scalable Distributed Data Structures.
Proceedings of the Distributed Data & Structures 4, 2002

2001
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

A Very Efficient Order Preserving Scalable Distributed Data Structure.
Proceedings of the Database and Expert Systems Applications, 12th International Conference, 2001

2000
Scalable Distributed Data Structures: A Survey.
Proceedings of the Distributed Data & Structures 3, 2000

An Amoritized Lower Bound for Distributed Searching of k-dimensional Data.
Proceedings of the Distributed Data & Structures 3, 2000

Introduction: Distributed Data & Structures 3.
Proceedings of the Distributed Data & Structures 3, 2000

Distributed Searching of <i>k</i>-Dimensional Data with Almost Constant Costs.
Proceedings of the Current Issues in Databases and Information Systems, 2000

1999
Fully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs.
Proceedings of the Distributed Data & Structures 2, 1999


  Loading...