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: Author="Rothschild, B.L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On triangulations of the convex hull of
n
points
B.L. Rothschild
,
E.G. Straus
Combinatorica
5
, 1985, pp. 167-179
Induced partition theorems
W. Deuber
,
B.L. Rothschild
,
B. Voigt
Journal of Combinatorial Theory Series A
32
, 1982, pp. 225-240
On characterizing subspace
A.A. Bruen
,
B.L. Rothschild
,
J.H. van Lint
Journal of Combinatorial Theory Series A
29
, 1980, pp. 257-260
Characterizing
k
-flats in geometric designs
B.L. Rothschild
,
N.M. Singhi
Journal of Combinatorial Theory Series A
20
, 1976, pp. 398-403
Asymptotic enumeration of partial orders on a finite set
D.J. Kleitman
,
B.L. Rothschild
Trans. Am. Math. Soc.
205
, 1975, pp. 205-220
Characterizing finite subspaces
B.L. Rothschild
,
J.H. van Lint
Journal of Combinatorial Theory Series A
16
, 1974, pp. 97-110
Euclidean Ramsey theorems. I
P. Erdŏs
,
R.L. Graham
,
P. Montgomery
,
B.L. Rothschild
,
J. Spencer
,
E.G. Straus
Journal of Combinatorial Theory Series A
14
, 1973, pp. 341-363
A generalization of Kaplansky's game
D.J. Kleitman
,
B.L. Rothschild
Discrete Mathematics
2
(1), 1972, pp. 173-178