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="Lindstr{\"o}m, Bernt"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Communication complexity of two decision problems
Anders Björner
,
Johan Karlander
,
Bernt Lindström
Discrete Applied Mathematics
39
, 1992, pp. 161-163
On strong joins and pushout of combinatorial geometries
Bernt Lindström
Journal of Combinatorial Theory Series A
25
, 1978, pp. 77-79
On the chromatic number of regular matroids
Bernt Lindström
Journal of Combinatorial Theory Series B
24
(3), 1978, June, pp. 367-369
A theorem on families of sets
Bernt Lindström
Journal of Combinatorial Theory Series A
13
, 1972, pp. 274-277
Determination of two vectors from the sum
Bernt Lindström
Journal of Combinatorial Theory
6
, 1969, pp. 402-407
An inequality for
B_2
-sequences
Bernt Lindström
Journal of Combinatorial Theory
6
, 1969, pp. 211-212
A remark on
B_4
-sequences
Bernt Lindström
Journal of Combinatorial Theory
7
, 1969, pp. 276-277