default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st ICS 2010: Tsinghua University, Beijing, China
- Andrew Chi-Chih Yao:
Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings. Tsinghua University Press 2010, ISBN 978-7-302-21752-7 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? 1-19 - Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor:
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. 20-31 - Bernard Chazelle:
Analytical Tools for Natural Algorithms. 32-41 - Mihály Bárász, Santosh S. Vempala:
A New Approach to Strongly Polynomial Linear Programming. 42-48 - Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge:
Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract). 49-65 - Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. 66-80 - Jing Chen, Silvio Micali, Paul Valiant:
Robustly Leveraging Collusion in Combinatorial Auctions. 81-93 - Jing Chen, Avinatan Hassidim, Silvio Micali:
Robust Perfect Revenue From Perfectly Informed Players. 94-105 - Michal Feldman, Adam Kalai, Moshe Tennenholtz:
Playing Games without Observing Payoffs. 106-110 - Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Adversarial Leakage in Games. 111-119 - Joseph Y. Halpern, Rafael Pass:
Game Theory with Costly Computation: Formulation and Application to Protocol Security. 120-142 - Lance Fortnow, Rahul Santhanam:
Bounding Rationality by Discounting Time. 143-155 - Vijay V. Vazirani, Mihalis Yannakakis:
Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. 156-165 - Brendan Lucier:
Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions. 166-177 - Christos H. Papadimitriou, Gregory Valiant:
A New Look at Selfish Routing. 178-187 - Mickey Brautbar, Michael J. Kearns:
Local Algorithms for Finding Interesting Individuals in Large Networks. 188-199 - Maria-Florina Balcan, Avrim Blum, Yishay Mansour:
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. 200-213 - Elchanan Mossel, Grant Schoenebeck:
Reaching Consensus on Social Networks. 214-229 - Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Robustness of the Learning with Errors Assumption. 230-240 - Vitaly Feldman:
Distribution-Specific Agnostic Boosting. 241-250 - Steve Chien, Katrina Ligett, Andrew McGregor:
Space-Efficient Estimation of Robust Statistics and Distribution Testing. 251-265 - Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Cryptographic Complexity Classes and Computational Intractability Assumptions. 266-289 - Andrej Bogdanov, Kunal Talwar, Andrew Wan:
Hard Instances for Satisfiability and Quasi-one-way Functions. 290-300 - Noam Livne:
On the Construction of One-Way Functions from Average Case Hardness. 301-309 - Alessandro Chiesa, Eran Tromer:
Proof-Carrying Data and Hearsay Arguments from Signature Cards. 310-331 - Yonatan Bilu, Nathan Linial:
Are Stable Instances Easy? 332-341 - Barna Saha, Aravind Srinivasan:
A New Approximation Technique for Resource-Allocation Problems. 342-357 - Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch:
Global Alignment of Molecular Sequences via Ancestral State Reconstruction. 358-369 - Toniann Pitassi, Rahul Santhanam:
Effectively Polynomial Simulations. 370-382 - Vikraman Arvind, Srikanth Srinivasan
:
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. 383-396 - Ariel Gabizon, Avinatan Hassidim:
Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction. 397-405 - Tali Kaufman, Avi Wigderson:
Symmetric LDPC Codes and Local Testing. 406-421 - Tali Kaufman, Shachar Lovett, Ely Porat:
Weight Distribution and List-Decoding Size of Reed-Muller Codes. 422-433 - Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. 434-452 - Dorit Aharonov, Michael Ben-Or, Elad Eban:
Interactive Proofs For Quantum Computations. 453-469 - Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. 470-481 - Sergey Bravyi, Cristopher Moore, Alexander Russell:
Bounds on the Quantum Satisfiability Threshold. 482-489 - Aaron D. Sterling:
Memory Consistency Conditions for Self-Assembly Programming. 490-500 - Avinatan Hassidim:
Cache Replacement Policies for Multicore Processors. 501-509
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-01 22:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
