Joel Oren

 

Courses I’ve TA’ed:

  1. • CSC108 - Introduction to Programming

  2. • CSC373 - Algorithms Design

  3. • CSC263 - Data Structures

  4. • CSC200 - Social and Economic Networks: Models and Applications

  5. • CSC2221 - Distributed Computing

Courses I’ve taken:

  1. •CSC2401 - Introduction to Computational Complexity

  2. •CSC2415 - Impossibility Results in Distributed Computing

  3. •CSC2221 - Distributed Computing

  4. •CSC2504 - Computer Graphics

  5. •CSC2420 - Algorithm Design, Analysis, and Theory

  6. •CSC2515 - Machine Learning

I am a first year Ph.D student at the Theory Group, Department of Computer Science, University of Toronto I am fortunate to be supervised by Allan Borodin and Craig Boutilier. I finished my undergraduate studies at Ben-Gurion University, Be'er Sheva, Israel, under the supervision of Avraham Melkman. I am broadly interested in theoretical computer science. In particular I am interested in combinatorial optimization, online computation, and game theory. I have also dabbled with information retrieval and recommendation systems.http://www.cs.toronto.edu/~borhttp://www.cs.toronto.edu/~ceblyhttp://www.cs.bgu.ac.il/~melkmanAbout_Me_files/doc.pdfshapeimage_1_link_0shapeimage_1_link_1shapeimage_1_link_2

Research:

  1. • Efficient Vote Elicitation under Candidate Uncertainty. To appear in IJCAI2013. [PDF]

  2. • Robust winners and winner determination policies under candidate uncertainty - with Craig Boutilier, Jerome Lang, and Hector Palacios. Preliminary version presented at COMSOC2012 [PDF]

  3. • Truthful Mechanisms for Competing Submodular Processes - with Allan Borodin, Mark Braverman, and Brendan Lucier. To appear in WWW2013. [PDF]. A project poster was was presented at CAEC2011 [SLIDE].

  4. • Online Budgeted Social Choice - with Brendan Lucier. A preliminary version was presented at COMSOC2012. [PDF]

  5. • Efficient Sum-Based Hierarchical Smoothing Under the \ell_1-Norm - with Siavosh Benabbas, Hyun Chul Lee, and Yuli Ye. In submission. [PDF]

  6. • Threshold Models for Competitive Influence in Social Networks - with Allan Borodin and Yuval Filmus. WINE 2010. [PDF] [SLIDES]

Sandford-Flemming Building, Room 4306B

Computer Science

University of Toronto

10 King's College Road

Toronto, ON M5S 3G4

email:

surname@cs.toronto.edu