004.021 — Алгоритмы

The Complexity of Auditing Disclosure-Robust Defeasible Explanations Haoyang Li · 2026

Computing Twin-Width via Treedepth and Vertex Integrity Robert Ganian, Mathis Rocton · 2026

Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P? Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Melissa Welsh · 2026

Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling Kaito Baba, Evripidis Bampis, Giorgos Mitropoulos · 2026

Random Generation of $k$-coloured Motzkin Paths Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani · 2026

Threshold Minimum Cut with Terminal Quotas: Logarithmic and Planar Approximation Algorithms Qi Duan · 2026

Linear algebra at exponential scale via tensor network dimension reduction Chris Camaño, Ethan N. Epperly, Raphael A. Meyer, Joel A. Tropp · 2026

Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs Sharareh Alipour, Ermiya Farokhnejad · 2026

Directed Reachability-Preserving Minimum Edge Cut: Approximation and Planar Hardness Qi Duan · 2026

Depth Lower Bounds for ReLU Networks with Binary Inputs Neil Krishnan, Elchanan Mossel · 2026

On (Non-)Isomorphism of Self-Dual Lattices and Codes Huck Bennett, Kyle Fridberg · 2026

Some Complexity Results for Robustness Verification for Binarized Neural Networks Harshit Goyal, Sudakshina Dutta · 2026

Sum-of-Squares Degree Barriers for the Reweighted-Hinge Method in Robust Halfspace Learning: A Christoffel-Function Characterization Xiaoyu Li · 2026

Adaptive Proximal Methods for Weakly Convex Optimization with Unknown Parameter: Deterministic and Stochastic Guarantees Miaolan Xie · 2026

Scalable K-clique Estimation with Differential Privacy Dung Nguyen, Ritwick Mishra, Anil Vullikanti · 2026

Compact multi-text index for circular Cartesian tree matching Roman Pauli, Eric Osterkamp, Dominik Köppl · 2026

Learning Augmented Exact Exponential Algorithms Tatiana Belova, Yuriy Dementiev, Danil Sagunov · 2026

Tractable Gap-Constraint Languages for Complex Event Recognition Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid · 2026

Guarded Epoch Bloom Filters for Sliding-Window Membership Faruk Alpay, Levent Sarioglu · 2026

Attention Dynamics and Adaptive Decision Support in C5ISR: A Recurrence Quantification Analysis of Visual and Multimodal Attention Guidance Effects on Mission Performance Hyun-Gee Jei, Caleb J. Armstrong, Farzan Sasangohar · 2026

Differentially Private Submodular Maximization with a Knapsack Constraint Ron Zadicario, Tova Milo · 2026

Active Learning with Low-Rank Structure for Data Selection Vincent Cohen-Addad, Sasidhar Kunapuli, Vahab Mirrokni, Mahdi Nikdan, David P. Woodruff, Samson Zhou · 2026

Coresets for Continuous $k$-Center in Hyperbolic Space Eunku Park · 2026

Contested Cluster Selectors: Local Ambiguity, Normal Forms, and Backtracking Cost in Random Constraint Satisfaction Karthik Sheshadri · 2026

Problems related to strong connectivity and strong biconnectivity Raed Jaberi · 2026

Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete Qian Li, Xinyu Mao, Shang-Hua Teng · 2026

A constant-factor approximation of the Gromov-Hausdorff distance in the plane Sushovan Majhi · 2026

On finding exact solutions of linear programs in the oracle model Daniel Dadush, László A. Végh, Giacomo Zambelli · 2026

Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients Qiao-Long Huang, Yichuan Cao, Ruichen Qiu, Xiao-Shan Gao · 2026

Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard Yichuan Cao, Ruichen Qiu, Qiao-Long Huang, Ruyong Feng, Xiao-Shan Gao · 2026

Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard Ruichen Qiu, Yichuan Cao, Qiao-Long Huang, Ruyong Feng, Xiao-Shan Gao · 2026

Hardness of Approximate Hylland-Zeckhauser Equilibria Mark Braverman, Jingyi Liu, Eric Xue, Chenghan Zhou · 2026

Problems related to strong connectivity and strong biconnectivity Raed Jaberi · 2026

Single-item lot sizing problem under budgeted lead-time uncertainty Romain Guillaume, Adam Kasperski, Szymon Wrobel, Pawel Zielinski · 2026

Online Matching with KIID Edge Arrivals Yilong Feng, Haolong Li, Xiaowei Wu · 2026

The Program Is Still There: A Conservation Law for Program Discovery Jorge Miguel Silva · 2026

On Cutting Cakes and Crossing Curves Alexandros Hollender, Gilbert Maystre, Kilian Risse · 2026

Abstract Weighted Graph and Weighted Graph Algorithms · 2007

