MIT Open Access Articles: Recent submissions

Now showing items 43-45 of 55160

    • Concurrent Balanced Augmented Trees 

      Wrench, Evan; Singh, Ajay; Roh, Younghun; Fatourou, Panagiota; Jayanti, Siddhartha; e.a. (ACM|Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2026-01-28)
      Augmentation makes search trees tremendously more versatile, allowing them to support efficient aggregation queries, order-statistic queries, and range queries in addition to insertion, deletion, and lookup. In this paper, ...

    • Building Intelligent Agents with Neuro-Symbolic Concepts 

      Mao, Jiayuan; Tenenbaum, Joshua; Wu, Jiajun (ACM|Communications of the ACM, 2026-01-28)
      This article presents a concept-centric paradigm for building agents that can learn continually and reason flexibly. The concept-centric agent utilizes a vocabulary of neuro-symbolic concepts. These concepts, such as object, ...

    • Foundational Verification of Running-Time Bounds for Interactive Programs 

      Tockman, Andy; Singh, Pratap; Erbsen, Andres; Gruetter, Samuel; Chlipala, Adam (ACM|Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2026-01-08)
      Some important domains of software demand concrete bounds on how long functions may run, for instance for real-time cyberphysical systems where missed deadlines may damage industrial machinery. Such programs may interact ...