Stefan Burr | Academic Influence

Stefan Burr's AcademicInfluence.com Rankings

Stefan Burr

Mathematics

#2063

World Rank

#3244

Historical Rank

#825

USA Rank

Measure Theory

#3901

World Rank

#4596

Historical Rank

#1118

USA Rank

mathematics Degrees

Download Badge

Mathematics

Stefan Burr's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Stefan Burr Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Stefan Andrus Burr is a mathematician and computer scientist. He is a retired professor of Computer Science at The City College of New York. Burr received his Ph.D. in 1969 from Princeton University under the supervision of Bernard Dwork; his thesis research involved the Waring–Goldbach problem in number theory, which concerns the representations of integers as sums of powers of prime numbers.

(See a Problem?)

Stefan Burr's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Mathematics of networks (1982) (216)
Mathematical Models Of Target Coverage And Missile Allocation (1972) (104)
Generalized ramsey theory for graphs - a survey (1974) (93)
ON THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS (1973) (89)
Ramsey Numbers Involving Graphs with Long Suspended Paths (1981) (87)
Generalizations of a Ramsey-theoretic result of chvátal (1983) (80)
Ramsey theorems for multiple copies of graphs (1975) (74)
The orchard problem (1974) (63)
On the Ramsey multiplicities of graphs - problems and recent results (1980) (59)
Some Complete Bipartite Graph - Tree Ramsey Numbers (1988) (42)
A SURVEY OF NONCOMPLETE RAMSEY THEORY FOR GRAPHS (1979) (40)
Ramsey-minimal graphs for forests (1982) (34)
Ramsey-minimal graphs for star-forests (1981) (34)
On the use of senders in generalized ramsey theory for graphs (1985) (32)
Integer Prim-Read Solutions to a Class of Target Defense Problems (1985) (32)
The Unreasonable Effectiveness of Number Theory (1993) (28)
On the Computational Complexity of Ramsey—Type Problems (1990) (27)
AN EXTREMAL PROBLEM IN GENERALIZED RAMSEY THEORY (1980) (23)
Ramsey-minimal graphs for multiple copies (1978) (22)
On ramsey numbers for large disjoint unions of graphs (1988) (22)
Ramsey numbers for the pair sparse graph-path or cycle (1982) (22)
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (1984) (22)
Diagonal Ramsey numbers for small graphs (1983) (21)
A CLASS OF RAMSEY-FINITE GRAPHS (2004) (21)
What can we hope to accomplish in generalized Ramsey theory? (1987) (19)
On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large (1987) (18)
Goodness of trees for generalized books (1987) (17)
Maximal antiramsey graphs and the strong chromatic number (1989) (16)
An inequality involving the vertex arboricity and edge arboricity of a graph (1986) (15)
Complete sequences of sets of integer powers (1996) (12)
On Ramsey numbers for linear forests (1974) (12)
On unavoidable digraphs in orientations of graphs (1987) (12)
The Ramsey number for the pair complete bipartite graph-graph of limited degree (1985) (10)
On Ramsey numbers involving starlike multipartite graphs (1983) (9)
Antidirected Subtrees of Directed Graphs (1982) (8)
A ramsey-theoretic result involving chromatic numbers (1980) (7)
Ramsey numbers of graphs with long tails (1982) (7)
On Graphs with Ramsey-Infinite Blocks (1985) (7)
On the completeness of sequences of perturbed polynomial values. (1979) (5)
Completeness Properties of Perturbed Sequences (1981) (5)
Generalized Ramsey theory and decomposable properties of graphs (1999) (5)
Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory* (1980) (3)
Computing cube roots when a fast square root is available (1982) (3)
On graphsG for which all large trees areG-good (1993) (3)
Multicolor Ramsey numbers involving graphs with long suspended paths (1982) (3)
A Ramsey-type property in additive number theory (1985) (3)
Ramsey numbers for certain k-graphs (1981) (2)
A theorem on difference equations and its generalization to operator equations (1970) (1)
On uniform elementary estimates of arithmetic sums (1973) (1)
Graph Theory (1999) (0)
Location on Networks: Theory and Algorithms (Gabriel Y. Handler And Pitu B. Mirchandani) (1981) (0)
The Theory of Partitions (George E. Andrews) (1979) (0)
set r(G) = r(G,G) ; these are called the diagonal Ramsey numbers . These (1976) (0)
On detecting a periodic event by means of periodic observations. I (1975) (0)

This paper list is powered by the following services:

Other Resources About Stefan Burr

en.wikipedia.org

What Schools Are Affiliated With Stefan Burr?

Stefan Burr is affiliated with the following schools:

Image Attributions

Image Source for Stefan Burr