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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

We argue that synthesizing operations on recursive linked data structures is not as hard as it appears and is, in fact, within…

2009

An efficient and accurate computational method is developed for analyzing finite layers of crossed arrays of circular cylinders…

2008

What is the best biomass source and conversion process to create our country in the future? Specifically, is cellulosic ethanol…

2005

This paper describes an Information Extraction (IE) system to identify genic interactions in text. The approach relies on the…

2004

The characterisation of a grammar formalism for natural languages defined in terms of the process of time-linear tree growth for…

2000

In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We…

1994

In the program checking paradigm, the original program is run on the desired input, and its output is checked by another program…

Review

1992

Review

1992

Part 1 of this paper concerning algebraic specifications is an informal introduction to formal methods for software development…

1992

In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding…

1985

The influence of the finite gain-bandwidth product of operational amplifiers on the performance of state-space SC circuits is…