[AT02] A. Archer and E. Trados, "Frugal Path Mechanism", in SODA 2002.

[AKKLR03] N. Alon, M.Krivelevich, T. Kaufman, S. Litsyn and D. ron, "Testing low-degree polynomials of GF(2)", in RANDOM 2003.

[BHW02] Z. Bar-Yossef, K. Hildrum and F. Wu, "Incentive-Compatible Online Auctions for Digital Goods", in SODA 2002.

[BS04] E. Ben-Sasson and M. Sudan, "Robust locally testable codes and products of codes", in RANDOM04.

[BO01] S. Bikhchandani and J. M. Ostroy, "The Package Assignment Model". Working Paper, 2001.

[BLR93] M. Blum, M. Luby and R. Rubeinfeld, "Self-testing/correcting with applications to numerical problems". JACM, 47:549-595. 1993.

[BKKR+03] A. Buchsbaum, H. Karloff, C. Kneyon, N. Reingold and M. Thorup, "OPT vs LOAD in Dyanmic Storage Allocation", in STOC 03.

[BVSV01] S. Bikhchandani, S. E. Vries, J. Schummer and R. H. Vohra, "Linear Programming and Vickery Auction". Working Paper, 2001

[DO01] E. Demaine and J. O'Rourke, "Open Problems from CCCG 2001", in CCCG 2001.

[G99] J. Gergov, "Algortihms for compile-time memory optimizations", in SODA 1999.

[GHW01] A. Goldberg, J. Hartline and A. Wright, "Competitive Auctions and digital goods", in SODA 2001.

[GHK+05] V. Guruswami, J. Hartline, A. Karlin, D. Kempe, C. Kenyon and F. McSherry, "On Profit-Maximizing Envy-free Pricing", in SODA05.

[GS99] V. Guruswami and M. Sudan, "Improved Decoding of Reed-Solomon and Algebraic-Geometric codes", in IEEE Transactions on Information Theory, 45 (1999).

[GHW01] T. Kaufman and D. Ron, "Testing Polynomials over General Fields", in FOCS 2004.

[LW94] N. Littlestone and M. K. Warmuth, "The Weighted Majority Algorithm", in Informations and Computation 108:212-261, 1994.

[PV05] F. Parvaresh and A. Vardy, "Correcting errors beyond the Guruswami-Sudan radius in polynomial time", in FOCS 2005.

[V05] P. Valiant, "The tensor product of two codes is not necessarily robustly testable", in RANDOM05.

[WZ03] P. Winkler and L. Zhang, "Wavelength Assignment and Generalized Interval Graph Coloring", in SODA 2003.