Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient authenticated data structures for graph connectivity and geometric search problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient authenticated data structures for graph connectivity and geometric search problems |
scientific article |
Statements
Efficient authenticated data structures for graph connectivity and geometric search problems (English)
0 references
30 June 2011
0 references
authenticated data structures
0 references
data authentication
0 references
information integrity
0 references
graph connectivity
0 references
geometric searching
0 references
0.8227825164794922
0 references
0.775556206703186
0 references
0.7481251358985901
0 references
0.7467125058174133
0 references
