RESUME

Lawren Smithline

150 Spruce Street
Princeton, NJ 08542
(607) 277-0096

lawren@idaccr.org

http://www.math.cornell.edu/~lawren

CURRENT EMPLOYMENT

Center for Communications Research, Princeton, NJ, January 2005--present.

     As a member of the research staff, I contribute to the company's
     team oriented approach to Department of Defense-supported
     mathematics research.  My interest in signal processing,
     developed while at CCR, together with my pure mathematics
     background, has afforded me an opportunity to work with a
     large number of collaborators.  Results span analysis,
     theorems, prototype algorithms, and production software.

EDUCATION

University of California, Berkeley, CA,

     Ph.D. in Mathematics, June 2000.
     Dissertation: _Exploring p-adic modular forms_.
     Advisor: Robert Coleman (Number Theory).
     Candidate in Philosophy, January 1997. 
     National Science Foundation Graduate Fellow.

Cambridge University, Cambridge, UK.

     Certificate of Advanced Study in Mathematics, June 1995.
     Matriculated Emmanuel College.

Harvard University, Cambridge, MA,

     A.B. summa cum laude in Mathematics, June 1994.
     Hoopes prize for senior thesis.
     Phi Beta Kappa.
     Dean's List.
     John Harvard Scholarship.
     Barry Goldwater Scholarship.
     Certificate for Excellence in Teaching.
     Putnam Competition Honorable Mention, 1990, top 100, 1991, 1992.

PROFESSIONAL EXPERIENCE

Cornell University, Ithaca, NY, July 2000--2004.

     As Assistant Professor, I teach mathematics and research
     number theory, combinatorial algebra and computational
     biology algorithms.

Center for Communications Research, Princeton, NJ, Summer '93, '94, '01, '02

     Summer Conference on Applied Math Problems (SCAMP).
     I contributed to the company's team oriented approach to
     classified Department of Defense mathematics research.

BARRA, Inc., Berkeley, CA, Summer '98 

     I analyzed a model of Merton's problem of lifetime asset allocation
     using stochastic calculus, supervised by Dr. Nicolo Torre.

Harvard University and University of California, various terms, '91-'99

     As teaching assistant, I led discussion sections, graded exams
     and homework, and conducted office hours for undergraduate math
     and computer science.

University of Minnesota, Duluth, Summer '92

     I constructed an algorithm to demonstrate the bandwidth of a
     certain class of graph theoretic trees as a participant in a
     National Science Foundation Research Experience for Undergraduates
     (REU) directed by Professor Joseph Gallian.

Rose Hulman Institute of Technology, Terre Haute, IN, Summer '91

     I researched problems in combinatorial finite group theory and
     later presented the results at a national mathematics conference.
     Professor Gary Sherman directed this National Science Foundation REU.

Cornell National Supercomputing Facility, Ithaca, NY, Summer 1990

     I implemented an original parallel algorithm for reduction of
     a matrix to Hessenberg form, a preparatory step for determining
     eigenvalues.  The project derived from my Westinghouse
     Science Talent Search semifinalist winning entry.  Helen Doerr
     directed the SuperQuest Supercomputing Institute.


PUBLICATIONS

L. Smithline, ``A cipher to Thomas Jefferson,'' 
     _American Scientist_ 97 (2, March-April 2009): 142-149.

S. Kutin, D. Moulton, and L. Smithline, ``Computation at a Distance,''
     Chicago Journal of Theoretical Computer Science (2007), vol. 2007.
     Also arXiv:quant-ph/0701194v1.

L. Smithline, ``Bounding slopes of p-adic modular forms,''  cited as
     arXiv:0705.3614v1 in D. Loeffler, "Spectral expansions of
     overconvergent modular functions," International Mathematics
     Research Notices (2007) Vol. 2007.

---, ``Compact operators with rational generation,'' in _CRM Proceedings
     Lecture Notes_, vol. 36, Providence, RI: American Mathematical
     Society (2004) 287-294.

---, ``Probabilistic pairwise sequence alignment,''
     arXiv:q-bio/0409035v1.

---, ``Computing lowest slopes of p-adic modular forms,''
     submitted to _Journal of Computational Mathematics_.

---  ``Bandwidth of the complete k-ary tree,''
     _Discrete Mathematics_,  142 (1995) 203-212.

J. Ellenberg, G. Sherman, et al, ``The combinatorics of rewritability in
     finite groups'' in  _Proceedings of the Biennial Ohio State-Denison
     Conference_,  Paris: World Scientific (1993) 250-261.


PRESENTATIONS

_A Cryptic Letter to Thomas Jefferson_, 
     various venues from March 2008, 
     including Cornell, Harvard, and Princeton Universities.

_Computation at a Distance_,
     various venues from March 2008.

_Compact operators with rational generating functions_, 
     May 2002, Canadian Number Theory Association, Montreal, QC.

_Slopes of p-adic modular forms_,
     June 1999, Park City Mathematics Institute, Park City, UT.

_Bandwidth of the complete k-ary tree_,
     January 1993, AMS-MAA Joint Meetings, San Antonio, TX.

_Anagrams in groups_,
     January 1992, AMS-MAA Joint Meetings, Baltimore, MD.


INTERESTS

Triathlon, music.