Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comb.~Theory Series A AND Volume=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Orthogonal circulant matrices over finite fields, and how to find them
F.J. MacWilliams
Journal of Combinatorial Theory Series A
10
, 1971, pp. 1-17
A counterexample to the generalization of Sperner's theorem
R.P. Dilworth
,
Curtis Grefne
Journal of Combinatorial Theory Series A
10
, 1971, pp. 18-21
Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
John Rhodes
Journal of Combinatorial Theory Series A
10
, 1971, pp. 22-73
On the number of open sets of finite topologies
Richard P. Stanley
Journal of Combinatorial Theory Series A
10
, 1971, pp. 74-79
On periodic sequences from
(GF(q)
Robert J. McEliece
Journal of Combinatorial Theory Series A
10
, 1971, pp. 80-91
Gobos in a finite projective plane
George E. Martin
Journal of Combinatorial Theory Series A
10
, 1971, pp. 92-96
The normal structure of
t
-designs
Richard N. Lane
Journal of Combinatorial Theory Series A
10
, 1971, pp. 97-105
t
-designs and
t
-ply homogeneous groups
Richard N. Lane
Journal of Combinatorial Theory Series A
10
, 1971, pp. 106-118
Orthomodular lattices admitting no states
R.J. Greechie
Journal of Combinatorial Theory Series A
10
, 1971, pp. 119-132
Multiplier groups of difference sets
R. Balakrishnan
Journal of Combinatorial Theory Series A
10
, 1971, pp. 133-139
Generalized convexity lattices
Mary Katherine Bennett
Journal of Combinatorial Theory Series A
10
, 1971, pp. 140-144
Numerical polynomials for arbitrary characters
A. Rudvalis
,
E. Snapper
Journal of Combinatorial Theory Series A
10
, 1971, pp. 145-159
Minimax optimization of a unimodal function by variable block derivative search with time delay
John H. Beamer
,
D.J. Wilde
Journal of Combinatorial Theory Series A
10
, 1971, pp. 160-173
A theorem on permutations
Rimhak Ree
Journal of Combinatorial Theory Series A
10
, 1971, pp. 174-175
A selection lemma
Richard Rado
Journal of Combinatorial Theory Series A
10
, 1971, pp. 176-177
Subspaces, subsets, and partitions
Donald E. Knuth
Journal of Combinatorial Theory Series A
10
, 1971, pp. 178-180
Efficient subsemilattice generation
Philip J. Chase
Journal of Combinatorial Theory Series A
10
, 1971, pp. 181-182
On polynomials and crossing numbers of complete graphs
Thomas L. Saaty
Journal of Combinatorial Theory Series A
10
, 1971, pp. 183-184
Jordan circuits of a graph
J. Richard Büchi
,
Gary Haggard
Journal of Combinatorial Theory Series A
10
, 1971, pp. 185-197
Manifolds in stacked 4-polytopes
Amos Altshuler
Journal of Combinatorial Theory Series A
10
, 1971, pp. 198-239
Embedding partial idempotent Latin squares
Charles C. Lindner
Journal of Combinatorial Theory Series A
10
, 1971, pp. 240-245
Some extremal problems in geometry
Paul Erdŏs
,
George Purdy
Journal of Combinatorial Theory Series A
10
, 1971, pp. 246-252
m
-ary closed sequences
Abraham Lempel
Journal of Combinatorial Theory Series A
10
, 1971, pp. 253-258
The completion of finite incomplete Steiner triple systems with applications to loop theory
Christine Treash
Journal of Combinatorial Theory Series A
10
, 1971, pp. 259-265
A new property of partitions with applications to the Rogers-Ramanujan identities
George E. Andrews
Journal of Combinatorial Theory Series A
10
, 1971, pp. 266-270
Seiten 1
2
>