Algebraic Circuits Over Sum and Shift and Existential Presburger Arithmetic with Divisibility Ignacio Barros, Michaël Cadilhac, Guillermo A. Pérez · 2026

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Christoper Musco, Indu Ramesh · 2026

Random Proposals: A Softmax-Based Local-Improvement Framework for Maximum Weighted Matching Ahmed M. Alzuhair, Ahmed Alherz · 2026

A unified complexity bound for logconcave sampling Yunbum Kook, Santosh S. Vempala · 2026

On a Conjecture for Parameterized st-Orientations Charalampos Papamanthou · 2026

An Efficient Private Algorithm for Community Detection Vincent Cohen-Addad, Alessandro Epasto, Haim Kaplan, Hanna Komlós, Silvio Lattanzi · 2026

Online Convex Optimization with Sublinear Noisy Probes Simone Di Gregorio, Anupam Gupta, Stefano Leonardi, Matteo Russo · 2026

The price of incrementality in k-center clustering László Kozma · 2026

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits Vladimir Braverman, Chen Wang, Liudeng Wang, Samson Zhou · 2026

Advanced Sorting Algorithms · 2007

Kronecker products and iterated matrix multiplication Christian Ikenmeyer · 2026

B-Tree Data Structure · 2007

Structure-Informed Multiple Sequence Alignment: A Formal Model and Hardness Results Yoshiki Kanazawa, Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter · 2026

Optimal Online Equitable Allocation with Indivisible Resources Ramiro N. Deo-Campo Vuong · 2026

From Estimates to Schedules: Learning-Augmented Restricted Assignment Michalis Xefteris · 2026

A near-quadratic lower bound on the border determinantal complexity of $\sum_i x_i^n$ via conormal specialization Karthik Sheshadri · 2026

Multi-Objective Submodular Maximization with Differential Privacy Ting Hou, Yanhao Wang, Yiping Wang, Cen Chen, Minghao Zhao, Fan Dang · 2026

PivCo-Huffman Marcin Zukowski · 2026

Detecting Large Quasi-cliques on Dynamic Networks Luciano Gualà, Simone Pellegrini, Luca Pepè Sciarria, Alessandro Straziota · 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions Yuzhou Gu, Xin Li, Yinzhan Xu · 2026

Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more Spencer Compton, Jerry Li · 2026

Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment Tait Weicht, Alexander S. Wein · 2026

Differentially Private Hierarchical Heavy Hitters Ari Biswas, Graham Cormode, Yaron Kanza, Divesh Srivastava, Zhengyi Zhou · 2026

Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry Maximilian J. Kramer, Carsten Schubert, Jens Eisert · 2026

Learning with Simulators: No Regret in a Computationally Bounded World Sasha Voitovych, Abhishek Shetty, Noah Golowich, Alexander Rakhlin · 2026

Testing Bipartiteness in Logarithmic Rounds Yumou Fei, Ronitt Rubinfeld · 2026

Computational Complexity Kent D. Lee, Steve Hubbard · 2024

The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard Andreas Björklund · 2026

Uncertainty Principles for the Number Theoretic Transform Giulio Malavolta, Alon Rosen · 2026

Quotient Admission Algorithms for Witness-Supported Graph Windows Yushan Li · 2026

Direct Addressing Data Structure · 2007

Randomization for Faster Exact Optimization of Discounted Markov Decision Processes Andrei Graur, Aaron Sidford, Ta-Wei Tu · 2026

Exponential Quantum Space Advantage for Approximating Max-$k$SAT in the Streaming Setting Haoyu Wang, Guangxu Yang · 2026

Learning-Augmented Online Minimization with Dual Predictions Christian Coester, Alexa Tudose, Alexander Turoczy · 2026

Quantified propositional calculi and narrow implicit proofs Pavel Pudlák, Neil Thapen · 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties Chiara Piombi · 2026

A symmetric determinantal lower bound for diagonal power sums via polar degree Karthik Sheshadri · 2026

Tree Containment Parameterized by Scanwidth Leo van Iersel, Mark Jones, Mathias Weller · 2026

Differentially Private Range Subgraph Counting Xian Chen, Ruobing Bai, Pan Peng · 2026

Proportionality from Sampled Approvals Gregory Kehne · 2026

On the Complexity of Signed Domination Sangam Balchandar Reddy · 2026

Express Language Modeling Albert Gong, Annabelle Michael Carrell, Raaz Dwivedi, Lester Mackey · 2026

Enumerating Inclusion-Maximal Arithmetic Progressions Brian Bemman, Maximilien Gadouleau, Oliver W. Gnilke, George B. Mertzios · 2026

Bit-counting complexity classes Tayfun Pay · 2026

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Hunter Monroe · 2026

