|
New! - Great Ideas in Theoretical Computer Science Colloquium.
Blog - A Smoother Pebble.
Research
At the moment, I'm working on derandomization and pseudorandomness. More broadly, I'm interested in computational complexity,
quantum computing, and connections between physics and theoretical computer science.
About Me
I'm currently a first year PhD student in the Theory of Computation Group at MIT,
working with Professor Dana Moshkovitz, supported
by an MIT Presidential Fellowship. I graduated from USC in 2010 with a B.A. in Mathematics.
While there I had the wonderful opportunity to do research with, and learn from Len Adleman and Aiichiro Nakano.
Things I have done in the past: SSP (2006), DAAD (2008), QuISU (2010).
Papers
- Continuous Time Channels with Interference. With Ioana Ivan, Michael Mitzenmacher, and Justin Thaler. International Symposium on Information Theory 2012. [PDF]
- Extremely Accurate Fantasy Quantum Computers Imply the Collapse of the Counting Hierarchy. Manuscript 2011. [PDF]
- DNA Sequencing via Machine Learning and Quantum Mechanics. With F. Shimojo, K. Zhang, A. Nakano, K. Nomura, P. Vashishta, and R. Kalia. [PDF]
Writing
- A New Kind of Solution, and an Application Recurrence Relations. (Essay): In this essay, I philosophize about the meaning of ``solution'' in mathematics, and apply this philosophy to generalize recurrence relations. A complexity theoretic result is proved about recurrence relations. [PDF]
- Sunset.
(Poem): The reference is The Omega Point theory. It describes the final moments of the universe, as it is dissolving into an maximally entropic state. [Link]
Talks/Presentations
- Time vs. Randomness, presented at the MIT Great Ideas in Theoretical Computer Science colloquium, February 2012.
[PPTX]
Past Projects
- ToughSAT - a tool to generate SAT instances based off of hard problems such as FACTORING and SUBSET SUM.
Contact
MIT CSAIL
32-G614, Stata Center
32 Vassar Street
Cambridge, MA 02139
electronic mail:  |
