Results 251 to 260 of about 5,217,955 (289)
Some of the next articles are maybe not open access.
1989
The first phase of the Ada Generic Library, Linear Data Structures, can be described in terms of the different data structures that are implemented or planned, most of which are relatively simple and familiar structures such as linked lists, vectors (one dimensional arrays), stacks, queues, deques, etc.
David R. Musser, Alexander A. Stepanov
openaire +1 more source
The first phase of the Ada Generic Library, Linear Data Structures, can be described in terms of the different data structures that are implemented or planned, most of which are relatively simple and familiar structures such as linked lists, vectors (one dimensional arrays), stacks, queues, deques, etc.
David R. Musser, Alexander A. Stepanov
openaire +1 more source
2003
This chapter is restricted to a review of the displacement or node method of linear structural analysis. Many good references on this topic are available to the reader. (See for example Spillers, 1972.)
Robert Levy, William R. Spillers
openaire +1 more source
This chapter is restricted to a review of the displacement or node method of linear structural analysis. Many good references on this topic are available to the reader. (See for example Spillers, 1972.)
Robert Levy, William R. Spillers
openaire +1 more source
MULTIVARIATE LINEAR STRUCTURAL RELATIONS
Biometrika, 1958Brown, R. L., Fereday, F.
openaire +2 more sources
STRUCTURE OF SKEW LINEAR SEMIGROUPS
International Journal of Algebra and Computation, 1993It is known that if \(K\) is a field and \(S \subseteq M_ n(K)\) is a semigroup, then there exists a chain of ideals \(J_ 1 \subseteq J_ 2 \subseteq\dots\subseteq J_ t = S\) of \(S\), \(t \leq 2^ n + n\), such that \(J_ 1\) and all factors \(J_ i/J_{i-1}\), \(i = 2,3,\dots,t\) are uniform (recall that a semigroup \(S\) is called uniform if \(S\) embeds
openaire +2 more sources
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
1998
A data structure with homogeneous elements is linear if it organizes its elements into a sequence. In a computer, each data structure is finite in terms of the number of its elements. A linear data structure has a first and a last element. Each of the other elements in the linear data structure has a predecessor and a successor.
openaire +1 more source
A data structure with homogeneous elements is linear if it organizes its elements into a sequence. In a computer, each data structure is finite in terms of the number of its elements. A linear data structure has a first and a last element. Each of the other elements in the linear data structure has a predecessor and a successor.
openaire +1 more source
Sufficient Linear Structures: Econometric Applications
Econometrica, 1980Gourieroux, Christian, Monfort, Alain
openaire +2 more sources