Skip to search formSkip to main contentSkip to account menu

Linked list

Known as: Singly linked list, Tail sharing, Linked List in Pascal 
In computer science, a linked list is a linear collection of data elements, called nodes, each pointing to the next node by means of a pointer. It is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACM Turing AwardAVL treeAbstract data typeAmortized analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Real‐Time Concurrent Linked List Construction on the GPU
We introduce a method to dynamically construct highly concurrent linked lists on modern graphics processors. Once constructed… 
Highly Cited
2004
Highly Cited
2004
Interactive Theorem Proving and Program Development
ion makes it possible to build non-recursive functions directly inside Calculus of Constructions terms, without giving a name to… 
Highly Cited
1998
Highly Cited
1998
Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text
Review
1998
Review
1998
Linux Device Drivers
Preface. Chapter 1. An Introduction to Device Drivers The Role of the Device Driver Splitting the Kernel Classes of Devices and… 
Review
1998
Review
1998
Weak-interaction and nuclear-structure aspects of nuclear double beta decay
Highly Cited
1996
Highly Cited
1996
Secreted amyloid β–protein similar to that in the senile plaques of Alzheimer's disease is increased in vivo by the presenilin 1 and 2 and APP mutations linked to familial Alzheimer's disease
To determine whether the presenilin 1 (PS1), presenilin 2 (PS2) and amyloid β-protein precursor (APP) mutations linked to… 
Highly Cited
1989
Highly Cited
1989
Finite topology as applied to image analysis
  • V. Kovalevsky
  • Computer Vision Graphics and Image Processing
  • 1989
  • Corpus ID: 15401230
Highly Cited
1986
Highly Cited
1986
Data parallel algorithms
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the… 
Highly Cited
1982
Highly Cited
1982
Maintaining order in a linked list
  • Paul F. Dietz
  • Symposium on the Theory of Computing
  • 1982
  • Corpus ID: 24008786
We present a new representation for linked lists. This representation allows one to efficiently insert objects into the list and… 
Highly Cited
1970
Highly Cited
1970
Control flow analysis
  • F. Allen
  • Symposium on Compiler Optimization
  • 1970
  • Corpus ID: 14740595
Any static, global analysis of the expression and data relationships in a program requires a knowledge of the control flow of the… 
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)