David W. Walkup

2.8k total citations · 1 hit paper
27 papers, 1.7k citations indexed

About

David W. Walkup is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, David W. Walkup has authored 27 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 6 papers in Geometry and Topology and 5 papers in Discrete Mathematics and Combinatorics. Recurrent topics in David W. Walkup's work include graph theory and CDMA systems (5 papers), Advanced Graph Theory Research (5 papers) and Optimization and Variational Analysis (4 papers). David W. Walkup is often cited by papers focused on graph theory and CDMA systems (5 papers), Advanced Graph Theory Research (5 papers) and Optimization and Variational Analysis (4 papers). David W. Walkup collaborates with scholars based in United States, Spain and Australia. David W. Walkup's co-authors include Frank Proschan, J. D. Esary, Roger J.‐B. Wets, Victor Klee, Peter McMullen, Albert W. Marshall, P. Mani, S. Bachmuth and H. Y. Mochizuki and has published in prestigious journals such as SIAM Journal on Computing, American Mathematical Monthly and SIAM Journal on Applied Mathematics.

In The Last Decade

David W. Walkup

27 papers receiving 1.4k citations

Hit Papers

Association of Random Variables, with Applications 1967 2026 1986 2006 1967 250 500 750
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Association of Random Variables, with Applications
    1967 792 citations J. D. Esary, Frank Proschan et al. The Annals of Mathematical Statistics profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
David W. Walkup United States 16 672 458 385 317 277 27 1.7k
Lajos Takács United States 24 888 1.3× 502 1.1× 207 0.5× 643 2.0× 238 0.9× 144 3.0k
J. H. B. Kemperman United States 18 231 0.3× 273 0.6× 161 0.4× 277 0.9× 95 0.3× 70 1.1k
J. R. Blum United States 19 328 0.5× 562 1.2× 170 0.4× 285 0.9× 264 1.0× 59 1.7k
Ulrich Krengel Germany 18 331 0.5× 417 0.9× 279 0.7× 892 2.8× 223 0.8× 56 1.7k
V. V. Petrov Russia 15 729 1.1× 711 1.6× 120 0.3× 822 2.6× 497 1.8× 65 2.1k
J. Neveu France 13 304 0.5× 429 0.9× 228 0.6× 691 2.2× 341 1.2× 29 1.7k
Y. S. Chow United States 23 1.3k 2.0× 1.4k 3.0× 139 0.4× 691 2.2× 746 2.7× 48 3.3k
Pál Révész Austria 23 412 0.6× 542 1.2× 84 0.2× 770 2.4× 521 1.9× 111 1.6k
Maurice Sion Canada 13 306 0.5× 145 0.3× 430 1.1× 201 0.6× 121 0.4× 31 1.4k
Donald L. Iglehart United States 30 2.1k 3.1× 802 1.8× 256 0.7× 583 1.8× 436 1.6× 87 3.8k

Countries citing papers authored by David W. Walkup

Since Specialization
Citations

This map shows the geographic impact of David W. Walkup's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David W. Walkup with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David W. Walkup more than expected).

Fields of papers citing papers by David W. Walkup

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David W. Walkup. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David W. Walkup. The network helps show where David W. Walkup may publish in the future.

Co-authorship network of co-authors of David W. Walkup

This figure shows the co-authorship network connecting the top 25 collaborators of David W. Walkup. A scholar is included among the top collaborators of David W. Walkup based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with David W. Walkup. David W. Walkup is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Walkup, David W.. (1980). Matchings in random regular bipartite digraphs. Discrete Mathematics. 31(1). 59–64. 43 indexed citations
2.
Walkup, David W.. (1979). How many ways can a permutation be factored into two n-cycles?. Discrete Mathematics. 28(3). 315–319. 18 indexed citations
3.
Walkup, David W.. (1979). On the Expected Value of a Random Assignment Problem. SIAM Journal on Computing. 8(3). 440–442. 80 indexed citations
4.
Walkup, David W.. (1976). Pólya sequences, binomial convolution and the union of random sets. Journal of Applied Probability. 13(1). 76–85. 16 indexed citations
5.
Walkup, David W.. (1972). The number of plane trees. Mathematika. 19(2). 200–204. 13 indexed citations
6.
McMullen, Peter & David W. Walkup. (1971). A generalized lower‐bound conjecture for simplicial polytopes. Mathematika. 18(2). 264–273. 55 indexed citations
7.
Bachmuth, S., H. Y. Mochizuki, & David W. Walkup. (1970). A nonsolvable group of exponent 5. Bulletin of the American Mathematical Society. 76(3). 638–640. 14 indexed citations
8.
Walkup, David W.. (1970). The lower bound conjecture for 3- and 4-manifolds. Acta Mathematica. 125(0). 75–107. 79 indexed citations
9.
Walkup, David W. & Roger J.‐B. Wets. (1969). A Lipschitzian characterization of convex polyhedra. Proceedings of the American Mathematical Society. 23(1). 167–173. 53 indexed citations
10.
Walkup, David W. & Roger J.‐B. Wets. (1969). Stochastic Programs with Recourse II: On the Continuity of the Objective. SIAM Journal on Applied Mathematics. 17(1). 98–103. 18 indexed citations
11.
Walkup, David W. & Roger J.‐B. Wets. (1969). Lifting projections of convex polyhedra. Pacific Journal of Mathematics. 28(2). 465–475. 78 indexed citations
12.
Walkup, David W. & Roger J.‐B. Wets. (1969). Some Practical Regularity Conditions for Nonlinear Programs. SIAM Journal on Control. 7(3). 430–436. 10 indexed citations
13.
Walkup, David W. & Roger J.‐B. Wets. (1968). A note on decision rules for stochastic programs. Journal of Computer and System Sciences. 2(3). 305–311. 7 indexed citations
14.
Walkup, David W.. (1968). Minimal Conditions for Association of Binary Variables. SIAM Journal on Applied Mathematics. 16(6). 1394–1403. 1 indexed citations
15.
Walkup, David W.. (1968). A Simplex with a Large Cross Section. American Mathematical Monthly. 75(1). 34–34. 7 indexed citations
16.
Walkup, David W. & Roger J.‐B. Wets. (1967). Continuity of some convex-cone-valued mappings. Proceedings of the American Mathematical Society. 18(2). 229–235. 64 indexed citations
17.
Walkup, David W. & Roger J.‐B. Wets. (1967). Continuity of Some Convex-Cone-Valued Mappings. Proceedings of the American Mathematical Society. 18(2). 229–229. 22 indexed citations
18.
Walkup, David W. & Roger J.‐B. Wets. (1967). Stochastic Programs with Recourse. SIAM Journal on Applied Mathematics. 15(5). 1299–1314. 136 indexed citations
19.
Esary, J. D., Frank Proschan, & David W. Walkup. (1967). Association of Random Variables, with Applications. The Annals of Mathematical Statistics. 38(5). 1466–1474. 792 indexed citations breakdown →
20.
Walkup, David W.. (1965). Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph. Canadian Journal of Mathematics. 17. 831–838. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Lajos Takács Breakdown of academic impact, for papers by J. H. B. Kemperman Breakdown of academic impact, for papers by J. R. Blum Breakdown of academic impact, for papers by Ulrich Krengel Breakdown of academic impact, for papers by V. V. Petrov Breakdown of academic impact, for papers by J. Neveu Breakdown of academic impact, for papers by Y. S. Chow Breakdown of academic impact, for papers by Pál Révész Breakdown of academic impact, for papers by Maurice Sion Breakdown of academic impact, for papers by Donald L. Iglehart
Rankless by CCL
2026