The following pages link to SIAM Journal on Computing (Q84798):
Displaying 50 items.
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources (Q2956041) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Computer Science (FOCS 2014) (Q2968150) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Chasing Ghosts: Competing with Stateful Policies (Q2968152) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise (Q2968158) (← links)
- An Automatic Inequality Prover and Instance Optimal Identity Testing (Q2968159) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- Randomly Supported Independence and Resistance (Q2999851) (← links)
- Multiwriter Consistency Conditions for Shared Memory Registers (Q2999853) (← links)
- The Complexity of Early Deciding Set Agreement (Q2999854) (← links)
- How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855) (← links)
- Uncoordinated Two-Sided Matching Markets (Q2999856) (← links)
- A Near-Optimal Separation of Regular and General Resolution (Q2999857) (← links)
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation (Q2999858) (← links)
- Search via Quantum Walk (Q2999859) (← links)
- The Chow Parameters Problem (Q2999860) (← links)
- An Almost Optimal Rank Bound for Depth-3 Identities (Q2999861) (← links)
- Black-Box Constructions of Protocols for Secure Computation (Q3020005) (← links)
- A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product (Q3020006) (← links)
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP (Q3020008) (← links)
- Dynamic Connectivity: Connecting to Networks and Geometry (Q3020009) (← links)
- Self-Improving Algorithms (Q3020010) (← links)
- Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete (Q3020012) (← links)
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays (Q3020013) (← links)
- Fail-Aware Untrusted Storage (Q3020014) (← links)
- On Proximity-Oblivious Testing (Q3020015) (← links)
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016) (← links)
- On the Optimal Layout of Planar Graphs with Fixed Boundary (Q3027032) (← links)
- <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (Q3028211) (← links)
- On Some Distance Problems in Fixed Orientations (Q3028355) (← links)
- The Discrete Geodesic Problem (Q3028357) (← links)
