- Rational Secret Sharing and Multiparty Computation: Extended Abstract
- DOI: 10.1007/s00145-001-0006-7 J. Cryptology (2001) 14: 211223
- Decision Trees: More Theoretical Justification for Practical Algorithms
- CostSharing Mechanisms for Network Design Anupam Gupta y Aravind Srinivasan z
- Provable Unlinkability Against Traffic Analysis Ron Berman, Amos Fiat , and Amnon Ta-Shma
- DOI: 10.1007/s00453-001-0003-0 Algorithmica (2001) 30: 101139
- Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and
- [MS] L.A. McGeoch and D.D. Sleator. A Strongly Competitive Randomized Paging Algo rithm. Submitted to Algorithmica.
- On the complexity of mining association rules Extended Abstract
- Verifiable Mixing (Shuffling) of ElGamal Pairs C. Andrew Neff
- How Much Can Taxes Help Selfish Routing? Richard Cole
- Data Clustering: A Review Michigan State University
- Online Companion Caching , Manor Mendel2
- On Forward-Secure Storage Extended Abstract
- [C] W.W. Chu. Optimal File Allocation in a Multiple Computer System. IEEE Transactions of Com puters, 18(10), October 1969.
- BETTER ALGORITHMS FOR UNFAIR METRICAL TASK SYSTEMS AND APPLICATIONS
- Oblivious AQM and Nash Equilibria Debojyoti Dutta
- Truly Online Paging with Locality of Reference Amos Fiat yz Manor Mendel yz
- [MMS] M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive Algorithms for OnLine Problems. Journal of Algorithms, 11:208--230, 1990.
- Competitive Generalized Auctions School of Comp. Sci.
- On the Inefficiency of Equilibria in Congestion Games
- On Electronic Voting Schemes Ivan Damgard
- Fast Algorithms for the Free Riders Problem in Broadcast Encryption
- Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?
- Rational Secure Computation and Ideal Mechanism Design Sergei Izmalkov
- A Secure and Private Clarke Tax Voting Protocol without Trusted Authorities
- On the Inefficiency of Equilibria in Congestion
- Efficiently Mining Maximal Frequent Itemsets Karam Gouda
- Fast Vertical Mining Using Diffsets Mohammed J. Zaki
- MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
- Survey of Clustering Data Mining Techniques Pavel Berkhin
- Efficiently Mining Long Patterns from Databases Roberto J. Bayardo Jr.
- Web Search Via Hub Synthesis Dimitris Achlioptas Amos Fiat y Anna R. Karlin z Frank McSherry x
- Generating Non-Redundant Association Rules Mohammed J. Zaki
- Randomized Robot Navigation Algorithms Piotr Berman \Lambda Avrim Blum y Amos Fiat z Howard Karloff x Adi Ros'en --
- Priced Oblivious Transfer: How to Sell Digital Goods
- Batch RSA \Lambda Amos Fiat y
- Oneway Trapdoor Permutations Are Sufficient for NonTrivial SingleServer
- Making Data Structures Con uently Persistent Amos Fiat Haim Kaplan
- Rationality and Adversarial Behavior in Multi-Party Computation
- Coordination mechanisms George Christodoulou1
- Competitive Distributed File Allocation \Lambda Baruch Awerbuch y Yair Bartal z Amos Fiat x
- Correlation Clustering ---Minimizing Disagreements on Arbitrary Weighted Graphs
- DATA MINING CLASS 3 1. Google and Hits continue
- Censorship Resistant Peer-to-Peer Content Addressable Networks Amos Fiat Jared Saia y
- Prior-free Mechanisms The big challenge that separates mechanism design from (non-game-theoretic) optimization
- Computational Tractability In many relevant environments optimal mechanisms are computationally intractable. A
- Multi-dimensional Approximation Throughout the majority of this text we have assumed that the agents' private preferences
- Approximation and Mechanism Our world is an interconnected collection of economic and computational systems wherein
- Equilibrium The theory of equilibrium attempts to predict what happens in a game when players be-
- Prior-independent Approximation In the last two chapters we discussed mechanism that performed well for a given Bayesian
- Bayesian Approximation One of the most intriguing conclusions from the preceding chapter is that for i.i.d., regular,
- Optimal Mechanisms In this chapter we discuss the objectives of social surplus and profit. As we will see, the
