ESP Biography
LETITIA LI, MEng in EECS
Major: EECS College/Employer: MIT Year of Graduation: G 

Brief Biographical Sketch:
Not Available. Past Classes(Clicking a class title will bring you to the course's section of the corresponding course catalog)C8682: Dynamic Programming and other Algorithms in Splash 2014 (Nov. 22  23, 2014)
Imagine on Halloween, some grouch only lets you keep a certain weight in loot. How would you optimize your candyinduced happiness for the next year, while you plot revenge against that grouch? Ever wonder how google's pagerank works? Learn optimization algorithms, mapfinding and other algorithms.
C8234: Computers at the Lowest Level in Spark 2014 (Mar. 15  16, 2014)
Ever wonder about the location of every electron in your computer? Probably not, but we'll get as close as possible to that level of detail! We'll go over gates and how to build them, encoding, and everyone's favorite programming language: assembly language!
C8307: Dynamic Programming and other Algorithms in Spark 2014 (Mar. 15  16, 2014)
Imagine on Halloween, some grouch only lets you keep a certain weight in loot. How would you optimize your candyinduced happiness for the next year, while you plot revenge against that grouch? Ever wonder how google pagerank works? Learn optimization algorithms, mapfinding and other algorithms.
C7509: Living Optimally with Dynamic Programming in Splash! 2013 (Nov. 23  24, 2013)
Imagine on Halloween, some grouch only lets you keep a certain weight in loot. How would you optimize your candyinduced happiness for the next year, while you plot revenge against that grouch? Learn a certain type of optimization algorithms along with mapfinding and other algorithms.
C7510: Computers at the Lowest Level in Splash! 2013 (Nov. 23  24, 2013)
Ever wonder about the location of every electron in your computer? Probably not, but we'll get as close as possible to that level of detail! We'll go over gates and how to build them, encoding, and everyone's favorite programming language: assembly language!
X4653: How to Not Fail at Cosplay in Spark! 2011 (Mar. 12, 2011)
Cosplay means dressing up as anime or video game characters, for an anime convention or maybe just Halloween. But maybe you don't feel like ordering a $100 costume online. This class is for beginners who want to learn to cosplay cheaply while still being recognizable and not ending up on "10 Worst Cosplays of all time".
M4654: Odd Math Tricks to Annoy People with in Spark! 2011 (Mar. 12, 2011)
I will prove lots of unbelievable statements, and you try to figure out if I'm lying. Learn why I insist 420 > 422, how the Monty Hall problem works, how I set up a rigged card game, and the principles behind these problems.
A3891: How to not Fail at Cosplay in Splash! 2010 (Nov. 20  21, 2010)
Cosplay means dressing up as anime or video game characters, for an anime convention or maybe just Halloween. Learn what makes your character recognizable, and what will get you posted on "Top 10 worst cosplays".
M3974: CounterIntuitive Probability and Random Math in Splash! 2010 (Nov. 20  21, 2010)
Learn of interesting math problems like Proof by Induction, how to solve the MontyHall problem, Matching algorithm, and others.
C3209: Living Optimally with Dynamic Programming in Spark! 2010 (Mar. 13, 2010)
Imagine on Halloween, some grouch only lets you keep a certain weight in loot. How would you optimize your candyinduced happiness for the next year, while you plot revenge against that grouch? Learn a certain type of optimization algorithms along with mapfinding and other algorithms.
X3233: How not to fail at Cosplay in Spark! 2010 (Mar. 13, 2010)
Winning costume contests requires time and charisma. All I try for is not getting my picture posted on "10 worst Cosplays of all time". Running from every camera is one possible way, but what parts of a costume can we skimp on and still look impressive? Discuss how to be recognizable, as well as how to choose fabric and wigs.
M3263: Counterintuitive Probability and Random Math in Spark! 2010 (Mar. 13, 2010)
How do you solve the Monty Hall problem? And what is the algorithm for stable matching? Learn random surprising math problems.
C2708: Living optimally with Dynamic Programming in Splash! 2009 (Nov. 21  22, 2009)
There is one group of algorithms which make finding optimal solutions efficient. Go through an imaginary vacation while applying dynamic programming and random other algorithms.
S2709: Run! It's Organic Chemistry! in Splash! 2009 (Nov. 21  22, 2009)
Is it really so hard that it's a miracle to just pass? And what use can it be? Try to learn 2 semesters worth of reactions in 1 hour, as well as how to make TNT.
M2421: Number Theory and Other Random Math in HSSP Summer 2009 (Jul. 12, 2009)
What’s a recurrence? And why does it help with algorithms? If I have n newts, t toads, and s slugs, how many ways can I make n+t+s people miserable by putting my animals in their beds? In number theory, we will learn about the properties of numbers, in particular, integers. We will learn about how to effectively determine whether an integer is prime or not, how to prove the sqr root of 2 is irrational. We also learn a bit of cryptology—using numbers encoding messsages. You will be sending secret messages and ask people to decipher them. Learn about encryption, probability, induction, and other random topics in math. Great for students who want to learn a different kind of math than the kinds taught in high school.
M2077: Proofs, Induction, Mass Chaos, and Love in Spark! Spring 2009 (Mar. 07, 2009)
Induction is the simplest type of proof, requiring only two parts. Yet small false statements, very well hidden, can "prove" strange things. And somehow, it's related to matchmaking, puzzles, and a temple that can end the world.
X2078: Disastrous Sushi Making in Spark! Spring 2009 (Mar. 07, 2009)
There can only be so many ways to mess it up, but I seem destined to go through them all. And yet, it's still cheap, and people seem to eat it anyway.
M1611: Fourier and Laplace Transforms in Splash! 2008 (Nov. 22  23, 2008)
It's actually possible to change space and time with just math! They're strange tools in differential equations that one can use to make a problem much easier, or just things to do if you feel like doing math. Also great plot devices if you feel like giving kids nightmares about integrals.
How to NOT fail at Cosplay in JUNCTION (2010)
Winning cosplay contests requires sewing skill, time, and money. It's easier to go for not getting your picture posted on ...
Data stream coding in JUNCTION (2009)
I will send you a line of 0s and 1s, and you will be able to figure out what I've ...
Differential Equations in JUNCTION (2009)
Differential Equations model real world systems. And in many real world systems, whether as simple as a spring and weight, ...
Dynamic Programming in JUNCTION (2009)
Dynamic Programming describes algorithms which solve smaller problems first, which lead to solutions for more complex problems. It finds the ...
Fourier and Laplace Transforms in JUNCTION (2009)
I don't feel like solving the problem in time, so I'll change worlds and solve it in frequency. Or maybe ...
Organic Chemistry in JUNCTION (2009)
The bane of a college student's life. Is it really so hard that it's a celebration just to pass? And ...
Proof by Induction in JUNCTION (2009)
Some things never change. And using this fact, I can prove that, in this hypothetic or real situation, a fact ...
Search Algorithms in JUNCTION (2009)
I am in an arbitrary world made of destinations and paths. I know the cost to move from one destination ...
