Skip to search formSkip to main contentSkip to account menu

Linked data structure

Known as: Connector, Connector (computer science) 
In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We present an index for the local sensitivity of spatiotemporal structures in coupled oscillatory systems based on the properties… 
2010
2010
Individuals learn their environment through repeated experience. Trying to find out new alternatives is an example of exploration… 
2009
2009
An efficient and accurate computational method is developed for analyzing finite layers of crossed arrays of circular cylinders… 
2008
2008
What is the best biomass source and conversion process to create our country in the future? Specifically, is cellulosic ethanol… 
2005
2005
This paper describes an Information Extraction (IE) system to identify genic interactions in text. The approach relies on the… 
2004
2004
The characterisation of a grammar formalism for natural languages defined in terms of the process of time-linear tree growth for… 
2003
2003
Pits and oval structures dating from the Meso to the Early and Mid Neo. Pottery and lithics also present. Later Beaker pot… 
1999
1999
A new "linkage crossover" operator based on probabilistic methodology is proposed. The genetic algorithm using this operator is… 
1992
1992
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding… 
1985
1985
The influence of the finite gain-bandwidth product of operational amplifiers on the performance of state-space SC circuits is…