The following pages link to SIAM Journal on Computing (Q84798):
Displaying 50 items.
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ (Q84801) (← links)
- The complexity of modular graph automorphism (Q2706110) (← links)
- Approximating shortest paths on a nonconvex polyhedron (Q2706111) (← links)
- Taking a walk in a planar arrangement (Q2706112) (← links)
- Finding sets covering a point with application to mesh-free Galerkin methods (Q2706114) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes (Q2706116) (← links)
- A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction (Q2706118) (← links)
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems (Q2706119) (← links)
- On the relative complexity of resolution refinements and cutting planes proof systems (Q2706120) (← links)
- Randomness is hard (Q2706121) (← links)
- On the determinization of weighted finite automata (Q2706122) (← links)
- Algorithms for the relaxed online bin-packing model (Q2706124) (← links)
- Tight bounds for searching a sorted array of strings (Q2706125) (← links)
- Minimum networks in uniform orientation metrics (Q2706126) (← links)
- General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate) (Q2706127) (← links)
- A decomposition theorem for task systems and bounds for randomized server problems (Q2706128) (← links)
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs (Q2706129) (← links)
- Squarish \(k\)-\(d\) trees (Q2706131) (← links)
- Computations of uniform recurrence equations using minimal memory size (Q2706132) (← links)
- Approximation algorithms for curvature-constrained shortest paths (Q2706133) (← links)
- On bipartite drawings and the linear arrangement problem (Q2706134) (← links)
- Edge-disjoint paths in expander graphs (Q2706135) (← links)
- Efficient dynamic traitor tracing (Q2706136) (← links)
- Quantum entanglement and communication complexity (Q2706137) (← links)
- Regular languages are testable with a constant number of queries (Q2706138) (← links)
- The approximability of constraint satisfaction problems (Q2706139) (← links)
- Dual-issue scheduling for binary trees with spills and pipelined loads (Q2719116) (← links)
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application (Q2719117) (← links)
- An extension of path coupling and its application to the Glauber dynamics for graph colorings (Q2719118) (← links)
- Optimal simulations between unary automata (Q2719119) (← links)
- An approximation algorithm for feedback vertex sets in tournaments (Q2719120) (← links)
- The shortest vector in a lattice is hard to approximate to within some constant (Q2719121) (← links)
- Dual-bounded generating problems: Partial and multiple transversals of a hypergraph (Q2719122) (← links)
- A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria (Q2719123) (← links)
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms (Q2719124) (← links)
- First-order specifications of programmable data types (Q2719126) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
- A decomposition theorem for maximum weight bipartite matchings (Q2719128) (← links)
- Traveling salesman-based curve reconstruction in polynomial time (Q2719129) (← links)
- Tree search on an atomic model for message passing (Q2719130) (← links)
- On-line randomized call control revisited (Q2719132) (← links)
- Fixed-parameter tractability, definability, and model-checking (Q2719133) (← links)
- Approximation techniques for average completion time scheduling (Q2719134) (← links)
- Markov chain algorithms for planar lattice structures (Q2784446) (← links)
- There are no sparse NP\(_{w}\)-hard sets (Q2784447) (← links)
- Randomness and recursive enumerability (Q2784448) (← links)
- Treewidth and minimum fill-in: Grouping the minimal separators (Q2784449) (← links)
- The accommodating function: A generalization of the competitive ratio (Q2784450) (← links)
- Generating bracelets in constant amortized time (Q2784451) (← links)
