The MIT Libraries is completing a major upgrade to DSpace@MIT. Starting May 5 2026, DSpace will remain functional, viewable, searchable, and downloadable, however, you will not be able to edit existing collections or add new material. We are aiming to have full functionality restored by May 18, 2026 but intermittent service interruptions may occur. Please email dspace-lib@mit.edu
with any questions. Thank you for your patience as we implement this important upgrade.
LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 58-60 of 486
-
On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor
(1998-01)We show that computing the approximate length of the shortest vector in a lattice within a factor c is NP-hard for randomized reductions for any constant c < ? (2). -
Space - Time Scheduling of Instruction-Level Parallelism on a Raw Machine
(1997-12)Advances in VLSI technology will enable chips with over a billion transistors within the next decade. Unfortunately, the centralized-resource architectures of modern microprocessors are ill-suited to exploit such advances. ... -
Specifying and Using a Partitionable Group Communication Service*
(1997-08)A new, simple formal specification is presented for a partitionable view-oriented group communication service. The specification consists of a state machine to express safety requirements and a timed trace property to ...
