Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,533,803 papers from all fields of science
Search
Sign In
Create Free Account
Linked list
Known as:
Singly linked list
, Tail sharing
, Linked List in Pascal
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACM Turing Award
AVL tree
Abstract data type
Amortized analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
High performance combinatorial algorithm design on the Cell Broadband Engine processor
David A. Bader
,
Virat Agarwal
,
Kamesh Madduri
,
Seunghwa Kang
Parallel Computing
2007
Corpus ID: 16099404
2006
2006
Comparing Information Extraction Pattern Models
Mark Stevenson
,
M. Greenwood
2006
Corpus ID: 16615399
Several recently reported techniques for the automatic acquisition of Information Extraction (IE) systems have used dependency…
Expand
2005
2005
A novel 2D dynamic cellular automata model for photoresist etching process simulation
Zai-fa Zhou
,
Qing‐An Huang
,
Wei-Hua Li
,
W. Lu
IEEE Transactions on Computer-Aided Design of…
2005
Corpus ID: 15965985
A novel two-dimensional (2D) dynamic cellular automata (CA) model is presented for photoresist etching process simulation. The…
Expand
2001
2001
Circular incident edge lists: a data structure for rendering complex unstructured grids
B. Lévy
,
G. Caumon
,
Stephane Conreaux
,
Xavier Cavin
Proceedings Visualization, . VIS '01.
2001
Corpus ID: 6743953
We present the circular incident edge lists (CIEL), a new data structure and a high-performance algorithm for generating a series…
Expand
Review
1998
Review
1998
Unconventional therapies for cancer: 3. Iscador
E. Kaegi
1998
Corpus ID: 70528734
This article, on Iscador, is third in the series that reviews the evidence for the safety and effectiveness of 6 unconventional…
Expand
1997
1997
Implementing wait-free objects on priority-based systems
James H. Anderson
,
Srikanth Ramamurthy
,
R. Jain
ACM SIGACT-SIGOPS Symposium on Principles of…
1997
Corpus ID: 2931152
Wait-free objects are often implemented through the use of a “helping scheme”, whereby one process “helps” one or more other…
Expand
1993
1993
Supporting Pascal Programming with an On-Line Template Library and Case Studies
P. Schank
,
M. Linn
,
M. Clancy
Int. J. Man Mach. Stud.
1993
Corpus ID: 37471592
Abstract We propose a template library as a good representation of programming knowledge, and programming case studies as part of…
Expand
Highly Cited
1986
Highly Cited
1986
A Simulation Study of the CRAY X-MP Memory System
Tony Cheung
,
James Smith
IEEE transactions on computers
1986
Corpus ID: 242632
One of the significant differences between the CRAY X-MP and its predecessor, the CRAY-1S, is a considerably increased memory…
Expand
Highly Cited
1986
Highly Cited
1986
Plasmid–Transformed ura3 fur1 Double-Mutants of S. cerevisiae: An Autoselection System Applicable to the Production of Foreign Proteins
G. Loison
,
M. Nguyen-Juilleret
,
S. Alouani
,
M. Marquet
Bio/Technology
1986
Corpus ID: 25197020
Simple auxotrophic mutants of S. cerevisiae transformed to prototrophy via plasmid DNA must be grown in media in which cured…
Expand
Highly Cited
1985
Highly Cited
1985
Cloning vectors : a laboratory manual
P. Pouwels
,
B. Enger-Valk
,
W. J. Brammar
1985
Corpus ID: 60596867
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)
ACCEPT & CONTINUE