CaltechTHESIS
  A Caltech Library Service

Browse by Advisor

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Degree Date (Year Only) | Authors | No Grouping
Jump to: B | F | G | H | K
Number of items: 7.

B

Buchfuhrer, David I. (2011) Limits on computationally efficient VCG-based mechanisms for combinatorial auctions and public projects. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:05242011-112814785

F

Fefferman, William Jason (2014) The power of quantum Fourier sampling. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:05302014-131308138

Fefferman, William Jason (2010) On quantum computing and pseudorandomness. Master's thesis, California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:01312011-155543067

G

Guo, Zeyu (2014) Randomness-efficient curve sampling. Master's thesis, California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:02242014-040043833

H

Hurwitz, Jeremy S. (2012) A nearly-quadratic gap between adaptive and non-adaptive property testers. Master's thesis, California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:11302011-091414252

K

Kalyanaraman, Shankar (2009) Limited randomness in games, and computational perspectives in revealed preference. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-06042009-233839

Kalyanaraman, Shankar (2006) On obtaining pseudorandomness from error-correcting codes. Master's thesis, California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-06022006-170858

This list was generated on Mon Nov 24 02:30:16 2014 PST.