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 <i>O</i>(<i>n</i>log <i>n</i>) 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 <i>O</i>(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 <i>k</i>-<i>d</i> 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<sub><i>w</i></sub>-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)
