Earlier quoted context omitted.
My publications are at http://www.daemonology.net/papers/ , but this doesn't include the work I did when I was 15 -- that was a novel algorithm for computing polynomial GCDs over algebraic number fields, which I never published due to unresolved loose ends involving high-degree fields (professors encouraged me to publish it anyway -- but I didn't want to published something "unfinished"). It turns out that those "loo…
damn good for 19 years old, but as i see there aren't groundbreaking works i hoped to see. =(
I'm 27 years old, actually...
there aren't groundbreaking works
Ouch. I'd say that my shared caches side channel attack work was groundbreaking (although Shamir and his graduate students were only a few months behind me). I'd say that my projective algorithm for matching with mismatches is groundbreaking. The sqrt(5) \epsilon error bound on complex floating-point multiplication shouldn't have been groundbreaking, but apparently was -- I've never seen numerical analysts get so excited about a ~30% reduction in an error bound.