Amartya Shankha Biswas
Professor · MIT
Amartya Shankha Biswas is a professor at MIT working on graph algorithms, graph theory and data compression.
About
Amartya Shankha Biswas is a professor at MIT working on graph algorithms, graph theory and data compression. Biswas's recitations for MIT 6.046J, an upper-level undergraduate course, prove greedy exchange arguments for scheduling and derive the Christofides bound for the metric traveling salesman problem.
Taught with
Same subject, Algorithms & Theoretical CS
Connections
5Their places, courses, books and lectures.

