Computer Science Thesis Proposal December 5, 2023 1:30pm — 3:00pm Location: In Person - Newell-Simon Hall 4305 Speaker: PRANEETH KACHAM , Ph.D. Student, Computer Science Department, Carnegie Mellon University https://www.praneethkacham.com/ On Efficient Sketching Algorithms Sketching has become a very effective tool to efficiently extract useful information from very large inputs which are presented to an algorithm in various forms such as a turnstile stream or when the data is partitioned arbitrarily among multiple servers. In this proposal, we describe the main paradigms of computation with large datasets and how we obtain new efficient algorithms for a large variety of problems using sketch-based techniques. Thesis Committee: David Woodruff (Chair) Pravesh Kothari Richard Peng Rasmus Pagh (University of Copenhagen) Add event to Google Add event to iCal
