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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present the first verification of full functional correctness for a range of linked data structure implementations, including… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize… (More)
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Abstract: In this paper, we describe an effective compile-time analysis for software prefetching in Java. Previous work in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously… (More)
  • table 1
  • figure 2
  • figure 3
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We introduce a dynamic scheme that captures the accesspat-terns of linked data structures and can be used to predict future… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data… (More)
  • figure 1
  • figure 3
Is this relevant?
Review
1981
Review
1981
A concise and unified view of the numerous existing algorithms for performing garbage collection of linked data structures is… (More)
  • figure I
  • figure 3
  • table 3
  • table 5
Is this relevant?