Education and Teaching


Classes taken at Cornell
Multi-agent systems, logic of knowledge: Reasoning About Knowledge (CS 676) (prof. Joe Halpern)

Programming languages, type theory, automated reasoning
Advanced Programming Languages (CS 611) (prof. Andrew Myers)
Introduction to Automated Reasoning (CS 671) (prof Bob Constable and Christoph Kreitz)

Operating systems, security
Advanced Course in Computer Systems (CS 614), Operating systems (CS 414) (prof. Ken Birman)
System Security (CS 513) (prof. Fred Schneider)
Databases (CS 432) (prof. Jayavel Shanmugasundaram)
Computer Organization (ECE 314) (prof. Sally McKee)

Artificial intelligence, neural networks
Advanced Artificial Intelligence (CS 672) (prof. Bart Selman)
Feedforward Neural Networks (EE 577) (prof. Terrence Fine)

Algorithms, computability
Algorithms (CS 681) (prof. Jon Kleinberg)
Automata theory and computability (CS 481) (prof. Dexter Kozen)

Decision theory: Decision theory (ECON 676) (prof. Joe Halpern, Larry Blume, David Easley)

Statistics: Bayesian Statistics and Data Analysis (ORIE 678) (prof. David Ruppert)

Numerical analysis: Matrix Computation (CS 621) (prof. Charles Van Loan)

Seminars
PRL seminar
PLDG

Teaching
Classes TA-ed at Cornell
Differential Equations (MATH 420), Calculus for Engineering (MATH 293), Computers and Programming (CS 211)

Graduate Outreach Program '04: Puzzles and and Games of Chance Explained
As an undergraduate
I was a student of the Faculty of Mathematics, Department of Computer Science in Bucharest.
The first year I studied Real Analysis, Algebra, Geometry, and Computer Science; the last three years were specialization in computer science.
The study of mathematics was continued by Complex Analysis, Differential Equations, Optimization Methods and Theory of Measure and Probability, Statistics, Models of Simulation .
Some of the computer science courses: Operating Systems, Programming Languages, Algorithms and Data Structures, Mathematical Models of Programming Languages, AI, Databases, Computer Networks , along with more applicative classes: UNIX, Visual C, Visual Basic, LISP, or Sampling Theory (applied statistics).

The subject of my thesis was Evolutionary Algorithms : Genetic Algorithms, Evolutionary Strategies, and Evolutionary Programming, a theoretical review of the subject and implementation of the algorithms for function maximization. The program was written in Visual C and I have also coded the standard version of genetic algorithms in LISP.