David Wajc (pronounced "Weizz")
Technion, Israel Institue of Technology, CS Faculty
Contact Information
- Email: sdavidwa@cs.technion.ac.il
- Address: Taub 207, Technion, Haifa, Israel
- Phone: (+972) 4-829-3376
- Office Hours:
Research Interests
Algorithms. Specifically: Data Structures, Graph algorithms. Approximation and online algorithms for hard problems.Advised By: Nir Ailon
"Algorithms research is like sex: sure it may give some practical results, but that's not why we do it".
- Martin Farach-Colton, paraphrasing Richard Feynman
Teaching
"Education's purpose is to replace an empty mind with an open one."- Malcolm Forbes
Data Structures 1 (234218) Spring 2012
Data Structures 1 (234218) Winter 2011-2012
Algorithms 1 (234247) Summer 2011
Data Structures 1 (234218) Spring 2011
Data Structures 1 (234218) Winter 2010-2011
Algorithms 1 (234247) Summer 2010
Data Structures 1 (234218) Spring 2010
Introduction to Systems Programming (234122) Spring 2009
Introduction to CS (234114) Winter 2008-09
Title
Master Student (at least that's what my student ID claims...)
Master Student (at least that's what my student ID claims...)
Courses of Interest I Took
I have been privileged to take and audit some very interesting courses, given by some great researchers, both at the Technion's Faculties of CS and Maths, as well as at Carnegie Mellon University (CMU), where I spent a semester as part of the Technion's Foreign Exchange Program. Among these courses:
- Polynomial Time Algorithms for LP by Elad Hazan
- Fixed Parameter Tractability by Hadas Shachnai
- Online Algorithms by Seffi Naor
- Approximation Algorithms by Hadas Shachnai
- Algorithms Seminar by Reuven Bar-Yehuda
- Communication Complexity (old site) by Eyal Kushilevitz
- Probabilistic Methods and Algorithms by Eldar Fischer
- Complexity Theory by Eyal Kushilevitz
- Computational Geometry by Gill Barequet
- Math Puzzles by Rom Pinchassi. (Also, see this link for a general course description)
- Spectral Graph Theory by Eli Ben-Sasson and Ariel Gabizon (Based on courses of Daniel Spielman).
- Field and Galois Theory by Raphael Loewy
- Ramsey Theory by Andrzej Dudek (at CMU)
- Advanced Algorithms by Anupam Gupta and Daniel Sleator (at CMU)
- Introduction to Theoretical Cryptography by Manuel Blum (at CMU)
I have been privileged to take and audit some very interesting courses, given by some great researchers, both at the Technion's Faculties of CS and Maths, as well as at Carnegie Mellon University (CMU), where I spent a semester as part of the Technion's Foreign Exchange Program. Among these courses:
- Polynomial Time Algorithms for LP by Elad Hazan
- Fixed Parameter Tractability by Hadas Shachnai
- Online Algorithms by Seffi Naor
- Approximation Algorithms by Hadas Shachnai
- Algorithms Seminar by Reuven Bar-Yehuda
- Communication Complexity (old site) by Eyal Kushilevitz
- Probabilistic Methods and Algorithms by Eldar Fischer
- Complexity Theory by Eyal Kushilevitz
- Computational Geometry by Gill Barequet
- Math Puzzles by Rom Pinchassi. (Also, see this link for a general course description)
- Spectral Graph Theory by Eli Ben-Sasson and Ariel Gabizon (Based on courses of Daniel Spielman).
- Field and Galois Theory by Raphael Loewy
- Ramsey Theory by Andrzej Dudek (at CMU)
- Advanced Algorithms by Anupam Gupta and Daniel Sleator (at CMU)
- Introduction to Theoretical Cryptography by Manuel Blum (at CMU)
- 4255 visits so far -