Dr. Leonard Schulman

Professor

Build a Statement of Purpose

Generate a tailored SOP for Dr. Leonard Schulman. Improve your application with a focused, well-structured draft.

Biography

Professor Leonard J. Schulman specializes in algorithms, coding, communication protocols, combinatorics, probability, and quantum computation. His research incorporates causal inference and non-reversible Markovian dynamics. His areas of focus include game theory, coding theory, and information theory. Schulman's work aims to advance the understanding of complex systems through the development of efficient algorithms and protocols that can be applied across various domains of computer science. He has contributed to the theoretical foundations of computer science while also exploring practical applications of his research in quantum computation and related fields. In addition to his research, Professor Schulman is actively involved in teaching and mentoring students within the Computer Science department at the California Institute of Technology, contributing to the next generation of scholars in this rapidly evolving field.

Research Interests

Courses

CMS/CS/IDS 139 – Analysis Design Algorithms CS/IDS 153 – Current Topics Theoretical Computer Science CS/IDS 150 ab – Probability Algorithms CS/IDS 153 – Current Topics Theoretical Computer Science: Markov Chain Monte Carlo Algorithms

Requirements for California Institute of Technology

Doctorate Program
Requirements
TOEFL
Total
Required:100
IELTS
Overall
Required:7
Prerequisites
Bachelor's degree or equivalent Strong background in mathematics and physical sciences
Application Checklist
  • Online Application
  • Statement of Purpose
  • Three Letters of Recommendation
  • Transcripts
  • Resume/CV
Specialization Notes

Most Caltech graduate programs are PhD-only. GRE General and Subject tests vary by department; many have made them optional or no longer accept them.