I am a computer science PhD
student at CMU.
For the 2018-2019 academic year, I was a computer science Masters
student at Cambridge University, as a Churchill Scholar
Before that, I was a math major
(and computer science minor
) at Caltech.
Broadly, I seek to apply mathematical thinking to problems in computer science with practical applications.
My recent areas of interest include secure group messaging and the design of algorithms for error-correcting codes.
- M. Weidner. Group messaging for secure asynchronous collaboration. MPhil Dissertation, 2019. Advisors: A. Beresford and M. Kleppmann. pdf
- A. K. Narayanan and M. Weidner. Subquadratic time encodable codes beating the Gilbert-Varshamov bound. To appear in IEEE Transactions on Information Theory. arXiv:1712.10052
- M. Weidner. Towards fast encoding of Garcia-Stichtenoth algebraic
geometry codes. SURF Final Report, 2018. Advisors: A. K. Narayanan and C. Umans. pdf
- A. Chiesa, L. Chua, and M. Weidner. On cycles of pairing-friendly elliptic curves. SIAM Journal on Applied Algebra and Geometry, 3(2):175--192, 2019. official pdf
- M. Weidner. Pseudocharacters of classical groups. In preparation. arXiv:1809.03644
- M. Weidner. On conjectural rank parities of quartic and sextic twists of elliptic curves. To appear in International Journal of Number Theory. official arXiv:1809.04244
- M. Hadian and M. Weidner. On Selmer rank parity of twists. Journal of the Australian Mathematical Society, 102(3):316-330, June 2017. official preprint
- Notes from a talk I gave on algebraic geometry error-correcting codes to Caltech's Math Club, targeted towards a general undergraduate mathematical audience.
While at Caltech, I played tenor saxophone in the Caltech-Occidental Wind Orchestra
. I can juggle five balls and three of various other objects.
Math is Fun?
Here is a list of math jokes
, compiled by Laura Shou
Here is a packet of "fun" math problems
, compiled from various sources by a group including William Hoza
, Laura Shou
, Jalex Stark
, Michael Wheeler, and myself. They are designed to be printed double sided and cut in two, so that each problem has a link to its "answer" on the back.
maweidne [AT] andrew.cmu.edu