I love computable problems. I was always interested in math, but took a
special interest in computer design and programming in high school when I
wrote a C compiler on OS X. Since then computer science and mathematics has
completely permeated my life. All my friends whom I have known for years are
as into computer science as I am (and fortunately we now all live in Silicon
Valley). Computer science is not just my profession, its my life's ambition
and working with computers is what makes me happiest.

I am now a doctor of philosophy in computer science, and I began my first
research on transactional storage systems under Dr. Erez Zadok. I was
successful and published several conference papers relating to our findings in
transactional file systems and operating systems (FAST, MSST, TOS, ExpCS).
Subsequently I took a deeper interest in the fundamental storage problem and
worked on new algorithms for indexing, hashing, compressing, and querying
key-value storage systems. I have published several conference papers related
to those findings as well (SOCC, VLDB, HotStorage, TaPP). My dissertation
describes how to build new faster and more robust local storage systems (e.g.,
Filesystems) using log-structured merge trees that have been generalized for
both database and file system workloads using my own novel techniques (i.e..,
Stitching, application of Quotient Filters) and architectures (i.e., snapshot
concurrency, writable snapshots).

You can learn more about my research by reading through my published papers
listed in my resume. I am interested in storage research, as well as new
problems. I am not as interested in remuneration as I am in problems,
technology, and an exciting future.