Skip to search formSkip to main contentSkip to account menu

Data structure

Known as: Augmenting Data Structures, Data structure augmentation, Structure (disambiguation) 
In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. Data structures can… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
2–3 heapAmortized analysisAttribute–value pairBeam stack search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Synthesizing data structure transformations from input-output examples
We present a method for example-guided synthesis of functional programs over recursive data structures. Given a set of input… 
Review
2012
Review
2012
PRIO-GRID: A unified spatial data structure
Contributions to the quantitative civil war literature increasingly rely on geo-referenced data and disaggregated research… 
Highly Cited
2012
Highly Cited
2012
An Isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces
Highly Cited
2003
Highly Cited
2003
Chemometrics applied to unravel multicomponent processes and mixtures: Revisiting latest trends in multivariate resolution
Highly Cited
2002
Highly Cited
2002
c ○ ESO 2002 Astronomy Astrophysics
  • 2002
  • Corpus ID: 5504247
Highly Cited
2002
Highly Cited
2002
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index… 
Highly Cited
2002
Highly Cited
2002
Factor analysis applied to regional geochemical data: problems and possibilities
Highly Cited
1997
Highly Cited
1997
Construction of Engineering Ontologies for Knowledge Sharing and Reuse
This thesis describes an investigation into the practical use of ontologies for the development of information systems… 
Highly Cited
1994
Highly Cited
1994
On data structures and asymmetric communication complexity
In this paper we consider two-party communication complexity, the ``asymmetric case'', when the input sizes of the two players… 
Highly Cited
1985
Highly Cited
1985
Applying Adaptive Algorithms to Epistatic Domains
John Holland has shown that when adaptive algorithms are used to search certain kinds of extremely large problem spaces, they… 
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)