Computer Science Engineering

Location:

Princeton, NJ

Posted:

February 14, 2013

Contact this candidate

Resume:

We found * results related to this asset

Document InformationType: Other

Total # of pages: 2

Avg Rating:

Price:

Free

Document Source

http://www.cs.princeton.edu/~sssix/resume.pdf

Siddhartha Sen

Education Princeton University Princeton, NJ

Ph.D. in Computer Science, Advisors: Robert E. Tarjan and Michael J. Freedman, expected 2012

GPA: 4.0/4.0

Massachusetts Institute of Technology Cambridge, MA

M. Eng. in Computer Science and Engineering, Advisor: Charles E. Leiserson, June 2004

GPA: 5.0/5.0

Massachusetts Institute of Technology Cambridge, MA

B.S. in Computer Science and Engineering and B.S. in General Mathematics, June 2003

Minor in Spanish, June 2003

GPA: 4.8/5.0

International School Manila High School Manila, Philippines

Graduated Valedictorian and Class Speaker 1999 with GPA: 4.0/4.0

Honors Awarded two-year Google Ph.D. Fellowship in Fault-Tolerant Computing, 2009

Awarded SODA 2010 (sponsor: NSF), SOSP 2009 (sponsor: NSF), and NSDI 2008 Student Scholarships

Member of Phi Beta Kappa, Tau Beta Pi, and Eta Kappa Nu national honor societies

Member of National Society of Collegiate Scholars (NSCS) and Sigma Xi scientific research society

Publications Siddhartha Sen, Wyatt Lloyd, and Michael J. Freedman. Prophecy: Using history for high-throughput

fault tolerance. In NSDI, 2010.

Siddhartha Sen and Robert E. Tarjan. Deletion Without Rebalancing in Balanced Binary Trees. In SODA,

2010.

Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato F. Werneck, and Udi Wieder. Virtual Ring Routing

Trends. In DISC, 2009.

Siddhartha Sen and Robert E. Tarjan. Deletion Without Rebalancing in Multiway Search Trees. In

ISAAC, 2009.

Bernhard Haeupler, Siddhartha Sen, and Robert E. Tarjan. Rank-Pairing Heaps. In ESA, 2009.

Bernhard Haeupler, Siddhartha Sen, and Robert E. Tarjan. Rank-Balanced Trees. In WADS, 2009.

Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, and Robert E. Tarjan. Faster

Algorithms for Incremental Topological Ordering. In ICALP, 2008.

Anders Selmer, Mike Goodson, Markus Kraft, Siddhartha Sen, V. Faye McNeill, Barry S. Johnston, and

Clark Colton. Process Dynamics and Control Experiment Performed Across the Atlantic. Chemical

Engineering Education, Summer 2005, 232-237.

Siddhartha Sen. Dynamic Processor Allocation for Adaptively Parallel Jobs. Master's thesis,

Massachusetts Institute of Technology, September 2004.

Patents Siddhartha Sen, Vladimir Petter, and Andrea D’Amato. Client Affinity in Distributed Load Balancing

Systems. United States Patent Application, filed September 13, 2007.

Siddhartha Sen and Amit Date. Software Testing Techniques for Stack-Based Environments. United

States Patent Application, filed January 5, 2007.

Siddhartha Sen. Dynamic Network Load Balancing Using Roundtrip Heuristic. United States Patent

Application 11/518,673, filed September 11, 2006.

Siddhartha Sen. Load Balancing via Rotation of Cluster Identity. United States Patent Application

11/276,761, filed March 13, 2006.

Siddhartha Sen, Joseph M. Joy, Nikolai Tillman, Colin L. Campbell, and Margus Veanes. Diagnosing

Problems in Distributed Systems. United States Patent Application 11/140,061, filed May 28, 2005.

Work

Experience

S* Network Systems Group and Theory Group (Princeton CS Dept.) September 2007-

Research Assistant

Currently performing research on algorithms, data structures, and designs for scalable and reliable

distributed systems. (More details can be found in publications and website.)

Distributed Systems Group (Microsoft Research Redmond) June 2010-August 2010

Research Intern

Worked on two research projects (currently in submission): the first is a provably-efficient, decentralized

system for providing availability to machines even as they sleep; the second is a characterization of

Princeton University

Dept. of Computer Science

35 Olden Street

Princeton, NJ 08544

http://www.cs.princeton.edu/~sssix/

abqotz@r.postjobfree.com

Phone: 617-***-****

Page 1

Page 2 »