Results 261 to 270 of about 42,688,929 (320)
Some of the next articles are maybe not open access.
Acta Mathematica Scientia, 1983
Abstract It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence, and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.
openaire +2 more sources
Abstract It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence, and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.
openaire +2 more sources
Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2015Memory reclamation for sequential or lock-based data structures is typically easy. However, memory reclamation for lock-free data structures is a significant challenge. Automatic techniques such as garbage collection are inefficient or use locks, and non-
Trevor Brown
semanticscholar +1 more source
1996
A functional data structure is a data structure that is suitable for implementation in a functional programming language, or for coding in an ordinary language like C or Java using a functional style. Functional data structures are closely related to persistent data structures and immutable data structures—in fact, the three terms are often used ...
openaire +1 more source
A functional data structure is a data structure that is suitable for implementation in a functional programming language, or for coding in an ordinary language like C or Java using a functional style. Functional data structures are closely related to persistent data structures and immutable data structures—in fact, the three terms are often used ...
openaire +1 more source
Algorithms and Data Structures
Lecture Notes in Computer Science, 2021I. Millington
semanticscholar +1 more source
Data Structures, Program Structures
2018At the beginning of July 1975 I left Rome with my wife and my three children, respectively 4 years, 2 years and 8 months old. Destination Ithaca. The house had been lent to us by a colleague of the Computer Science Department of Cornell University and was on the outskirts of Ithaca, uphill.
openaire +1 more source
1993
Abstract Data structures store the information on which a Genstat program operates. Examples include data for statistical analyses, coordinates for graphs, text for annotation, and so on. You can also store almost anything that can be printed in an analysis.
R W Payne +10 more
openaire +1 more source
Abstract Data structures store the information on which a Genstat program operates. Examples include data for statistical analyses, coordinates for graphs, text for annotation, and so on. You can also store almost anything that can be printed in an analysis.
R W Payne +10 more
openaire +1 more source
Genetic Algorithms + Data Structures = Evolution Programs
Springer Berlin Heidelberg, 1996Z. Michalewicz
semanticscholar +1 more source
The Journal of the American Association of Gynecologic Laparoscopists, 1997
J M, Kretz, D B, Redwine, D L, Olive
openaire +2 more sources
J M, Kretz, D B, Redwine, D L, Olive
openaire +2 more sources