{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/119599"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/119599","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Sparse approximations, iterative methods, and faster algorithms for matrices and graphs","abstract":"This thesis aims to advance our algorithmic understanding of some of the most fundamental objects in computer science: graphs and matrices. Specifically, on one hand, we develop a broad set of sampling techniques that yield better (sparser) approximations of these objects and do so more efficiently. On the other hand, we provide faster algorithms for a host of core problems in numerical linear algebra and graph algorithms. The resulting insights often lead to first in decades progress on the studied problems.","abstract_html":"This thesis aims to advance our algorithmic understanding of some of the most fundamental objects in computer science: graphs and matrices. Specifically, on one hand, we develop a broad set of sampling techniques that yield better (sparser) approximations of these objects and do so more efficiently. On the other hand, we provide faster algorithms for a host of core problems in numerical linear algebra and graph algorithms. The resulting insights often lead to first in decades progress on the studied problems.","abstract_has_math":false,"creators":["Cohen, Michael Benjamin"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Aleksander Ma̧dry"],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018","date_published":"2018","updated_at":"2026-07-22T22:20:51Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/119599","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Aleksander Ma̧dry"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Cohen, Michael Benjamin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-12-11T21:07:58Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-12-11T21:07:58Z"]},{"key":"dc:date.issued","label":"Date","values":["2018"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/119599"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 435-460)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis aims to advance our algorithmic understanding of some of the most fundamental objects in computer science: graphs and matrices. Specifically, on one hand, we develop a broad set of sampling techniques that yield better (sparser) approximations of these objects and do so more efficiently. On the other hand, we provide faster algorithms for a host of core problems in numerical linear algebra and graph algorithms. The resulting insights often lead to first in decades progress on the studied problems."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Sparse approximations, iterative methods, and faster algorithms for matrices and graphs"]}]}],"canonical_facts":{"dc:contributor.advisor":["Aleksander Ma̧dry"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Cohen, Michael Benjamin"],"dc:date.accessioned":["2018-12-11T21:07:58Z"],"dc:date.available":["2018-12-11T21:07:58Z"],"dc:date.issued":["2018"],"dc:description":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 435-460)."],"dc:description.abstract":["This thesis aims to advance our algorithmic understanding of some of the most fundamental objects in computer science: graphs and matrices. Specifically, on one hand, we develop a broad set of sampling techniques that yield better (sparser) approximations of these objects and do so more efficiently. On the other hand, we provide faster algorithms for a host of core problems in numerical linear algebra and graph algorithms. The resulting insights often lead to first in decades progress on the studied problems."],"dc:description.degree":["Ph. D."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/119599"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Sparse approximations, iterative methods, and faster algorithms for matrices and graphs"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:20:51Z"}