Burr, Stefan A. (Stefan Andrus) 1940
Overview
Works:  10 works in 56 publications in 1 language and 1,022 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Editor, Author 
Publication Timeline
.
Most widely held works by
Stefan A Burr
The Unreasonable effectiveness of number theory by
Stefan A Burr(
Book
)
22 editions published between 1991 and 2014 in English and held by 563 WorldCat member libraries worldwide
22 editions published between 1991 and 2014 in English and held by 563 WorldCat member libraries worldwide
The Mathematics of networks by
Stefan A Burr(
Book
)
21 editions published between 1982 and 2014 in English and held by 419 WorldCat member libraries worldwide
21 editions published between 1982 and 2014 in English and held by 419 WorldCat member libraries worldwide
Mathematical models of target coverage and missile allocation by
A. Ross Eckler(
Book
)
5 editions published between 1972 and 2001 in English and held by 34 WorldCat member libraries worldwide
5 editions published between 1972 and 2001 in English and held by 34 WorldCat member libraries worldwide
Complete sequences of sets of integer powers(
)
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
The unreasonable effectiveness of number theory : Symposium : Papers(
)
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
An elementary solution of the WaringGoldbach problem by
Stefan A Burr(
)
1 edition published in 1968 in English and held by 1 WorldCat member library worldwide
1 edition published in 1968 in English and held by 1 WorldCat member library worldwide
The Orchard Problem(
Book
)
1 edition published in 1973 in English and held by 1 WorldCat member library worldwide
The geometric version of the problem of KirkmanSteiner triples may be formulated as follows: What is the maximal possible number t(p) of lines each of which contains precisely three points of a suitable set of p points in the Euclidean plane. The first general results were announced by J.J. Sylvester in 1867 and 1868, but up to now no proof of his best claims was published. The authors present a proof of a theorem improving those given by Sylvester, together with several related results. The general estimate they obtain may be put in the form (p(p3)/6) + 1 <or = t(p) <or = (p(p3)/6 + 4p/21). (Author)
1 edition published in 1973 in English and held by 1 WorldCat member library worldwide
The geometric version of the problem of KirkmanSteiner triples may be formulated as follows: What is the maximal possible number t(p) of lines each of which contains precisely three points of a suitable set of p points in the Euclidean plane. The first general results were announced by J.J. Sylvester in 1867 and 1868, but up to now no proof of his best claims was published. The authors present a proof of a theorem improving those given by Sylvester, together with several related results. The general estimate they obtain may be put in the form (p(p3)/6) + 1 <or = t(p) <or = (p(p3)/6 + 4p/21). (Author)
The unreasonable effectiveness of number theory, Held in Orono, Maine, August 67, 1991(
Book
)
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
Integer PrimRead Solutions to a Class of Target Defense Problems(
Book
)
1 edition published in 1983 in English and held by 1 WorldCat member library worldwide
The problem we address is that of choosing a deployment and firing doctrine for defending separated point targets of (potentially) different values against an attack by an unknown member of sequentially arriving missiles. We minimize the total number of defenders subject to an upper bound on the maximum expected value damage per attacking weapon. We show that the Greedy Algorithm produces an optimal integral solution to this problem
1 edition published in 1983 in English and held by 1 WorldCat member library worldwide
The problem we address is that of choosing a deployment and firing doctrine for defending separated point targets of (potentially) different values against an attack by an unknown member of sequentially arriving missiles. We minimize the total number of defenders subject to an upper bound on the maximum expected value damage per attacking weapon. We show that the Greedy Algorithm produces an optimal integral solution to this problem
Ramseyminimal graphs for forests(
Book
)
2 editions published in 1980 in English and held by 0 WorldCat member libraries worldwide
2 editions published in 1980 in English and held by 0 WorldCat member libraries worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Andrews, George E. Editor
 Eckler, A. Ross 19011991 Author
 American Mathematical Society Publisher Editor
 Short Course The Unreasonable Effectiveness of Number Theory (1991, Orono, Me.)
 Short Course The Mathematics of Networks. <1981, Pittsburgh, Pa.>.
 Short Course Tghe Mathematics of Networks (1981, Pittsburgh, Pa.)
 American Mathematical Society Short Course
 Lagarias, J. C. Editor
 Marsaglia, George
 American Mathematical Society Short Course, the Mathematics of Netwoorks$ (1981 : Pittsburgh, Pennsylvanie)
Useful Links
Alternative Names
Burr, Stefan A.
Burr, Stefan A. 1940
Burr, Stefan Andrus
Burr, Stefan Andrus 1940
Stefan Burr American mathematician
Stefan Burr Amerikaans wiskundige
Stefan Burr amerikai matematikus
Stefan Burr matemático estadounidense
Stefan Burr matematico statunitense
Stefan Burr mathématicien américain
ステファン・バー
Languages