Skip to search formSkip to main contentSkip to account menu

Implicit data structure

In computer science, an implicit data structure stores very little information other than the main or required data. These storage schemes retain no… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Hierarchical clustering is used in computational biology as a method of comparing sequenced bacterial strain DNA and determining… 
2010
2010
VISION A new approach to knowledge. In the last few decades we have witnessed a major shift to a digital world that not only… 
1996
1996
Algorithms to compute the intersection and union of toleranced polygons with applications Abstract Since mechanical operations… 
1994
1994
In this paper, we present an implicit data structure for partial lattices representation, which allows to efficiently perform… 
1993
1993
In this paper, we introduce an implicit data structure which represents a forest-structured partial order to efficiently perform… 
1992
1992
In this paper we give an implicit data structure for storing a set of 2-key records; it can support the operations insert, delete… 
1989
1989
In this paper, an implicit data structure is presented which makes it possible to represent a tree-structured partial order in… 
1988
1988
We describe an implicit data structure for <italic>n</italic> multikey records that supports searching for a record, under any…