Conferences in DBLP

(innovations)
2010 (conf/innovations/2010)

1. 
   Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? [Citation Graph (, )][DBLP]
   
   
2. 
   Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. [Citation Graph (, )][DBLP]
   
   
3. 
   Analytical Tools for Natural Algorithms. [Citation Graph (, )][DBLP]
   
   
4. 
   A New Approach to Strongly Polynomial Linear Programming. [Citation Graph (, )][DBLP]
   
   
5. 
   Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract). [Citation Graph (, )][DBLP]
   
   
6. 
   Pan-Private Streaming Algorithms. [Citation Graph (, )][DBLP]
   
   
7. 
   Robustly Leveraging Collusion in Combinatorial Auctions. [Citation Graph (, )][DBLP]
   
   
8. 
   Robust Perfect Revenue From Perfectly Informed Players. [Citation Graph (, )][DBLP]
   
   
9. 
   Playing Games without Observing Payoffs. [Citation Graph (, )][DBLP]
   
   
10. 
    Adversarial Leakage in Games. [Citation Graph (, )][DBLP]
    
    
11. 
    Game Theory with Costly Computation: Formulation and Application to Protocol Security. [Citation Graph (, )][DBLP]
    
    
12. 
    Bounding Rationality by Discounting Time. [Citation Graph (, )][DBLP]
    
    
13. 
    Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. [Citation Graph (, )][DBLP]
    
    
14. 
    Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions. [Citation Graph (, )][DBLP]
    
    
15. 
    A New Look at Selfish Routing. [Citation Graph (, )][DBLP]
    
    
16. 
    Local Algorithms for Finding Interesting Individuals in Large Networks. [Citation Graph (, )][DBLP]
    
    
17. 
    Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. [Citation Graph (, )][DBLP]
    
    
18. 
    Reaching Consensus on Social Networks. [Citation Graph (, )][DBLP]
    
    
19. 
    Robustness of the Learning with Errors Assumption. [Citation Graph (, )][DBLP]
    
    
20. 
    Distribution-Specific Agnostic Boosting. [Citation Graph (, )][DBLP]
    
    
21. 
    Space-Efficient Estimation of Robust Statistics and Distribution Testing. [Citation Graph (, )][DBLP]
    
    
22. 
    Cryptographic Complexity Classes and Computational Intractability Assumptions. [Citation Graph (, )][DBLP]
    
    
23. 
    Hard Instances for Satisfiability and Quasi-one-way Functions. [Citation Graph (, )][DBLP]
    
    
24. 
    On the Construction of One-Way Functions from Average Case Hardness. [Citation Graph (, )][DBLP]
    
    
25. 
    Proof-Carrying Data and Hearsay Arguments from Signature Cards. [Citation Graph (, )][DBLP]
    
    
26. 
    Are Stable Instances Easy? [Citation Graph (, )][DBLP]
    
    
27. 
    A New Approximation Technique for Resource-Allocation Problems. [Citation Graph (, )][DBLP]
    
    
28. 
    Global Alignment of Molecular Sequences via Ancestral State Reconstruction. [Citation Graph (, )][DBLP]
    
    
29. 
    Effectively Polynomial Simulations. [Citation Graph (, )][DBLP]
    
    
30. 
    Circuit Lower Bounds, Help Functions, and the Remote Point Problem. [Citation Graph (, )][DBLP]
    
    
31. 
    Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction. [Citation Graph (, )][DBLP]
    
    
32. 
    Symmetric LDPC Codes and Local Testing. [Citation Graph (, )][DBLP]
    
    
33. 
    Weight Distribution and List-Decoding Size of Reed-Muller Codes. [Citation Graph (, )][DBLP]
    
    
34. 
    Non-Malleable Codes. [Citation Graph (, )][DBLP]
    
    
35. 
    Interactive Proofs For Quantum Computations. [Citation Graph (, )][DBLP]
    
    
36. 
    On the Power of a Unique Quantum Witness. [Citation Graph (, )][DBLP]
    
    
37. 
    Bounds on the Quantum Satisfiability Threshold. [Citation Graph (, )][DBLP]
    
    
38. 
    Memory Consistency Conditions for Self-Assembly Programming. [Citation Graph (, )][DBLP]
    
    
39. 
    Cache Replacement Policies for Multicore Processors. [Citation Graph (, )][DBLP]