MIT Open Access Articles

The MIT Open Access Articles collection consists of scholarly articles written by MIT-affiliated authors that are made available through DSpace@MIT under the MIT Faculty Open Access Policy, or under related publisher agreements. Articles in this collection generally reflect changes made during peer-review.

Version details are supplied for each paper in the collection:

  • Original manuscript: author's manuscript prior to formal peer review
  • Author's final manuscript: final author's manuscript post peer review, without publisher's formatting or copy editing
  • Final published version: final published article, as it appeared in a journal, conference proceedings, or other formally published context (this version appears here only if allowable under publisher's policy)

Some peer-reviewed scholarly articles are available through other DSpace@MIT collections, such as those for departments, labs, and centers.

If you are an MIT community member who wants to deposit an article into the this collection, you will need to log in to do so. If you don't have an account, please contact us.

More information:

Recent Submissions

  • Constant Degree Networks for Almost-Everywhere Reliable Transmission 

    Bafna, Mitali; Minzer, Dor (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
    In the almost-everywhere reliable message transmission problem, introduced by [Dwork, Pippenger, Peleg, Upfal’86], the goal is to design a sparse communication network G that supports efficient, fault-tolerant protocols ...

  • Quasi-Linear Size PCPs with Small Soundness from HDX 

    Bafna, Mitali; Minzer, Dor; Vyas, Nikhil; Yun, Zhiwei (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
    We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur’s 2-query quasi-linear size PCPs with soundness 1 − Ω(1). As an immediate ...

  • Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time 

    Eden, Talya; Levi, Reut; Ron, Dana; Rubinfeld, Ronitt (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
    Counting small subgraphs, referred to as motifs, in large graphs is a fundamental task in graph analysis, extensively studied across various contexts and computational models. In the sublinear-time regime, the relaxed ...

View more