Till KTH:s startsida Till KTH:s startsida

Lecture 2: Fingerprinting and Hashing

Time: Wednesday 23 September 2015 at 13:00 - 15:00 2015-09-23T13:00:00 2015-09-23T15:00:00

Kungliga Tekniska högskolan
HT 2015 avalg15

Location: M2

Activity: Lecture

Teachers: Danupon Na Nongkai ()

Student groups: TCSCM_1, TIEMM_CSCJ_1, TMAKM_1

Info:

-
Scheduling staff created event 27 February 2015

changed the permissions 30 April 2015

Kan därmed läsas av alla och ändras av lärare.
Teacher Danupon Na Nongkai edited 14 September 2015

FöreläsningLecture 2: Basic Median Finding, Minimum Cut

Main Reading Materials:¶


* Section 1 in Lecture 3 last year
* Chapter 2 in Arora's lecture note

Teacher Danupon Na Nongkai edited 14 September 2015

Lecture 2: Basic Randomized Algorithms - Median Finding, Minimum Cut

Main Reading Materialferences:


* Section 1 in Lecture 3 last year
* Chapter 2Section 2.1 in Arora's lecture note

Teacher Danupon Na Nongkai edited 14 September 2015

Main References:


* Section 1 in Lecture 3 last year
* Section 2.1Chapter 2 in Arora's lecture note

Teacher Danupon Na Nongkai edited 21 September 2015

Lecture 2: BHasic Randomized Algorithms - Median Fhing, Fingerprindting, Minimum Cutand applications

Main References: 


* Section 3.1 in Llecture 3 last yeaby Sinclair
* Chapter 2 1 in Arora's lecture note
Other References: ¶


* Lecture 2 note from DD2440, 2014
* Lecture note by Le Gall
* Lecture note by Peter Bro Miltersen

Teacher Danupon Na Nongkai edited 23 September 2015

Lecture 2: Hashing, Fingerprinting, and applicationsHashing

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing (1 bonus point for type-setting this). 
Other References: ¶


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
Other References: ¶
* Lecture 2 note from DD2440, 2014
* Lecture note by Le Gall
 * Lecture note by Peter Bro Miltersen

Teacher Danupon Na Nongkai edited 26 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing (1 bonus point for type-setting this). 
* Lecture note by Mélanie Sedda
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen

Teacher Danupon Na Nongkai edited 26 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing Lecture 2-2 Hashing.pdf
* Lecture note by Mélanie Sedda
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen

Teacher Danupon Na Nongkai edited 26 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing Lecture 2-2 Hashing.pdf
* Lecture note by Mélanie Sedda
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen

Teacher Danupon Na Nongkai edited 26 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing
* Lecture note by Mélanie Sedda
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen
* Videos on the Prime Number Theorem: By Art of the Problem, By Numberphile

Teacher Danupon Na Nongkai edited 26 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing
* Lecture note by Mélanie Sedda
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen
* Videos on the Prime Number Theorem: By Art of the Problem, By Numberphile

Teacher Danupon Na Nongkai edited 26 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing
* Lecture note by Mélanie Sedda
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Rabin-Karp algorithm can be found in Chapter 32 in the book Introduction to Algorithms.
 * Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen
* Videos on the Prime Number Theorem: By Art of the Problem, By Numberphile

Teacher Danupon Na Nongkai edited 27 September 2015

Main References: 


* Slides on Fingerprinting
* Hand-written notes on hashing (updated: Sep 27, 2015)
* Lecture note by Mélanie Sedda on hashing (partially)
Other References: 


* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Rabin-Karp algorithm can be found in Chapter 32 in the book Introduction to Algorithms.
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen
* Videos on the Prime Number Theorem: By Art of the Problem, By Numberphile

Teacher Danupon Na Nongkai edited 28 September 2015

Main References: ¶
* Slides on Fingerprinting
* Hand-written notes on hashing (updated: Sep 27, 2015)
* Lecture note by Mélanie Sedda on hashing (partially)
Other References: ¶
* Both fingerprinting and hashing can be found in the Lecture note by Le Gall.
* Fingerprinting can be also found in Section 3.1 in lecture by Sinclair
* Hashing can be found in Chapter 1 in Arora's lecture
* Rabin-Karp algorithm can be found in Chapter 32 in the book Introduction to Algorithms.
* Lecture 2 note from DD2440, 2014
* Lecture note by Peter Bro Miltersen
* Videos on the Prime Number Theorem: By Art of the Problem, By Numberphile
-¶

Accessible to the whole world.

Last changed 2015-09-28 15:09

Tags: None so far.