Sign in
SIAM J. Comput.
1972
1989
2007
2024
1972
2024
Keyphrases
Publications
volume 53, number 1, 2024
David Gamarnik
,
Aukosh Jagannath
,
Alexander S. Wein
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics.
SIAM J. Comput.
53 (1) (2024)
volume 52, number 1, 2023
Vijay Bhattiprolu
,
Mrinal Kanti Ghosh
,
Venkatesan Guruswami
,
Euiwoong Lee
,
Madhur Tulsiani
Inapproximability of Matrix p → q Norms.
SIAM J. Comput.
52 (1) (2023)
Martin Grohe
,
Daniel Neuen
,
Daniel Wiebking
Isomorphism Testing for Graphs Excluding Small Minors.
SIAM J. Comput.
52 (1) (2023)
Zongchen Chen
,
Kuikui Liu
,
Eric Vigoda
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction.
SIAM J. Comput.
52 (1) (2023)
Deepanshu Kush
,
Benjamin Rossman
Tree-Depth and the Formula Complexity of Subgraph Isomorphism.
SIAM J. Comput.
52 (1) (2023)
Aris Filos-Ratsikas
,
Yiannis Giannakopoulos
,
Alexandros Hollender
,
Philip Lazos
,
Diogo Poças
On the Complexity of Equilibrium Computation in First-Price Auctions.
SIAM J. Comput.
52 (1) (2023)
Erin W. Chambers
,
Jeff Erickson
,
Kyle Fox
,
Amir Nayyeri
Minimum Cuts in Surface Graphs.
SIAM J. Comput.
52 (1) (2023)
Sébastien Bubeck
,
Yin Tat Lee
,
Yuanzhi Li
,
Mark Sellke
Competitively Chasing Convex Bodies.
SIAM J. Comput.
52 (1) (2023)
volume 52, number 2, 2023
Jean-Daniel Boissonnat
,
Siargey Kachanovich
,
Mathijs Wintraecken
using Coxeter-Freudenthal-Kuhn Triangulations.
SIAM J. Comput.
52 (2) (2023)
Aris Filos-Ratsikas
,
Alexandros Hollender
,
Katerina Sotiraki
,
Manolis Zampetakis
Consensus-Halving: Does It Ever Get Easier?
SIAM J. Comput.
52 (2) (2023)
Sébastien Bouchard
,
Yoann Dieudonné
,
Andrzej Pelc
Want to Gather? No Need to Chatter!
SIAM J. Comput.
52 (2) (2023)
Manish Raghavan
,
Aleksandrs Slivkins
,
Jennifer Wortman Vaughan
,
Zhiwei Steven Wu
Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits.
SIAM J. Comput.
52 (2) (2023)
Nikhil Bansal
,
Jatin Batra
,
Majid Farhadi
,
Prasad Tetali
On Min Sum Vertex Cover and Generalized Min Sum Set Cover.
SIAM J. Comput.
52 (2) (2023)
Ewan Davies
,
Will Perkins
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs.
SIAM J. Comput.
52 (2) (2023)
Alexander A. Sherstov
,
Andrey A. Storozhenko
,
Pei Wu
An Optimal Separation of Randomized and Quantum Query Complexity.
SIAM J. Comput.
52 (2) (2023)
Joshua A. Grochow
,
Youming Qiao
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness.
SIAM J. Comput.
52 (2) (2023)
volume 52, number 3, 2023
Arnab Bhattacharyya
,
Sutanu Gayen
,
Eric Price
,
Vincent Y. F. Tan
,
N. V. Vinodchandran
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu.
SIAM J. Comput.
52 (3) (2023)
Swastik Kopparty
,
Noga Ron-Zewi
,
Shubhangi Saraf
,
Mary Wootters
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes.
SIAM J. Comput.
52 (3) (2023)
Chong Shangguan
,
Itzhak Tamo
Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius.
SIAM J. Comput.
52 (3) (2023)
Mark de Berg
,
Hans L. Bodlaender
,
Sándor Kisfaludi-Bak
,
Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP.
SIAM J. Comput.
52 (3) (2023)
Tomasz Gogacz
,
Jerzy Marcinkowski
,
Andreas Pieris
Uniform Restricted Chase Termination.
SIAM J. Comput.
52 (3) (2023)
Jaroslaw Byrka
,
Fabrizio Grandoni
,
Afrouz Jabal Ameli
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree.
SIAM J. Comput.
52 (3) (2023)
volume 52, number 4, 2023
Nithin Varma
,
Yuichi Yoshida
Average Sensitivity of Graph Algorithms.
SIAM J. Comput.
52 (4) (2023)
Marco Bressan
,
Enoch Peserico
,
Luca Pretto
Sublinear Algorithms for Local Graph-Centrality Estimation.
SIAM J. Comput.
52 (4) (2023)
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm.
SIAM J. Comput.
52 (4) (2023)
Ulrich A. Brodowsky
,
Stefan Hougardy
,
Xianghui Zhong
-Opt Heuristic for the Euclidean Traveling Salesman Problem.
SIAM J. Comput.
52 (4) (2023)
Niv Buchbinder
,
Moran Feldman
,
Mohit Garg
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid.
SIAM J. Comput.
52 (4) (2023)
Sevag Gharibian
,
François Le Gall
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.
SIAM J. Comput.
52 (4) (2023)
Dan Alistarh
,
James Aspnes
,
Faith Ellen
,
Rati Gelashvili
,
Leqi Zhu
Why Extension-Based Proofs Fail.
SIAM J. Comput.
52 (4) (2023)
volume 52, number 5, 2023
Sayan Bhattacharya
,
Monika Henzinger
,
Danupon Nanongkai
,
Xiaowei Wu
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.
SIAM J. Comput.
52 (5) (2023)
Albert Atserias
,
Joanna Fijalkow
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem.
SIAM J. Comput.
52 (5) (2023)
Konstantinos Panagiotou
,
Leon Ramzews
,
Benedikt Stufler
Exact-Size Sampling of Enriched Trees in Linear Time.
SIAM J. Comput.
52 (5) (2023)
Argyrios Deligkas
,
Michail Fasoulakis
,
Evangelos Markakis
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games.
SIAM J. Comput.
52 (5) (2023)
Sam Coy
,
Artur Czumaj
Deterministic Massively Parallel Connectivity.
SIAM J. Comput.
52 (5) (2023)
Ittai Abraham
,
Arnold Filtser
,
Anupam Gupta
,
Ofer Neiman
Corrigendum: Metric Embedding via Shortest Path Decompositions.
SIAM J. Comput.
52 (5) (2023)
Satoru Iwata
,
Yu Yokoi
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals.
SIAM J. Comput.
52 (5) (2023)
volume 52, number 6, 2023
Shuichi Hirahara
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\).
SIAM J. Comput.
52 (6) (2023)
Martin Grohe
,
Daniel Neuen
,
Pascal Schweitzer
A Faster Isomorphism Test for Graphs of Small Degree.
SIAM J. Comput.
52 (6) (2023)
Mika Göös
,
Aviad Rubinstein
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria.
SIAM J. Comput.
52 (6) (2023)
Jesper Nederlof
,
Jakub Pawlewicz
,
Céline M. F. Swennenhuis
,
Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.
SIAM J. Comput.
52 (6) (2023)
Elette Boyle
,
Vincent Cohen-Addad
,
Alexandra Kolla
,
Mikkel Thorup
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018).
SIAM J. Comput.
52 (6) (2023)
Akash Kumar
,
C. Seshadhri
,
Andrew Stolman
Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs.
SIAM J. Comput.
52 (6) (2023)
Vera Traub
,
Jens Vygen
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs.
SIAM J. Comput.
52 (6) (2023)
Josh Alman
,
Virginia Vassilevska Williams
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication.
SIAM J. Comput.
52 (6) (2023)
Jeongwan Haah
,
Matthew B. Hastings
,
Robin Kothari
,
Guang Hao Low
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians.
SIAM J. Comput.
52 (6) (2023)
Marcel Dall'Agnol
,
Tom Gur
,
Oded Lachish
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification.
SIAM J. Comput.
52 (6) (2023)
Timothy Chu
,
Yu Gao
,
Richard Peng
,
Sushant Sachdeva
,
Saurabh Sawlani
,
Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions.
SIAM J. Comput.
52 (6) (2023)
Jatin Batra
,
Naveen Garg
,
Amit Kumar
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time.
SIAM J. Comput.
52 (6) (2023)
Benny Applebaum
,
Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
SIAM J. Comput.
52 (6) (2023)
Urmila Mahadev
Classical Homomorphic Encryption for Quantum Circuits.
SIAM J. Comput.
52 (6) (2023)