- CS 601/IITB Randomizd algorithm for 3 SAT Abhiram Ranade Input: 3-CNF formula. n variables.
- Scheduling Light-trails on WDM Rings Soumitra Pal and Abhiram Ranade
- 100 marks CS 408 Endsem 9:30-12:30, 23/4/10 Problem 1:(a)[20 marks] Consider the Butter y network on 2n rows and n+1 columns. Show that
- 50 marks CS 408 Quiz 1 8:00-9:25, 28/1/11 A brief explanation is always expected, even for yes/no questions.
- 50 marks CS 601 Quiz 1 8:15-9:25, 18/8/10 You have about one minute per mark. Keep this in mind while deciding how long you need to
- CS 601/IITB Global Min Cut Abhiram Ranade How easy is it to disconnect a network? This problem is formalized as the min-cut
- Scheduling Loosely Connected Task Graphs Abhiram G. Ranade
- 125 marks CS 601 Endsemester Test 9:30-12:30, 22/11/9 Problem 1:[20 marks] We have n positions p 1 ; : : : ; p n and m applicants a 1 ; : : : ; am . For each
- Some uses of spectral methods Abhiram G. Ranade
- N/2 Input Benes Network N/2 Input Benes Network
- An Improved Maximum Likelihood Formulation for Accurate Genome Assembly Aditya Varma, Abhiram Ranade and Srinivas Aluru
- Precedence Constrained Scheduling in 3p+1) Optimal
- How to balance the Govardhan Abhiram Ranade
- Report Writing (Get excited!)
- 50 marks CS 601 Quiz 1 8:30-9:30, 26/8/9 You have about one minute per mark. Keep this in mind while deciding how long you need to
- 100 marks CS 601 Midsemester Test 2:00-4:00, 18/9/10 You may reduce from any NP-hard problems that we have studied, e.g. Circuit-SAT, Inde-
- CS 601/IITB p-center problem Abhiram Ranade Input: n n matrix D giving distances between n points c1; : : : ; cn. The distances form a
- CS 601/IITB Greedy algorithm for Set cover Abhiram Ranade Input: Collection C of sets S1;
- CS 601/IITB Uncapacitated Facility Location Abhiram Ranade Input: n n matrix D giving distances between n points C = fc1; : : : ; cng. The
- Foundations of Parallel Computation Abhiram Ranade
- CS 408 The Multibutter y Network Abhiram Ranade e hve een onsidering the prolem of designing non-blocking netE
- CS 408 Embeddings and MIS Abhiram Ranade In this lecture we will see another application of graph embedding. We
- CS 408 Tree Decomposition Abhiram Ranade We will see a dierent kind of embedding into trees, called tree decom-
- CS 408 Planar Graphs Abhiram Ranade A graph is planar if it can be drawn in the plane without edges cross-
- CS 408 Genome Assembly Abhiram Ranade Every organism has a genome in its cell nucleus which encodes the features
- 50 marks CS 408 Quiz 2 3:30-5:00, 22/3/11 Problem 1:[20 marks] Consider a processor scheduling problem as follows. We are given P [1
- CS 408 Spectral Graph Theory Abhiram Ranade e often think of grphs geometrillyD iFeF we see verties s points on
- 50 marks CS 408 Makeup Quiz 8:30-9:25, 18/4/11 Solve any 2 from the rst 3 problems. Problem 4 is compulsory.
- CS 408 The Probabilistic Method Abhiram Ranade We have already seen a proof of the existence of splitter graphs that uses
- CS 408 Edmonds Karp Max ow Abhiram Ranade The algorithm is as follows
- CS 408 Tutte's Theorem Abhiram Ranade For a graph G let o(G) denote the number of components with an odd
- CS 408 Page Rank Abhiram Ranade An important question for search engines is to determine which pages
- CS 408 Walks on undirected graphs Abhiram Ranade vet G a @V;EA e n undireted onneted grphF fy random walk
- 50 marks CS 408 Quiz 2 8:30-9:30, 23/3/10 Problem 1:[20 marks] A company needs to allocate its employees for the projects it is to execute.
- Hypercubes,Product Graphs CS 408/Abhiram Ranade There are various ways to de ne a hypercube. Here is one. The hypercube
- A Variation on SVD Based Image Compression Abhiram Ranade Srikanth S. M.
- 100 marks CS 408 Midsem 9:30-11:30, 16/2/10 Problem 1: Suppose the 2 2n node hypercube Q 2n
- 100 marks CS 601 Midsemester Test 16:30-18:30, 14/9/9 Problem 1: A graph is said to be d-regular if every vertex has degree d. Consider a d regular
- Abstractions and Paradigms for Programming Abhiram Ranade
- 50 marks CS 408 Quiz 1 9:30-10:30, 28/1/10 Write your roll number on the question paper, write on it the answer to problem 1, and submit it
- CS 408 Mat. Mult. and graphs Abhiram Ranade Let A be an n n matrix, and x an n 1 vector. Then it is useful to
- CS 408 The Geometry of Graphs Abhiram Ranade e usully think of grph visullyD iFeF we see verties s points on
- CS 408 Bisection Lower Bound Abhiram Ranade Finding the bisection width of a graph is NP-complete. But for nice graphs
- CS 408 Page Rank Abhiram Ranade An internet search engine must perform two tasks: (i) decide which pages
- 60 marks CS 601 Quiz 2 6:00-8:00, 23/10/10 You may reduce from any of the problems we have studied, or any of the problems discussed
- THE DELAY SEQUENCE ARGUMENT Abhiram Ranade
- Simulator for Railway Line Capacity Planning Rangaraj, N. , Ranade, A., Moudgalya, K.,
- 100 marks CS 408 Midsem 5:30-7:30, 26/2/11 Problem 1:[15 marks] Let be any permutation from f0;
- I/O-Complexity of Graph Algorithms M. V. Kameshwar Abhiram Ranade
- Devanagari Penwritten Character Recognition
- CS 408 The Multibutter y Network Abhiram Ranade We have been considering the problem of designing a non-blocking net-
- Mumbai Navigator Abhiram Ranade M. Srikrishna y K. Tilak M. Datar
- Register Efficient Mergesorting Abhiram Ranade1, Sonal Kothari2, and Raghavendra Udupa3
- CS 408 Matching in General graphs Abhiram Ranade Input: Undirected unweighted Graph G.
- CS 601/IITB Multicut on Trees Abhiram Ranade First the general problem
- 1. Suppose a complete binary tree on n vertices is embedded in Pn, the path with n vertices with load 1. Show that the dilation must be