A note on rounding fractional matchings with constant-factor strong negative correlation David G. Harris · 2026

Counting Hamiltonian Paths in 3-Regular Planar Graphs Ira Pohl, Larry Stockmeyer · 2026

Proceedings of the 14th edition of the conference on Random Generation of Combinatorial Structures Srečko Brlek, Luca Ferrari · 2026

The Complexity of Verifying Feedforward Neural Networks in Quantised Settings Eric Alsmann, Martin Lange, Marco Sälzer · 2026

Multiversion Concurrency Control for Multiversion B-Trees Amir Tonta, Bernhard Seeger, Eljas Soisalon-Soininen · 2026

Engineering Scalable Distributed List Ranking Peter Sanders, Matthias Schimek, Tim Niklas Uhl, Thomas Weidmann · 2026

Quantum Cut Sparsifiers Arpon Basu, Joshua Brakensiek, Pravesh K. Kothari, Aaron Putterman · 2026

Bayesian Probing on Graphs Anupam Gupta, Benjamin Moseley, Rudy Zhou · 2026

Complexity and Algorithms for Unary Translocation Distance Maria Constantin, Adrian Miclăuş, Alexandru Popa, Andrei Popa · 2026

Quantum Kravchuk Transform using $\mathfrak{su}(2)$ fast-forwarding Chaowen Guan, Akshit Katiyar · 2026

Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality Riley Brown, Istvan Miklos · 2026

Probabilistically Checking Quantum Proofs, with Interaction Baocheng Sun, Thomas Vidick · 2026

Online Span Minimization for Flexible Uniform Jobs Mozhengfu Liu, Samir Khuller, Xueyan Tang · 2026

On the Hardness of Optimal Motion on Trees Tzvika Geft · 2026

$O(n +f(k))$: Truly Linear FPT Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose, Jessica Enright, Michael R. Fellows, David C. Kutner, Laura Larios-Jones, Barnaby Martin, Frances Rosamond, Ella Yates · 2026

Scaling Laws for Neural-Network Quantum States Riccardo Rende, Alessandro Sinibaldi, Luciano Loris Viteritti, Roeland Wiersema, Antoine Georges, Giuseppe Carleo · 2026

Lean 4 Machine-Verified Proof of P = NP via the Pedigree Polytope Membership Problem T. S. Arthanari · 2026

Quantum-Classical Equivalence for AND-Functions Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett · 2026

Towards Optimal Robustness in Learning-Augmented Paging Peng Chen, Hailiang Zhao, Xueyan Tang, Yixuan Wang, Shuiguang Deng · 2026

Scalable Concurrent Queues for GPU Pratheek Prakash Shetty, Thomas R. W. Scogland, Wu-chun Feng · 2026

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen · 2026

The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines Kao-Chuan Liang, Ya-Chun Liang · 2026

Terminal Steiner tree problem : Complexity and Algorithms Jyothish S, Sadagopan Narasimhan · 2026

Approximate Algorithms for Chamfer Distance Under Translation Gil Halevi, Daniel Zhang, Jason Zhang · 2026

Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp Xujun Bai, Yun Shang, Honghong Lin · 2026

Tomography of quantum states with bounded extent Srinivasan Arunachalam, Arkopal Dutt · 2026

Worst-Case Update Complexity of the Preisach Extremum Stack Piotr Frydrych · 2026

The Preisach Extremum Stack is a Shannon-Minimal Sufficient Statistic for Rate-Independent Functionals Piotr Frydrych · 2026

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent Jason M. Altschuler, Pablo A. Parrilo · 2026

An Upper Bound on Grothendieck's Constant Steven Heilman · 2026

Listing Even Cycles Faster than the Submodular-Width Barrier Vasileios Nakos, Hung Q. Ngo, Andreas Panayi · 2026

Incremental BPE Tokenization Shenghu Jiang, Ruihao Gong · 2026

Sharp Low-Degree Thresholds for Planted-vs-Planted Testing Anda Skeja, Daniel Gutiérrez Espinoza, Fiona Skerman, Alexander S. Wein · 2026

A Class of Multipartite Entangled States Based on State Transitions Jehn-Ruey Jiang · 2026

Incremental Sheaf Cohomology on Cellular Complexes: O(1)-in-n Lazy Edit Processing under Bounded Local Geometry Jason L. Volk · 2026

What Makes Majority Illusion Easy to Detect? Šimon Schierreich, Ildikó Schlotter · 2026

On the Complexity of Recurrence Evaluation Artem Parfenov, Michael Vyalyi · 2026

Recursive Jump Operators and Optimal Proof Systems Fabian Egidy · 2026

Circular Array Data Structure · 2007

On Thin Perfect Matchings up to Polylogarithmic Factors Alireza Haqi, Shayan Oveis Gharan · 2026

