II - Computer Science (Theory)

SHARE:
  • Cited for his work developing the RSA algorithm, a method for public-key cryptography, Ronald Rivest is named to the National Cyber Security Hall of Fame, Oct. 17, 2012.
  • This fall, the faculty and students in the Electrical Engineering and Computer Science (EECS) Department at MIT are coming together for a new program that has created a buzz since its announcement last spring. The Advanced Undergraduate Research Program — now officially called the SuperUROP — for EECS department juniors and seniors has already enticed over 200 students with more than 100 exciting research projects proposed by the department's faculty. Read more!
  • We study several natural problems in which an {\em unknown} distribution over an {\em unknown} population of vectors needs to be recovered from partial or noisy samples. Such problems naturally arise in a variety of contexts in learning, clustering, statistics, data mining and database privacy, where loss and error may be introduced by nature, inaccurate measurements, or on purpose.
  • Applying random linear projections, a.k.a. "sketching", has become a standard technique when analyzing high-dimensional data sets. The resulting algorithms are embarrassingly parallelizable and suitable for stream processing.
  • In his seminal paper, Myerson [1981] provides a revenue-optimal auction for a seller who is looking to sell a single item to multiple bidders. Extending this auction to simultaneously selling multiple heterogeneous items has been one of the central problems in Mathematical Economics. We provide such an extension that is also computationally efficient.
  • We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric.

Pages

Subscribe to II - Computer Science (Theory)