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="Kruskal, J.B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A flexible way of counting large numbers approximately in small registers
J.B. Kruskal
,
A.G. Greenberg
Algorithmica
6
(4), 1991, pp. 590-596
The theory of well-quasi-ordering: A frequently discovered concept
J.B. Kruskal
Journal of Combinatorial Theory Series A
13
, 1972, pp. 297-305
The number of
s
-dimensional faces in a complex: An analogy between the simplex and the cube
J.B. Kruskal
Journal of Combinatorial Theory
6
, 1969, pp. 86-89
Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture
J.B. Kruskal
Trans. Am. Math. Soc.
95
, 1960, pp. 210-225
On the shortest spanning subtree of a graph and the traveling salesman problem
J.B. Kruskal
Proceedings of the American Mathematical Society
7
, 1956, pp. 48-50