Adversarial Configurations for the ReCom Transition Function Micah Gold · 2026

Towards Optimal Robustness in Learning-Augmented Paging Peng Chen, Hailiang Zhao, Xueyan Tang, Yixuan Wang, Shuiguang Deng · 2026

High-Dimensional Expanders, the Sparsest Cut Problem, and Steurer's Conjecture Farzam Ebrahimnejad, Shayan Oveis Gharan · 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation Ezequiel López-Rubio · 2026

Search-space Reduction for Boolean MinCSPs via Essential Constraints Bart M. P. Jansen, Ruben F. A. Verhaegh · 2026

Token Rankings are Unforgeable Language Model Signatures Matthew Finlayson, Andreas Grivas, Xiang Ren, Swabha Swayamdipta · 2026

Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances Tim A. Hartmann, Dániel Marx · 2026

Randomized separations in black-box TFNP Fedor Kiselev · 2026

Quantum Time Lower Bounds by Permutation Invariance Qisheng Wang · 2026

Introduction · 2024

Dynamic Breadth First Search with Predictions Shahbaz Khan, Shubham Kumar Verma, Utkarsh Lohiya · 2026

The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme Ragnar Groot Koerkamp · 2026

Multiagent Matroid Upgrading: Greedy is Fair and Efficient Qingwen Ma, Chao Peng, Changfeng Xu, Chenyang Xu, Ruilong Zhang · 2026

Revisiting $O(n \log \log n)$ chaining for anchored edit distance Nicola Rizzo, Ragnar Groot Koerkamp · 2026

Ranked MSO-enumeration over compressed words Markus Lohrey · 2026

Planar Perfect Matching Counting is as Hard as Determinants Radu Curticapean, Jiaheng Wang · 2026

The Grothendieck Constant is Less Than $\fracπ{2 \log (1+ \sqrt{2})} - 10^{-5}$ Alan Li, Rahul Saha, Anton Xue, Adam Klivans, Pravesh K Kothari, Raghu Meka, Swarat Chaudhury · 2026

An Improved Greedy Approximation for (Metric) $k$-Means Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland · 2026

Distributed Gaussian Mean Testing under Communication Constraints: messages, samples, and coins Clément L. Canonne, Nimitt · 2026

Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications Samuel B. Hopkins, Stefan Tiegel · 2026

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores Ishant Garg · 2026

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting Steve Hanneke, Qinglin Meng, Shay Moran, Amirreza Shaeiri · 2026

АЛГОРИТМ ДИАГНОСТИКИ СФЕНОИДИТА Ашуров А. М., Сотиболдиев С. Р., Ашурова Д. Д. · 2026

Алгоритмы нелинейного программирования Узбеков Руслан Шавкятьевич, Челноков Виталий Вячеславович · 2025

РАСПАРАЛЛЕЛИВАНИЕ ГИБРИДНОГО АЛГОРИТМА МУРАВЬИНОЙ КОЛОНИИ С ИЗМЕНЯЮЩИМИСЯ С ПОМОЩЬЮ ГЕНЕТИЧЕСКОГО АЛГОРИТМА ПАРАМЕТРАМИ Микулик Илья Игоревич, Благовещенская Екатерина Анатольевна · 2023

Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't Anej Svete, William Merrill, Ryan Cotterell, Ashish Sabharwal · 2026

Diffusion-Robust Optimization over Graphs Liviu Aolaritei, Ricky Huang, Michael I. Jordan, Paul Grigas · 2026

Quoridor is PSPACE-Complete Marius Drop, Benjamin G. Rin, Finn van der Velde · 2026

Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing Joshua M. Courtney · 2026

Tree Containment Parameterized by Scanwidth Leo van Iersel, Mark Jones, Mathias Weller · 2026

Aspects of Coherence in Dependence Logic Timon Barlag, Nicolas Fröhlich, Miika Hannula, Phokion G. Kolaitis, Juha Kontinen, Arne Meier, Jouko Väänänen · 2026

Optimal Rates for Differentially Private Hypothesis Testing with E-values Ben Jacobsen, Tomas Gonzalez, Gavin Brown, Kassem Fawaz, Aaditya Ramdas · 2026

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes Faruk Alpay, Levent Sarioglu · 2026

Elfs, transducers and quantum walks Simon Apers, Jérémie Roland, Yuxin Zhang · 2026

Robust Statistical Estimators with Bounded Empirical Sensitivity Valentio Iverson, Gautam Kamath, Argyris Mouzakis, Adam Smith · 2026

