Computer Science Assistant

Zeph Grunschlag

*** ********* **. #**

New York, NY 10027

Home Phone 212-***-****

****@**.********.***

www1.cs.columbia.edu/~zeph

Objective Computer Scientist seeking a new career in finance

Experience

1999-Present Assistant Professor, Columbia University Computer Science Dept.

Summer 2000 Visiting Researcher, IBM Research Center, Haifa, Israel

1999-2005 Graduate Student Instructor and Researcher, U.C. Berkeley

Spring 1990 Undergraduate Teaching Assistant, Princeton University

Education

1993-1999 PhD in Mathematics

University of California, Berkeley

Advisor: Dr. John Stallings

Dissertation: Algorithms in geometric group theory

1988-1992 AB in Mathematics

Princeton University

Magna Cum Laude

Skills

C++, Java, Matlab, PHP, Regular Expressions, Google Maps, Javascript, HTML, LaTeX

Awards

Erdosz Fellow, 1999, Technion University, Israel (Declined the Fellowship Award) National Need Fellow, 1993, University of California, Berkeley

Phi Beta Kappa, 1992, Princeton University

Publications

Deciding if the Angle is Zero in Free Groups, Topology and its Applications, no. 110 (2001), Elsevier Science, Amsterdam.

Computing Angles in Hyperbolic Groups, pp. 59-88 in Groups, Languages and Geometry, R. Gilman Ed., Contemporary Mathematics no. 250, American Mathematical Society, Providence R.I., 1999., Dissertation, Berkeley, CA, 1999.

Software (available through homepage)

PPIso - Protein-Protein-Interaction Graph Isomorphism solver

Technologies: C++, GraphViz, HTML

- PHP graph search visualizer using Google maps of the 50 states

Technologies: C++, PHP, HTML, Javascript, Google Maps API

- web-based cryptology learning system

Technologies: Java, Swing, HTML

- context free grammar egrep variant

Technologies: Java

- visual parse tree generator for general context free grammars

Technologies: Java, Swing

- student grades website and personalized email generator

Technologies: Java, XML, HTML

Lecture Notes (available through homepage)

Teaching

Courses Taught at Columbia

Data Structures and Algorithm Analysis in C++

Covers both abstract design and practical implementation issues in C++

Honors and regular sections taught

Data Structures in Java

Covers both abstract design and practical implementation issues in Java

Honors and regular sections taught

Introduction to Cryptography

Covers the theoretical underpinning of cryptography and cryptanalysis

Graduate level

Undergraduate Cryptography

Covers classical and modern encryption and cryptanalysis algorithms both theoretically

and through Java implementations

Models of Computation

Covers regular expressions, context free grammars, Turing completeness, undecidable

and intractable problems

Final theory course required by all undergraduate C.S. majors

Discrete Mathematics and Graph Theory

Covers logic, proofs, probability, combinatorics, and graphs.

First C.S. theory course

Courses Taught at U.C. BerkeleyCalculus II (Summer 1997)Teaching Assistant (1993–1998): Abstract Algebra, Discrete Mathematics,

Linear Algebra, Calculus I, Calculus II, Pre-Calculus

Independent Study

Finkel, Jenny (Spring 2001) Experimental Evidence for the Hanna Neumann Conjecture

Lyubashevsky, Vadim (Spring 2001) Geometric Group Theory Algorithm Programs

Chou, Ching-En and Wu, Jiunn-Ru (Fall 2001) Topics in Complexity Theory

LaShanda Henry, Kabir Ahuja, Sage Choi, Jason Lee and Olga Zaitseva (2001-2002)

Weaver and the Web

Ordonez, Ramiro (Fall 2002) Implementating Fast Matrix Multiplication Algorithms

Student Projects

John E. Cao, Jing Fan, Jing Huang, Shen Li, Yiting Shen and Simin Wang (Fall 2000)

ABCEZ: AppletProjects Based Computability Enlightenment Zone

Hirsch, Yoav (Spring 2002) Grammar Transformation Addition to JavaCFG

Dweck., B. J. (Fall 2003) Graph Based Turing Machine Simulator

Mungekar, Surag (Spring 2004) Automaton Addition to Turing Machine Simulator

Larivierre, David (Spring 2004) Javascript Runtime Encryptor

Committees and Service

Columbia Video Network Computer Science Liaison. Fall 2000 – current

Columbia Video Network Computer Science Advisor. Fall 2000 – current

Masters Program Committee. Fall 2001 – current

Masters Admissions Committee. Fall 2001 – current

Masters Student Advisor. Fall 2001 – current

Senior Engineering Student Advisor. Fall 2000 and Spring 2001

Junior Engineering Student Advisor. Fall 1999 and Spring 2000

Invited Talks

Connections between formal languages and hyperbolic groups, Colloquium, Vanderbilt Math Dept., Nashville, TN, 7 April, 1999

The importance of computer science in group theory (or what happened when Rubik read Hopcroft and Ullman) Colloquium, Columbia C.S. Dept., NY, NY, 25 March, 1999

Computing angles in hyperbolic groups, Albany Group Theory Conference, Albany, NY, 11 October, 1998

References - available upon request

Contact this candidate