-
-
I've written on interesting theoretical topics.
Since they are for my own amusement and not for credit of any sort,
far more effort was put into them than is typical for schoolwork.
Teaching
- my past TA assignments in the CSE department
Year |
Session |
Course # |
Course name |
Professor |
2003 |
Fall |
202 |
Alg Design and Analysis |
Ramamohan Paturi |
2004 |
Winter |
107 |
Intro to Modern Crypto |
Mihir Bellare |
Fall |
202 |
Alg Design and Analysis |
Russell Impagliazzo |
2005 |
Winter |
200 |
Computability and Complexity |
Daniele Micciancio |
Spring |
5A |
Intro to Programming I: C |
Susan Marx |
Summer |
21 |
Math for Alg and Systems |
Neil Rhodes |
2006 |
Winter |
200 |
Computability and Complexity |
Ramamohan Paturi? |
Winter |
11 |
Intro to CS and OOP: Java |
Paul Kube |
Fall |
200 |
Computability and Complexity |
Russell Impagliazzo |
2007 |
Winter |
21 |
Math for Alg and Systems |
Ronald Graham |
Spring |
200 |
Computability and Complexity |
Russell Impagliazzo |
Summer |
105 |
Theory of Computability |
Ramamohan Paturi |
2009 |
Winter |
202 |
Alg Design and Analysis |
Ramamohan Paturi |
Summer |
101 |
Alg Design and Analysis |
Ramamohan Paturi |
- some guides for CSE 202, and mathematical writing in general
Publications
-
Chris Calabro,
Russell Impagliazzo,
Ramamohan Paturi
The Complexity of Satisfiability of Small Depth Circuits
IWPEC, 2009, (to appear in IWPEC 2009, LNCS)
-
Chris Calabro,
Ramamohan Paturi
k-SAT is No Harder than Decision-Unique-k-SAT
CSR, 59-70, LNCS 5675, 2009
-
Chris Calabro
A Lower Bound on the Size of Graphs
Dense in Long Paths
ECCC Report TR08-110, 2008
-
Chris Calabro,
Russell Impagliazzo,
Ramamohan Paturi
A Duality between Clause Width and
Clause Density for SAT
IEEE Conference on Computational Complexity 2006: 252-260
-
Chris Calabro,
Russell Impagliazzo,
Valentine Kabanets,
Ramamohan Paturi
The Complexity of Unique k-SAT:
An Isolation Lemma for k-CNFs
IEEE Conference on Computational Complexity 2003: 135-141
-
- the purpose of which can be found
here.
-
- the purpose of which is to propose a thesis topic.
-
- "The exponential complexity of satisfiability problems"
|
Software
- Hors Catégorie
An interactive fiction I made with
David Benin in 2007.
- Dots-n-Boxes
My wonderful Allegro implementation of the classic game.
The AI is very strong.
It should now work with Windows XP et al.
- Launch project
for Sam Buss's Spring 2002 graphics class.
- Primality
Here is the code for a C implementation of the
Agrawal, Nayal, Saxena primality testing algorithm.
It does not use FFT for the polynomial multiplication.
Such a change would require much more programming effort
and only speed it up by 1 order of magnitude,
and even then only for sufficiently large inputs.
- Programming projects
A list of most of my programming activities over my whole life.
Dance
- I've been dancing tango since 2002.
- I presided over the
UCSD Tango Club from 2005-2006,
- and currently co-run the Friday night dance
Milonga Sin Nombre.
-
A clip
of me dancing with Judy Cunningham, 3/2007.
Artwork
- T-shirt
I designed for the UCSD Tango Club; an adaptation of
an image of Poseidon commonly found on UCSD websites.
- Business card
(coming soon)
-
Eiffel tower
I made from Brisk Iced Tea cans that
Ragesh Jaiswal
drank. It stands proudly in the theory lab.
- UCSD Tango Club
cache of the old website I designed (coming soon).
- Milonga Sin Nombre
website I designed.
|