Optimal $e^{(γ+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices Nima Anari, Farzam Ebrahimnejad · 2026

Исследование эффективности алгоритма саранчи в задачах сегментации изображений Запорожец Дмитрий Юрьевич, Кравченко Юрий Алексеевич, Кулиева Нина Владимировна, Семенова Марина Максимовна, Кулиев Эльмар Валерьевич · 2024

АЛГОРИТМЫ И АЛГОРИТМИЗАЦИЯ Сопыев А., Гулджанова Г. Х., Курбанов А. · 2023

СОПРОВОЖДЕНИЕ МАНЕВРИРУЮЩИХ ЦЕЛЕЙ С ИСПОЛЬЗОВАНИЕМ МНОГОМОДЕЛЬНОГО АЛГОРИТМА С ПЕРЕМЕННОЙ СТРУКТУРОЙ Хоанг Ле Минь, Коновалов А. А., Лук Дао Ван · 2023

ПРИМЕНЕНИЕ АЛГОРИТМОВ В ЮРИСПРУДЕНЦИИ Комин Алексей Владимирович · 2023

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model Aleksey Upirvitskiy, Aleksandr Levin · 2026

Linear Functional Testing with General Loadings in Sparse Regression: Separation Rates and Computational Barriers Jie Xie, Dongming Huang · 2026

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization Philip Cervenjak, Junhao Gan, Naonori Kakimura, Seeun William Umboh, Anthony Wirth · 2026

Low-degree estimation thresholds in planted hypergraphs and tensor PCA Daniel Fu, Youngtak Sohn · 2026

Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion Anay Mehrotra, Phuc Tran, Van H. Vu, Manolis Zampetakis · 2026

On Language Generation in the Limit with Bounded Memory Jon Kleinberg, Anay Mehrotra, Amin Saberi, Grigoris Velegkas · 2026

Tree Search With Predictions Michael Dinitz, Bob Dong · 2026

Proper Agnostic Learning of Functions of Halfspaces under Gaussian Marginals Sergei Tikhonov, Arsen Vasilyan · 2026

Smoothed Score Queries and the Complexity of Sampling Jingbo Liu · 2026

The Complexity of Nested Reset Counter Systems A. R. Balasubramanian, Franzisco Schmidt · 2026

Covering vertices by sequential stars Mengyuan Hu, An Zhang, Yong Chen, Zhikai Chen, Wei Ding, Guohui Lin, Jiaxuan Ma, Yue Sun · 2026

Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling Cong Ling, Hao Yan, Nicholas Zhao · 2026

Parameterized Complexity of Directed Feedback Set Problems in Tournaments Venkatesh Raman, Saket Saurabh · 2003

When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? Timo Fritsch, Marvin Künnemann, Mirza Redzic, Julian Stieß · 2026

Constant Inapproximability for Fisher Markets Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos · 2026

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity Susanna F. de Rezende, David Engström, Yassine Ghannane, Duri Andrea Janett, Artur Riazanov · 2026

The Dirichlet Mechanism for rounding with strong negative correlation, with applications David G. Harris, George Z. Li, Nitya Raju, Renata Valieva · 2026

Approximate Algorithms for Chamfer Distance Under Translation Gil Halevi, Daniel Zhang, Jason Zhang · 2026

Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications Samuel B. Hopkins, Stefan Tiegel · 2026

A Note on Approximability of Densest At-Least-k-Subgraph Bundit Laekhanukit, Pasin Manurangsi, Ohad Trabelsi · 2026

Entropy Equivalence Testing Clément L. Canonne, Yash Pote, Jonathan Scarlett, Joy Qiping Yang · 2026

Separate Chaining Data Structure · 2007

Skip List Data Structure · 2007

A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing Nader H. Bshouty · 2026

An Approximation Algorithm for Graph Label Selection Josia John, Simon Meierhans, Maximilian Probst Gutenberg · 2026

Low Soundness Linearity Testing on the Half-Slice Haakon Larsen, Tushant Mittal, Silas Richelson, Sourya Roy · 2026

Polynomial-time isomorphism test for groups with abelian Sylow subgroups Saveliy V. Skresanov · 2026

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca · 2026

A Tight Bound on Localization of Electrical Flows Ori Gurel-Gurevich, Asaf Nachmias, Sushant Sachdeva · 2026

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation Alex Crane, Pål Grønås Drange, Eli Friedman, Paul D. Hovland, Jan Hückelheim, Andrew Lyons, Yosuke Mizutani, Macéo Ottavy, Blair D. Sullivan · 2026

Compresssed Trie Data Structure · 2007

Resource bounded Kučera-Gács Theorems Satyadev Nandakumar, Akhil S, Chandra Shekhar Tiwari · 2026

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming Victor Lagerkvist, Johanna Groven, Leif Eriksson · 2026

Asymptotic Rank Speedup Theorems, Revisited Josh Alman, Baitian Li · 2026

Finding a Solution to the Erdős-Ginzburg-Ziv Theorem in Linear Time Sunghyeon Jo · 2026

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem Tatiana Rocha Avila, Julian Christoph Brinkmann, Alexander Leonhardt, Conrad Schecker · 2026

The Gallai Vertex Problem is $Θ_2^p$-Complete Amir Nikabadi, Eva Rotenberg, Lasse Wulf · 2026

Polyhedral Instability Governs Regret in Online Learning Yuetai Li, Fengqing Jiang, Yichen Feng, Kaiyuan Zheng, Luyao Niu, Bhaskar Ramasubramanian, Basel Alomair, Linda Bushnell, Radha Poovendran · 2026

Risk of Bad Tails: CVaR-Aware Pandora's Box and Prophet Inequality Jingwei Ji · 2026

A Hierarchy of Tinhofer Graphs: Separations and Membership Testing Sutanay Bhattacharjee, Ameya Panse, Jayalal Sarma · 2026

Learning-Augmented Online Scheduling with Parsimonious Preemption Mugen Blue, Sungjin Im, Alexander Lindermayr · 2026

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking Diptarka Chakraborty, Arya Mazumdar, Barna Saha, Alvin Hong Yao Yan · 2026

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth Niels Holtgrefe, Jannik Schestag · 2026

Efficient Uniform Sampling of Surjections via their Profiles Arnaud Carayol, Pablo Rotondo · 2026

Rounding Almost Commuting Hamiltonians Islam Faisal, Anand Natarajan, Alexander Poremba · 2026

Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph Kamil Khadiev, Ilnur Valeev · 2026

Creating Robust and Fair Graph Structures for Connectivity and Clustering Kushagra Chatterjee · 2026

Treewidth of the $n \times n$ toroidal grid Tatsuya Gima, Hiraku Morimoto, Yuto Okada, Yota Otachi · 2026

Fibonacci Heap Data Structure · 2007

Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 David Kirkpatrick · 2013

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification Guangyi Zhang, Lutz Oettershagen, Lixu Wang, Aristides Gionis · 2026

Space-Time Trade-off in Integer Linear Scaling Rounded to the Nearest Integer through Multiplicative and Additive Decomposition Kyeong Soo Kim · 2026

Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals Ilias Diakonikolas, Giannis Iakovidis, Mingchen Ma · 2026

Adjacency Matrix Data Structure · 2007

Beyond the Half-Approximation: Fair and Efficient Online Class Matching Sander Borst, Max Springer · 2026

Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains Nicholas Zhao · 2026

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs Akash Kumar, Abhiruk Lahiri, C. Seshadhri · 2026

Optimal Dimension-Free Sampling for Regularized Classification Meysam Alishahi, Alexander Munteanu, Simon Omlor, Jeff M. Phillips · 2026

Leftist Heap Data Structure · 2007

Array Data Structure · 2007

Unambiguous Parity‐Query Complexity Dmytro Gavinsky · 2025

Other Complexity Classes and Measures Eric Allender, Michael Loui, Kenneth Regan · 2009

Basic Notions in Computational Complexity Tao Jiang, Ming Li, Bala Ravikumar · 2009

Basic Searching Algorithms · 2007

Quoridor is PSPACE-Hard Marius Drop, Benjamin G. Rin, Finn van der Velde · 2026

A sharp interaction-degree threshold for simulating QAOA Ralfs Āboliņš, Andris Ambainis · 2026

Extending CDCL to disjunctions of parity equations Paul Beame, Glenn Sun · 2026

On the Limits of PAC Learning of Networks from Opinion Dynamics Dmitry Chistikov, Luisa Estrada, Mike Paterson, Paolo Turrini · 2026

Entropy of pebble automata and space complexity J. Andres Montoya · 2026

Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH Rishav Gupta, Bingkai Lin, Xin Zheng · 2026

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki · 2026

Proof Systems Based on Structured Circuits Matthäus Micun, Christoph Berkholz · 2026

Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing Joshua M. Courtney · 2026

Quantum state isomorphism problems for groups Alexandru Gheorghiu, Dale Jacobs, Saeed Mehraban, Arsalan Motamedi · 2026

The Secretary Problem with a Stochastic Precursor Franziska Eberle, Alexander Lindermayr · 2026

Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees Christian Janos Lebeda, David Erb, Tudor Cebere, Aurélien Bellet · 2026

On the Parameterized Complexity of Min-Sum-Radii Pankaj Kumar, Haiko Müller, Sebastian Ordyniak, Melanie Schmidt · 2026

Optimal Testing of Reed-Muller Codes with an Online Adversary Esty Kelman, Uri Meir, Kai Zhe Zheng · 2026

Compact Trie Data Structure · 2007

Splay Tree Data Structure · 2007

Patricia Trie Data Structure · 2007

Efficient algorithms and data structures for indexing DNA sequence data Kamil Salikhov · 2024

B+-Tree Data Structure · 2007

Open Addressing Data Structure · 2007

Pairing Heap Data Structure · 2007

Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition Peter Davies-Peck · 2026

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds Samuel German · 2026

Clustering with Locally Bounded Ignorance Jaroslav Garvardt, Christian Komusiewicz · 2026

Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency Asaf Lev-Ran, Pavel Arkhipov, Vladimir Kolmogorov · 2026

Upper Bounds for Symmetric Approximate Bounded Indistinguishability Christopher Williamson · 2026

Non-Redundancy of Low-Arity Symmetric Boolean CSPs Amatya Sharma, Santhoshini Velusamy · 2026

Enhanced and Efficient Reasoning in Large Learning Models Leslie G. Valiant · 2026

On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets Ali Asadi, Krishnendu Chatterjee, Alipasha Montaseri, Ali Shafiee · 2026

Parse indexing for choosing pseudo-MEMs Travis Gagie · 2026

Tolerant Testing for Unique Games Yuichi Yoshida · 2026

On efficient robust regression with subquadratic samples Deeksha Adil, Jarosław Błasiok, Hongjie Chen, Deepak Narayanan Sridharan · 2026

Linear Kernels for $l$-Exact Component Order Connectivity Yuxi Liu, Mingyu Xiao · 2026

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth Yuxi Liu, Kangyi Tian, Mingyu Xiao · 2026

Block-Sphere Vector Quantization Heesang Ann, Joongkyu Lee, Min-hwan Oh · 2026

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations Claire Chang, Arin Khare, David Shmoys · 2026

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model Aleksey Upirvitskiy, Aleksandr Levin · 2026

Finite Sample Bounds for Learning with Score Matching Devin Smedira, Abhijith Jayakumar, Sidhant Misra, Marc Vuffray, Andrey Y. Lokhov · 2026

Stochastic Matching via Local Sparsification Sara Ahmadian, Edith Cohen, Mohammad Roghani · 2026

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order Niv Buchbinder, Moran Feldman, Siyue Liu, Sherry Sarkar · 2026

Graphs and Graph Algorithms · 2007

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis Alexander Narvaez · 2026

Improved Parallel Algorithms for EF1 Allocations Kishen N Gowda, D Ellis Hershkowitz, Richard Z Huang, Gregory Kehne · 2026

Online Graph Embedding in Star Graphs Julien Dallot, Darya Melnyk, Maciej Pacut, Stefan Schmid · 2026

Iterative Chow Filtering for Learning with Distribution Shift Gautam Chandrasekaran, Georgios Gkrinias, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan · 2026

Online Orthogonal Vectors Revisited Karthik Gajulapalli, Alexander Golovnev, Samuel King, Sidhant Saraogi · 2026

The stochastic block model has the overlap graph property for modularity Shankar Bhamidi, David Gamarnik, Remco van der Hofstad, Nelly Litvak, Pawel Pralat, Fiona Skerman, Yasmin Tousinejad · 2026

Chasing Small Sets Optimally Against Adaptive Adversaries Christian Coester, Alexa Tudose · 2026

Performance bounds for nearest neighbor search with k-d trees Marco Bazzani, Sanjoy Dasgupta · 2026

Streaming Complexity Separations for Dense and Sparse Graphs Yang P. Liu, Hoai-An Nguyen, Noah G. Singer, David P. Woodruff · 2026

Towards infinite PCSP: a dichotomy for monochromatic cliques Demian Banakh, Alexey Barsukov, Tamio-Vesa Nakajima · 2026

Multi-Prover Interactive Proof Systems with Leakage Vahid R. Asadi, Atsuya Hasegawa, François Le Gall · 2026

Optimal Inapproximability of Generalized Linear Equations over a Finite Group Amey Bhangale, Yezhou Zhang · 2026

Modelling Network Resilience: The Complexity of Some Graph Division Games Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Antonio Lauerbach, Alexander Wolff · 2026

The Expressive Power of Low Precision Softmax Transformers with (Summarized) Chain-of-Thought Moritz Brösamle, Stephan Eckstein · 2026

Complexity of Finding and Enumerating Interconnection Trees Noé Demange, Yann Strozecki · 2026

An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians Ranitha Mataraarachchi, François Le Gall, Suguru Tamaki · 2026

Computational Complexity Kent D. Lee, Steve Hubbard · 2015

Correction to “Unambiguous Parity‐Query Complexity” · 2026

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm Christian Møller Mikkelstrup, Anders Bjorholm Dahl, Philip Bille, Vedrana Andersen Dahl, Inge Li Gørtz · 2026

Low-Cost Arborescence Under Edge Faults Dipan Dey, Telikepalli Kavitha · 2026

Min-Max Optimization Requires Exponentially Many Queries Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender · 2026

Provable Quantization with Randomized Hadamard Transform Ying Feng, Piotr Indyk, Michael Kapralov, Dmitry Krachun, Boris Prokhorov · 2026

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs Quinten De Man, Gilvir Gill, Michael A. Bender, Laxman Dhulipala, David Tench · 2026

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Ioannis Caragiannis, Kostas Kollias, Mohammad Roghani, Aaron Schild, Ali Kemal Sinop · 2026

Optimizing Line Segment Inspection with Limited-Range Drones José-Miguel Díaz-Báñez, José-Manuel Higes, Alina Kasiuk, Inmaculada Ventura · 2026

More efficient PBWT prefix-array access via batching Travis Gagie · 2026

B Complexity Analysis · 2007

Basic Searching Algorithms · 2005

Algorithms Alan Parker · 2018

CorBin: Generate High-Dimensional Binary Data with Correlation Structures · 2019

COLLECTION DATA STRUCTURES AND ALGORITHMS · 2007

Algorithms+Data Structures = Programs · 2024

Quantum algorithms for path and cycle containment problems Arjan Cornelissen, Amin Shiraz Gilani, Subhasree Patro · 2026

VP, VNP and Algebraic Branching Programs over Min-Plus Semirings Balagopal Komarath, Harshil Mittal, Jayalal Sarma · 2026

Understanding Robust Catalytic Computing Michal Koucký, Ian Mertz, Sasha Sami · 2026

Robustness and Transferability of Pix2Geomodel for Bidirectional Facies Property Translation in a Complex Reservoir Abdulrahman Al-Fakih, Nabil Sariah, Ardiansyah Koeshidayatullah, Sherif Hanafy, SanLinn I. Kaka · 2026

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases Sanjeev Khanna, Aaron Putterman, Junkai Song · 2026

Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model Abigail R. Jones, Kisun Lee, Jose Israel Rodriguez · 2026

The Scaling Properties of Implicit Deductive Reasoning in Transformers Enrico Vompa, Tanel Tammet · 2026

Adjacency List Data Structue · 2007

Binary Heap Data Structure · 2007

Trie Data Structure · 2007

Advanced Sorting Algorithms · 2005

RETRACTION: Interactive Algorithms in Complex Image Processing Systems Based on Big Data Complexity · 2025

Basic Sorting Algorithms · 2005

The tractability landscape of diffusion alignment: regularization, rewards, and computational primitives Ankur Moitra, Andrej Risteski, Dhruv Rohatgi · 2026

Connectivity augmentation is fixed-parameter tractable Tuukka Korhonen, Mikkel Thorup · 2026

Maximizing Reachability via Shifting of Temporal Paths Argyrios Deligkas, Michelle Döring, Eduard Eiben, George Skretas, Georg Tennigkeit · 2026

On the LSH Distortion of Ulam and Cayley Similarities Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Erasmo Tani · 2026

Quad Tree Data Structure · 2007

Sorted Array Data Structure · 2007

KD-Tree Data Structure · 2007

Tracked Array Data Structure · 2007

Complexity-scalable transform coding using variable complexity algorithms W. Pan, A. Ortega · 2024

Basic Sorting Algorithms · 2007

Advanced Algorithms · 2005

Parameterized Complexity of Generalized Vertex Cover Problems Jiong Guo, Rolf Niedermeier, Sebastian Wernicke · 2005

Resilient Algorithms and Data Structures Giuseppe F. Italiano · 2010

Complexity of Algorithms · 2000

Complexity Analysis · 2007

Algorithms, Data Structures, and Complexity: A Complexity-First Pedagogical Framework Valeriu Ungureanu · 2026

A case study in comparison based complexity: Finding the nearest value(s) Walter Cunto, J. Ian Munro, Patricio V. Poblete · 2024

On the Complexity of Scheduling Conditional Real-Time Code Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele · 2001

Complexity Classes Eric Allender, Michael Loui, Kenneth Regan · 2009

Deterministically finding an element of large order in $\mathbb{Z}_N^*$ Itamar Nir · 2026

A Scalable and Unified Framework to Weighted Rank Aggregation Amir Carmel, Debarati Das, Tien-Long Nguyen · 2026

Dynamic Edge Coloring of Forests Haim Kaplan, David Naori, Yaniv Sadeh · 2026

State Canonization and Early Pruning in Width-Based Automated Theorem Proving Mateus de Oliveira Oliveira, Sam Urmian · 2026

Algorithms And Data Structures For Association Rule Mining And Its Complexity Analysis Alexander Prutzkow* · 2018