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

  • Regulating Wait-Driven Requests in Queues 

    Freund, Daniel; Hausman, David; Weng, Wentao (ACM|The 26th ACM Conference on Economics and Computation, 2025-07-02)
    The study of rational queueing has a long and distinguished history focused on individuals' preference to avoid waiting. Surprisingly, there are settings in which some potential arrivals (which we also refer to as requests) ...

  • DeepSeek Inside: Origins, Technology, and Impact 

    Cusumano, Michael (ACM|Communications of the ACM, 2025-06-18)
    The release of DeepSeek V3 and R1 in January 2025 caused steep declines in the stock prices of companies that provide generative artificial intelligence (GenAI) infrastructure technology and datacenter services. These two ...

  • Density-Dependent Graph Orientation and Coloring in Scalable MPC 

    Ghaffari, Mohsen; Grunau, Christoph (ACM|ACM Symposium on Principles of Distributed Computing, 2025-06-13)
    This paper presents massively parallel computation (MPC) algorithms in the strongly sublinear memory regime (aka, scalable MPC) for orienting and coloring graphs as a function of its subgraph density. Our algorithms run ...

View more