FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2018
020406019622018

Related topics

Related topics

50 relations
Applesoft BASICArray data structureArtificial intelligenceB-tree
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Linked list
Computer science
Recursion
Artificial intelligence
Natural language
C++

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Efficient Linked-List RDF Indexing in Parliament
As the number and scale of Semantic Web applications in use increases, so does the need to efficiently store and retrieve RDF… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Lock-Free Linked Lists Using Compare-and-Swap
Lock-free data structures implement concurrent objects without the use of mutual exclusion. This approach can avoid performance… (More)
  • figure 8
Is this relevant?
1991
1991
Linked-list visualization for debugging
Recent extensions to the VIPS debugger are described. In the original version of VIPS, visualization of linked structures was… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
1990
1990
Using binary search on a linked list
In this article a variation of binary search applicable to a linked list structure is examined. There are no additional data… (More)
  • table 2
  • table 3
  • table 1
Is this relevant?
1990
1990
Parallel Algorithms for Linked List and Beyond
  • Yijie Han
  • SIGAL International Symposium on Algorithms
  • 1990
Linked list problems are fundamental problems in the design of parallel algorithms. We present design techniques for linked list… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
1989
1989
Parallel Algorithms for Computing Linked List Prefix
Given a linked list x1, x2, ..., xn with xi following xi−1 in the list and an associative operation ©, the linked list prefix… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1989
1989
Matching Partition a Linked List and Its Optimization
We show the curve O( nl°gi + log~0n + log/) for the time P complexity of computing a maximal matching for a linked list, where n… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking
The following problem is considered: given a linked list of length n, compute the distance from each element of the linked list… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1983
1983
Maintaining order in a generalized linked list
We give a representation for linked lists which allows to efficiently insert and delete objects in the list and to quickly… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Maintaining Order in a Linked List
We present a new representation for linked lists. This representation allows one to efficiently insert objects into the list and… (More)
Is this relevant?