Pages that link to "Item:Q5494958"
From MaRDI portal
The following pages link to 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Q5494958):
Displaying 50 items.
- Improved mixing condition on the grid for counting and sampling independent sets (Q1955841) (← links)
- Privacy Amplification and Nonmalleable Extractors Via Character Sums (Q5494939) (← links)
- The Graph Minor Algorithm with Parity Conditions (Q5494959) (← links)
- Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications (Q5494960) (← links)
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths (Q5494961) (← links)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Q5494962) (← links)
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable (Q5494963) (← links)
- Graph Connectivities, Network Coding, and Expander Graphs (Q5494964) (← links)
- Online Node-Weighted Steiner Tree and Related Problems (Q5494965) (← links)
- Extractors for Circuit Sources (Q5494966) (← links)
- Randomness Buys Depth for Approximate Counting (Q5494967) (← links)
- Pseudorandomness for Read-Once Formulas (Q5494968) (← links)
- Dispersers for Affine Sources with Sub-polynomial Entropy (Q5494969) (← links)
- A Small PRG for Polynomial Threshold Functions of Gaussians (Q5494970) (← links)
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem (Q5494971) (← links)
- 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General (Q5494972) (← links)
- Near Linear Lower Bound for Dimension Reduction in L1 (Q5494973) (← links)
- On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems (Q5494974) (← links)
- Quantum Query Complexity of State Conversion (Q5494975) (← links)
- Streaming Algorithms via Precision Sampling (Q5494976) (← links)
- Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones (Q5494977) (← links)
- Fully Dynamic Maximal Matching in O (log n) Update Time (Q5494978) (← links)
- Which Networks are Least Susceptible to Cascading Failures? (Q5494979) (← links)
- The Power of Linear Estimators (Q5494980) (← links)
- Planar Graphs: Random Walks and Bipartiteness Testing (Q5494981) (← links)
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy (Q5494982) (← links)
- How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games (Q5494983) (← links)
- Markov Layout (Q5494984) (← links)
- On Range Searching in the Group Model and Combinatorial Discrepancy (Q5494985) (← links)
- A Randomized Rounding Approach to the Traveling Salesman Problem (Q5494986) (← links)
- Approximating Graphic TSP by Matchings (Q5494987) (← links)
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings (Q5494988) (← links)
- Balls and Bins: Smaller Hash Families and Faster Evaluation (Q5494989) (← links)
- Lexicographic Products and the Power of Non-linear Network Coding (Q5494990) (← links)
- Optimal Testing of Multivariate Polynomials over Small Prime Fields (Q5494991) (← links)
- A Two Prover One Round Game with Strong Soundness (Q5494992) (← links)
- The Randomness Complexity of Parallel Repetition (Q5494993) (← links)
- Medium Access Using Queues (Q5494994) (← links)
- Local Distributed Decision (Q5494995) (← links)
- The Complexity of Renaming (Q5494996) (← links)
- Mutual Exclusion with O(log^2 Log n) Amortized Work (Q5494997) (← links)
- Algorithms for the Generalized Sorting Problem (Q5494998) (← links)
- Efficient Reconstruction of Random Multilinear Formulas (Q5494999) (← links)
- Approximation Algorithms for Submodular Multiway Partition (Q5495000) (← links)
- An FPTAS for #Knapsack and Related Counting Problems (Q5495001) (← links)
- Evolution with Recombination (Q5495002) (← links)
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption (Q5495003) (← links)
- Min-max Graph Partitioning and Small Set Expansion (Q5495004) (← links)
- How Bad is Forming Your Own Opinion? (Q5495005) (← links)
- The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions (Q5495006) (← links)
