Have You Seen the Most Cited SIMAX and SICOMP Papers Lately?

Review the 20 most cited papers for SIAM Journal on Computing (SICOMP) and SIAM Journal on Matrix Analysis and Applications (SIMAX) since 2018 below. Don’t miss the chance to explore these articles. Discover and share the papers in the lists now!

Jump to: 

SICOMP 20 most cited papers since 2018
SIMAX 20 most cited papers since 2018

SICOMP 20 most cited papers since 2018

• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward) 
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Vincent Cohen-Addad, Philip N. Klein, and Claire Mathieu)
• Simple and Tight Device-Independent Security Proofs (Rotem Arnon-Friedman, Renato Renner, and Thomas Vidick)
• Constant-Round Interactive Proofs for Delegating Computation (Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum) 
• Approximation via Correlation Decay When Strong Spatial Mixing Fails(Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel Štefankovič)
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Manuel Bodirsky, Barnaby Martin, Michael Pinsker , and András Pongrácz)
• Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Michael Elkin and Ofer Neiman)
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability (Heng Guo and Mark Jerrum)
• Minimum Bisection Is Fixed-Parameter Tractable (Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Zachary Friggstad, Mohsen Rezapour, and Mohammad R. Salavatipour)
• Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Gábor Ivanyos and Youming Qiao)
• Quantum Query Algorithms Are Completely Bounded Forms (Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos
• Bounds on the Step and Namespace Complexity of Renaming (Hagit Attiya, Armando Castan͂eda, Maurice Herlihy, and Ami Paz)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie)
• Robust Estimators in High-Dimensions Without the Computational Intractability (Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, and Alistair Stewart)
• Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model (Charilaos Efthymiou, Thomas P. Hayes, Daniel Štefankovič, Eric Vigoda, and Yitong Yin)
• Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, and Shahbaz Khan)
• A Time Hierarchy Theorem for the LOCAL Model (Yi-Jun Chang and Seth Pettie)
• Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan)
• A General Framework for Graph Sparsification (Wai-Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, and Debmalya Panigrahi)

SIMAX 20 most cited papers since 2018

• A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps (Antoine Gautier, Francesco Tudisco , and Matthias Hein)
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Diego Armentano and Carlos Beltrán)
• The Perron--Frobenius Theorem for Multihomogeneous Mappings (Antoine Gautier, Francesco Tudisco , and Matthias Hein)
• LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property (Ron Estrin, Dominique Orban, and Michael A. Saunders)
• An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation (I. Ben Gharbia and J. Ch. Gilbert)
• Weierstrass Structure and Eigenvalue Placement of Regular Matrix Pencils under Low Rank Perturbations (Itziar Baragan͂a and Alicia Roca)
• Learning Paths from Signature Tensors (Max Pfeffer, Anna Seigal , and Bernd Sturmfels)
• Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations (Christopher C. Paige)
• A Rational QZ Method (Daan Camps , Karl Meerbergen, and Raf Vandebril)
• The Eigenvalue Distribution of Special 2-by-2 Block Matrix-Sequences with Applications to the Case of Symmetrized Toeplitz Structures (Paola Ferrari, Isabella Furci, Sean Hon, Mohammad Ayman Mursaleen, and Stefano Serra-Capizzano)
• Numerical Computation for Orthogonal Low-Rank Approximation of Tensors (Yu Guan and Delin Chu)
• Computing Delay Lyapunov Matrices and $\mathcal{H}_2$ Norms for Large-scale Problems (Wim Michiels and Bin Zhou)
• Conditioning of Partial Nonuniform Fourier Matrices with Clustered Nodes (Dmitry Batenkov , Laurent Demanet, Gil Goldman, and Yosef Yomdin)
• Necessary Conditions and Tight Two-level Convergence Bounds for Parareal and Multigrid Reduction in Time (Ben S. Southworth)
• Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices (Estelle Massart and P.A. Absil)
• Max-Balanced Hungarian Scalings (James Hook, Jennifer Pestana , Françoise Tisseur , and Jonathan Hogg)
• Euclidean-Norm Error Bounds for SYMMLQ and CG (Ron Estrin, Dominique Orban, and Michael Saunders)
• Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion (Mikael Sørensen and Lieven De Lathauwer)
• Sensitivity Analysis of Nonlinear Eigenproblems (Rafikul Alam and Sk. Safique Ahmad)
• The General Matrix Pencil Completion Problem: A Minimal Case (Marija Dodig and Marko Stošić)