Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,627,602 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Beap
Binary heap
Binary tree
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Chronology-Sensitive Hierarchical Clustering of Pyrosequenced DNA Samples of E. coli: A Case Study
Aldrin Montana
,
Alex Dekhtyar
,
Emily R. Neal
,
Michael Black
,
C. Kitts
IEEE International Conference on Bioinformatics…
2011
Corpus ID: 12060949
Hierarchical clustering is used in computational biology as a method of comparing sequenced bacterial strain DNA and determining…
Expand
2010
2010
Research Statement Vision
Virgil Pavlu
2010
Corpus ID: 18678532
VISION A new approach to knowledge. In the last few decades we have witnessed a major shift to a digital world that not only…
Expand
1996
1996
Algorithms to Compute the Intersection and Union of Toleranced Polygons with Applications
Fr Ed
,
Eric Cazals
,
G. D. Ramkumar
1996
Corpus ID: 5912896
Algorithms to compute the intersection and union of toleranced polygons with applications Abstract Since mechanical operations…
Expand
1994
1994
Fast Lattice Browsing on Sparse Representations
M. Talamo
,
P. Vocca
Orders, Algorithms, and Applications
1994
Corpus ID: 27037354
In this paper, we present an implicit data structure for partial lattices representation, which allows to efficiently perform…
Expand
1993
1993
An efficient implicit data structure for relation testing and searching in partially ordered sets
G. Gambosi
,
M. Protasi
,
M. Talamo
BIT
1993
Corpus ID: 46316869
In this paper, we introduce an implicit data structure which represents a forest-structured partial order to efficiently perform…
Expand
1992
1992
The Implicit Dictionary Problem Revisited
T. Lam
,
K. Lee
International Symposium on Algorithms and…
1992
Corpus ID: 37369136
In this paper we give an implicit data structure for storing a set of 2-key records; it can support the operations insert, delete…
Expand
1989
1989
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests
G. Gambosi
,
M. Protasi
,
M. Talamo
Foundations of Software Technology and…
1989
Corpus ID: 42210393
In this paper, an implicit data structure is presented which makes it possible to represent a tree-structured partial order in…
Expand
1988
1988
Storing and searching a multikey table
A. Fiat
,
M. Naor
,
A. Schäffer
,
Jeanette P. Schmidt
,
A. Siegel
Symposium on the Theory of Computing
1988
Corpus ID: 16307924
We describe an implicit data structure for <italic>n</italic> multikey records that supports searching for a record, under any…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE