The following pages link to SIAM Journal on Computing (Q84798):
Displaying 50 items.
- Disjunctions of Horn theories and their cores (Q2784452) (← links)
- A Fully dynamic algorithm for recognizing and representing proper interval graphs (Q2784453) (← links)
- Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets (Q2784454) (← links)
- Proportion extend sort (Q2784455) (← links)
- Approximating the throughput of multiple machines in real-time scheduling (Q2784456) (← links)
- Low redundancy in static dictionaries with constant query time (Q2784457) (← links)
- Maintaining minimum spanning forests in dynamic graphs (Q2784458) (← links)
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model (Q2784459) (← links)
- The complexity of counting in sparse, regular, and planar graphs (Q2784460) (← links)
- Matchings meeting quotas and their impact on the blow-up lemma (Q2784462) (← links)
- Optimal buy-and-hold strategies for financial markets with bounded daily returns (Q2784464) (← links)
- Quantum formulas: A lower bound and simulation (Q2784465) (← links)
- A 2-approximation algorithm for the directed multiway cut problem (Q2784466) (← links)
- The global power of additional queries to \(p\)-random oracles (Q2784467) (← links)
- Geometric complexity theory. I: An approach to the P vs. NP and related problems (Q2784468) (← links)
- On-line load balancing in a hierarchical server topology (Q2784469) (← links)
- Checking approximate computations of polynomials and functional equations (Q2784470) (← links)
- The polygon exploration problem (Q2784471) (← links)
- On the computational complexity of upward and rectilinear planarity testing (Q2784472) (← links)
- New algorithmic aspects of the local lemma with applications to routing and partitioning (Q2784473) (← links)
- Adaptive and efficient algorithms for lattice agreement and renaming (Q2784474) (← links)
- Algorithms for capacitated vehicle routing (Q2784475) (← links)
- Optimal sampling strategies in Quicksort and Quickselect (Q2784476) (← links)
- The compactness of interval routing for almost all graphs (Q2784477) (← links)
- Topological lower bounds on algebraic random access machines (Q2784478) (← links)
- Succinct representation of balanced parentheses and static trees (Q2784479) (← links)
- Temporal logic and semidirect products: An effective characterization of the until hierarchy (Q2784480) (← links)
- Parallel quantum computation and quantum codes (Q2784481) (← links)
- Analysis of timing-based mutual exclusion with random times (Q2784482) (← links)
- A characterization of eventual Byzantine agreement (Q2784483) (← links)
- Evasiveness of subgraph containment and related properties (Q2784484) (← links)
- Compressibility and resource bounded measure (Q2784485) (← links)
- Resource-bounded Kolmogorov complexity revisited (Q2784486) (← links)
- Separation of NP-completeness notions (Q2784487) (← links)
- Approximation algorithms for single-source unsplittable flow (Q2784488) (← links)
- Proof techniques for cryptographic processes (Q2784489) (← links)
- A layered analysis of consensus (Q2784490) (← links)
- On binary searching with nonuniform costs (Q2784491) (← links)
- The efficiency of resolution and Davis-Putnam procedures (Q2784492) (← links)
- A decision procedure for unitary linear quantum cellular automata (Q2784493) (← links)
- A polylogarithmic approximation of the minimum bisection (Q2784494) (← links)
- Lattice embeddings for abstract bounded reducibilities (Q2784495) (← links)
- Decidability of termination of grid string rewriting rules (Q2784496) (← links)
- Randomness, computability, and density (Q2784497) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- Decompositions of triangle-dense graphs (Q2796209) (← links)
- Pricing on paths: a PTAS for the highway problem (Q2796210) (← links)
- Equilibria in online games (Q2796211) (← links)
- Complexity classification of local Hamiltonian problems (Q2799351) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
