Pages that link to "Item:Q2808275"
From MaRDI portal
The following pages link to Foundations and Trends® in Theoretical Computer Science (Q2808275):
Displayed 39 items.
- A Decade of Lattice Cryptography (Q2808276) (← links)
- Quantum Proofs (Q2808277) (← links)
- Pseudorandomness (Q2869768) (← links)
- Incidence Theorems and Their Applications (Q2871574) (← links)
- Partial Derivatives in Arithmetic Complexity and Beyond (Q2872492) (← links)
- Evasiveness of Graph Properties and Topological Fixed-Point Theorems (Q2872493) (← links)
- Bayesian Mechanism Design (Q2872499) (← links)
- Algorithms and Data Structures for External Memory (Q2903190) (← links)
- Computational Advertising: Techniques for Targeting Relevant Ads (Q2939794) (← links)
- Arithmetic Circuits: A survey of recent results and open questions (Q3069052) (← links)
- Communication Complexity (for Algorithm Designers) (Q3178295) (← links)
- The Algorithmic Foundations of Differential Privacy (Q3190360) (← links)
- Complexity Lower Bounds using Linear Algebra (Q3397730) (← links)
- On the Power of Small-Depth Computation (Q3400006) (← links)
- Quantum Hamiltonian Complexity (Q3451340) (← links)
- Average-Case Complexity (Q3522267) (← links)
- Pairwise Independence and Derandomization (Q3522268) (← links)
- Data Streams: Algorithms and Applications (Q3522272) (← links)
- Probabilistic Proof Systems: A Primer (Q3530806) (← links)
- Mathematical Aspects of Mixing Times in Markov Chains (Q3587573) (← links)
- A Survey of Lower Bounds for Satisfiability and Related Problems (Q3587579) (← links)
- The Design of Competitive Online Algorithms via a Primal—Dual Approach (Q3636884) (← links)
- On Doubly-Efficient Interactive Proof Systems (Q4571853) (← links)
- Coding for Interactive Communication: A Survey (Q4600219) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Faster Algorithms via Approximation Theory (Q5167553) (← links)
- lgorithmic and Analysis Techniques in Property Testing (Q5190073) (← links)
- Semialgebraic Proofs and Efficient Algorithm Design (Q5215904) (← links)
- Hashing, Load Balancing and Multiple Choice (Q5354405) (← links)
- Bayesian Mechanism Design (Q5396759) (← links)
- Lx = b (Q5396760) (← links)
- Complexity of Linear Boolean Operators (Q5396765) (← links)
- Scalable Algorithms for Data and Network Analysis (Q5739491) (← links)
- Locally Decodable Codes (Q5891400) (← links)
- Algorithmic Results in List Decoding (Q5898676) (← links)
- Algorithmic Results in List Decoding (Q5900252) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)