 |
|
|
|
|
|
| Project's location | The projects' presentation will be in room 201.
Please bring laptops with you as there are no computer there. |
|
| Created on 29/5/2008, 10:23:13 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed B grades | Moed B grades are in GR++.
5 points factor was given.
|
|
| Created on 28/5/2008, 01:12:55 |
|
|
|
|
|
|
|
|
|
|
|
|
| Projects' hours | The hours for the four projects are:
- Tuesday (10/6) 16:00-16:50 - Project #2
- Tuesday (10/6) 17:00-17:50 - Project #4
- Wednesday (11/6) 17:30-18:20 - Project #6
- Wednesday (11/6) 18:30-19:20 - Project #7
|
|
| Last updated on 24/5/2008, 19:02:09 |
|
|
|
|
|
|
|
|
|
|
|
|
| Reception hours before moed b | Hadas will give a reception hour at Sunday 15:30-16:30.
I'll held a reception hour at Monday 12:20-13:20.
Study well, good luck in the exam! |
|
| Last updated on 23/5/2008, 10:06:48 |
|
|
|
|
|
|
|
|
|
|
|
|
| Projects' hours | The hours for the four projects are:
- Tuesday (10/6) 16:00-16:50
- Tuesday (10/6) 17:00-17:50
- Wednesday (11/6) 17:30-18:20
- Wednesday (11/6) 18:30-19:20
Please send Gil a list your preferences. |
|
| Last updated on 24/5/2008, 11:17:31 |
|
|
|
|
|
|
|
|
|
|
|
|
| Projects | Projects have been assigned to the couples.
- 036333094 and 316851013 are asked to work on project #2.
- 316826577 and 317838456 are asked to work on project #4.
- 024648032 and 040404758 are asked to work on project #6.
- 313944969 and 307028936 are asked to work on project #7.
Good luck! |
|
| Created on 12/5/2008, 22:09:27 |
|
|
|
|
|
|
|
|
|
|
|
|
| Projects - final call | | Those of you who wish to submit a project but still haven't sent me their preferences are asked to do so till 13:00 tomorrow. (Notice that deadline was today.) |
|
| Last updated on 11/5/2008, 22:43:55 |
|
|
|
|
|
|
|
|
|
|
|
|
| Projects | Please read the instructions under Course Material > Projects.
Hag Atzmaut Same'ah! |
|
| Created on 7/5/2008, 14:03:50 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed A appeals | Appeals for Moed A may be submitted till the 15th.
Note that the final grades after moed a and without the projects were published. |
|
| Last updated on 1/5/2008, 16:15:59 |
|
|
|
|
|
|
|
|
|
|
|
|
| Project | Students who wish to take a project are asked to contact Gil in the next couple of days.
More details concerning the projects will be published once we'll know how many of you will take it. |
|
| Last updated on 28/4/2008, 08:32:45 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 5 was graded | The grades can be viewed in GR++.
The assignments will wait for you near the secretaries in a day or two.
We'll publish details about the optional project soon. |
|
| Last updated on 27/4/2008, 22:01:27 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed A grades | Moed A grades are in GR++. The final grades will be given once assignment 5 will be checked.
For those of you who failed moed a - please send a mail to Gil.
We hope you all enjoyed the course,
Hadas & Gil |
|
| Last updated on 25/4/2008, 15:26:45 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 4 was graded | Your grades on assignment 4 can be seen via GR++.
I'll return the assignments on Sunday.
|
|
| Created on 11/4/2008, 01:44:21 |
|
|
|
|
|
|
|
|
|
|
|
|
| Reception hours before moed a - correction | Hadas will give a reception hour at Sunday 14:30-15:30.
I'll held a reception hour at Monday 9:30-10:30.
In the previous message I accidentally flipped the days. |
|
| Last updated on 10/4/2008, 23:11:04 |
|
|
|
|
|
|
|
|
|
|
|
|
| Reception hours before moed a | Hadas will give a reception hour at Monday 14:30-15:30.
I'll held a reception hour at Sunday 9:30-10:30.
Study well, good luck in the exam! |
|
| Created on 10/4/2008, 19:12:15 |
|
|
|
|
|
|
|
|
|
|
|
|
| Grades in GR++ | | Assignments 1-3 Grades are now visible on GR++ |
|
| Last updated on 10/4/2008, 19:09:31 |
|
|
|
|
|
|
|
|
|
|
|
|
| Recitation 12 is on site | | The last recitation, recitation 12, on Algorithmic Game Theory is on site. |
|
| Created on 9/4/2008, 10:21:11 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 5 postponement | You may submit assignment 5 till the 15th (The day of the final exam).
Also notice that Recitation 11 on (Matroids) is on site.
|
|
| Created on 8/4/2008, 13:10:35 |
|
|
|
|
|
|
|
|
|
|
|
|
| Exam location changed | | The exam will be held in Ulmann 307 and not in Taub 9 as published. |
|
| Created on 6/4/2008, 12:55:46 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 5 (the last one!) is out | The assignment is due to 10.4.08.
We understand most of you have many assignments to submit and finals to prepare for, so this assignment, like the previous one, is shorter than we would have like.
|
|
| Last updated on 30/3/2008, 21:57:41 |
|
|
|
|
|
|
|
|
|
|
|
|
| Recitations 9,10 are on site | Recitations 9,10 on Greedy Algorithms Analysis are on site.
Matroids example will be added to this document later this week. |
|
| Last updated on 29/3/2008, 12:40:09 |
|
|
|
|
|
|
|
|
|
|
|
|
| Hint for question 4 of assignment 4 | | It might be helpful for you to think of Prim's algorithm for finding a Minimum Spanning Tree. |
|
| Last updated on 27/3/2008, 12:12:34 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 3 returned | | Your third assignment has been graded, but will wait for you only on Sunday evening near the secretaries. |
|
| Created on 26/3/2008, 20:25:31 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 4 is out | The assignment is due to 31.3.08.
Note that you have less than two weeks to submit this assignment. This is so we won't get into the exam period with the last assignment. |
|
| Created on 20/3/2008, 18:06:55 |
|
|
|
|
|
|
|
|
|
|
|
|
| The lemma on Hamiltonian Cycles in Random Graphs is on site | | You can find it under Material > Lectures Material. |
|
| Last updated on 13/3/2008, 08:23:56 |
|
|
|
|
|
|
|
|
|
|
|
|
| Recitation 8 is on site | | Recitation 8 on Random Walks is on site. |
|
| Last updated on 13/3/2008, 08:20:21 |
|
|
|
|
|
|
|
|
|
|
|
|
| Reminder - the recitation tomorrow | | The recitation tomorrow will be held at 13:30 and not at 16:30. |
|
| Created on 11/3/2008, 16:51:33 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 2 returned | Your second assignment will wait for you tomorrow morning near the secretaries.
Again, great job! |
|
| Last updated on 9/3/2008, 23:38:27 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 3 is out | The assignment is due to 19.3.08.
Note that questions 4 and 5 should be solved only after our next recitation on Random Walks. |
|
| Created on 3/3/2008, 21:37:46 |
|
|
|
|
|
|
|
|
|
|
|
|
| The recitation of 12 March | | The recitation of March 12 will be held at 13:30 and not at 16:30. |
|
| Last updated on 3/3/2008, 12:03:55 |
|
|
|
|
|
|
|
|
|
|
|
|
| Clarification regarding assignment 2 | | In question 4 you should only prove that the competitive ratio of the deterministic algorithm is not great than 4 (rather than showing it's exactly 4.) |
|
| Last updated on 2/3/2008, 12:07:12 |
|
|
|
|
|
|
|
|
|
|
|
|
| Literature section updated | The Literature section was updated with two books
- Randomized Algorithms
- Online Computation and Competitive Analysis
|
|
| Last updated on 29/2/2008, 19:17:08 |
|
|
|
|
|
|
|
|
|
|
|
|
| Recitations 5,6 and 7 are on site | Recitations 5&6 on the Balls into Bins model and recitation 7 on Markov Chains are on site.
Remember that there will be no recitation this week. Instead there will be 3 hours with Hadas. See you all in two weeks.
Gil |
|
| Last updated on 29/2/2008, 18:25:21 |
|
|
|
|
|
|
|
|
|
|
|
|
| Bloom Filters | Tomorrow we'll mention a data structure that is called a Bloom filter.
We will go over it in the recitation, but if are are curious and want to read about it, you can find a short description of it under Course Material > Lectures Material. |
|
| Last updated on 26/2/2008, 18:18:11 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignments 1 returned | Your first assignments are waiting for you in the hash table near the secretary.
Great job! |
|
| Last updated on 26/2/2008, 16:26:06 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 2 is out | The assignment is due to 5.3.08
You should start working on it soon. |
|
| Created on 20/2/2008, 18:46:21 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignments' Guidelines and Regulations | Roee Engelberg wrote a great document on guidelines and regulations for the homework assignments for the Algorithm 2 course. It is suitable for our course as well.
It will be wise to read it. |
|
| Last updated on 14/2/2008, 17:31:19 |
|
|
|
|
|
|
|
|
|
|
|
|
| Recitation 4 is on site | Recitation 4 is now published on the site under Course Material > Recitations.
Hadas & Gil |
|
| Last updated on 13/2/2008, 19:38:38 |
|
|
|
|
|
|
|
|
|
|
|
|
| Recitations 1,2 and 3 are on site | | Recitations 1,2 and 3 are now published on the site under Course Material > Recitations.
Please report any mistake or typo to Gil.
Hadas & Gil |
|
| Last updated on 7/2/2008, 07:47:08 |
|
|
|
|
|
|
|
|
|
|
|
|
| Assignment 1 is out | | The assignment is due to 20.2.08. |
|
| Created on 6/2/2008, 20:35:42 |
|
|
|
|
|
|
|
|
|
|
|
|
| Gil's reception hour | Gil's reception hour will be held on Wednesday 10:30-11:30 weekly, office 223.
Also, in the next recitation we will go over the proof of the upper bound for the competitive ratio of LRU in the access graph model where the graph is a tree (which we've started doing last time) . Don't you worry if things haven't been totally clear. Having said that - please take the time and go over the proof of the first lemma before the recitation.
Hadas & Gil |
|
| Last updated on 4/2/2008, 14:03:33 |
|
|
|
|
|
|
|
|
|
|
|
|
| Back to school | The strike is behind us. We'll meet according to the regular schedule on Wednesday.
Note that the material for lecture 1 can be found under Course Material - Lectures Material. Please print and bring it for your own convenient.
Wishing us all an interesting semester,
Hadas & Gil |
|
| Last updated on 20/1/2008, 18:51:15 |
|
|
|
|
|
|
|
|
|
|
|
|
| Dusting Probability - Solutions to questions | You can find solutions to the questions from Dusting Probability in the Course Material -> Other material section.
Hadas & Gil |
|
| Last updated on 17/11/2007, 17:25:36 |
|
|
|
|
|
|
|
|
|
|
|
|
| Stike | Due to the strike, there will be no lecture or recitation today as well.
Hadas & Gil |
|
| Created on 7/11/2007, 08:11:21 |
|
|
|
|
|
|
|
|
|
|
|
|
| Strike | Due to the strike, there will be no lecture or recitation today.
|
|
| Created on 31/10/2007, 11:46:22 |
|
|
|
|
|
|
|
|
|
|
|
|
| Strike issues |
In case the strike will continue tomorrow, there will be no lecture and no recitation.
|
|
| Created on 23/10/2007, 16:07:31 |
|
|
|
|
|
|
|
|
|
|
|
|
| Welcome to Methods in The Analysis of Algorithms |
Please make time and read the syllabus which contains information regrading the grading policy of our course, among other things.
Regrading the strike - the first lecture will be held as usual unless we will publish otherwise. Do check the site from time to time in order to stay updated.
Under the Course Material -> Lectures Material you can find a one page document containing algorithms and figures we will use on the first lecture. Please bring a printed copy of that page to the first lecture in order for us to save time.
A document called "Dusting Probability" is placed under Course Material -> Other Material. This document, as it's name suggest, will remind you of some principles we will use from the Theory of Probability. We tried to write this document as interesting as possible. Please find time and read it before the third recitation.
We wish you all enjoy the course,
Hadas & Gil
|
|
| Last updated on 21/10/2007, 23:49:34 |
|
|
|
|
|
|
Technion - Israel Institute of Technology 
