Abstract is missing.
- Abstract CryptographyUeli Maurer, Renato Renner. 1-21 [doi]
- Efficient Semantic Communication via Compatible BeliefsBrendan Juba, Madhu Sudan. 22-31 [doi]
- Secret Sharing Krohn-Rhodes: Private and Perennial Distributed ComputationShlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov. 32-44 [doi]
- Semantic Security under Related-Key Attacks and ApplicationsBenny Applebaum, Danny Harnik, Yuval Ishai. 45-60 [doi]
- Renegotiation-Safe ProtocolsRafael Pass, Abhi Shelat. 61-78 [doi]
- Compression without a common prior: an information-theoretic justification for ambiguity in languageBrendan Juba, Adam Tauman Kalai, Sanjeev Khanna, Madhu Sudan. 79-86 [doi]
- Extracting Roots of Arithmetic Circuits by Adapting Numerical MethodsMaurice J. Jansen. 87-100 [doi]
- Pricing Loss Leaders can be HardYi Wu. 101-111 [doi]
- Revenue Maximization via Nash ImplementationThanh Nguyen. 112-124 [doi]
- Beyond the Nash Equilibrium BarrierRobert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos. 125-140 [doi]
- A Complexity View of Markets with Social InfluenceXi Chen, Shang-Hua Teng. 141-154 [doi]
- Best-Response MechanismsNoam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. 155-165 [doi]
- Posting Prices with Unknown DistributionsMoshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer. 166-178 [doi]
- Testing Properties of Collections of DistributionsReut Levi, Dana Ron, Ronitt Rubinfeld. 179-194 [doi]
- Is Submodularity Testable?C. Seshadhri, Jan Vondrák. 195-210 [doi]
- Property Testing via Set-Theoretic OperationsVictor Chen, Madhu Sudan, Ning Xie. 211-222 [doi]
- Fast Local Computation AlgorithmsRonitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie. 223-238 [doi]
- Testing monotonicity of distributions over general partial ordersArnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant. 239-252 [doi]
- Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factorThomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick. 253-263 [doi]
- Query Complexity Lower Bounds for Reconstruction of CodesSourav Chakraborty, Eldar Fischer, Arie Matsliah. 264-274 [doi]
- Optimal lower bounds for locality sensitive hashing (except when q is tiny)Ryan O'Donnell, Yi Wu, Yuan Zhou. 275-283 [doi]
- Cycle Detection, Order Finding and Discrete Log with JumpsSourav Chakraborty, David García-Soriano, Arie Matsliah. 284-297 [doi]
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decodingHenry Cohn, Nadia Heninger. 298-308 [doi]
- Shallow circuits with high-powered inputsPascal Koiran. 309-320 [doi]
- Finding Almost-Perfect Graph BisectionsVenkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou. 321-337 [doi]
- The Need for Structure in Quantum SpeedupsScott Aaronson, Andris Ambainis. 338-352 [doi]
- Leaky Pseudo-Entropy FunctionsMark Braverman, Avinatan Hassidim, Yael Tauman Kalai. 353-366 [doi]
- Combinatorial Approximation Algorithms for MaxCut using Random WalksSatyen Kale, C. Seshadhri. 367-388 [doi]
- The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic ApproachChristian Borgs, Jennifer T. Chayes, Jian Ding, Brendan Lucier. 389-400 [doi]
- Understanding Space in Proof Complexity: Separations and Trade-offs via SubstitutionsEli Ben-Sasson, Jakob Nordström. 401-416 [doi]
- Distributed Computing with Adaptive HeuristicsAaron D. Jaggard, Michael Schapira, Rebecca N. Wright. 417-443 [doi]
- Complex Semidefinite Programming Revisited and the Assembly of Circular GenomesKonstantin Makarychev, Alantha Newman. 444-459 [doi]
- On Approximating the Entropy of Polynomial MappingsZeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan. 460-475 [doi]
- Economical Graph DiscoveryNoga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz. 476-486 [doi]
- Cross-Validation and Mean-Square StabilitySatyen Kale, Ravi Kumar, Sergei Vassilvitskii. 487-495 [doi]
- The Complexity of Linear Dependence Problems in Vector SpacesArnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie. 496-508 [doi]
- The Effects of Diversity in Aggregation GamesPetros Mol, Andrea Vattani, Panagiotis Voulgaris. 509-521 [doi]
- Computationally Limited RandomnessMatei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos. 522-536 [doi]