The following pages link to SIAM Journal on Computing (Q84798):
Displaying 50 items.
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset (Q2862207) (← links)
- Nerves of good covers are algorithmically unrecognizable (Q2862208) (← links)
- Robust geometric spanners (Q2862209) (← links)
- Size bounds and query plans for relational joins (Q2862210) (← links)
- Counting trees in a phylogenetic network is \#P-complete (Q2862211) (← links)
- Optimal homologous cycles, total unimodularity, and linear programming (Q2875148) (← links)
- Simulating size-constrained Galton-Watson trees (Q2884570) (← links)
- Envy-free makespan approximation (Q2884571) (← links)
- The gathering problem for two oblivious robots with unreliable compasses (Q2884572) (← links)
- On clustering to minimize the sum of radii (Q2884573) (← links)
- Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph (Q2884575) (← links)
- An optimal dynamic data structure for stabbing-semigroup queries (Q2884577) (← links)
- Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures (Q2884578) (← links)
- The complexity of distributions (Q2884580) (← links)
- Explicit dimension reduction and its applications (Q2884581) (← links)
- Local versus global properties of metric spaces (Q2884582) (← links)
- The complexity of inferring a minimally resolved phylogenetic supertree (Q2884583) (← links)
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation (Q2903519) (← links)
- Approximating the permanent via nonabelian determinants (Q2903520) (← links)
- A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521) (← links)
- Improved bounds for geometric permutations (Q2903522) (← links)
- Randomized competitive algorithms for generalized caching (Q2903523) (← links)
- An optimal self-stabilizing firing squad (Q2903524) (← links)
- Approximate sparse recovery: optimizing time and measurements (Q2903525) (← links)
- Almost-optimal gossip-based aggregate computation (Q2910849) (← links)
- Multiparty communication complexity and threshold circuit size of AC\(^0\) (Q2910850) (← links)
- On the inherent sequentiality of concurrent objects (Q2910851) (← links)
- Area-universal and constrained rectangular layouts (Q2910852) (← links)
- Universal sequencing on an unreliable machine (Q2910853) (← links)
- Approximating TSP on metrics with bounded global growth (Q2910854) (← links)
- On minimal-time solutions of firing squad synchronization problems for networks (Q2910855) (← links)
- Dynamic approximate all-pairs shortest paths in undirected graphs (Q2910856) (← links)
- Huffman coding with letter costs: a linear-time approximation scheme (Q2910857) (← links)
- Corrigendum: ``Algorithmic enumeration of ideal classes for quaternion orders'' (Q2910858) (← links)
- Utilitarian mechanism design for multiobjective optimization (Q2929697) (← links)
- Position-based cryptography (Q2929699) (← links)
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs (Q2929700) (← links)
- Reporting neighbors in high-dimensional Euclidean space (Q2929701) (← links)
- Managing unbounded-length keys in comparison-driven data structures with applications to online indexing (Q2929702) (← links)
- Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime (Q2929703) (← links)
- Analyzing Walksat on random formulas (Q2929704) (← links)
- Down the rabbit hole: robust proximity search and density estimation in sublinear space (Q2929705) (← links)
- Zero-knowledge against quantum attacks (Q2931394) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
