BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI
INSTRUCTION DIVISION
Course Handout (Part II)
First Semester 2014-15
Date: 31 July 2014
In addition to part I (General Handout for all courses appended to the time table) this
portion gives further specifi

Analysis of Algorithms
CS 477/677
Randomizing Quicksort
Instructor: George Bebis
(Appendix C.2 , Appendix C.3)
(Chapter 5, Chapter 7)
Randomizing Quicksort
Randomly permute the elements of the input
array before sorting
OR . modify the PARTITION procedu

Using Dual Approximation Algorithms for Scheduling
Problems: Theoretical and Practical Results
DORIT S. HOCHBAUM
University
of California,
Berkeley, Calijornia
AND
DAVID
B. SHMOYS
Mussuchasetts Institute of Technology, Cambridge,
Massachusetts
Abstract. T

Randomized algorithms
1
Overview
What are randomized algorithms?
A randomized algorithm is one that employs randomization (usually done using a random
number generator) in one or more intermediate steps of the algorithm.
Although the terms are sometimes

724
Chapter 13 Randomized Algorithms
buy n more boxes of cereal before you see the nal type. In the meantime, you
keep getting coupons youve already seen before, and you might conclude that
this nal type is the rare one. But in fact its just as likely as

Annals of Mathematics
PRIMES Is in P
Author(s): Manindra Agrawal, Neeraj Kayal and Nitin Saxena
Source: Annals of Mathematics, Second Series, Vol. 160, No. 2 (Sep., 2004), pp. 781-793
Published by: Annals of Mathematics
Stable URL: http:/www.jstor.org/sta

Downloaded 10/06/15 to 202.78.175.199. Redistribution subject to SIAM license or copyright; see http:/www.siam.org/journals/ojsa.php
SIAM J. COMPUT.
Vol. 26, No. 5, pp. 14841509, October 1997
c 1997 Society for Industrial and Applied Mathematics
009
POLYN

c 2013 Society for Industrial and Applied Mathematics
Downloaded 10/06/15 to 202.78.175.199. Redistribution subject to SIAM license or copyright; see http:/www.siam.org/journals/ojsa.php
SIAM J. COMPUT.
Vol. 42, No. 2, pp. 685699
FAST INTEGER MULTIPLICATI

APPROXIMATION ALGORITHMS
FOR COMBINATORIAL
PROBLEMS
David S. Johnson
Massachusetts Institute of Technology
BIN-PACKING:
Given a finite list of numbers
between 0 and I and a sequence of unit-capaclty
bins, find a packing of the numbers into the bins
such t

Analysis of running time of Randomized Quicksort
Analysis of running time of Randomized Quicksort
Quicksort
Recall :
In quicksort a pivot value is chosen and elements of the array
are rearranged so that all elements to the left of the pivot are
pivot ele

See discussions, stats, and author profiles for this publication at: http:/www.researchgate.net/publication/2662996
Covering Trains by Stations or The Power of Data
Reduction
ARTICLE FEBRUARY 1998
Source: CiteSeer
CITATIONS
DOWNLOADS
VIEWS
58
28
60
1 AUTH

Birla Institute of Technology and Science-Pilani, Hyderabad and Pilani
Campus
First Semester 2015-2016
Comprehensive Exam
Part-A Closed Book
Course No CS G526
Course Title: Advanced Algorithms and Complexity
Total Time: 3 Hrs Total Marks: 15
Date: 2/12/15

A real world example
A short introduction to parameterized complexity
Anand Narasimhamurthy
Anand Narasimhamurthy
A short introduction to parameterized complexity
A real world example
Introduction
Reference : Niedermeier, R. (2006). Invitation to
Fixed-Pa

Birla Institute of Technology and Science-Pilani
Pilani and Hyderabad Campus
First Semester 2015-2016
Test I
Course No CS G526
Course Title: Advanced Algorithms and Complexity
Type: Open Time: 60 mins Total Marks: 15 Wt. age: 15%
Date: 15/09/14
General In

Birla Institute of Technology and Science-Pilani
Pilani and Hyderabad Campus
First Semester 2015-2016
Test II
Course No CS G526
Course Title: Advanced Algorithms and Complexity
Type: Open Time: 60 mins Total Marks: 15 Wt. age: 15%
Date: 8/11/15
General In

Birla Institute of Technology and Science-Pilani, Hyderabad and Pilani
Campus
First Semester 2015-2016
Comprehensive Exam
Part-B Open Book
Course No CS G526
Course Title: Advanced Algorithms and Complexity
Total Time: 3 Hrs Total Marks: 15
Date: 2/12/15
G

Refresher problems on background material
August 3, 2016
Note : These are not practice problems for test or exam. These are aimed to serve as a refresher of
background material and essential pre requisites.
1
Preliminaries : Asymptotic notation
1. Conside

Birla Institute of Technology and Science, Pilani
Instruction Division
First Semester 2016-2017
Course Handout Part II
Date: 01/08/2016
In addition to the Part-I (General Handout) for all courses appended to the timetable, this portion
gives further speci

Randomized algorithms : specific examples
Randomized algorithms : specific examples
Median finding
Reference book : Algorithm design by Kleinberg and Tardos,
chapter on Randomized Algorithms, pages 727-731 in 2006 edition
Consider finding the median of a

Complexity classes of Las Vegas and Monte Carlo algorithms
Las Vegas and Monte Carlo algorithms and
complexity classes
Las Vegas and Monte Carlo algorithms and complexity classes
Complexity classes of Las Vegas and Monte Carlo algorithms
Distinction betwe

MAX CNF Satisfiability
A few graph related examples
Relaxation based methods with examples
Approximation algorithm specific examples
Approximation algorithm specific examples
MAX CNF Satisfiability
A few graph related examples
Relaxation based methods wit

General overview of NP-complete problems
Specific examples
A short introduction to approximation algorithms
A short introduction to approximation algorithms
General overview of NP-complete problems
Specific examples
NP complete problems
Recall : Formally,

A Randomized Approximation Algorithm for MAX
3-SAT
CS 511
Iowa State University
December 8, 2008
Note. This material is based on Kleinberg & Tardos, Algorithm Design, Chapter 13, Section 4, and associated slides.
CS 511 (Iowa State University)
A Randomize