By Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, and Tal WagnerSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 2001-2003, June 2024. Abstract. We correct an error in the appendix of [N. Alon et al., SIAM J. Discrete...
By Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, and Leon SchillerSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1943-2000, June 2024. Abstract. A recent trend in the context of graph theory is to bring theoretical analyses closer...
By Stefan Dantchev, Nicola Galesi, Abdul Ghani, and Barnaby MartinSIAM Journal on Computing, Volume 53, Issue 3, Page 764-802, June 2024. Abstract. We consider proof complexity in light of the unusual binary encoding of certain combinatorial principles. We...
By Federico Ardila-Mantilla, Christopher Eur, and Raul PenaguiaoSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1930-1942, June 2024. Abstract. We prove that the number of tropical critical points of an affine matroid [math] is...
By Jin Guo, Alexander L. Gavrilyuk, and Ilia PonomarenkoSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1915-1929, June 2024. Abstract. It is proved that the Weisfeiler–Leman dimension of the class of permutation graphs is at...
By Bo Bai, Yu Gao, Jie Ma, and Yuze WuSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1902-1914, June 2024. Abstract. We consider the symmetric difference of two graphs on the same vertex set [math], which...
By Zhiyi Huang, Qiankun Zhang, and Yuhao ZhangSIAM Journal on Computing, Volume 53, Issue 3, Page 701-763, June 2024. Abstract. Three decades ago, Karp, Vazirani, and Vazirani [Proceedings of the 22nd Annual ACM Symposium on Theory...
By Pierre Aboulker, Thomas Bellitto, Frédéric Havet, and Clément RambaudSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1863-1901, June 2024. Abstract. The dichromatic number [math] of a digraph [math] is the least integer [math] such that...
By Xiaoyu Chen, Weiming Feng, Yitong Yin, and Xinyuan ZhangSIAM Journal on Computing, Ahead of Print. Abstract. We prove an optimal [math] lower bound on a spectral gap of the Glauber dynamics for antiferromagnetic two-spin systems with [math]...
By Maël Dumas, Florent Foucaud, Anthony Perez, and Ioan TodincaSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1840-1862, June 2024. Abstract. We show that if the edges or vertices of an undirected graph [math] can be...
By Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, and Mathijs WintraeckenSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1784-1807, June 2024. Abstract. For a locally finite set, [math], the [math]th Brillouin zone of [math] is the region...
By Igor Araujo, Simón Piga, Andrew Treglown, and Zimu XiangSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1808-1839, June 2024. Abstract. Given graphs [math] and [math], a perfect [math]-tiling in [math] is a collection of vertex-disjoint...
By Sijie Ren, Jian Wang, Shipeng Wang, and Weihua YangSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1733-1756, June 2024. Abstract. A graph [math] is called [math]-free if it does not contain any cycle of length...
By Jie Ma and Long-Tu YuanSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1757-1783, June 2024. Abstract. For an integer [math] and a graph [math], the [math]-disintegration of [math] is the graph...
By Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, and Iddo TzameretSIAM Journal on Computing, Volume 53, Issue 3, Page 648-700, June 2024. Abstract. We introduce the binary value principle, which is a simple subset-sum instance expressing that a natural...
By Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, and Imrich VrtoSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1701-1732, June 2024. Abstract. A Nash equilibrium of a routing game is a stable state where no (randomizing) user...
By Bernardo Abrego, Julia Kinzel, Silvia Fernandez-Merchant, Evgeniya Lagoda, and Yakov SapozhnikovSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1686-1700, June 2024. Abstract. A [math]-page book drawing of a graph [math] is a drawing of [math] on [math]...
By Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski, and Paul SeymourSIAM Journal on Computing, Volume 53, Issue 3, Page 624-647, June 2024. Abstract. A hole in a graph is an induced cycle of length at least 4. A hole...
By Kazuhiro Nomoto and Jorn van der PolSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1676-1685, June 2024. Abstract. Tuza [Finite and Infinite Sets, Proc. Colloq. Math. Soc. János Bolyai 37, North Holland, 1981, p. 888] conjectured that...
By Margaret Bayer, Mark Denker, Marija Jelić Milutinović, Rowan Rowlands, Sheila Sundaram, and Lei XueSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1630-1675, June 2024. Abstract. We define the [math]-cut complex of a graph [math] with vertex set [math] to be the...
By Leonardo N. CoreglianoSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1586-1629, June 2024. Abstract. A Sidorenko bigraph is one whose density in a bigraphon [math] is minimized precisely when...
By Kolja Knauer and William T. TrotterSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1566-1585, June 2024. Abstract. Let [math] be a finite set. A family [math] of subsets of [math] is called...
By Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, and Alexander WolffSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1537-1565, June 2024. Abstract. An obstacle representation of a graph [math] consists of a set of pairwise disjoint simply...
By Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, and Clifford SteinSIAM Journal on Computing, Volume 53, Issue 3, Page 588-623, June 2024. Abstract. We consider the following node-capacitated network design problem. The input is an undirected graph, a set...
By Xiangying ChenSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1526-1536, June 2024. Abstract. Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional...
By Umberto De AmbroggioSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1492-1525, June 2024. Abstract. We describe a robust methodology, based on the martingale argument of Nachmias and Peres and...
By Florian Hörsch, Tomáš Kaiser, and Matthias KriesellSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1472-1491, June 2024. Abstract. Recently, it was proved by Bérczi and Schwarcz that the problem of factorizing a matroid...
By Ivailo Hartarsky and Lyuben LichevSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1462-1471, June 2024. Abstract. We show that for every [math], the maximal running time of the [math]-bootstrap percolation in...
By Stijn Cambie, Penny Haxell, Ross J. Kang, and Ronen WdowinskiSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1451-1461, June 2024. Abstract. Given a bipartite graph [math] in which any vertex in [math] (resp., [math]) has degree...
By Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, and Paul WollanSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1438-1450, June 2024. Abstract. We give an approximate Menger-type theorem for the case when a graph [math] contains two [math]...
By Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, and Ran TaoSIAM Journal on Computing, Volume 53, Issue 3, Page 573-587, June 2024. Abstract. We show [math]. Here the class [math] consists of all total search problems that reduce to...
By Kristóf Bérczi, Endre Boros, and Kazuhisa MakinoSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1417-1437, June 2024. Abstract. Horn functions form a subclass of Boolean functions possessing interesting structural and computational properties. These...
By Anqi Li and Lisa SauermannSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1409-1416, June 2024. Abstract. In this paper, we strengthen a result by Green about an analogue of Sárközy’s theorem in...
By Noga Alon, Dor Elboim, János Pach, and Gábor TardosSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1381-1408, June 2024. Abstract. It is known that any open necklace with beads of [math] types, in which the number...
By Patrick Bennett and Alan FriezeSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1369-1380, June 2024. Abstract. We estimate the likely values of the chromatic and independence numbers of the random [math]-uniform [math]-regular...
By Maria Dascălu and Annie RaymondSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1351-1368, June 2024. Abstract. Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph...
By Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, and Daniël PaulusmaSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1315-1350, June 2024. Abstract. A homomorphism [math] from a guest graph [math] to a host graph [math] is locally...
By John FernleySIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1285-1314, June 2024. Abstract. The voter model is a classical interacting particle system, modeling how global consensus is formed...
By Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, William Kuszmaul, and Nicole WeinSIAM Journal on Computing, Ahead of Print. Abstract. The online list-labeling problem is an algorithmic primitive with a large literature of upper bounds, lower bounds, and applications. The goal...
By Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, and Huacheng YuSIAM Journal on Computing, Ahead of Print. Abstract. We give an almost quadratic [math] lower bound on the space usage of any [math]-pass streaming algorithm solving the (directed) [math]-[math]...
By Zichao Dong and Zijian XuSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1269-1284, June 2024. Abstract. We prove that every family of (not necessarily distinct) even cycles [math] on some fixed...
By Kenta NoguchiSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1250-1268, June 2024. Abstract. We completely characterize the triangulations of the projective plane that admit a spanning bipartite quadrangulation...
By Natalie Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, and Shannon OgdenSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1239-1249, June 2024. Abstract. Given a graph [math], we say that an edge-colored graph [math] is [math]-rainbow saturated if...
By Lily Li and Aleksandar NikolovSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1222-1238, June 2024. Abstract. The determinant lower bound of Lovász, Spencer, and Vesztergombi [European J. Combin., 7 (1986), pp....
By Telikepalli KavithaSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1202-1221, June 2024. Abstract. Let [math] be a bipartite graph where every node has a strict ranking of its...
By Bryce Frederickson and Lukas MichelSIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1193-1201, June 2024. Abstract. Given a simple Eulerian binary matroid [math], what is the minimum number of disjoint circuits...
By Sepehr Assadi, Gillat Kol, and Zhijun ZhangSIAM Journal on Computing, Ahead of Print. Abstract. We consider the problem of finding a maximal independent set (MIS) in the shared blackboard communication model with vertex-partitioned inputs. There...
By Robert AndrewsSIAM Journal on Computing, Ahead of Print. Abstract. We show that lower bounds on the border rank of matrix multiplication can be used to nontrivially derandomize polynomial identity testing for...
By Siqi Liu, Sidhanth Mohanty, Tselil Schramm, and Elizabeth YangSIAM Journal on Computing, Ahead of Print. Abstract. The random geometric graph model [math] is a distribution over graphs in which the edges capture a latent geometry. To sample...
By Nikhil Bansal, Lars Rohwedder, and Ola SvenssonSIAM Journal on Computing, Ahead of Print. Abstract. We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines....
By Lijie ChenSIAM Journal on Computing, Ahead of Print. Abstract. Following the seminal work of [R. R. Williams, J. ACM, 61 (2014)], in a recent breakthrough, [C. D. Murray and R....
By Jerry Li and Allen LiuSIAM Journal on Computing, Ahead of Print. Abstract. We consider the problem of clustering mixtures of mean-separated Gaussians in high dimensions. We are given samples from a mixture of...
By Andreas Björklund, Thore Husfeldt, and Petteri KaskiSIAM Journal on Computing, Ahead of Print. Abstract. Given a directed graph as input, we show how to efficiently find a shortest (directed, simple) cycle on an even number...
By Philipp Hieronymi and Chris SchulzSIAM Journal on Computing, Ahead of Print. Abstract. Let [math] be two multiplicatively independent integers. Cobham’s famous theorem states that a set [math] is both [math]-recognizable and [math]-recognizable if...
By Ryan Alweiss, Yang P. Liu, and Mehtaab S. SawhneySIAM Journal on Computing, Ahead of Print. Abstract. We study discrepancy minimization for vectors in [math] under various settings. The main result is the analysis of a new simple...
By Aviad Rubinstein, Saeed Seddighin, Zhao Song, and Xiaorui SunSIAM Journal on Computing, Ahead of Print. Abstract. Longest common subsequence (LCS) is a classic and central problem in combinatorial optimization. While LCS admits a quadratic time solution, recent...
By Xiao MaoSIAM Journal on Computing, Ahead of Print. Abstract. The (unweighted) tree edit distance problem for [math] node trees asks to compute a measure of dissimilarity between two rooted trees...
By Tuukka KorhonenSIAM Journal on Computing, Ahead of Print. Abstract. We give an algorithm that, given an [math]-vertex graph [math] and an integer [math], in time [math] either outputs a tree...
By Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, and Eylon YogevSIAM Journal on Computing, Ahead of Print. Abstract. Laws of large numbers guarantee that given a large enough sample from some population, the measure of any fixed subpopulation is...
By Zongchen Chen, Kuikui Liu, and Eric VigodaSIAM Journal on Computing, Ahead of Print. Abstract. We prove an optimal mixing time bound for the single-site update Markov chain known as the Glauber dynamics or Gibbs sampling...
By Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, and Robin KothariSIAM Journal on Computing, Ahead of Print. Abstract. We exhibit an unambiguous [math]-DNF (disjunctive normal form) formula that requires conjunctive normal form width [math], which is optimal up to...
By Yu Gao, Yang Liu, and Richard PengSIAM Journal on Computing, Ahead of Print. Abstract. We give an algorithm for computing exact maximum flows on graphs with [math] edges and integer capacities in the range [math]...
By Federica Cecchetto, Vera Traub, and Rico ZenklusenSIAM Journal on Computing, Ahead of Print. Abstract. We consider the connectivity augmentation problem (CAP), a classical problem in the area of survivable network design. It is about increasing...
By Aris Filos-Ratsikas, Kristoffer A. Hansen, Kasper Høgh, and Alexandros HollenderSIAM Journal on Computing, Ahead of Print. Abstract. We introduce a new technique for proving membership of problems in FIXP: the class capturing the complexity of computing a fixed...
By Sepehr Assadi and Sahil SinglaSIAM Journal on Computing, Ahead of Print. Abstract. A longstanding open problem in algorithmic mechanism design is to design truthful mechanisms that are computationally efficient and (approximately) maximize welfare...
By Deeparnab Chakrabarty, Yu Chen, and Sanjeev KhannaSIAM Journal on Computing, Ahead of Print. Abstract. Submodular function minimization (SFM) and matroid intersection are fundamental discrete optimization problems with applications in many fields. It is well known...
By Mohsen Ghaffari, Bernhard Haeupler, and Goran ZuzicSIAM Journal on Computing, Ahead of Print. Abstract. We prove the existence of an oblivious routing scheme that is [math]-competitive in terms of [math], thus resolving a well-known question...
By Rahul IlangoSIAM Journal on Computing, Ahead of Print. Attempts to prove the intractability of the Minimum Circuit Size Problem ($\mathsf{MCSP}$) date as far back as the 1950s and are well...
By Jingcheng Liu, Alistair Sinclair, and Piyush SrivastavaSIAM Journal on Computing, Ahead of Print. We explore connections between the phenomenon of correlation decay (more precisely, strong spatial mixing) and the location of Lee--Yang and Fisher zeros...
By Shai Evra, Tali Kaufman, and Gilles ZémorSIAM Journal on Computing, Ahead of Print. Constructing quantum low-density parity-check (LDPC) codes with a minimum distance that grows faster than a square root of the length has been...
By Paul Dütting, Thomas Kesselheim, and Brendan LucierSIAM Journal on Computing, Ahead of Print. Prophet inequalities compare the expected performance of an online algorithm for a stochastic optimization problem to the expected optimal solution in hindsight....
By Daniel Lokshtanov, Saket Saurabh, and Vaishali SurianarayananSIAM Journal on Computing, Ahead of Print. In the Min $k$-Cut problem, the input consists of an edge weighted graph $G$ and an integer $k$, and the task is...
By Tarun Kathuria, Yang P. Liu, and Aaron SidfordSIAM Journal on Computing, Ahead of Print. We present an algorithm which given any $m$-edge directed graph with positive integer capacities at most $U$, vertices $a$ and $b$,...
By Marc Roth, Johannes Schmitt, and Philip WellnitzSIAM Journal on Computing, Ahead of Print. Given a graph property $\Phi$, the problem $\#\ensuremath{{\sc IndSub}}(\Phi)$ asks, on input of a graph $G$ and a positive integer $k$, to...
By Jeff Erickson, Ivor van der Hoog, and Tillmann MiltzowSIAM Journal on Computing, Ahead of Print. We study algorithmic problems that belong to the complexity class of the existential theory of the reals ($\exists \mathbb{R}$). A problem is...
By Hung Le and Shay SolomonSIAM Journal on Computing, Ahead of Print. Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 1980s...
By Alexander Golovnev, Gleb Posobin, Oded Regev, and Omri WeinsteinSIAM Journal on Computing, Ahead of Print. Proving superlogarithmic data structure lower bounds in the static group model has been a fundamental challenge in computational geometry since the early...
By Josh Alman and Lijie ChenSIAM Journal on Computing, Ahead of Print. For a matrix $H$ over a field $\mathbb{F}$, its rank-$r$ rigidity, denoted by $\mathscr{R}_{H}(r)$, is the minimum Hamming distance from $H$ to...
By Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, and Mary WoottersSIAM Journal on Computing, Ahead of Print. We show that Gallager's ensemble of low-density parity-check (LDPC) codes achieves list-decoding capacity with high probability. These are the first graph-based codes...
By Nima Anari and Alireza RezaeiSIAM Journal on Computing, Ahead of Print. We prove that the permanent of nonnegative matrices can be deterministically approximated within a factor of $\sqrt{2}^n$ in polynomial time, improving upon...
By Enric Boix-Adserà, Matthew Brennan, and Guy BreslerSIAM Journal on Computing, Ahead of Print. We consider the problem of counting $k$-cliques in $s$-uniform Erdös--Rényi hypergraphs $G(n,c,s)$ with edge density $c$ and show that its fine-grained average-case...
By Nima Anari, Kuikui Liu, and Shayan Oveis GharanSIAM Journal on Computing, Ahead of Print. We say a probability distribution $\mu$ is spectrally independent if an associated pairwise influence matrix has a bounded largest eigenvalue for the...
By Andrea MontanariSIAM Journal on Computing, Ahead of Print. Let ${A}\in{\mathbb R}^{n\times n}$ be a symmetric random matrix with independent and identically distributed (i.i.d.) Gaussian entries above the diagonal. We consider...
Hong Kong
This prize was created in 2013 to emphasize George Pólya’s legacy of communicating mathematics effectively. It joins two long-standing Pólya prizes SIAM has awarded in combinatorics and other fields beginning in 1969.
Established in 1998 in memory of Ralph E. Kleinman, the prize recognizes contributions that bridge the gap between high-level mathematics and engineering problems. The award is based on the quality and impact of the mathematics.
Established in 2020, the prize is awarded every two years to an early career researcher for recent contributions in the field of applied and computational discrete algorithms.
This joint prize was established in 2002 to honor Sonia Kovalevsky and her work on the theory of differential equations. It is awarded to anyone in the scientific or engineering community whose work highlights the achievements of women in applied and computational mathematics. Nominations can be submitted via the AWM website.
The SIAM Student Paper Prize is awarded annually to the student author(s) of the most outstanding paper(s) accepted by SIAM journals within the three years preceding the nomination deadline. Starting with the 2018 award, the focus of the prize is to recognize outstanding scholarship by students in SIAM journals.
Established in 1967, the prize honors Norbert Wiener, a founder of the field of cybernetics. The prize is awarded every three years by SIAM and the American Mathematical Society (AMS) for an outstanding contribution to applied mathematics. Nominations can be submitted via the AMS website.
Established in 2007, the prize honors Dénes König, a pioneer of discrete mathematics still influencing the field. It is awarded for outstanding research by an individual in their early career, based on publication in peer-reviewed journals.
The prize was established in 1986 in memory of Richard C. DiPrima, who served SIAM for many years and in 1979–1980 as SIAM President. It aims to recognize an early career researcher in applied mathematics and is based on the doctoral dissertation.
The Pioneer Prize is awarded every four years at the International Council for Industrial and Applied Mathematics (ICIAM) Congress to one individual for pioneering work introducing applied mathematical methods and scientific computing techniques to an industrial problem area or a new scientific field of applications. Nominations can be submitted via the ICIAM website.
This prize is intended to emphasize applications of combinatorics and is funded by the estate of Stella Pólya in memory of her husband George. The prize is a modification of the older George Pólya Prize in Combinatorics, originally established as the George Pólya Prize in 1969.
Through the generosity and inspiration of Gerald and Judith Porter, the Mathematical Association of America (MAA), American Mathematical Society (AMS), and SIAM offer this annual lecture at the Joint Mathematics Meetings. The lecture, first awarded in 2010, is given on a mathematical topic accessible to the broader community.
Named in honor of I. E. Block, a co-founder and the first managing director of SIAM, this lecture is open to the public at the SIAM Annual Meeting. It is intended to encourage public appreciation of applied mathematics and computational science by reaching out to the local community.
Established in 1959, the prize honors John von Neumann, a founder of modern computing. The prize is awarded annually for distinguished contributions to applied mathematics and for the effective communication of these ideas to the community.
The JPBM Communications Award is given annually to reward and encourage communicators who, on a sustained basis, bring mathematical ideas and information to non-mathematical audiences. The prize may be awarded in two categories: For Public Outreach and For Expository and Popular Books. Nominations can be submitted via the AMS website.
~*Learn More*~
The MAA-SIAM-AMS Hrabowski-Gates-Tapia-McBay (HGTM) Lecture is named after four influential scientists of color: Freeman Hrabowski, President of the University of Maryland at Baltimore County; James S. Gates, University of Maryland, College Park; Richard Tapia, Rice University; and Shirley McBay, Founder and former President of Quality Education for Minorities. This lecture started in 2016 as an activity of the Mathematical Association of America’s Committee on Minority Participation and became a jointly sponsored MAA-SIAM-AMS event in 2018.
The prize recognizes students for outstanding solutions to real world math problems. It is awarded to six of the teams judged "Outstanding" in the Mathematical Contest in Modeling (MCM) administered annually by the Consortium for Mathematics and Its Applications (COMAP). Registration is accepted via the COMAP website.
The SIAM Outstanding Paper Prize is not currently active. For the 20 years before it was discontinued in 2019, the SIAM Outstanding Paper Prizes brought attention to papers published in SIAM journals. Three awards were made each year to the authors of papers deemed by SIAM journal editors-in-chief worthy of particular attention.
The prize, established in 1985 and originally intended to be awarded periodically, is now awarded annually for contributions to the advancement of applied mathematics on the national or international level.
SIAM Journal on Computing (SICOMP) aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution.
Looking for financial support to further your research? Fellowships often provide funding plus experiential learning opportunities to young researchers. Learn more about fellowship opportunities.
Read More
Internships allow you to network and forge connections for future job possibilities, while also exploring possible areas of interest. Look at this list of companies who offer valuable opportunities.
Our community is founded on igniting groundbreaking developments in applied math and computational science. Take a deeper dive into your area of study with one of these opportunities.