The following pages link to SIAM Journal on Computing (Q84798):
Displaying 50 items.
- Approximate nearest neighbor search for low-dimensional queries (Q2839174) (← links)
- Matroid secretary problem in the random-assignment model (Q2839176) (← links)
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model (Q2839177) (← links)
- Circumventing the price of anarchy: leading dynamics to good behavior (Q2839178) (← links)
- Symmetry and approximability of submodular maximization problems (Q2839179) (← links)
- Noise tolerance of expanders and sublinear expansion reconstruction (Q2839180) (← links)
- Matroid matching: the power of local search (Q2839182) (← links)
- IP = PSPACE using error-correcting codes (Q2839183) (← links)
- Threshold phenomena in \(k\)-dominant skylines of random samples (Q2840977) (← links)
- Embeddings of surfaces, curves, and moving points in Euclidean space (Q2840978) (← links)
- Nearly tight bounds for testing function isomorphism (Q2840979) (← links)
- Contractions, removals, and certifying 3-connectivity in linear time (Q2840980) (← links)
- Optimal testing of multivariate polynomials over small prime fields (Q2840981) (← links)
- A harmonic algorithm for the 3D strip packing problem (Q2840983) (← links)
- Spectral gap amplification (Q2840985) (← links)
- Pattern matching under polynomial transformation (Q2840986) (← links)
- Link reversal routing with binary link labels: work complexity (Q2840988) (← links)
- Bounded-curvature shortest paths through a sequence of points using convex optimization (Q2840989) (← links)
- Fast integer multiplication using modular arithmetic (Q2840990) (← links)
- Testing and reconstruction of Lipschitz functions with applications to data privacy (Q2840991) (← links)
- Special section: Selected papers based on the presentations at the 42nd annual ACM symposium on theory of computing, STOC `10. Cambridge, MA, USA, June 5--8, 2010. (Q2847662) (← links)
- Graph connectivities, network coding, and expander graphs (Q2848198) (← links)
- \(\mathcal{NP}\)-hardness of approximately solving linear equations over reals (Q2848199) (← links)
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs (Q2848201) (← links)
- Set covering with our eyes closed (Q2848202) (← links)
- Finding, minimizing, and counting weighted subgraphs (Q2848203) (← links)
- On multiplicative \(\lambda\)-approximations and some geometric applications (Q2848204) (← links)
- Branching-time model checking of one-counter processes and timed automata (Q2848205) (← links)
- Balls and bins: smaller hash families and faster evaluation (Q2848208) (← links)
- Pseudorandom generators for combinatorial shapes (Q2848209) (← links)
- Every property of hyperfinite graphs is testable (Q2848211) (← links)
- Computing shortest paths amid convex pseudodisks (Q2848214) (← links)
- Locating regions in a sequence under density constraints (Q2848218) (← links)
- Improving exhaustive search implies superpolynomial lower bounds (Q2848219) (← links)
- An effective dichotomy for the counting constraint satisfaction problem (Q2848220) (← links)
- Pseudorandom generators for polynomial threshold functions (Q2848221) (← links)
- Local list-decoding and testing of random linear codes from high error (Q2848222) (← links)
- How to compress interactive communication (Q2848223) (← links)
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations (Q2848225) (← links)
- Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (Q2848226) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2848227) (← links)
- Fixed-parameter algorithms for maximum agreement forests (Q2862198) (← links)
- The all-or-nothing multicommodity flow problem (Q2862199) (← links)
- Privately releasing conjunctions and the statistical query barrier (Q2862200) (← links)
- On the bit-complexity of Lempel-Ziv compression (Q2862201) (← links)
- Multiple-source shortest paths in embedded graphs (Q2862202) (← links)
- A deterministic truthful PTAS for scheduling related machines (Q2862203) (← links)
- Asymmetric traveling salesman path and directed latency problems (Q2862204) (← links)
- The stretch factor of the Delaunay triangulation is less than 1.998 (Q2862205) (← links)
- Soft heaps simplified (Q2862206) (← links)
