| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev |
Sharp Thresholds in Random Simple Temporal Graphs.  |
SIAM J. Comput.  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruben Becker, Yuval Emek, Mohsen Ghaffari 0001, Christoph Lenzen 0001 |
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv |
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | David Gamarnik, Aukosh Jagannath, Alexander S. Wein |
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément Legrand-Duchesne, Ashutosh Rai 0001, Martin Tancer |
Parameterized Complexity of Untangling Knots. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
Rigid Matrices from Rectangular PCPs. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Greg Bodwin |
Reachability Preservers: New Extremal Bounds and Approximation Algorithms. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski |
Online Edge Coloring via Tree Recurrences and Correlation Decay. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Christian Sohler |
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Focke, Marc Roth |
Counting Small Induced Subgraphs with Hereditary Properties. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk |
Fast Metric Embedding into the Hamming Cube. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeyu Guo 0001, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters |
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé |
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong |
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong |
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring. |
SIAM J. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Akash Kumar 0003, C. Seshadhri 0001, 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. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Göös, Aviad Rubinstein |
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný |
Topology and Adjunction in Promise Constraint Satisfaction. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Joanna Fijalkow |
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua A. Grochow, Youming Qiao |
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis |
Consensus-Halving: Does It Ever Get Easier? |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Fabrizio Grandoni 0001, Afrouz Jabal Ameli |
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler |
Exact-Size Sampling of Enriched Trees in Linear Time. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chong Shangguan, Itzhak Tamo |
Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jatin Batra, Naveen Garg 0001, Amit Kumar 0001 |
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc |
Want to Gather? No Need to Chatter! |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu |
An Optimal Separation of Randomized and Quantum Query Complexity. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
Why Extension-Based Proofs Fail. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Eliran Kachlon |
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zongchen Chen, Kuikui Liu, Eric Vigoda |
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ewan Davies, Will Perkins 0001 |
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Coy, Artur Czumaj |
Deterministic Massively Parallel Connectivity. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Niv Buchbinder, Moran Feldman, Mohit Garg 0003 |
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali |
On Min Sum Vertex Cover and Generalized Min Sum Set Cover. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara |
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\). |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel Dall'Agnol, Tom Gur, Oded Lachish |
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya 0001, Sutanu Gayen, Eric Price 0001, Vincent Y. F. Tan, N. V. Vinodchandran |
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy Chu, Yu Gao 0001, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang |
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Urmila Mahadev |
Classical Homomorphic Encryption for Quantum Circuits. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bressan 0002, Enoch Peserico, Luca Pretto |
Sublinear Algorithms for Local Graph-Centrality Estimation. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters |
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay |
An ETH-Tight Exact Algorithm for Euclidean TSP. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low |
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Manish Raghavan, Aleksandrs Slivkins, Jennifer Wortman Vaughan, Zhiwei Steven Wu |
Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepanshu Kush, Benjamin Rossman |
Tree-Depth and the Formula Complexity of Subgraph Isomorphism. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu 0001 |
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris |
Uniform Restricted Chase Termination. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman, Virginia Vassilevska Williams |
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ittai Abraham, Arnold Filtser, Anupam Gupta 0001, Ofer Neiman |
Corrigendum: Metric Embedding via Shortest Path Decompositions. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong |
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nithin Varma, Yuichi Yoshida |
Average Sensitivity of Graph Algorithms. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Erin W. Chambers, Jeff Erickson 0001, Kyle Fox, Amir Nayyeri |
Minimum Cuts in Surface Graphs. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis |
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani |
Inapproximability of Matrix p → q Norms. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Ciardo, Stanislav Zivný |
CLAP: A New Algorithm for Promise CSPs. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Daniel Neuen, Daniel Wiebking |
Isomorphism Testing for Graphs Excluding Small Minors. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Daniel Neuen, Pascal Schweitzer |
A Faster Isomorphism Test for Graphs of Small Degree. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Daniel Boissonnat, Siargey Kachanovich, Mathijs Wintraecken |
Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter-Freudenthal-Kuhn Triangulations. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata 0001, Yu Yokoi |
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vera Traub, Jens Vygen |
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. |
SIAM J. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Nguyen, Igor Pak |
Short Presburger Arithmetic Is Hard. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | John Hershberger 0001, Subhash Suri, Hakan Yildiz |
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev |
One-Way Functions and (Im)perfect Obfuscation. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král, Kristýna Pekárková |
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone |
Elastic-Degenerate String Matching via Fast Matrix Multiplication. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami |
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman, Ola Svensson, Rico Zenklusen |
A Framework for the Secretary Problem on the Intersection of Matroids. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Amir Shpilka |
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Broadbent, Alex Bredariol Grilo |
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Bhandari, Sayantan Chakraborty 0002 |
Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | William M. Hoza, Chris Umans |
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma |
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Nikhil S. Mande |
A Short List of Equalities Induces Large Sign-Rank. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Bavarian, Thomas Vidick, Henry Yuen |
Anchored Parallel Repetition for Nonlocal Games. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Nowotka, Aleksi Saarela |
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément Carbonnel, Miguel Romero 0001, Stanislav Zivný |
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther Ezra, Micha Sharir |
On Ray Shooting for Triangles in 3-Space and Related Problems. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke |
Almost Tight Bounds for Reordering Buffer Management. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel M. Idziak, Jacek Krzaczkowski |
Satisfiability in MultiValued Circuits. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra |
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe, Michel Habib, Laurent Viennot |
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen 0001, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis |
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker |
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi |
Caching with Time Windows and Delays. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk |
A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Hanlin Ren |
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes 0002 |
Explicit Near-Ramanujan Graphs of Every Degree. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Andy Drucker, Ravi Kumar 0001, Amit Sahai, Mohit Singh |
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017). |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeyu Guo 0001, Mrinal Kumar 0001, Ramprasad Saptharishi, Noam Solomon |
Derandomization from Algebraic Hardness. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata 0001, Yusuke Kobayashi 0001 |
A Weighted Linear Matroid Parity Algorithm. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Veselý 0001, Marek Chrobak, Lukasz Jez, Jirí Sgall |
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Apers, Ronald de Wolf |
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Dell, John Lapinskas, Kitty Meeks |
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen |
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). |
SIAM J. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license