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.
CAMBRIDGE, MA, United States
Swarthmore, , United States
Chicago, IL, United States, Chicago, IL, United States
By Sujoy Bhore and Csaba D. TóthSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2411-2444, September 2022. Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the...
By Ahmad Abdi, Gérard Cornuéjols, and Zuzanna PalionSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2445-2451, September 2022. Let $G=(V,E)$ be a graph, and $T\subseteq V$ a nonempty subset of even cardinality. The famous...
La Jolla, CA, United States
Pittsburgh, PA, United States
Hong Kong
Germantown, MD, United States
By Vojtech Dvorak and Ohad KleinSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2393-2410, September 2022. Let $a_1, \ldots, a_n \in \mathbb{R}$ satisfy $\sum_i a_i^2 = 1$, and let $\varepsilon_1, \ldots, \varepsilon_n$...
By Tibor Jordán and Shin-ichi TanigawaSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2367-2392, September 2022. In the random subgraph model we consider random subgraphs $G(t)$ of a graph $G$ obtained as...
Winter Park, FL, United States
Guangzhou, , China
By Mingyang Guo, Hongliang Lu, and Dingjia MaoSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2339-2351, September 2022. Let $n,s,k$ be three positive integers such that $1\leq s\leq(n-k+1)/k$ and let $[n]=\{1,\ldots,n\}$. Let $H$...
By Jungho Ahn, Kevin Hendrey, Donggyu Kim, and Sang-il OumSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2352-2366, September 2022. Bonnet et al. [J. ACM, 69 (2022), 3] introduced the twin-width of a graph. We show...
By Yulin Chang, Huifen Ge, Jie Han, and Guanghui WangSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2323-2338, September 2022. For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$...
By Tobias Friedrich, Andreas Göbel, Martin S. Krejca, and Marcus PappikSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2282-2322, September 2022. The hard-sphere model is one of the most extensively studied models in statistical physics. It describes...
By François Clément and Thang PhamSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2271-2281, September 2022. In this paper, we study the Erdös--Falconer distance problem in five dimensions for sets of Cartesian...
By Colin Cooper and Alan FriezeSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2238-2257, September 2022. We consider the rank of a class of sparse Boolean matrices of size $n \times n$....
By Yan Cao, Guantao Chen, Guangming Jing, and Songling ShanSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2258-2270, September 2022. Given a simple graph $G$, denote by $\Delta(G)$, $\delta(G)$, and $\chi'(G)$ the maximum degree, the minimum...
By Neil Fan and Peter GuoSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2225-2237, September 2022. An odd diagram class is a set of permutations with the same odd diagram. Brenti, Carnevale,...
By Michał Dȩbsk, Marta Piecyk, and Paweł Rza̧żewskiSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2205-2224, September 2022. We study the 3-Coloring problem in graphs with small diameter. In 2013, Mertzios and Spirakis showed...
By Kazuki Matoya and Taihei OkiSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2121-2158, September 2022. Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings...
By Andreas Galanis, Leslie A. Goldberg, and Andres Herrera-PoyatosSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2159-2204, September 2022. We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in...
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 Anne Broadbent and Alex Bredariol GriloSIAM Journal on Computing, Volume 51, Issue 4, Page 1400-1450, August 2022. We provide several advances to the understanding of the class of quantum Merlin--Arthur (QMA) proof systems, the...
By Marthe Bonamy, Cyril Gavoille, and Michał PilipczukSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2082-2099, September 2022. An adjacency labeling scheme for a given class of graphs is an algorithm that, for every...
By Peter Nelson and Zach WalshSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2100-2120, September 2022. A frame template over a field $\mathbb F$ describes the precise way in which a given...
By Sepehr Hajebi, Yanjia Li, and Sophie SpirklSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2004-2027, September 2022. For a positive integer $r$ and graphs $G$ and $H$, we denote by $G+H$ the disjoint...
By Peter Frankl, János Pach, and Dömötör PálvölgyiSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2073-2081, September 2022. In a recent breakthrough, Adiprasito, Avvakumov, and Karasev constructed a triangulation of the $n$-dimensional real projective...
By Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, and Chuanqi XiaoSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2028-2050, September 2022. Let ${\rm ex}_{\mathcal{P}}(n,T,H)$ denote the maximum number of copies of $T$ in an $n$-vertex planar graph...
By James Oxley and Jagdeep SinghSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 2051-2072, September 2022. The class of cographs or complement-reducible graphs is the class of graphs that can be generated...
By Eva-Maria C. Hols, Stefan Kratsch, and Astrid PieterseSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1955-1990, September 2022. The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized...
By Jiaao Li, Xueliang Li, and Meiling WangSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1991-2003, September 2022. For integers $k$ and $d$ with $k\ge 2d>0$, a circular ${k}/{d}$-flow of a graph $G$ is...
By Nathan Mull, Shuo Pang, and Alexander RazborovSIAM Journal on Computing, Volume 51, Issue 4, Page 1368-1399, August 2022. We prove that conflict-driven clause learning (CDCL) SAT-solvers with the ordered decision strategy and the DECISION learning...
By MohammadTaghi HajiAghayi, Masoud Seddighin, Saeedreza Seddighin, and Xiaorui SunSIAM Journal on Computing, Volume 51, Issue 4, Page 1341-1367, August 2022. Longest common subsequence (LCS) is one of the most fundamental problems in combinatorial optimization. Apart from theoretical...
By Umberto MartÍnez-Pen͂asSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1868-1886, September 2022. We construct six new explicit families of linear maximum sum-rank distance (MSRD) codes, each of which...
By Maximus Redman, Lauren Rose, and Raphael WalkerSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1861-1867, September 2022. A Sidon set is a subset of an Abelian group with the property that each sum...
By Victor Campos, Raul Lopes, Ana Karolinna Maia, and Ignasi SauSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1887-1917, September 2022. The grid theorem of Robertson and Seymour [J. Combin. Theory Ser. B, 41 (1986), pp. 92--114]...
By Martin Henk, Stefan Kuhlmann, and Robert WeismantelSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1918-1942, September 2022. We study the lattice width of lattice-free polyhedra given by ${A}{x}\leq{b}$ in terms of $\Delta({A})$, the...
By Nicolas Fraiman, Lyuben Lichev, and Dieter MitscheSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1943-1954, September 2022. In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to...
By Akash Kumar, C. Seshadhri, and Andrew M. StolmanSIAM Journal on Computing, Ahead of Print. Let $G$ be a graph with $n$ vertices and maximum degree $d$. Fix some minor-closed property $\mathcal{P}$ (such as planarity). We say...
By Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, and Yelena YuditskySIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1848-1860, September 2022. For $n\geq s> r\geq 1$ and $k\geq 2$, write $n \rightarrow (s)_{k}^r$ if every hyperedge coloring...
By John Hershberger, Subhash Suri, and Hakan YildizSIAM Journal on Computing, Volume 51, Issue 4, Page 1296-1340, August 2022. We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane....
By Mengyu Cao, Benjian Lv, Kaishun Wang, and Sanming ZhouSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1823-1847, September 2022. Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. In this paper we...
By Margarita Akhmejanova and Maksim ZhukovskiiSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1788-1799, September 2022. In this paper, we disprove EMSO(FO$^2$) convergence law for the binomial random graph $G(n,p)$ for any...
By Arpitha P. Bharathi and Monaldo MastrolilliSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1800-1822, September 2022. In this paper we examine polynomial ideals that are the vanishing ideals of solution sets of...
By Fabrizio Grandoni, Bundit Laekhanukit, and Shi LiSIAM Journal on Computing, Ahead of Print. In the directed Steiner tree (DST) problem, we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of...
By Sylvia Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, and Lu WangSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1730-1747, September 2022. Given a connected undirected graph $\overline{G}$ on $n$ vertices and nonnegative edge costs $c$, the $\ensuremath{{2ECM}}$...
By Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Yota OtachiSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1761-1787, September 2022. Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central topic of study in...
By María A. Hernández Cifre and Eduardo LucasSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1748-1760, September 2022. The conjectured log-Brunn--Minkowski inequality says that the volume of centrally symmetric convex bodies $K,L\subset\mathbb{R}^n$ satisfies ${vol}\bigl((1-\lambda)\cdot...
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 Konrad Anand and Mark JerrumSIAM Journal on Computing, Volume 51, Issue 4, Page 1280-1295, August 2022. We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin...
By Urmila MahadevSIAM Journal on Computing, Volume 51, Issue 4, Page 1172-1229, August 2022. We present the first protocol allowing a classical computer to interactively verify the result of an efficient...
By Alan M. Frieze, Wesley Pegden, and Tomasz TkoczSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1687-1710, September 2022. Let $p=\frac{1+\varepsilon}{n}$. It is known that if $N=\varepsilon^3n\to\infty$, then with high probability (w.h.p.) $G_{n,p}$ has a...
By Jonathan Tidor and Yufei ZhaoSIAM Journal on Computing, Volume 51, Issue 4, Page 1230-1279, August 2022. We study the property testing of functions $\mathbb F_p^n\to[R]$ for fixed prime $p$ and positive integer $R$....
By Peter Nelson and Kazuhiro NomotoSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1711-1729, September 2022. A simple binary matroid is called $I_4$-free if none of its rank-4 flats are independent sets....
By Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, and Eran OmriSIAM Journal on Computing, Volume 51, Issue 4, Page 1126-1171, August 2022. In his seminal work, Cleve [Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986,...
By Renato Paes Leme and Jon SchneiderSIAM Journal on Computing, Volume 51, Issue 4, Page 1096-1125, August 2022. We study the problem of contextual search, a multidimensional generalization of binary search that captures many problems...
By Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, and Jan VolecSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1678-1686, September 2022. The Hall ratio of a graph $G$ is the maximum value of $v(H) / \alpha(H)$ taken...
By Ian M. Wanless and David R. WoodSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1663-1677, September 2022. The Lovász Local Lemma is a powerful probabilistic technique for proving the existence of combinatorial objects....
By Esther Ezra and Micha SharirSIAM Journal on Computing, Volume 51, Issue 4, Page 1065-1095, August 2022. We consider several intersection searching problems that involve lines in ${\mathbb R}^3$ and present improved algorithms for...
By Hongliang Lu, Yan Wang, and Xingxing YuSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1645-1662, September 2022. Let $n$ be a sufficiently large integer with $n\equiv 0\pmod 4$, and let $F_i \subseteq{[n]\choose 4}$,...
By Lap Chi Lau and Hong ZhouSIAM Journal on Computing, Volume 51, Issue 4, Page 1018-1064, August 2022. We present a spectral approach to design approximation algorithms for network design problems. We observe that the...
By Rong ChenSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1627-1644, September 2022. The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and...
By Yahav Alon, Michael Krivelevich, and Peleg MichaeliSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1612-1626, September 2022. We present an explicit connected spanning structure that appears in a random graph just above the...
By Lap Chi Lau and Hong ZhouSIAM Journal on Computing, Volume 51, Issue 4, Page 900-951, August 2022. We present a local search framework to design and analyze both combinatorial algorithms and rounding algorithms for...
By Anupam Gupta, Amit Kumar, and Debmalya PanigrahiSIAM Journal on Computing, Volume 51, Issue 4, Page 975-1017, August 2022. We consider two generalizations of the classical weighted paging problem that incorporate the notion of delayed service...
By Haim Kaplan, Yishay Mansour, Yossi Matias, and Uri StemmerSIAM Journal on Computing, Volume 51, Issue 4, Page 952-974, August 2022. We present efficient differentially private algorithms for learning unions of polygons in the plane (which are not...
By Vincent Moulton and Taoyang WuSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1586-1611, September 2022. RNA molecules are single-stranded analogues of DNA that can fold into various structures which influence their...
By Holger Dell, John Lapinskas, and Kitty MeeksSIAM Journal on Computing, Volume 51, Issue 4, Page 849-899, August 2022. In this paper, we design efficient algorithms to approximately count the number of edges of a given...
By Michael Elkin and Ofer NeimanSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1529-1550, September 2022. Given metric spaces $(X,d)$ and $(Y,\rho)$ and an ordering $x_1,x_2,\ldots,x_n$ of $(X,d)$, an embedding $f: X...
By Simona Boyadzhiyska, Dennis Clemens, and Pranshu GuptaSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1503-1528, September 2022. Given any graph $H$, a graph $G$ is said to be $q$-Ramsey for $H$ if every...
By Luis Montejano, Jorge L. Ramírez Alfonsín, and Ivan RasskinSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1551-1566, September 2022. A self-dual map $G$ is said to be antipodally self-dual if the dual map $G^*$ is...
By Guyslain Naves and Bruce ShepherdSIAM Journal on Discrete Mathematics, Volume 36, Issue 3, Page 1567-1585, September 2022. Gomory--Hu (GH) trees are a classical sparsification technique for graph connectivity. For an edge-capacitated undirected graph...
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$, and...
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 Konstantin Makarychev, Yury Makarychev, and Ilya RazenshteynSIAM Journal on Computing, Ahead of Print. Consider an instance of Euclidean $k$-means or $k$-medians clustering. We show that the cost of the optimal solution is preserved up to...
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 Aris Filos-Ratsikas and Paul W. GoldbergSIAM Journal on Computing, Ahead of Print. We resolve the computational complexity of three problems known as Necklace Splitting, Consensus-Halving, and Discrete Ham sandwich, showing that they are PPA-complete....
By Nir Bitansky, Dakshita Khurana, and Omer PanethSIAM Journal on Computing, Ahead of Print. The round complexity of zero-knowledge protocols is a long-standing open question and is yet to be settled under standard assumptions. So far,...
By Aaron Bernstein, Maximilian Probst Gutenberg, and Christian Wulff-NilsenSIAM Journal on Computing, Ahead of Print. Computing the strongly connected Components (SCCs) in a graph $G=(V,E)$ is known to take only $O(m + n)$ time using an algorithm...
By Mika Göös and Aviad RubinsteinSIAM Journal on Computing, Ahead of Print. We prove an $N^{2-o(1)}$ lower bound on the randomized communication complexity of finding an $\epsilon$-approximate Nash equilibrium (for constant $\epsilon>0$) in a...
By Aaron Bernstein and Danupon NanongkaiSIAM Journal on Computing, Ahead of Print. In the distributed all-pairs shortest paths problem, every node in the weighted undirected distributed network (the CONGEST model) needs to know the...
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 Josh Alman and Virginia Vassilevska WilliamsSIAM Journal on Computing, Ahead of Print. We study the known techniques for designing Matrix Multiplication algorithms. The two main approaches are the Laser method of Strassen, and the...
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 Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, and Elaine ShiSIAM Journal on Computing, Ahead of Print. Sorting extremely large datasets is a frequently occurring task in practice. These datasets are usually much larger than the computer's main memory;...
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 Alexander A. Sherstov and Pei WuSIAM Journal on Computing, Ahead of Print. The threshold degree of a Boolean function $f\colon{{\{0,1\}}^n}\to{\{0,1\}}$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign:...
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 Jeongwan Haah, Matthew B. Hastings, Robin Kothari, and Guang Hao LowSIAM Journal on Computing, Ahead of Print. We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice...
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...
By Akash Kumar, C. Seshadhri, and Andrew StolmanSIAM Journal on Computing, Ahead of Print. Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\varepsilon...
By Urmila MahadevSIAM Journal on Computing, Ahead of Print. We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. The scheme allows a classical client to...
By Jatin Batra, Naveen Garg, and Amit KumarSIAM Journal on Computing, Ahead of Print. In the weighted flow-time problem on a single machine, we are given a set of $n$ jobs, where each job has a...
By Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, and Junxing WangSIAM Journal on Computing, Ahead of Print. We develop a framework for graph sparsification and sketching, based on a new tool, short cycle decomposition, which is a decomposition of...
By Vera Traub and Jens VygenSIAM Journal on Computing, Ahead of Print. Among various variants of the traveling salesman problem (TSP), the $s$-$t$-path graph TSP has the special feature that we know the...
By Martin Grohe, Daniel Neuen, and Pascal SchweitzerSIAM Journal on Computing, Ahead of Print. In a recent breakthrough, Babai [Proceedings of STOC, ACM, New York, 2016, pp. 684--697] gave a quasipolynomial-time graph isomorphism test. In this...
Merced, CA, United States
Daytona Beach, FL, United States
Notre Dame, IN, United States
New York, NY, United States
Cambridge, MA, 684
Hanover, NH, United States
Atlanta, GA, United States
Medford, MA, United States
San Francisco, CA, United States
Berkeley, CA, United States
Harrisonburg, VA, United States
Tempe, AZ, United States
Riverside, CA, United States
Shanghai, , China
Newport, RI, United States
Stony Brook, NY, United States
Santa Clara, CA, United States
Kunshan, , China
Granville, OH, United States
Lancaster, PA, United States
Santa Cruz, CA, United States
Pomona, CA, United States
Glassboro, NJ, United States
Houston, TX, United States
Albuquerque, NM, United States
Worcester, MA, United States
Middletown, CT, United States
Clemson, SC, United States
BLOOMINGTON, IN, United States
Stanford, CA, United States
Raleigh, NC, United States
TX, United States
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 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.
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.
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.
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.
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.
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.