A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Author index for volume 56
1991
Journal of combinatorial theory. Series A
Preserved Fulltext
All rights of reproduction in any form reserved. ...
Patrick, 223
Hilton, A. ...
doi:10.1016/0097-3165(91)90043-g
fatcat:ovntb7oecjbclpdcfqcejg5tue
Author index for volume 31
1981
Journal of combinatorial theory. Series A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
All rights of reproduction
in any form reserved
AUTHOR
INDEX
FOR VOLUME
31
341
S
U
Sierksma, Gerard, 190
Stanley, Richard P., 56
Sulanke, Robert A., 33
Prinfed in Belgium ...
A 31, 340-341 (1981) Author Uchimura, Keisuke, 13 I V van Leijenhorst. D. C.. 146 Index for Volume 31
A
Ahrens, .I. H.. 277
Anstee, R. P.. 256
B
Biennot. Gerard,
43
Billera. ...
doi:10.1016/0097-3165(81)90063-7
fatcat:f5zdrqknizht3plypxkxjiashu
Page 18 of American Mathematical Society. Bulletin of the American Mathematical Society Vol. 61, Issue 3
[page]
1955
American Mathematical Society. Bulletin of the American Mathematical Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A. 55, 706.
Youngs, J. W. T. 54, 1044. —— Topological methods in the theory of Lebesgue area, 56, 17.
Zariski, O. 53, 1101. Zygmund, A. 59, 516. ...
.
—— Combinatorial homotopy. 1, 55, 213.
—— Combinatorial homotopy. 11, 55, 453.
Whitney, H. 52, 965.
Whyburn, G. T. 56, 142.
Widder, D. V. 60, 126.
—— The convolution transform, 60, 444. ...
Page 3442 of Mathematical Reviews Vol. , Issue 84h
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The reader is assumed to be familiar with graph theory, linear algebra, some combinatorial optimization and linear programming
Sekiguchi, Yasuki 84h:90087 A unifying framework of combinatorial optimization ...
From the introduction: “This work aims to introduce the reader to the field of matroid theory from the point of view of combinatorial optimization. ...
Using error-correcting dependencies for collaborative filtering
2008
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
., A new combinatorial approach to the construction of constant composition codes (2008) Science in China, Series A: Mathematics, 51 (3), pp. 416-426. 33. ...
Journal of Combinatorial Theory.Series A, 113(8), 1719-1731. 52. Smith, D. H., Hughes, L. A., & Perkins, S. (2006). A new table of constant weight codes of length greater than 28. ...
doi:10.1016/j.datak.2008.04.008
fatcat:xkgdz76effgp3lsjzeftlebspy
An algorithm for optimal difference systems of sets
2007
Journal of combinatorial optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Tonchev Steiner systems for two-stage disjunctive testing, Journal of Combinatorial Optimization, 15 (2008), 1-6. 4. C. Sarami and V.D. ...
Tonchev, Difference systems of sets and cyclotomy, Discrete Math. 308 (2008), 2959-2969. 2007 7. V.D. Tonchev, A class of 2-(3 n 7, 3 n−1 7, (3 n−1 7 − 1)/2) designs, J. ...
Tonchev, A formula for the number of Steiner quadruple systems on 2 n points of 2-rank 2 n − n, Journal of Combinatorial Designs, 11 (2003), 260-274. 25. M. Harada and V.D. ...
doi:10.1007/s10878-007-9064-6
fatcat:zgfx2dhb6rabhkpjcfe3vbummy
Page 1127 of Mathematical Reviews Vol. 52, Issue 4
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This is a one-volume version of a proceedings that originally appeared in three volumes (the detailed references are given
below).
Table of Contents: H. J. ...
NATO Advanced Study Institutes Series, Series C: Mathe- matical and Physical Sciences, Vol. 16.
D. ...
George E. Andrews: Partitions: Yesterday and today
1981
Historia Mathematica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
volumes of the Journal for the History of Arabic Science--a most commendable achievement. ...
Andrews again uses combinatorial tools and, in particular, the Durfee square to prove a result in partition theory deduced from false theta series. ...
doi:10.1016/0315-0860(81)90013-6
fatcat:fibtcvocmjbbxgwgqopdktskxu
CPC volume 1 issue 2 Cover and Back matter
1992
Combinatorics, probability & computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
LMS Lecture Note Series Lecture notes and refereed conference proceedings of the highest quality (each volume c. £20 paperback, about 10 volumes per year). ...
Its scope covers combinatorics in a broad sense, including classical and algebraic graph theory, probabilistic methods, random structures, combinatorial probability and limit theorems for random combinatorial ...
doi:10.1017/s0963548300000110
fatcat:dhfkwtyvbzgn5jqytlgfeqejsq
Page 6134 of Mathematical Reviews Vol. , Issue 95j
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
With the help of REDUCE 3.4 the author calculates the expected
value of the volume, V, of a tetrahedron whose vertices are chosen
at random in the interior of a given tetrahedron. ...
Herbert Ziezold (D-KSSL; Kassel)
95j:60024 60D05 52A22 52A38
Mannion, David (4-LNDHB; Egham)
The volume of a tetrahedron whose vertices are chosen at random in
the interior of a parent tetrahedron. ...
A decade of Finite Fields and Their Applications
2005
Finite Fields and Their Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This activity has occurred in a wide variety of areas, including of course finite field theory itself, along with algebraic coding theory, cryptography, combinatorial design theory, and algebraic geometry ...
The journal Finite Fields and Their Applications (FFTA) began publication in 1995, and in this special issue, we provide a flavor of some of the huge volume of finite fieldrelated activity that has taken ...
doi:10.1016/j.ffa.2005.05.009
fatcat:rgii7n2uanc27ohm3tse4tcbhi
Page 5297 of Mathematical Reviews Vol. , Issue 2000g
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
New Series 1 m: 2: Monographs, 55 PASS * 2 * 00030 Lecture Notes in Physics New ‘Series m 2: Monographs, 56 * 81228 * 62231 . * 62013 . *81009 sacccs, ; +00057b, a * 00066 * 00091
Lecture Notes in Statistics ...
of Science Association, 16th Biennial, 1998 Piero between Art and Science, International . *01017 Memorial Volume: Harris, William A., Jr Methods and applications for functional equations
Mikio Sato: ...
Page 6401 of Mathematical Reviews Vol. , Issue 95k
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
programs and problems” [MR 57 #14595]; “Lower bounds by Galois theory” [MR 56 #7315]; “Generalized Galois theory and its application to complexity” [MR 82):68018]. ...
., Berlin, 1966] that a simple fragment of L.,. is sufficient for formulating properties of programs and of data structures. This gave rise to a series of papers concerning the logic of programs. ...
Page 4068 of Mathematical Reviews Vol. 58, Issue 6
[page]
1979
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{For the entire collection see MR 56 #8371.}
Kol'cov, V. N. 58 #27587 Decomposition of a bipartite graph into a minimal number of plane subgraphs. ...
Nishizeki, Takao; Saito, Nobuji
Necessary and sufficient conditions for a graph to be
three-terminal series-parallel-cascade.
J. Combin. Theory Ser. B 2A (1978), no. 3, 344-361. ...
MTK volume 57 issue 2 Cover and Back matter
2011
Mathematika
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Printed back numbers Orders for volume 56 (2010) onwards should be sent to Cambridge University Press. ...
and Andrei Yafaev A characterization of special
subvarieties
263-273
Corrigendum.
328-328
Contents of volume 57
VOLUME 57 PART 2 JULY 2011 ...
doi:10.1112/s0025579311000027
fatcat:k2cdaa26mzefzdecx7tzadqjii
« Previous
Showing results 1 — 15 out of 10,588 results