CSAIL Publications and Digital Archive header
bullet Technical Reports bullet Work Products bullet Historical Collections bullet

link to publications.csail.mit.edu link to www.csail.mit.edu horizontal line
   


LCS Technical Memos

Click on the title of the document for more information. Click the column headers to sort by different fields.
Publication Title LCS Document Number Publication Author LCS Group Publication Date
Subcontracted Rational SFEMIT-LCS-TM-653Lepinski, MatthewCryptography and Information Security11-2-2005
MPEG-2 in a Stream Programming LanguageMIT-LCS-TM-652Drake, MatthewComputer Architecture10-22-2005
Exploiting Vector Parallelism in Software Pipelined LoopsMIT-LCS-TM-651Larsen, SamComputer Architecture6-3-2005
File Synchronization with Vector Time PairsMIT-LCS-TM-650Cox, RussParallel and Distributed Operating Systems2-28-2005
Complexity of finding Nash equilibria in 0-1 bimatrix gamesMIT-LCS-TM-648Abbott, TimCryptography and Information Security2-8-2005
The Security Power of the Ballot BoxMIT-LCS-TM-647Lepinski, MattCryptography and Information Security2-2-2005
Versatility and VersaBench: A New Metric and a Benchmark Suite for Flexible ArchitecturesMIT-LCS-TM-646Rabbah, Rodric M.Computer Architecture6-14-2004
Scalar Operand Networks: Design, Implementation, and AnalysisMIT-LCS-TM-645Taylor, Michael BedfordComputer Architecture6-8-2004
Deionizer: A Tool for Capturing and Embedding I/O CellsMIT-LCS-TM-644Taylor, Michael BedfordComputer Architecture6-7-2004
Can Basic ML Techniques Illuminate Rateless Erasure Codes?MIT-LCS-TM-643Gupta, AnjaliParallel and Distributed Operating Systems5-5-2004
A 1020-Node Modular Microphone Array and Beamformer for Intelligent Computing SpacesMIT-LCS-TM-642Weinstein, EugeneComputer Architecture4-14-2004
A Stream Algorithm for the SVDMIT-LCS-TM-641Strumpen, VolkerComputer Architecture10-22-2003
Updatable Zero-Knowledge SetsMIT-LCS-TM-640Liskov, MosesTheory of Computation10-14-2003
Electronic Cash with Blind Deposits: How to Have No Spare ChangeMIT-LCS-TM-639Liskov, MosesTheory of Computation10-14-2003
Execution Model Enforcement Via Program ShepherdingMIT-LCS-TM-638Kiriansky, VladimirComputer Architecture5-20-2003
Scalable Packet Classification Using Bit Vector Aggregating and FoldingMIT-LCS-TM-637Li, JiAdvanced Network Architecture4-17-2003
Stream Algorithms and ArchitectureMIT-LCS-TM-636Henry, HoffmanComputer Architecture3-24-2003
A Theoretical and Practical Approach to Instruction Scheduling on Spatial ArchitecturesMIT-LCS-TM-635S. Mirrokni, VahabComputer Architecture12-13-2002
Meta Optimization: Improving Compiler Heuristics with Machine LearningMIT-LCS-TM-634Stephenson, MarkComputer Architecture12-3-2002
Plain-Text Aware Encryption Via Public-Key RegistrationMIT-LCS-TM-633Micali, SilvioTheory of Computation11-20-2002
pStore: A Secure Peer-to-Peer Backup SystemMIT-LCS-TM-632Batten, ChristopherComputer Architecture10-30-2002
Offline Authentication of Untrusted StorageMIT-LCS-TM-631Clarke, DwaineComputation Structures8-23-2002
A Collision Model for Randomized Routing In Fat-Tree NetworksMIT-LCS-TM-629Strumpen, VolkerComputer Architecture7-15-2002
How to Build Scalable On-Chip ILP Networks for a Decentralized ArchitectureMIT-LCS-TM-628Taylor, MichaelRAW4-17-2000
A Stream Compiler for Communication-Exposed ArchitecturesMIT-LCS-TM-627Gordon, MichaelComputer Architecture3-31-2002
A Note on the Stability Requirements of Adaptive Virtual QueueMIT-LCS-TM-626Katabi, DinaAdvanced Network Architecture2-13-2002
Secure Execution Via Program ShepherdingMIT-LCS-TM-625Kiriansky, VladimirComputer Architecture2-4-2002
Efficient View-Dependent Sampling of Visual HullsMIT-LCS-TM-624Matusik, WojciechComputer Graphics2-1-2002
An Efficient Visual Hull Computation AlgorithmMIT-LCS-TM-623Matusik, WojciechComputer Graphics2-1-2002
StreamIT: A Complier for Streaming ApplicationsMIT-LCS-TM-622Thies, WilliamComputer Architecture2-12-2002
Techniques for Increasing and Detecting Memory AlignmentMIT-LCS-TM-621Larsen, SamuelComputer Architecture11-25-2001
StreaMIT: A Language for Streaming ApplicationsMIT-LCS-TM-620Thies, WilliamComputer Architecture8-6-2001
A Software Framework for Supporting General Purpose Applications on RAW Computation FabricsMIT-LCS-TM-619Frank, MatthewComputer Architecture7-20-2001
Persona: A Contextualized and Personalized Web SearchMIT-LCS-TM-618Mui, LikClinical Decision Making5-1-2001
Ratings in Distributed Systems: A Bayesian ApproachMIT-LCS-TM-617Mui, LikClinical Decision Making5-1-2001
Three Round Zero-Knowledge Using a Proof of Knowledge AssumptionMIT-LCS-TM-616Lepinski, MatthewCryptography and Information Security4-20-2001
Mutually Independent CommitmentMIT-LCS-TM-615Liskov, MosesTheory of Computation4-9-2001
Forward-Secure Signatures with Optimal Signing and VerifyingMIT-LCS-TM-614Itkis, GeneCryptography and Information Security4-9-2001
A Unified Framework for Schedule and Storage OptimizationMIT-LCS-TM-613Thies, William F.Computer Architecture11-17-2000
Availability Study of Dynamic Voting AlgorithmsMIT-LCS-TM-611Ingols, KyleTheory of Computation11-1-2000
A General Framework for Highly Available Services based on Group CommunicationMIT-LCS-TM-610Fekete, AlanTheory of Computation11-1-2000
Concurrent/Resettable Zero-Knowledge Protocols for NP in the Public Key ModelMIT-LCS-TM-609Micali, SilvioTheory of Computation8-14-2000
A New Self-Play Experiment in Computer ChessMIT-LCS-TM-608Heinz, ErnstSupercomputing Technologies5-20-2000
Systematic Testing of Multithreaded ProgramsMIT-LCS-TM-607Bruening, D.Computer Architecture5-2-2000
Softspec: Software-based Speculative ParallelismMIT-LCS-TM-606Bruering, DerekComputer Architecture4-17-2000
Proving Correctness of a Distributed Shared Memory ImplementationMIT-LCS-TM-603Castro, M.Programming Methodology1-4-1999
Bitwidth Analysis with Application to Silicon CompilationMIT-LCS-TM-602Stephenson, MarkComputer Architecture11-12-1999
Exploiting Superword Level Parallelism with Multimedia Instruction SetsMIT-LCS-TM-601Larsen, SamuelComputer Architecture11-18-1999
Strength Reduction of Integer Division and Modulo OperationsMIT-LCS-TM-600Amarasinghe, SamanComputer Architecture11-1-1999
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication AlgorithmMIT-LCS-TM-597Castro, MiguelProgramming Methodology6-1-1999
MASC: A User-Embeddable Hardware Platform and Infrastructure for Information AppliancesMIT-LCS-TM-596Chatterjee, SandeepClinical Decision Making3-9-1999
Authenticated Byzantine Fault Tolerance Without Public-Key CryptographyMIT-LCS-TM-595Castro, MiguelProgramming Methodology6-1-1999
Can Statistical Zero-Knowledge Be Made Non-Interactive? or On the Relationship of SZK and NISZKMIT-LCS-TM-594Goldreich, OdedTheory of Computation2-1-1999
A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANsMIT-LCS-TM-593Keidar, IditTheory of Computation6-1-1999
NAIVE - Network Aware Internet Video EncodingMIT-LCS-TM-591Briceno, HectorComputer Graphics4-22-1999
Dynamic Load Balancing with Group CommunicationMIT-LCS-TM-588Dolev, ShlomiTheory of Computation10-19-1999
Complexity Results for Single Machine Distance Constrained Scheduling ProblemsMIT-LCS-TM-587Engels, Daniel W.Clinical Decision Making11-1-1998
Extracting all the Randomness from a Weakly Random SourceMIT-LCS-TM-585Vadhan, SalilTheory of Computation8-1-1998
Local Rules Modeling of Nucleation-Limited Virus Capsid AssemblyMIT-LCS-TM-584Schwartz, RussellTheory of Computation8-1-1998
Maps: a Compiler-Managed Memory System for RAW MachinesMIT-LCS-TM-583Barua, RajeevComputer Architecture7-1-1998
Indolent Closure CreationMIT-LCS-TM-580Strumpen, VolkerScientific Computing6-1-1998
A Concrete Construction Of Computationally-Sound CheckersMIT-LCS-TM-579Halevi, SNo Group Specified5-1-1998
More on Proofs of KnowledgeMIT-LCS-TM-578Micali, SilvioTheory of Computation5-1-1998
Computationally Sound ProofsMIT-LCS-TM-577Micali, SilvioTheory of Computation5-1-1998
Proving Correctness of a Controller Algorithm for the RAID Level 5 SystemMIT-LCS-TM-576Vaziri, MandanaTheory of Computation5-1-1998
Signing with Partially Adversarial HashingMIT-LCS-TM-575Micali, SilvioTheory of Computation2-1-1998
On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant FactorMIT-LCS-TM-574Micciancio, DanielleNo Group Specified1-1-1998
Space - Time Scheduling of Instruction-Level Parallelism on a Raw MachineMIT-LCS-TM-572Lee, WalterNo Group Specified12-3-1997
Specifying and Using a Partitionable Group Communication Service*MIT-LCS-TM-570Fekete, AlanTheory of Computation8-1-1997
Lazy Reference Counting for Transactional Storage SystemsMIT-LCS-TM-567Castro, MiguelNo Group Specified10-1-1997
The Sensitivity of Communication Mechanisms to Bandwidth and LatencyMIT-LCS-TM-562Barua, RajeevNo Group Specified12-1-1996
Matching and Pose Refinement with Camera Pose EstimatesMIT-LCS-TM-561Coorg, SatyanNo Group Specified1-12-1996
Light TrapsMIT-LCS-TM-560Dawson, R.J. Macg.No Group Specified10-1-1996
Protein Folding in the Generalized Hydrophobic-Polar Model on the Triangular LatticeMIT-LCS-TM-559Decatur, Scott E.No Group Specified5-1-1996
A Survey of Active Network ResearchMIT-LCS-TM-557Tennenhouse, DavidSoftware Devices and Systems9-1-1996
UDM: User Direct Messaging for General-Purpose MultiprocessingMIT-LCS-TM-556Mackenzie, KennethComputer Architecture3-1-1996
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study*MIT-LCS-TM-555Pogosyants, AnnaTheory of Computation6-1-1997
An Oblivious Data Structure and its Applications to CryptographyMIT-LCS-TM-554Micciancio, DanieleTheory of Computation6-1-1996
Parameterized Types and JavaMIT-LCS-TM-553Bank, Joseph A.Programming Methodology5-1-1996
Conservative Radiance Interpolants for Ray TracingMIT-LCS-TM-549Teller, SethComputer Graphics4-1-1996
Cilk: An Efficient Multithreaded Runtime SystemMIT-LCS-TM-548Blumofe, Robert D.Scientific Computing1-1-1996
A Brief Overview of the GSM Radio InterfaceMIT-LCS-TM-547Turletti, ThierrySoftware Devices and Systems3-1-1996
A Spacially and Temporally Coherent Object Space Visibility AlgorithmMIT-LCS-TM-546Coorg, SatyanSemantics2-1-1996
Modelling and Verification of Automated Transit Systems, Using Timed Automata, Invariants and SimulationsMIT-LCS-TM-545Lynch, NancyTheory of Computation12-1-1995
Hybrid I/O AutomataMIT-LCS-TM-544Lynch, NancyTheory of Computation12-1-1995
Efficient Certificate Revocation SystemMIT-LCS-TM-542Micali, SilvioTheory of Computation3-22-1996
Symmetric Alternation Captures BPPMIT-LCS-TM-541Russell, AlexanderTheory of Computation11-1-1995
Temporally Coherent Conservative VisibilityMIT-LCS-TM-540Coorg, SatvanSemantics11-1-1995
Guaranteed Partial Key-EscrowMIT-LCS-TM-537Micali, SilvioTheory of Computation8-1-1995
On the Redundancy Achieved by Huffman CodesMIT-LCS-TM-536De Prisco, RobertoTheory of Computation9-1-1995
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed GraphsMIT-LCS-TM-535Bender, Michael A.Theory of Computation9-1-1995
What are Principal Typings and What are They Good For?MIT-LCS-TM-532Jim, TrevorTheory of Computation8-1-1995
Rank 2 Type Systems and Recursive Definitions*MIT-LCS-TM-531Jim, TrevorTheory of Computation8-1-1995
Charge-Based Proportional SchedulingMIT-LCS-TM-529Maheshwari, UmeshProgramming Methodology5-1-1996
Stride Scheduling: Deterministic Proportional- Share Resource ManagementMIT-LCS-TM-528Waldspurger, Carl A.No Group Specified6-1-1995
Local Rule Switching Mechanism for Viral Shell GeometryMIT-LCS-TM-527Berger, BonnieTheory of Computation6-1-1995
'C: A Language for High-Level, Efficient, and Machine-independant Dynamic Code GenerationMIT-LCS-TM-526Engler, Dawson R.No Group Specified1-1-0
Algorithms for Modeling and Measuring ProteinsMIT-LCS-TM-525Slonim, Donna K.Theory of Computation6-1-1995
A Case Study of Shared Memory and Message Passing: The Triangle PuzzleMIT-LCS-TM-524Lew, KevinParallel and Distributed Operating Systems1-1-1995
Virtual Infrastructure:Putting Information Infrastructure on the Technology CurveMIT-LCS-TM-523Tennenhouse, DavidSoftware Devices and Systems3-1-1995
Communication-Minimal Partitioning of Parallel Loops and Data Arrays for Cache-Coherent Distributed -Memory MultiprocessMIT-LCS-TM-522Barua, RajeevComputer Architecture1-1-1995
Addressing Partitioned Arrays in Distributed Memory Multiprocessors - the Software Virtual Memory ApproachMIT-LCS-TM-521Baura, RajeevComputer Architecture12-1-1994
Symmetric Alteration Captures BPPMIT-LCS-TM-520Russell, AlexanderTheory of Computation11-14-1995
On the Mathematics of Virus Shell AssemblyMIT-LCS-TM-519Berger, BonnieTheory of Computation7-15-1994
Implementing Sequentially Consistant Shared Objects using Broadcast and Point-To-Point CommunicationsMIT-LCS-TM-518Feteke, AlanParallel and Distributed Operating Systems6-1-1995
CRL: High - Performance All-Software Distributed Shared Memory*MIT-LCS-TM-517Johnson, Kirk L.Computer Architecture3-1-1995
Piecemeal Graph Exploration by a Mobile Robot*MIT-LCS-TM-516Awerbuch, BaruchTheory of Computation1-1-1995
USING NON-INTERACTIVE PROOFS TO ACHIEVE INDEPENDENCE EFFICIENTLY AND SECURELYMIT-LCS-TM-515Gennaro, RosarioTheory of Computation11-4-1994
THE USE OF THE DOMAIN NAME SYSTEM FOR DYNAMIC REFERENCES IN AN ONLINE LIBRARYMIT-LCS-TM-513Alavi, AliNo Group Specified5-16-1994
HOW CAN WE COMPUTE WITH ARRAYS OF NANOSTRUCTURES?MIT-LCS-TM-512Biafore, MichaelNo Group Specified8-3-1994
THE GENERALIZED RAILROAD CROSSING: A CASE STUDY IN FORMALl VERIFICATION OF REAL-TIME SYSTEMMIT-LCS-TM-511Heitmeyer, ConstanceTheory of Computation11-1-1994
CS PROOFSMIT-LCS-TM-510Micali, SilvioTheory of Computation6-1-1994
AN EFFICIENT IMPLEMENTATION OF A HIERARCHICAL WEIGHTED FAIR QUEUE PACKET SCHEDULERMIT-LCS-TM-509Ndiaye, OumarAdvanced Network Architecture5-1-1994
APPLICATION OF MINIMAL PERFECT HASHING IN MAIN MEMORY INDEXINGMIT-LCS-TM-508Ho, YukNo Group Specified5-1-1994
HYBRID CACHING FOR SCALABLE OBJECT SYSTEMS (THINK GLOBALLY, ACT LOCALLY)MIT-LCS-TM-507O'Toole, JamesProgramming Methodology4-1-1994
OPPORTUNISTIC LOG: EFFICIENT INSTALLATION READS IN A RELIABLE OBJECT SERVERMIT-LCS-TM-506O'Toole, JamesProgramming Methodology4-1-1994
COORDINATED RESOURCE MANAGEMENT IN A REPLICATED OBJECTED SERVERMIT-LCS-TM-505Ghemawat, SanjayProgramming Methodology2-1-1994
OPTIMAL CLOCK SYNCHRONIZATION UNDER DIFFERENT DELAY ASSUMPTIONSMIT-LCS-TM-504Attiya, HagitTheory of Computation4-1-1994
FUGU: IMPLEMENTING TRANSLATION AND PROTECTION IN A MULTIUSER, MULTIMODEL MULTIPROCESSORMIT-LCS-TM-503Mackenzie, KennethComputer Architecture10-24-1994
VERIFIABLE SECRET SHARING AS SECURE COMPUTATIONMIT-LCS-TM-502Gennaro, RosarioTheory of Computation3-1-1994
A SECURE AND EFFICIENT DIGITAL SIGNATURE ALGORITHMMIT-LCS-TM-501Micali, SilvioTheory of Computation4-1-1994
PAC-LEARNING PROLOG CLAUSES WITH OR WITHOUT ERRORSMIT-LCS-TM-500Gennaro, RosarioTheory of Computation2-1-1994
A COMPARISON OF SIMULATION TECHNIQUES AND ALGEBRAIC TECHNIQUES FOR VERIFYING CONCURRENT SYSTEMSMIT-LCS-TM-499Lynch, NancyTheory of Computation11-1-1993
ANATOMY OF A MESSAGE IN THE ALEWIFE MULTIPROCESSORMIT-LCS-TM-498Kubiatowicz, J.No Group Specified2-1-1993
ANALYZING MULTIPROCESSOR CACHE BEHAVIOR THROUGH DATA REFERENCE MODELINGMIT-LCS-TM-497Tsai, JoryNo Group Specified2-1-1993
SIMULATION TECHNIQUES FOR PROVING PROPERTIES OF REAL-TIME SYSTEMSMIT-LCS-TM-494Lynch, NancyNo Group Specified11-1-1993
SOFTWARE-EXTENDED COHERENT SHARED MEMORY: PERFORMANCE AND COSTMIT-LCS-TM-493Chaiken, DavidNo Group Specified10-1-1993
THE RELATIVIZED RELATIONSHIP BETWEEN PROBABILISTICALLY CHECKABLE DEBATE SYSTEMS, IP, AND PSPACEMIT-LCS-TM-492Russell, AlexanderNo Group Specified9-1-1993
VIRTUAL WIRES: OVERCOMING PIN LIMITATIONS IN FPGA-BASED LOGIC EMULATORSMIT-LCS-TM-491Babb, JonathanNo Group Specified11-1-1992
COMPILE-TIME LOOP SPLITTING FOR DISTRIBUTING MEMORY MULTIPROCESSORSMIT-LCS-TM-490Tanguay Jr., DonaldNo Group Specified5-1-1993
COLUMN-ASSOCIATIVE CACHES: A TECHNIQUE FOR REDUCING THE MISS RATE OF DIRECT-MAPPED CACHESMIT-LCS-TM-489Agarwal, AnantNo Group Specified7-1-1992
MODELING MULTIPROGRAMMED CACHESMIT-LCS-TM-488Agarwal, AnantNo Group Specified10-1-1992
FORWARD AND BACKWARD SIMULATIONS PART II: TIMING-BASED SYSTEMSMIT-LCS-TM-487cLynch, NancyTheory of Computation3-1-1993
FORWARD AND BACKWARD SIMULATIONS PART I: UNTIMED SYSTEMS (Replaces TM-486)MIT-LCS-TM-486.bLynch, NancyTheory of Computation3-1-1993
COLUMN-ASSOCIATIVE CACHES: A TECHNIQUE FOR REDUCING THE MISS RATE OF DIRECT- MAPPED CACHESMIT-LCS-TM-484Agarwal, AnantComputer Architecture11-1-1992
FAILSAFE KEY ESCROW SYSTEMS (EXTENDED ABSTRACT)MIT-LCS-TM-483Leighton, TomMathematics and Computation8-1-1994
AUTOMATIC PARTITIONING OF PARALLEL LOOPS FOR CACHE-COHERENT MULTIPROCESSORSMIT-LCS-TM-481Agarwal, AnantNo Group Specified12-1-1992
ACTION TRANSDUCERS AND TIMED AUTOMATAMIT-LCS-TM-480.bLynch, NancyParallel and Distributed Operating Systems11-1-1992
EXPERIENCE WITH FINE-GRAIN SYNCHRONIZATION IN MIMD MACHINES FOR PRECONDITIONED CONJUGATE GRADIENTMIT-LCS-TM-479Yeung, DonaldNo Group Specified10-1-1992
INTEGRATING MESSAGE-PASSING AND SHARED-MEMORY: EARLY EXPERIENCEMIT-LCS-TM-478Kranz, DavidNo Group Specified10-1-1992
HYBRID ATOMICITY FOR NESTED TRANSACTIONSMIT-LCS-TM-476Fekete, AlanNo Group Specified10-1-1992
MORE CHOICES ALLOW MORE FAULTS: SET CONSENSUS PROBLEMS IN TOTALLY ASYNCHRONOUS SYSTEMSMIT-LCS-TM-475Chaudhuri, SomaNo Group Specified9-1-1992
DRIBBLE-BACK REGISTERS: A TECHNIQUE FOR LATENCY TOLERANCE IN MULTIPROCESSORSMIT-LCS-TM-474Soundararajan, VijayaraghavanNo Group Specified6-1-1992
THE INTEGRATION OF THE ORGANIZATION ENGINE AND LIBRARY 2000MIT-LCS-TM-473Weiss, RonNo Group Specified5-1-1992
APPROXIMATING THE MINIMUM-COST MAXIMUM FLOW IS P - COMPLETEMIT-LCS-TM-472Stein, CliffordNo Group Specified6-1-1992
CLOSING THE WINDOW OF VULNERABILITY IN MULTIPHASE MEMORY TRANSACTIONSMIT-LCS-TM-471Kubiatowicz, JohnNo Group Specified6-1-1992
LOW-COST SUPPORT FOR FINE-GRAIN SYNCHRONIZATION IN MULTIPROCESSORSMIT-LCS-TM-470Kranz, DavidNo Group Specified6-1-1992
COMPILE-TIME TECHNIQUES FOR PROCESSOR ALLOCATION IN MACRO DATAFLOW GRAPHS FOR MULTIPROCESSORSMIT-LCS-TM-469Prasanna, G. N. SrinivasaNo Group Specified6-1-1992
MEMORY ASSIGNMENT FOR MULTIPROCESSOR CACHES THROUGH GRAPH COLORINGMIT-LCS-TM-465Agarwal, AnantNo Group Specified2-1-1992
HIERARCHICAL COMPILATION OF MACRO DATAFLOW GRAPHS FOR MULTIPROCESSORS WITH LOCAL MEMORYMIT-LCS-TM-464Prasanna, G. N. SrinivasaNo Group Specified2-1-1992
THE IMPACT OF COMMUNICATION LOCALITY ON LARGE-SCALE MULTIPROCESSOR PERFORMANCEMIT-LCS-TM-463Johnson, Kirk L.No Group Specified2-1-1992
AN ANALYSIS OF RABIN'S RANDOMIZED MUTUAL EXCLUSION ALGORITHM: PRELIMINARY REPORTMIT-LCS-TM-462Lynch, NancyNo Group Specified12-1-1991
FAST DETERMINISTIC CONSTRUCTIONS OF LOW-DIAMETER NETWORK DECOMPOSITIONSMIT-LCS-TM-460Berger, BonnieNo Group Specified12-1-1991
LINEARIZABLE COUNTING NETWORKSMIT-LCS-TM-459Herlihy, MauriceNo Group Specified11-1-1991
FORWARD AND BACKWARD SIMULATIONS FOR TIMING-BASED SYSTEMSMIT-LCS-TM-458Lynch, NancyNo Group Specified11-1-1991
AN ALGORITHM FOR THE TRAMP STEAMER PROBLEM BASED ON MEAN-WEIGHT CYCLESMIT-LCS-TM-457Ishii, Alexander T.No Group Specified11-1-1991
REPLICATION IN THE HARP FILE SYSTEMMIT-LCS-TM-456Liskov, BarbaraProgramming Methodology8-1-1991
A FAST MULTIPORT MEMORY BASED ON SINGLE-PORT MEMORY CELLSMIT-LCS-TM-455Rivest, RonaldNo Group Specified7-1-1991
THE MIT ALEWIFE MACHINE: A LARGE-SCALE DISTRIBUTED-MEMORY MULTIPROCESSORMIT-LCS-TM-454Agarwal, AnantNo Group Specified6-1-1991
COST-SENSITIVE ANALYSIS OF COMMUNICATION PROTOCOLSMIT-LCS-TM-453Awerbuch, BaruchNo Group Specified6-1-1991
THE COMPLEXITY OF CONTINUOUS OPTIMIZATIONMIT-LCS-TM-452Rogaway, PhillipNo Group Specified6-1-1991
COUNTING NETWORKSMIT-LCS-TM-451Aspnes, JamesNo Group Specified6-1-1991
APRIL: A PROCESSOR ARCHITECTURE FOR MULTIPROCESSINGMIT-LCS-TM-450Agarwal, AnantNo Group Specified6-1-1991
LAZY TASK CREATION: A TECHNIQUE FOR INCREASING THE GRANULARITY OF PARALLEL PROGRAMSMIT-LCS-TM-449Mohr, EricNo Group Specified6-1-1991
LIMITLESS DIRECTORIES: A SCALABLE CACHE COHERENCE SCHEMEMIT-LCS-TM-448Chaiken, DavidNo Group Specified6-1-1991
RELIABLE COMMUNICATION OVER UNRELIABLE CHANNELSMIT-LCS-TM-447Afek, YehudaNo Group Specified9-1-1992
MULTIPROCESSOR ADDRESS TRACING AND PERFORMANCE ANALYSISMIT-LCS-TM-446Kranz, DavidNo Group Specified4-1-1991
AN AUTOIMMUNE MECHANISM FOR AIDS' T4 LYMPHOPENIAMIT-LCS-TM-445Micali, SilvioNo Group Specified4-1-1991
THE COMPLEXITY OF DECISION VERSUS SEARCHMIT-LCS-TM-444Bellare, MihirNo Group Specified4-1-1991
AN AUTOIMMUNE MECHANISM FOR AIDS' T4 LYMPHOPENIAMIT-LCS-TM-443Micali, SilvioNo Group Specified3-1-1991
ARE WAIT-FREE ALGORITHMS FAST?MIT-LCS-TM-442Attiya, HagitNo Group Specified3-1-1991
ON-LINE ALGORITHMS FOR 2-COLORING HYPERGRAPHS VIA CHIP GAMESMIT-LCS-TM-439Aslam, Javed A.No Group Specified12-1-1990
ON THE MASSIVELY PARALLEL SOLUTION OF THE ASSIGNMENT PROBLEMMIT-LCS-TM-438Wein, JoelNo Group Specified12-1-1990
ON-LINE SCHEDULING OF PARALLEL MACHINESMIT-LCS-TM-437Wein, JoelNo Group Specified11-1-1990
BOUNDS ON THE TIME TO REACH AGREEMENT IN THE PRESENCE OF TIMING UNCERTAINTYMIT-LCS-TM-435Attiya, HagitNo Group Specified11-1-1990
THE MD4 MESSAGE DIGEST ALGORITHMMIT-LCS-TM-434Rivest, Ronald L.No Group Specified10-1-1990
RANDOMNESS-EFFICIENT SAMPLING OF ARBITRARY FUNCTIONSMIT-LCS-TM-433Bellare, MihirNo Group Specified7-1-1990
HOW TO SIGN GIVEN ANY TRAPDOOR PERMUTATIONMIT-LCS-TM-432Bellare, MihirNo Group Specified6-1-1990
THE EMERGING THEORY OF AVERAGE-CASE COMPLEXITYMIT-LCS-TM-431Schapire, Robert E.No Group Specified6-1-1990
NON-INTERACTIVE ZERO KNOWLEDGEMIT-LCS-TM-430Blum, ManuelNo Group Specified5-1-1990
ATOMIC SNAPSHOTS OF SHARED MEMORYMIT-LCS-TM-429Afek, YehudaNo Group Specified5-1-1990
THE NEED FOR HEADERS: AN IMPOSSIBILITY RESULT FOR COMMUNICATION OVER UNRELIABLE CHANNELSMIT-LCS-TM-428Fekete, AlanNo Group Specified3-1-1990
MODELLING SHARED STATE IN A SHARED ACTION MODELMIT-LCS-TM-427Goldman, KennethNo Group Specified3-1-1990
NON-OBTRUSIVE SYNCHRONIZERSMIT-LCS-TM-426Awerbuch, BaruchNo Group Specified4-1-1990
AN OPTIMAL ALGORITHM FOR SYNCHRONOUS BYZANTINE AGREEMENT (replaces 425)MIT-LCS-TM-425Feldman, PaulTheory of Computation12-1-1992
WORKSTATION SERVICES AND KERBEROS AUTHENTICATION AT PROJECT ATHENAMIT-LCS-TM-424Davis, DonNo Group Specified3-17-1989
SHARING MEMORY ROBUSTLY IN MESSAGE-PASSING SYSTEMSMIT-LCS-TM-423Attiya, HagitNo Group Specified2-1-1990
MULTIVALUED POSSIBILITIES MAPPINGSMIT-LCS-TM-422Lynch, NancyNo Group Specified8-1-1990
A SERIALIZATION GRAPH CONSTRUCTION FOR NESTED TRANSACTIONSMIT-LCS-TM-421Fekete, AlanNo Group Specified2-1-1990
NOTES ON COMMUNITY INFORMATION SYSTEMSMIT-LCS-TM-419Gifford, David K.No Group Specified12-1-1989
STOCHASTIC AN ANALYSIS OF QUALITATIVE DYNAMICSMIT-LCS-TM-418Doyle, JonNo Group Specified12-1-1989
SYNTHESIS OF EFFICIENT DRINKING PHILOSOPHERS ALGORITHMS (Replaces 417)MIT-LCS-TM-417Welch, Jennifer L.No Group Specified9-1-1992
IMPEDIMENTS TO UNIVERSAL PREFERENCE-BASED DEFAULT THEORIESMIT-LCS-TM-416Doyle, JonNo Group Specified10-1-1989
THE STRENGTH OF WEAK LEARNABILITYMIT-LCS-TM-415Schapire, Robert E.No Group Specified10-1-1989
LEARNING BINARY RELATIONS AND TOTAL ORDERSMIT-LCS-TM-413Goldman, SallyNo Group Specified5-1-1990
USING MAPPINGS TO PROVE TIMING PROPERTIESMIT-LCS-TM-412Lynch, NancyNo Group Specified12-1-1989
ROUTING WITH POLYNOMIAL COMMUNICATION-SPACE TRADEOFFMIT-LCS-TM-411Awerbuch, BaruchNo Group Specified9-1-1989
ONLINE TRACKING OF MOBILE USERSMIT-LCS-TM-410Awerbuch, BaruchNo Group Specified8-1-1989
NUCLEAR FUSION THROUGH DIMENSIONAL CONFINEMENTMIT-LCS-TM-409Smith, Mark A.No Group Specified8-1-1989
PRIORITY ARBITRATION WITH BUSSESMIT-LCS-TM-408Kipnis, ShlomoNo Group Specified10-1-1989
ON THE CORRECTNESS OF ORPHAN MANAGEMENT ALGORITHMSMIT-LCS-TM-406Herlihy, MauriceNo Group Specified8-1-1989
THE COMPLEXITY OF FINITE FUNCTIONSMIT-LCS-TM-405Boppana, Ravi B.No Group Specified8-1-1989
THEORY OF COMPUTATION GROUP RESEARCH SUMMARY JUNE 1988 - JULY 1989MIT-LCS-TM-404TOC, GroupTheory of Computation7-1-1989
TIME BOUNDS FOR REAL-TIME PROCESS CONTROL IN THE PRESENCE OF TIMING UNCERTAINTYMIT-LCS-TM-403Attiya, HagitNo Group Specified7-1-1989
VLSI THEORY AND PARALLEL SUPERCOMPUTINGMIT-LCS-TM-402Leiserson, Charles E.No Group Specified5-1-1989
HIGHLY CONCURRENT LOGICALLY SYNCHRONOUS MULTICASTMIT-LCS-TM-401Goldman, Kenneth J.No Group Specified7-1-1989
AN AUTOMATA-THEORETIC MODEL FOR UNITYMIT-LCS-TM-400Nour, Magda F.No Group Specified6-1-1989
CORRECTNESS PROOFS OF THE PETERSON-FISCHER MUTUAL EXCLUSION ALGORITHM.MIT-LCS-TM-399Colby, Christopher P.No Group Specified6-1-1989
PARALATION VIEWS: ABSTRACTIONS FOR EFFICIENT SCIENTIFIC COMPUTING ON THE CONNECTION MACHINEMIT-LCS-TM-398Goldman, Kenneth J.No Group Specified6-1-1989
TEMPORAL, PROCESSOR, AND SPATIAL LOCALITY IN MULTIPROCESSOR MEMORY REFERENCESMIT-LCS-TM-397Agarwal, AnantNo Group Specified6-1-1989
ADAPTIVE BACKOFF SYNCHRONIZATION TECHNIQUESMIT-LCS-TM-396Agarwal, AnantNo Group Specified6-1-1989
EVALUATING THE PERFORMANCE OF SOFTWARE CACHE COHERENCEMIT-LCS-TM-395Owicki, SusanNo Group Specified6-1-1989
A HUNDRED IMPOSSIBILITY PROOFS FOR DISTRIBUTED COMPUTINGMIT-LCS-TM-394Lynch, NancyNo Group Specified8-1-1989
BOUNDED CONCURRENT TIME-STAMP SYSTEMS ARE CONSTRUCTIBLEMIT-LCS-TM-393Dolev, DannyNo Group Specified6-1-1989
BOUNDED POLYNOMIAL RANDOMIZED CONSENSUSMIT-LCS-TM-392Attiya, HagitNo Group Specified6-1-1989
POLYNOMIAL END-TO-END COMMUNICATIONMIT-LCS-TM-391Awerbuch, BaruchNo Group Specified5-1-1989
TYPE ABSTRACTION RULES FOR REFERENCES: A COMPARISON OF FOUR WHICH HAVE ACHIEVED NOTORIETYMIT-LCS-TM-390O'Toole Jr., James WilliamNo Group Specified8-1-1989
A COMPLEXITY PRESERVING RESET PROCEDURE (Extended Abstract)MIT-LCS-TM-389Afek, YehudaNo Group Specified5-1-1989
THREE METHODS FOR RANGE QUERIES IN COMPUTATIONAL GEOMETRYMIT-LCS-TM-388Kipnis, ShlomoNo Group Specified3-1-1989
TWO DOGMAS OF KNOWLEDGE REPRESENTATIONMIT-LCS-TM-387Doyle, JonNo Group Specified9-1-1989
COMMUNICATION EFFECTS FOR MESSAGE-BASED CONCURRENCYMIT-LCS-TM-386Jouvelot, PierreNo Group Specified2-1-1989
StarT-Voyager: Hardware Engineering Specifications (Version 4.0)MIT-LCS-TM-385Ang, Boon S.No Group Specified3-11-1999
CHAPTER ON DISTRIBUTED COMPUTINGMIT-LCS-TM-384Lamport, LeslieNo Group Specified2-1-1989
A SPECIAL CASE OF SECOND-ORDER STRICTNESS ANALYSISMIT-LCS-TM-383Wang, Paul P.No Group Specified2-1-1989
THE IMPACT OF RECOVERY ON CONCURRENCY CONTROL (Extended Abstract)MIT-LCS-TM-382Weihl, Wiiliam, E.No Group Specified2-1-1989
ERROR-CORRECTING CODE FOR LIST DECODINGMIT-LCS-TM-381Elias, PeterNo Group Specified2-1-1989
TYPE RECONSTRUCTION WITH FIRST-CLASS POLYMORPHIC VALUESMIT-LCS-TM-380O'Toole, James W.No Group Specified5-1-1989
THE ORGANIZATION OF PERMUTATION ARCHITECTURE WITH BUSSED INTERCONNECTIONS.MIT-LCS-TM-379Kilian, JoeNo Group Specified1-1-1989
REASONING ABOUT CONTINUATIONS WITH CONTROL EFFECTSMIT-LCS-TM-378Jouvelot, PierreNo Group Specified1-1-1989
THEORY OF COMPUTATION GROUP RESEARCH SUMMARY JUNE 1987-JULY 1988.MIT-LCS-TM-377No Author AvailableNo Group Specified1-1-1989
IMPROVED ROUTING STRATEGIES WITH SUCCINCT TABLESMIT-LCS-TM-376Awerbuch, BaruchNo Group Specified12-1-1988
ON THE EFFECTS OF FEEDBACK IN DYNAMIC NETWORK PROTOCOLSMIT-LCS-TM-375Awerbuch, BaruchNo Group Specified12-1-1988
TIGHT BOUNDS ON MINIMUM BROADCAST NETWORKSMIT-LCS-TM-374Grigni, MichelangeloNo Group Specified10-1-1988
RETIMING SYNCHRONOUS CIRCUITRYMIT-LCS-TM-372Leiserson, Charles E.No Group Specified10-1-1988
NATURAL RANDOM NUMBERSMIT-LCS-TM-371Gifford, David K.No Group Specified9-1-1988
COMMUTATIVITY-BASED LOCKING FOR NESTED TRANSACTIONSMIT-LCS-TM-370Fekete, AlanNo Group Specified8-1-1988
MEMORY-BALANCED ROUTING STRATEGIESMIT-LCS-TM-369Awerbuch, BaruchNo Group Specified8-1-1988
HYBRID CONCURRENCY CONTROL FOR ABSTRACT DATA TYPESMIT-LCS-TM-368Herlihy, Maurice P.No Group Specified8-1-1988
COMMUTATIVITY-BASED CONCURRENCY CONTROL FOR ABSTRACT DATA TYPESMIT-LCS-TM-367Weihl, William, E.No Group Specified8-1-1988
A SPACE EFFICIENT GREEDY TRIANGULATION ALGORITHMMIT-LCS-TM-366Goldman, Sally A.No Group Specified7-1-1988
A TRADEOFF BETWEEN INFORMATION AND COMMUNICATION IN BROADCAST PROTOCOLSMIT-LCS-TM-365Baruch, AwerbuchNo Group Specified7-1-1988
ON THE CORRECTNESS OF ATOMIC MULTI-WRITER REGISTERSMIT-LCS-TM-364Schaffer, Russel W.No Group Specified6-1-1988
ASSISTING DESIGN GIVEN MULTIPLE PERFORMANCE CRITERIAMIT-LCS-TM-363Fogg, Dennis C.No Group Specified8-1-1988
THE THEORY OF ATOMIC TRANSACTIONSMIT-LCS-TM-362Lynch, NancyNo Group Specified6-1-1988
A LATTICE-STRUCTURED PROOF TECHNIQUE APPLIED TO A MINIMUM SPANNING TREE ALGORITHMMIT-LCS-TM-361Welch, Jennifer L.No Group Specified6-1-1988
TRANSACTION COMMIT IN A REALISTIC TIMING MODELMIT-LCS-TM-360Coan, Brian A.No Group Specified6-1-1988
SIMULATING SYNCHRONOUS PROCESSORSMIT-LCS-TM-359Welch, Jennifer LundeliusNo Group Specified6-1-1988
COMBINATORIAL ALGORITHMS FOR THE GENERALIZED CIRCULATION PROBLEMMIT-LCS-TM-358Goldberg, Andrew V.No Group Specified5-1-1988
SUBLINEAR-TIME PARALLEL ALGORITHMS FOR MATCHING AND RELATED PROBLEMSMIT-LCS-TM-357Goldberg, Andrew V.No Group Specified7-1-1988
PARALLEL SYMMETRY-BREAKING IN SPARSE GRAPHSMIT-LCS-TM-356Goldberg, Andrew V.No Group Specified5-1-1988
THE IMPOSSIBILITY OF IMPLEMENTING RELIABLE COMMUNICATION IN THE FACE OF CRASHES (Replaced by TM 355.D)MIT-LCS-TM-355Lynch, NancyNo Group Specified5-1-1988
IMPROVED ROUTING STRATEGIES WITH SUCCINCT TABLESMIT-LCS-TM-354Awerbuch, BaruchNo Group Specified4-1-1988
SEMANTICAL PARADIGMS: NOTES FOR AN INVITED LECTUREMIT-LCS-TM-353Meyer, Albert R.No Group Specified7-1-1988
ESTIMATING PERFORMANCE OF A GATEWAY ROUTING-TABLE CACHEMIT-LCS-TM-352Feldmeier, David C.No Group Specified3-1-1988
I/O AUTOMATA: A MODEL FOR DISCRETE EVENT SYSTEMSMIT-LCS-TM-351Lynch, NancyNo Group Specified3-1-1988
AN INTRODUCTION TO INPUT/OUTPUT AUTOMATAMIT-LCS-TM-373 (TM-351 Revised)Lynch, Nancy A.No Group Specified11-1-1988
LINEAR TIME ALGORITHM FOR MINIMUM NETWORK PARTITIONMIT-LCS-TM-350Awerbuch, BaruchNo Group Specified3-1-1988
A PROOF OF THE KAHN PRINCIPLE FOR INPUT/OUTPUT AUTOMATAMIT-LCS-TM-349Lynch, Nancy A.No Group Specified1-1-1988
USING NIKL IN A LARGE MEDICAL KNOWLEDGE BASEMIT-LCS-TM-348Haimowitz, Ira J.No Group Specified12-1-1987
SPACE EFFICIENT DYNAMIC PROTOCOLS: PART IIMIT-LCS-TM-347Awerbuch, BaruchNo Group Specified12-1-1987
SPACE EFFICIENT DYNAMIC PROTOCOLS: PART IMIT-LCS-TM-346Bloom, B.No Group Specified12-1-1987
BISIMULATION CAN'T BE TRACED: PRELIMINARY REPORTMIT-LCS-TM-345Bloom, BardNo Group Specified11-1-1987
TOWARDS FULLY ABSTRACT SEMANTICS FOR LOCAL VARIABLES: PRELIMINARY REPORTMIT-LCS-TM-344Meyer, Albert R.No Group Specified11-1-1987
A MIXED-INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY SOLVABLEMIT-LCS-TM-343Leiserson, Charles E.No Group Specified10-1-1987
APPROXIMATE AGREEMENTMIT-LCS-TM-342Fekete, AlanNo Group Specified9-1-1987
A MODULAR PROOF OF CORRECTNESS FOR A NETWORK SYNCHRONIZERMIT-LCS-TM-341Fekete, AlanNo Group Specified9-1-1987
NESTED TRANSACTIONS, CONFLICT-BASED LOCKING, AND DYNAMIC ATOMICITYMIT-LCS-TM-340Fekete, AlanNo Group Specified9-1-1987
INFERRING DECISION TREES USING THE MINIMUM DESCRIPTION LENGTH PRINCIPLEMIT-LCS-TM-339Quinlan, J. RossNo Group Specified9-1-1987
MULTITHREADED PROCESSOR ARCHITECTURE FOR PARALLEL SYMBOLIC COMPUTATIONMIT-LCS-TM-338Fujita, TetsuyaNo Group Specified9-1-1987
THEORY OF COMPUTATION GROUP RESEARCH SUMMARY JUNE 1986-1987MIT-LCS-TM-337No Author AvailableNo Group Specified8-1-1987
LOWER BOUNDS FOR RECOGNIZING SMALL CLIQUES ON CRCW PRAM'SMIT-LCS-TM-336Beame, PaulNo Group Specified8-1-1987
THE SEMANTICS OF MIRANDA'S ALGEBRAIC TYPESMIT-LCS-TM-335Bruce, Kim B.No Group Specified8-1-1987
FINDING MINIMUM-COST CIRCULATIONS BY CANCELING NEGATIVE CYCLESMIT-LCS-TM-334Goldberg, Andrew V.No Group Specified7-1-1987
FINDING MINIMUM-COST CIRCULATIONS BY SUCCESSIVE APPROXIMATIONMIT-LCS-TM-333Goldberg, Andrew V.No Group Specified7-1-1987
FORMULATION OF TRADEOFFS IN PLANNING UNDER UNCERTAINTYMIT-LCS-TM-332Wellman, Michael P.No Group Specified6-1-1987
TEMPORAL CONTROL STRUCTURE REFERENCE MANUALMIT-LCS-TM-331Russ, Thomas A.No Group Specified6-1-1987
TWO FUNDAMENTAL ISSUES IN MULTIPROCESSING (replaces TM-241)MIT-LCS-TM-330Arvind, ArvindNo Group Specified10-1-1987
ON THE CORRECTNESS OF ORPHAN ELIMINATION ALGORITHMSMIT-LCS-TM-329Herlihy, MauriceNo Group Specified5-1-1987
APPROXIMATING THE SIZE OF A DYNAMICALLY GROWING ASYNCHRONOUS DISTRIBUTED NETWORKMIT-LCS-TM-328Awerbuch, BaruchNo Group Specified4-1-1987
ADAPTING COMMUNICATION PROTOCOLS TO DYNAMIC INPUT AND NETWORK TOPOLOGY: RESEARCH SUMMARYMIT-LCS-TM-327Awerbuch, BaruchNo Group Specified5-1-1987
CONTROLLING WORST-CASE PERFORMANCE OF A COMMUNICATION PROTOCOL AND DYNAMIC RESOURCE MANAGEMENTMIT-LCS-TM-326Awerbuch, BaruchNo Group Specified5-1-1987
ON THE MESSAGE COMPLEXITY OF BROADCAST: A BASIC LOWER BOUND (Extended Abstract)MIT-LCS-TM-325Awerbuch, BaruchNo Group Specified5-1-1987
NESTED TRANSACTIONS AND READ/WRITE LOCKINGMIT-LCS-TM-324Fekete, AlanNo Group Specified4-1-1987
A SPACE-EFFICIENT ALGORITHM FOR FINDING THE CONNECTED COMPONENTS OF RECTANGLES IN THE PLANEMIT-LCS-TM-323Leiserson, Charles E.No Group Specified2-1-1987
EFFICIENT MULTICHIP PARTIAL CONCENTRATOR SWITCHESMIT-LCS-TM-322Cormen, Thomas H.No Group Specified2-1-1987
A HYPERCONCENTRATOR SWITCH FOR ROUTING BIT-SERIAL MESSAGESMIT-LCS-TM-321Cormen, Thomas H.No Group Specified2-1-1987
EFFICIENT PARALLEL ALGORITHMS FOR (DELTA + 1)-COLORING AND MAXIMAL INDEPENDENT SET PROBLEMSMIT-LCS-TM-320Goldberg, Andrew, V.No Group Specified2-1-1987
MURMUR CLINIC: AN AUSCULTATION EXPERT SYSTEMMIT-LCS-TM-319Leong, Tze-YunNo Group Specified1-1-1987
COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMSMIT-LCS-TM-318Leiserson, Charles, E.No Group Specified12-1-1986
CELLULAR AUTOMATA '86 CONFERENCEMIT-LCS-TM-317Bennett, Charles, H.No Group Specified12-1-1986
DATA SHARING IN GROUP WORKMIT-LCS-TM-316Greif, IreneNo Group Specified10-1-1986
TWO REMARKS CONCERNING THE GOLDWASSER-MICALI-RIVEST SIGNATURE SCHEMEMIT-LCS-TM-315Goldreich, OdedNo Group Specified9-1-1986
ATOMIC CHAIRED REGISTER ACCESS BY ASYNCHRONOUS HARDWARE (DETAILED ABSTRACT)MIT-LCS-TM-314Vitanyi, Paul, M. B.No Group Specified10-1-1986
THEORY OF COMPUTATION RESEARCH GROUP SUMMARY, June 1985 - July 1986MIT-LCS-TM-313Theory of Computation Group, Theory of Computation GroupNo Group Specified8-1-1986
HIERARCHICAL INEQUALITY REASONINGMIT-LCS-TM-312Sacks, Elisha, P.No Group Specified2-1-1987
GAME TREE SEARCHING BY MIN/MAX APPROXIMATIONMIT-LCS-TM-311Rivest, Ronald, L.No Group Specified9-1-1986
AN ARTIFICIAL INTELLIGENCE APPROACH TO CLINICAL DECISION MAKINGMIT-LCS-TM-310Szolovits, PeterNo Group Specified9-1-1986
RETIMING SYNCHRONOUS CIRCUITRYMIT-LCS-TM-309Leiserson, CharlesNo Group Specified5-1-1986
FLOYD-HOARE LOGIC DEFINES SEMANTICSMIT-LCS-TM-308Meyer, Albert R.No Group Specified5-1-1986
RANDOMIZED ROUTING ON FAT-TREESMIT-LCS-TM-307Greenberg, Ronald, I.No Group Specified4-1-1986
NONSEQUENTIAL COMPUTATION AND LAWS OF NATUREMIT-LCS-TM-306Vitanyi M. B., PaulNo Group Specified5-1-1986
REPRESENTING CHANGEMIT-LCS-TM-305Sacks, ElishaNo Group Specified5-1-1986
DISTRIBUTED CONTROL IN COMPUTER NETWORKS AND CROSS-SECTIONS OF COLORED MULTIDIMENSIONAL BODIESMIT-LCS-TM-304Kranakis, EvangelosNo Group Specified4-1-1986
THE POWER OF THE QUEUEMIT-LCS-TM-303Ming, LiNo Group Specified4-1-1986
A SURVEY OF ALGORITHMS FOR INTEGRATING WAFER-SCALE SYSTOLIC ARRAYSMIT-LCS-TM-302Leighton, TomNo Group Specified5-1-1986
INTERVAL AND REGENCY-RANK SOURCE CODING: TWO ON-LINE ADAPTIVE VARIABLE-LENGTH SCHEMESMIT-LCS-TM-301Elias, PeterNo Group Specified4-1-1986
KNOWLEDGE AND COMMON KNOWLEDGE IN A BYZANTINE ENVIRONMENT: CRASH FAILURESMIT-LCS-TM-300Dwork, CynthiaNo Group Specified7-1-1986
THE APPLICATION OF DIGITAL BROADCAST COMMUNICATION TO LARGE SCALE INFORMATION SYSTEMSMIT-LCS-TM-299Gifford, David, K.No Group Specified4-1-1986
TIGHT BOUNDS FOR MINIMAX GRID MATCHING, WITH APPLICATIONS TO THE AVERAGE CASE ANALYSIS OF ALGORITHMSMIT-LCS-TM-298Leighton, TomNo Group Specified5-1-1986
A RANDOMIZED DATA STRUCTURE FOR ORDERED SETSMIT-LCS-TM-297Bentley, Jon, L.No Group Specified5-1-1986
CELLULAR AUTOMATA SUPERCOMPUTERS FOR FLUID DYNAMICS MODELINGMIT-LCS-TM-296Margolus, NormanNo Group Specified12-1-1985
ATOMIC DATA ABSTRACTIONS IN A DISTRIBUTED COLLABORATIVE EDITING SYSTEM (EXTENDED ABSTRACT)MIT-LCS-TM-295Greif, IreneNo Group Specified11-1-1985
DATAFLOW ARCHITECTURESMIT-LCS-TM-294Arvind, ArvindNo Group Specified2-1-1986
WIDTH-3 PERMUTATION BRANCHING PROGRAMSMIT-LCS-TM-293Barrington, David A.No Group Specified12-1-1985
PACKET TRAINS: MEASUREMENTS AND A NEW MODEL FOR COMPUTER NETWORK TRAFFICMIT-LCS-TM-292Jain, RajNo Group Specified11-1-1985
A NEW MAX-FLOW ALGORITHMMIT-LCS-TM-291Goldberg, Andrew V.No Group Specified11-1-1985
DISTRIBUTED FIFO ALLOCATION OF IDENTICAL RESOURCES USING SMALL SHARED SPACEMIT-LCS-TM-290Fischer, Michael, J.No Group Specified6-1-1985
THE CAM-7 MULTIPROCESSOR: A CELLULAR AUTOMATA MACHINEMIT-LCS-TM-289Toffoli, TommasoNo Group Specified12-1-1985
DSCRIBE: A SCRIBE SERVERMIT-LCS-TM-288Chung, Janice, C.No Group Specified5-1-1985
NETWORK CONTROL BY BAYESIAN BROADCASTMIT-LCS-TM-287Rivest, Ronald, L.No Group Specified7-1-1985
IMPROVEMENTS OF YAO'S RESULTS ON PARITY CIRCUITSMIT-LCS-TM-286Hastad, JohanNo Group Specified9-1-1985
TWO UNDECIDABILITY RESULTS IN PROBABILISTIC AUTOMATA THEORYMIT-LCS-TM-285Killian, Joseph, J.No Group Specified6-1-1985
A MIXED-INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY SOLVABLEMIT-LCS-TM-284Leiserson, Charles, E.No Group Specified7-1-1985
UNBIASED BITS FROM SOURCES OF WEAK RANDOMNESS AND PROBABILISTIC COMMUNICATION COMPLEXITYMIT-LCS-TM-283Chor, BennyNo Group Specified9-1-1986
COMPUTER BASED REAL-TIME CONFERENCESMIT-LCS-TM-282Sarin, SunilNo Group Specified7-1-1985
WHAT PRICE FOR ELIMINATING EXPRESSION SIDE-EFFECTS?MIT-LCS-TM-281Hailperin, MaxNo Group Specified6-1-1985
QUALITATIVE SIMULATION IN MEDICAL PHYSIOLOGY: A PROGRESS REPORTMIT-LCS-TM-280Kuipers, BenjaminNo Group Specified6-1-1985
EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMSMIT-LCS-TM-279Lynch, Nancy, A.No Group Specified6-1-1985
PROBABILISTIC ANALYSIS OF A NETWORK RESOURCE ALLOCATION ALGORITHMMIT-LCS-TM-278Fischer, Michael, J.No Group Specified6-1-1985
ELECTING A LEADER IN A SYNCHRONOUS RINGMIT-LCS-TM-277Frederickson, Greg, N.No Group Specified3-1-1985
REACHING APPROXIMATE AGREEMENT IN THE PRESENCE OF FAULTSMIT-LCS-TM-276Dolev, DannyNo Group Specified5-1-1985
THE BYZANTINE FIRING SQUAD PROBLEMMIT-LCS-TM-275Burns, James, E.No Group Specified4-1-1985
QUALITATIVE SIMULATION OF MECHANISMSMIT-LCS-TM-274Kuipers, BenjaminNo Group Specified4-1-1985
GENERALIZED PLANAR MATCHINGMIT-LCS-TM-273Berman, FranNo Group Specified4-1-1985
TIGHT BOUNDS ON THE COMPLEXITY OF PARALLEL SORTINGMIT-LCS-TM-272Leighton, TomNo Group Specified4-1-1985
PATTERNS IN TREESMIT-LCS-TM-271Dershowitz, NachumNo Group Specified1-1-1985
CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY (Preliminary Version)MIT-LCS-TM-270Dwork, CynthiaNo Group Specified7-1-1984
THE COLORED TICKET ALGORITHMMIT-LCS-TM-269Fischer, MichaelNo Group Specified8-1-1983
COMPLEXITY OF NETWORK SYNCHRONIZATIONMIT-LCS-TM-268Awerbuch, BaruchNo Group Specified1-1-1985
PROPOSAL FOR A SMALL SCHEME IMPLEMENTATIONMIT-LCS-TM-267Schooler, RichardNo Group Specified10-1-1984
A SIMPLE AND EFFICIENT RANDOMIZED BYZANTINE AGREEMENT ALGORITHMMIT-LCS-TM-266Chor, BennyNo Group Specified8-1-1984
A NEW FAULT-TOLERANT ALGORITHM FOR CLOCK SYNCHRONIZATIONMIT-LCS-TM-265Lundelius, JenniferNo Group Specified7-1-1984
SOFTWARE FOR INTERACTIVE ON-LINE CONFERENCESMIT-LCS-TM-264Sarin, Sunil L.No Group Specified7-1-1984
NAMING AND DIRECTORY ISSUES IN MESSAGE TRANSFER SYSTEMSMIT-LCS-TM-263Sirbu, Marvin A.No Group Specified7-1-1984
THREE-DIMENSIONAL CIRCUIT LAYOUTSMIT-LCS-TM-262Leighton, ThomasNo Group Specified6-1-1984
OPTIMAL DISTRIBUTED ALGORITHMS FOR SORTING AND RANKINGMIT-LCS-TM-261Zaks, ShmuelNo Group Specified5-1-1984
RSA/RABIN LEAST SIGNIFICANT BITS ARE 1/2 +1/poly(logN)SECUREMIT-LCS-TM-260Chor, BennyNo Group Specified5-1-1984
THE IMPACT OF SYNCHRONOUS COMMUNICATION ON THE PROBLEM OF ELECTING A LEADER IN A RINGMIT-LCS-TM-259Halpern, Nancy A.No Group Specified4-1-1984
THE SEMANTICS OF LOCAL STORAGE, OR WHAT MAKES THE FREE LIST FREE?MIT-LCS-TM-258Halpern, Y., JosephNo Group Specified4-1-1984
ON THE SEQUENTIAL NATURE OF UNIFICATIONMIT-LCS-TM-257Dwork, CynthiaNo Group Specified3-1-1984
ON THE NUMBER OF CLOSE-AND-EQUAL PAIRS OF BITS IN A STRING (WITH IMPLICATIONS ON THE SECURITY OF RSA'S L.S.B.)MIT-LCS-TM-256Goldreich, OdedNo Group Specified3-1-1984
HOW TO ASSEMBLE TREE MACHINESMIT-LCS-TM-255Bhatt, Sandeep N.No Group Specified3-1-1984
EMPIRICAL ANALYSIS OF A TOKEN RING NETWORKMIT-LCS-TM-254Feldmeier, C., DavidNo Group Specified1-1-1984
AN APPLICATION OF NUMBER THEORY TO THE ORGANIZATION OF RASTER GRAPHICS MEMORYMIT-LCS-TM-253Chor, BennyNo Group Specified4-1-1984
ON BPPMIT-LCS-TM-252Zachos, StathisNo Group Specified12-1-1983
REACHING APPROXIMATE AGREEMENT IN THE PRESENCE OF FAULTSMIT-LCS-TM-251Dolev, DannyNo Group Specified12-1-1983
ON CONCURRENT IDENTIFICATION PROTOCOLSMIT-LCS-TM-250Golreich, OdedNo Group Specified12-1-1983
THE MARKOV CHAIN TREE THEOREMMIT-LCS-TM-249Leighton, Frank T.No Group Specified12-1-1983
ESTIMATING A PROBABILITY USING FINITE MEMORYMIT-LCS-TM-248Leighton, Frank T.No Group Specified11-1-1983
PROBABILISTIC SEARCHING IN SORTED LINKED LISTSMIT-LCS-TM-247Leighton, TomNo Group Specified11-1-1983
FROM DENOTATONAL TO OPERATIONAL AND AXIOMATIC SEMANTICS FOR AGOL-LIKE LANGUAGES: AN OVERVIEWMIT-LCS-TM-246Trakhtenbrot, A., B.No Group Specified10-1-1983
UNDERSTANDING ALGOL: THE VIEW OF THE RECENT CONVERT TO DENOTATIONAL SEMANTICSMIT-LCS-TM-245Meyer, R., AlbertNo Group Specified10-1-1983
HOW TO CONSTRUCT RANDOM FUNCTIONSMIT-LCS-TM-244Goldreich, OdedNo Group Specified11-1-1983
EFFICIENT DEMAND-DRIVEN EVALUATION (II)MIT-LCS-TM-243Pingali, KeshavNo Group Specified9-1-1983
EFFICIENT DEMAND-DRIVEN EVALUATION (I)MIT-LCS-TM-242Keshav, PingaliNo Group Specified9-1-1983
TWO FUNDAMENTAL ISSUES IN MULTIPROCESSING: THE DATAFLOW SOLUTION (Replaced by TM 330)MIT-LCS-TM-241Arvind, ArvindNo Group Specified1-1-1983
A PROGRAM FOR THERAPY OF ACID-BASE AND ELECTROLYTE DISORDERSMIT-LCS-TM-240Bromley, HankNo Group Specified6-1-1983
EVALUATION OF AN OFFICE ANALYSIS METHODOLOGYMIT-LCS-TM-239Sutherland, JulietNo Group Specified3-1-1983
AN APPROXIMATION ALGORITHM FOR MANHATTAN ROUTINGMIT-LCS-TM-238Baker, Brenda S.No Group Specified2-1-1983
PLANAR EMBEDDING OF PLANAR GRAPHSMIT-LCS-TM-237Dolev, DannyNo Group Specified2-1-1983
WAFER-SCALE INTEGRATION OF SYSTOLIC ARRAYSMIT-LCS-TM-236Leighton, Frank T.No Group Specified2-1-1983
THE IMPLICATION PROBLEM FOR FUNCTIONAL AND INCLUSION DEPENDENCIESMIT-LCS-TM-235Mitchell, John C.No Group Specified2-1-1983
RANDOMIZED ENCRYPTION TECHNIQUESMIT-LCS-TM-234Rivest, Ronald L.No Group Specified1-1-1983
IMPLEMENTING INTERNET REMOTE LOGIN ON A PERSONAL COMPUTERMIT-LCS-TM-233Konopelski, Louis J.No Group Specified12-1-1982
PLY: A SYSTEM OF PLAUSIBILITY INFERENCE WITH A PROBABILISTIC BASISMIT-LCS-TM-232Yeh, AlexanderNo Group Specified12-1-1982
AN ASYMPTOTICALLY OPTIMAL LAYOUT FOR THE SHUFFLE-EXCHANGE GRAPHMIT-LCS-TM-231Kleitman, DanielNo Group Specified10-1-1982
EMBEDDING CRYPTOGRAPHIC TRAPDOORS IN ARBITRARY KNAPSACK SYSTEMSMIT-LCS-TM-230Shamir, AdiNo Group Specified9-1-1982
THE COMPLEXITY OF EVALUATION RELATIONAL QUERIESMIT-LCS-TM-229Cosmadakis, Stavros S.No Group Specified8-1-1982
TWO REMARKS ON THE POWER OF COUNTINGMIT-LCS-TM-228Papadimitriou, Christos H.No Group Specified8-1-1982
NEW LOWER BOUND TECHNIQUES FOR VLSIMIT-LCS-TM-227Leighton, Frank T.No Group Specified8-1-1982
"HOARE'S LOGIC IS NOT COMPLETE WHEN IT COULD BE"MIT-LCS-TM-226Bergstra, J.No Group Specified8-1-1982
FOUNDATIONS FOR OFFICE SEMANTICSMIT-LCS-TM-225Barber, GeraldNo Group Specified7-1-1982
SUPPORTING ORGANIZATIONAL PROBLEM SOLVING WITH A WORKSTATIONMIT-LCS-TM-224Barber, GeraldNo Group Specified7-1-1982
A PRINCIPLED DESIGN FOR AN INTEGRATED COMPUTATIONAL ENVIRONMENTMIT-LCS-TM-223diSessa, Andrea A.No Group Specified7-1-1982
A TELEX GATEWAY FOR THE INTERNETMIT-LCS-TM-222Sieker, Friedrich Meir zuNo Group Specified5-1-1982
LAYOUTS FOR THE SHUFFLE-EXCHANGE GRAPH BASED ON THE COMPLEX PLANE DIAGRAMMIT-LCS-TM-221Leighton, Frank ThomsonNo Group Specified6-1-1982
CIRCUIT ANALYSIS OF SELF-TIMED ELEMENTS FOR NMOS VLSI SYSTEMSMIT-LCS-TM-220Chu, Tam-AnhNo Group Specified5-1-1982
RECURSIVE DECOMPOSITION ORDERING AND MULTISET ORDERINGSMIT-LCS-TM-219Jouannaud, Jean-PierreNo Group Specified6-1-1982
"COOPERATIVE OFFICE WORK, TELECONFERENCING AND CALENDAR MANAGEMENT: A COLLECTION OF PAPERSMIT-LCS-TM-218Grief, IreneNo Group Specified5-1-1982
A FILE TRANSFER PROGRAM FOR A PERSONAL COMPUTERMIT-LCS-TM-217Wright, Karl, D.No Group Specified4-1-1982
COPING WITH SYNTACTIC AMBIGUITY OR HOW TO PUT THE BLOCK IN THE BOX ON THE TABLEMIT-LCS-TM-216Church, KennethNo Group Specified4-1-1982
"OPTIMIZING SYNCHRONOUS SYSTEMS"MIT-LCS-TM-215Leiserson, Charles E.No Group Specified3-1-1982
"TERMINATION ASSERTIONS FOR RECURSIVE PROGRAMS: COMPLETENESS AND AXIOMATIC DEFINABILITY"MIT-LCS-TM-214Meyer, Albert R.No Group Specified3-1-1982
PCAL: A PERSONAL CALENDARMIT-LCS-TM-213Elias, P.No Group Specified1-1-1982
MINIMAX OPTIMAL UNIVERSAL CODEWORD SETSMIT-LCS-TM-212Elias, PeterNo Group Specified1-1-1982
A NOTE ON EQUIVALENCES AMONG LOGICS OF PROGRAMSMIT-LCS-TM-211Meyer, Albert R.No Group Specified12-1-1981
SOFTWARE FOR THE 'ROLES' PEOPLE PLAYMIT-LCS-TM-210Greif, IreneNo Group Specified2-1-1982
COMPUTATIONAL COMPLEXITY AND THE TRAVELING SALESMAN PROBLEMMIT-LCS-TM-209Johnson, DavidNo Group Specified12-1-1981
THE TRAVELING SALESMAN PROBLEM WITH MANY VISITS TO FEW CITIESMIT-LCS-TM-208Cosmadakis, Stavros, S.No Group Specified11-1-1981
POWER SET MODELS OF LAMBDA-CALCULUS: THEORIES, EXPANSIONS, ISOMORPHISMSMIT-LCS-TM-207Longo, GiuseppeNo Group Specified11-1-1981
OPTIMAL PLACEMENT FOR RIVER ROUTINGMIT-LCS-TM-206Leiserson, Charles, E.No Group Specified10-1-1981
CIRCUIT-SIZE LOWER BOUNDS AND NON-REDUCIBILITY TO SPARSE SETSMIT-LCS-TM-205Kannan, RavindranNo Group Specified10-1-1981
ON THE EXPRESSIVE POWER OF DYNAMIC LOGIC, IIMIT-LCS-TM-204Halpern, Joseph, YNo Group Specified8-1-1981
MACLISP EXTENSIONSMIT-LCS-TM-203Bawden, AlanNo Group Specified7-1-1981
COMMUNICATION RING INITIALIZATION WITHOUT CENTRAL CONTROLMIT-LCS-TM-202Saltzer, Jerome, H.No Group Specified12-1-1981
WHAT IS A MODEL OF THE LAMBDA CALCULUS? EXPANDED VERSIONMIT-LCS-TM-201Meyer, Albert, R.No Group Specified7-1-1981
LSB MANUALMIT-LCS-TM-200Burke, GlennNo Group Specified6-1-1981
THE COMPLEXITY OF THE WORD PROBLEMS FOR COMMUTATIVE SEMIGROUPS AND POLYNOMIAL IDEALSMIT-LCS-TM-199Mayr, Ernst, W.No Group Specified6-1-1981
THE PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAMSMIT-LCS-TM-198Halpern, Joseph, YNo Group Specified3-1-1981
CONSERVATIVE LOGICMIT-LCS-TM-197Fredkin, EdwardNo Group Specified5-1-1981
ON CONCENTRATION AND CONNECTION NETWORKSMIT-LCS-TM-196Bhatt, Sandeep, NautamNo Group Specified3-1-1981
RECORD OF THE WORKSHOP ON RESEARCH IN OFFICE SEMANTICSMIT-LCS-TM-195Barber, Gerald, R.No Group Specified2-1-1981
RECURSION THEORETIC OPERATORS AND MORPHISMS ON NUMBERED SETSMIT-LCS-TM-194Barendregt, HenkNo Group Specified2-1-1994
ALGEBRAIC DEPENDENCIESMIT-LCS-TM-193Yannakakis, MihalisNo Group Specified2-1-1981
THE DEDUCIBILITY PROBLEM IN PROPOSITIONAL DYNAMIC LOGICMIT-LCS-TM-192Meyer, Albert, R.No Group Specified2-1-1981
PROPOSITIONAL DYNAMIC LOGICS OF PROGRAMS: A SURVEYMIT-LCS-TM-191Parikh, RohitNo Group Specified1-1-1981
DETERMINISTIC PROPOSITIONAL DYNAMIC LOGIC: FINITE MODELS, COMPLEXITY, AND COMPLETENESSMIT-LCS-TM-190Ben-Ari, MordechaiNo Group Specified1-1-1981
PERSISTENCE OF VECTOR REPLACEMENT SYSTEMS IS DECIDABLEMIT-LCS-TM-189Mayr, ErnstNo Group Specified1-1-1981
AN EFFECTIVE REPRESENTATION OF THE REACHABILITY SET OF PERSISTENT PETRI NETSMIT-LCS-TM-188Mayr, ErnstNo Group Specified1-1-1981
W (n log n)LOWER BOUNDS ON LENGTH OF BOOLEAN FORMULASMIT-LCS-TM-187Fischer, Michael, J.No Group Specified11-1-1980
BRAND X MANUALMIT-LCS-TM-186Szolovits, PeterNo Group Specified11-1-1980
AN OPTIMALITY THEORY OF CONCURRENCY CONTROL FOR DATABASESMIT-LCS-TM-185Kung, Hsing-tsungNo Group Specified11-1-1980
A REAL TIME GARBAGE COLLECTOR THAT CAN RECOVER TEMPORARY STORAGE QUICKLYMIT-LCS-TM-184Lieberman, HenryNo Group Specified10-1-1980
A NOTE ON THE LENGTH OF CRAIG'S INTERPOLANTSMIT-LCS-TM-183Meyer, Albert R.No Group Specified10-1-1980
HAMILTON PATHS IN GRID GRAPHSMIT-LCS-TM-182Itai, AlonNo Group Specified10-1-1980
A FAST ALGORITHM FOR TESTING FOR SAFETY AND DETECTING DEADLOCKS IN LOCKED TRANSACTION SYSTEMSMIT-LCS-TM-181Lipski, Witold, J.No Group Specified10-1-1980
A THEOREM IN DATABASE CONCURRENCY CONTROLMIT-LCS-TM-180Papadimitriou, Christos, H.No Group Specified10-1-1980
AXIOMATIC DEFINITIONS OF PROGRAMMING LANGUAGES, IIMIT-LCS-TM-179Halpern, Joseph, Y.No Group Specified10-1-1980
I-STRUCTURES: AN EFFICIENT DATA TYPE FOR FUNCTIONAL LANGUAGESMIT-LCS-TM-178Arvind, ArvindNo Group Specified9-1-1980
TIMEPAD - A PERFORMANCE IMPROVING SYNCHRONIZATION MECHANISM FOR DISTRIBUTED SYSTEMSMIT-LCS-TM-177Sinha, Mukul, KumarNo Group Specified9-1-1980
A SEMANTICS OF SYNCHRONIZATIONMIT-LCS-TM-176Seaquist, Carl, R.No Group Specified9-1-1980
ON TIME VERSUS SPACE IIIMIT-LCS-TM-175Meyer, Albert, R.No Group Specified9-1-1980
A DATAFLOW ARCHITECTURE WITH TAGGED TOKENSMIT-LCS-TM-174Arvind, ArvindNo Group Specified9-1-1980
XLMS: A LINGUISTIC MEMORY SYSTEMMIT-LCS-TM-173Hawkinson, Lowell, B.No Group Specified9-1-1980
SOME NEW METHODS OF MUSIC SYNTHESISMIT-LCS-TM-172Paseman, William, G.No Group Specified8-1-1980
WHAT IS A MODEL OF THE LAMBDA CALCULUS?MIT-LCS-TM-171Meyer, Albert R.No Group Specified8-1-1980
PUMPING LEMMAS FOR REGULAR SETSMIT-LCS-TM-170Ehrenfeucht, A.No Group Specified8-1-1980
LOOP ITERATION MACROMIT-LCS-TM-169Burke, GlennNo Group Specified7-1-1980
PROGRAMS FOR DISTRIBUTED COMPUTING: THE CALENDAR APPLICATIONMIT-LCS-TM-168Grief, IreneNo Group Specified7-1-1980
COMPUTER PROGRAMS FOR RESEARCH IN GRAVITATION AND DIFFERENTIAL GEOMETRYMIT-LCS-TM-167Pavelle, RichardNo Group Specified6-1-1980
REPORT ON THE WORKSHOP ON SELF-TIMED SYSTEMSMIT-LCS-TM-166Bryant, Randal E.No Group Specified5-1-1980
THEORY AND PRACTICE OF TEXT EDITORS OR A COOKBOOK FOR AN EMACSMIT-LCS-TM-165Finseth, Craig A.No Group Specified5-1-1980
THE CRYPTOGRAPHIC SECURITY OF COMPACT KNAPSACKS (PRELIMINARY REPORT)MIT-LCS-TM-164Shamir, AdiNo Group Specified4-1-1980
AXIOMATIC DEFINITIONS OF PROGRAMMING LANGUAGES: A THEORETICAL ASSESSMENTMIT-LCS-TM-163Meyer, Albert M.No Group Specified4-1-1980
A MANAGER FOR NAMED, PERMANENT OBJECTSMIT-LCS-TM-162Marcum, Alan MichaelNo Group Specified4-1-1980
CRITICAL PATH SCHEDULING OF TASK SYSTEMS WITH RESOURCE AND PROCESSOR CONSTRAINTSMIT-LCS-TM-161Lloyd, Errol L.No Group Specified3-1-1980
ON THE COMPUTATIONAL COMPLEXITY OF CARDINALITY CONSTRAINTS IN RELATIONAL DATABASESMIT-LCS-TM-160Kanellakis, Paris C.No Group Specified3-1-1980
DYNAMIC ALGEBRAS AND THE NATURE OF INDUCTIONMIT-LCS-TM-159Pratt, Vaughan R.No Group Specified3-1-1980
SEMAPHORE PRIMITIVES AND STARVATION-FREE MUTUAL EXCLUSIONMIT-LCS-TM-158Stark, Eugene W.No Group Specified3-1-1980
ON THE EXPRESSIVE POWER OF DYNAMIC LOGICMIT-LCS-TM-157Meyer, Albert R.No Group Specified2-1-1980
DEFINABILITY IN DYNAMIC LOGICMIT-LCS-TM-156Meyer, Albert R.No Group Specified2-1-1980
COVERING GRAPHS BY SIMPLE CIRCUITSMIT-LCS-TM-155Itai, AlonNo Group Specified2-1-1980
ON LINEAR CHARACTERIZATIONS OF COMBINATORIAL OPTIMIZATION PROBLEMSMIT-LCS-TM-154Karp, Richard M.No Group Specified2-1-1980
WORST-CASE AND PROBABILISTIC ANALYSIS OF A GEOMETRIC LOCATION PROBLEMMIT-LCS-TM-153Papadimitriou, Christos H.No Group Specified2-1-1980
ON THE COMPLEXITY OF INTEGER PROGRAMMINGMIT-LCS-TM-152Papadimitriou, Christos H.No Group Specified2-1-1980
REVERSIBLE COMPUTINGMIT-LCS-TM-151Toffoli, TommasoNo Group Specified2-1-1980
TEN THOUSAND AND ONE LOGICS OF PROGRAMMINGMIT-LCS-TM-150Meyer, Albert R.No Group Specified2-1-1980
AN EFFICIENT ALGORITHM FOR DETERMINING THE LENGTH OF THE LONGEST DEAD PATH IN AN "LIFO" BRANCH-AND BOUND EXPLORATION SCHEMAMIT-LCS-TM-149Pallottino, StefanoNo Group Specified1-1-1980
SPACE-BOUNDED SIMULATION OF MULTITAPE TURING MACHINESMIT-LCS-TM-148Adleman, Leonard M.No Group Specified1-1-1980
AT + 0(2^n/2), S = 0(2^n/4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMSMIT-LCS-TM-147Schroeppel, RichardNo Group Specified1-1-1980
A MACHINE LANGUAGE INSTRUCTION SET FOR A DATA FLOW PROCESSORMIT-LCS-TM-146Aoki, Donald J.No Group Specified12-1-1979
A SPACE BOUND FOR ONE-TAPE MULTIDIMENSIONAL TURING MACHINESMIT-LCS-TM-145Loui, Michael C.No Group Specified11-1-1979
CONCURRENT AND RELIABLE UPDATES OF DISTRIBUTED DATABASESMIT-LCS-TM-144Takagi, AkihiroNo Group Specified11-1-1979
AN INTERMEDIATE FORM FOR DATA FLOW PROGRAMSMIT-LCS-TM-143Leth, James W.No Group Specified11-1-1979
ON DATA BASES WITH INCOMPLETE INFORMATIONMIT-LCS-TM-142Lipski, Witold Jr.No Group Specified10-1-1979
ON DATA BASE MANAGEMENT SYSTEM ARCHITECTUREMIT-LCS-TM-141Hammer, MichaelNo Group Specified10-1-1979
ARTIFICIAL INTELLIGENCE AND CLINICAL PROBLEM SOLVINGMIT-LCS-TM-140Szolovits, PeterNo Group Specified9-1-1979
ROLES, CO-DESCRIPTORS, AND THE FORMAL REPRESENTATION OF QUANTIFIED ENGLISH EXPRESSIONSMIT-LCS-TM-139Martin, William A.No Group Specified5-1-1980
DYNAMIC ALGEBRAS: EXAMPLES, CONSTRUCTIONS, APPLICATIONSMIT-LCS-TM-138Pratt, Vaughan R.No Group Specified7-1-1979
ALGORITHMS FOR SCHEDULING TASKS ON UNRELATED PROCESSORSMIT-LCS-TM-137Davis, ErnstNo Group Specified6-1-1979
REPORT ON THE SECOND WORKSHOP ON DATA FLOW COMPUTER AND PROGRAM ORGANIZATIONMIT-LCS-TM-136Misunas, David P.No Group Specified6-1-1979
TIMESTAMPS AND CAPABILITY-BASED PROTECTION IN A DISTRIBUTED COMPUTER FACILITYMIT-LCS-TM-135Wyleczuk, Rosanne H.No Group Specified6-1-1979
HOW TO SHARE A SECRETMIT-LCS-TM-134Shamir, AdiNo Group Specified5-1-1979
THE SPACE COMPLEXITY OF TWO PEBBLE GAMES ON TREESMIT-LCS-TM-133Loui, Michael C.No Group Specified5-1-1979
DESIGN OF A PROGRAM FOR EXPERT DIAGNOSIS OF ACID BASE AND ELECTROLYTE DISTURBANCESMIT-LCS-TM-132Patil, Ramesh S.No Group Specified5-1-1979
TIME, SPACE AND RANDOMNESSMIT-LCS-TM-131Adelman, Leonard M.No Group Specified3-1-1979
SPECIFYING THE SEMANTICS OF WHILE-PROGRAMS: A TUTORIAL AND CRITIQUE OF A PAPER BY HOARE AND LAUERMIT-LCS-TM-130Greif, IreneNo Group Specified4-1-1979
ON THE CRYPTOCOMPLEXITY OF KNAPSACK SYSTEMSMIT-LCS-TM-129Shamir, AdiNo Group Specified4-1-1979
MINIMUM REGISTER ALLOCATION IS COMPLETE IN POLYNOMIAL SPACEMIT-LCS-TM-128Loui, Michael C.No Group Specified3-1-1979
A NETWORK TRAFFIC GENERATOR FOR DECNETMIT-LCS-TM-127Strazdas, Richard J.No Group Specified3-1-1979
WITH WHAT FREQUENCY ARE APPARENTLY INTRACTABLE PROBLEMS DIFFICULT?MIT-LCS-TM-126Meyer, Albert R.No Group Specified2-1-1979
MENTAL POKERMIT-LCS-TM-125Shamir, AdiNo Group Specified2-1-1979
BICONTINUOUS EXTENSIONS OF INVERTIBLE COMBINATORIAL FUNCTIONSMIT-LCS-TM-124Toffoli, TommasoNo Group Specified1-1-1979
AN IMPROVED PROOF OF THE RABIN-HARTMANIS-STEARNS CONJECTUREMIT-LCS-TM-123Perry, Harold M.No Group Specified1-1-1979
EFFICIENT SCHEDULING OF TASKS WITHOUT FULL USE OF PROCESSOR RESOURCESMIT-LCS-TM-122Jaffe, JeffreyNo Group Specified1-1-1979
THE EQUIVALENCE OF R.E. PROGRAMS AND DATA FLOW SCHEMESMIT-LCS-TM-121Jaffe, JeffreyNo Group Specified1-1-1979
OPERATIONAL SEMANTICS OF A DATA FLOW LANGUAGEMIT-LCS-TM-120Brock, Jarvis D.No Group Specified12-1-1978
ON THE SECURITY OF THE MERKLE-HELLMAN CRYPTOGRAPHIC SCHEMEMIT-LCS-TM-119Shamir, AdiNo Group Specified12-1-1978
DATA MODEL EQUIVALENCEMIT-LCS-TM-118Borkin, Sheldon A.No Group Specified12-1-1978
SIX LECTURES ON DYNAMIC LOGICMIT-LCS-TM-117Pratt, Vaughan R.No Group Specified12-1-1979
APPLICATIONS OF MODAL LOGIC TO PROGRAMMINGMIT-LCS-TM-116Pratt, Vaughan R.No Group Specified12-1-1978
CONCURRENT PROGRAMMINGMIT-LCS-TM-115Bryant, Randal E.No Group Specified10-1-1978
RESEARCH DIRECTIONS IN COMPUTER ARCHITECTUREMIT-LCS-TM-114Dennis, Jack B.No Group Specified9-1-1978
A NEAR-OPTIMAL METHOD FOR REASONING ABOUT ACTIONMIT-LCS-TM-113Pratt R., VaughanNo Group Specified9-1-1978
A DECIDABILITY RESULT FOR A SECOND ORDER PROCESS LOGICMIT-LCS-TM-112Parikh, RohitNo Group Specified9-1-1978
BOUNDS ON THE SCHEDULING OF TYPED TASK SYSTEMSMIT-LCS-TM-111Jaffe, Jeffrey M.No Group Specified9-1-1978
AN ANALYSIS OF PREEMPTIVE MULTIPROCESSOR JOB SCHEDULINGMIT-LCS-TM-110Jaffe, Jeffrey M.No Group Specified9-1-1978
EFFECTIVENESSMIT-LCS-TM-109Parikh, RohitNo Group Specified7-1-1978
AN ANALYSIS OF THE SOLOVAY AND STRASSEN TEST FOR PRIMALITYMIT-LCS-TM-108Baratz, Alan E.No Group Specified7-1-1978
A FAST SIGNATURE SCHEMEMIT-LCS-TM-107Shamir, AdiNo Group Specified5-1-1978
A COMPLETENESS RESULT FOR A PROPOSITIONAL DYNAMIC LOGICMIT-LCS-TM-106Parikj, RohitNo Group Specified7-1-1978
A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCESMIT-LCS-TM-105Masek, William J.No Group Specified5-1-1978
THE USE OF QUEUES IN THE PARALLEL DATA FLOW EVALUATION OF "IF-THEN-WHILE" PROGRAMSMIT-LCS-TM-104Jaffe, JeffreyNo Group Specified5-1-1978
ARITHMETICAL COMPLETENESS IN LOGICS OF PROGRAMSMIT-LCS-TM-103Harel, DavidNo Group Specified4-1-1978
LOWER BOUNDS ON INFORMATION TRANSFER IN DISTRIBUTED COMPUTATIONSMIT-LCS-TM-102Abelson, HaroldNo Group Specified4-1-1978
DESCRIPTIONS AND THE SPECIALIZATION OF CONCEPTSMIT-LCS-TM-101Martin, William A.No Group Specified3-1-1978
A COMPUTER ARCHITECTURE FOR DATA- FLOW COMPUTATIONMIT-LCS-TM-100Misunas, David PeterNo Group Specified3-1-1978
THE SUBGRAPH HOMEOMORPHISM PROBLEMMIT-LCS-TM-099LaPaugh, Andrea SuzanneNo Group Specified2-1-1978
NONDETERMINISM IN LOGICS OF PROGRAMSMIT-LCS-TM-098Harel, DavidNo Group Specified2-1-1978
COMPUTABILITY AND COMPLETENESS IN LOGICS OF PROGRAMSMIT-LCS-TM-097Harel, DavidNo Group Specified2-1-1978
A COMPLETE AXIOMATIC SYSTEM FOR PROVING DEDUCTIONS ABOUT RECURSIVE PROGRAMSMIT-LCS-TM-096Harel, DavidNo Group Specified2-1-1978
CHARACTERIZING SECOND ORDER LOGIC WITH FIRST ORDER QUANTIFIERSMIT-LCS-TM-095Harel, DavidNo Group Specified2-1-1977
A DYNAMIC DEBUGGING SYSTEM FOR MDLMIT-LCS-TM-094Berez, Joel M.No Group Specified1-1-1978
A LOGIC DESIGN FOR THE CELL BLOCK OF A DATA- FLOW PROCESSORMIT-LCS-TM-093Amikura, KatsuhikoNo Group Specified12-1-1977
REPORT ON THE WORKSHOP ON DATA FLOW COMPUTER AND PROGRAM ORGANIZATIONMIT-LCS-TM-092Misunas, David P.No Group Specified11-1-1977
FACTORING NUMBERS IN 0 (Log N) ARITHMETIC STEPSMIT-LCS-TM-091Shamir, AdiNo Group Specified11-1-1977
AN ANALYSIS OF COMPUTER DECENTRALIZATIONMIT-LCS-TM-090d'Oliveira, Cecilia R.No Group Specified10-1-1977
MEASURING USER CHARACTERISTICS ON THE MULTICS SYSTEMMIT-LCS-TM-089Rodriguez, Humbert Jr.No Group Specified5-1-1977
ON TRIANGULATIONS OF A SET OF POINTS IN THE PLANEMIT-LCS-TM-088Lloyd, Errol L.No Group Specified7-1-1977
ANCILLARY REPORTS: KERNEL DESIGN PROJECTMIT-LCS-TM-087Clark, David D.No Group Specified6-1-1977
AN OVERVIEW OF OWL, A LANGUAGE FOR KNOWLEDGE REPRESENTATIONMIT-LCS-TM-086Szolovits, PeterNo Group Specified6-1-1977
FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHSMIT-LCS-TM-085Shamir, AdiNo Group Specified6-1-1977
THE MUTUAL EXCLUSION PROBLEM FOR UNRELIABLE PROCESSESMIT-LCS-TM-084Rivest, RonaldNo Group Specified4-1-1977
CONSTRUCTION AND ANALYSIS OF NETWORK FLOW PROBLEM WHICH FORCES KARZANOV ALGORITHM TO 0(h3) RUNNING TIMEMIT-LCS-TM-083Baratz, Alan E.No Group Specified5-1-1977
A METHOD FOR OBTAINING DIGITAL SIGNATURES AND PUBLIC-KEY CRYPTOSYSTEMSMIT-LCS-TM-082Rivest, RonaldNo Group Specified4-1-1977
HARDWARE ESTIMATION OF A PROCESS PRIMARY MEMORY REQUIREMENTSMIT-LCS-TM-081Gifford, David K.No Group Specified1-1-1977
THE MAX FLOW ALGORITHM OF DINIC AND KARZANOV: AN EXPOSITIONMIT-LCS-TM-080Even, ShimonNo Group Specified12-1-1976
A SYSTEM TO PROCESS DIALOGUE: A PROGRESS REPORTMIT-LCS-TM-079Brown, Gretchen P.No Group Specified10-1-1976
IMPROVING INFORMATION STORAGE RELIABILITY USING A DATA NETWORKMIT-LCS-TM-078Benjamin, Arthur J.No Group Specified10-1-1976
TASK SCHEDULING IN THE CONTROL ROBOTICS ENVIRONMENTMIT-LCS-TM-077Mok, Aloysius Ka-LauNo Group Specified9-1-1976
A NOTE ON THE AVERAGE TIME TO COMPUTE TRANSITIVE CLOSURESMIT-LCS-TM-076Bloniarz, P.A.No Group Specified9-1-1976
K+1 HEADS ARE BETTER THAN KMIT-LCS-TM-075Yao, Andrew C.No Group Specified9-1-1976
THE DESIGN OF A MODULAR LABORATORY FOR CONTROL ROBOTICSMIT-LCS-TM-074Malvania, NikhilNo Group Specified9-1-1976
OPTIMAL ARRANGEMENT OF KEYS IN A HASH TABLEMIT-LCS-TM-073Rivest, Ronald L.No Group Specified7-1-1976
PROTOSYSTEM I: AN AUTOMATIC PROGRAMMING SYSTEM PROTOTYPEMIT-LCS-TM-072Ruth, Gregory R.No Group Specified7-1-1976
ON THE WORST-CASE OF BEHAVIOR OF STRING-SEARCHING ALGORITHMSMIT-LCS-TM-071Rivest, Ronald L.No Group Specified4-1-1976
AUTOMATIC DESIGN OF DATA PROCESSING SYSTEMSMIT-LCS-TM-070Ruth, Gregory R.No Group Specified2-1-1976
IMPROVED BOUNDS ON THE COSTS OF OPTIMAL AND BALANCED BINARY SEARCH TREESMIT-LCS-TM-069Bayer, Paul J.No Group Specified11-1-1975
STREAM-ORIENTED COMPUTATION IN RECURSIVE DATA FLOW SCHEMASMIT-LCS-TM-068Weng, Kung-SongNo Group Specified10-1-1975
COMPUTATIONAL COMPLEXITY OF THE WORD PROBLEM FOR COMMUTATIVE SEMIGROUPSMIT-LCS-TM-067Cardoza, Edward W.No Group Specified10-1-1975
FORMAL PROPERTIES OF WELL-FORMED DATA FLOW SCHEMASMIT-LCS-TM-066Leung, Clement Kin ChoNo Group Specified6-1-1975
THE COMPLEXITY OF NEGATION-LIMITED NETWORKS- A BRIEF SURVEYMIT-LCS-TM-065Fischer, Michael J.No Group Specified6-1-1975
FINDING ISOMORPH CLASSES FOR COMBINATORIAL STRUCTURESMIT-LCS-TM-064Weiss, Randell B.No Group Specified6-1-1975
ENCRYPTION SCHEMES FOR COMPUTER CONFIDENTIALITYMIT-LCS-TM-063Pless, VeraNo Group Specified5-1-1975
AN ASYNCHRONOUS LOGIC ARRAYMIT-LCS-TM-062Patil, Suhas S.No Group Specified5-1-1975
FIRST VERSION OF A DATA FLOW PROCEDURE LANGUAGEMIT-LCS-TM-061Dennis, Jack B.No Group Specified5-1-1975
CAMAC: GROUP MANIPULATION SYSTEMMIT-LCS-TM-060Weiss, Randell B.No Group Specified3-1-1975
DECISION PROBLEMS FOR PETRI NETS AND VECTOR ADDITION SYSTEMSMIT-LCS-TM-059Hack, MichelNo Group Specified3-1-1975
DECIDABILITY OF EQUIVALENCE FOR A CLASS OF DATA FLOW SCHEMASMIT-LCS-TM-058Qualitz, Joseph E.No Group Specified3-1-1975
ON BATESON'S LOGICAL LEVELS OF LEARNING THEORYMIT-LCS-TM-057Levin, MichaelNo Group Specified2-1-1975
RESEARCH ON EXPERT SYSTEMSMIT-LCS-TM-056Gorry, G. AnthonyNo Group Specified12-1-1974
A CLASS OF BOOLEAN FUNCTIONS WITH LINEAR COMBINATIONAL COMPLEXITYMIT-LCS-TM-055Hsieh, W.N.No Group Specified10-1-1974
THE INHERENT COMPUTATIONAL COMPLEXITY OF THEORIES OF ORDERED SETS: A BRIEF SURVEYMIT-LCS-TM-054Meyer, Albert R.No Group Specified10-1-1974
MDC-PROGRAMMER: A MUDDLE-TO-DATALANGUAGE TRANSLATOR FOR INFORMATION RETRIEVALMIT-LCS-TM-053Bengelloun, Safwan A.No Group Specified6-1-1974
COMPUTING IN LOGARITHMIC SPACEMIT-LCS-TM-052Lind, John C.No Group Specified9-1-1974
AN INVESTIGATION OF CURRENT LANGUAGE SUPPORT FOR THE DATA REQUIREMENTS OF STRUCTURED PROGRAMMINGMIT-LCS-TM-051Aiello, Jack M.No Group Specified9-1-1974
AN ENCIPHERING MODULE FOR MULTICSMIT-LCS-TM-050Benedict, G. GordonNo Group Specified7-1-1974
COMPLETE CLASSIFICATION OF (24,12) AND (22,11) SELF-DUAL CODESMIT-LCS-TM-049Pless, VeraNo Group Specified6-1-1974
THE REDUCTION METHOD FOR ESTABLISHING LOWER BOUNDS ON THE NUMBER OF ADDITIONSMIT-LCS-TM-048Kedem, Zvi M.No Group Specified6-1-1974
MATHEMATICAL FOUNDATIONS OF FLIP-FLOPSMIT-LCS-TM-047Pless, VeraNo Group Specified6-1-1974
COMBINING DIMENSIONALITY AND RATE OF GROWTH ARGUMENTS FOR ESTABLISHING LOWER BOUNDS ON THE NUMBER OF MULTIPLICATIONSMIT-LCS-TM-046Kedem, Zvi M.No Group Specified6-1-1974
FAST ON-LINE INTEGER MULTIPLICATIONMIT-LCS-TM-045Fischer, Michael J.No Group Specified5-1-1974
SYMMETRY CODES AND THEIR INVARIANT SUBCODESMIT-LCS-TM-044Pless, VeraNo Group Specified2-1-1974
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETICMIT-LCS-TM-043Fischer, Michael J.No Group Specified2-1-1974
ON THE COMPLEXITY OF THE THEORIES OF WEAK DIRECT PRODUCTSMIT-LCS-TM-042Rackoff, CharlesNo Group Specified1-1-1974
STRING-MATCHING AND OTHER PRODUCTSMIT-LCS-TM-041Fischer, MIchael J.No Group Specified1-1-1974
AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATIONMIT-LCS-TM-040Paterson, Michael S.No Group Specified1-1-1974
DISCRETE COMPUTATION: THEORY AND OPEN PROBLEMSMIT-LCS-TM-039Meyer, Albert R.No Group Specified1-1-1974
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVEMIT-LCS-TM-038Meyer, Albert R.No Group Specified12-1-1973
REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINESMIT-LCS-TM-037Schonage, A.No Group Specified12-1-1973
A USER'S GUIDE TO THE MACRO CONTROL LANGUAGEMIT-LCS-TM-036Geiger, Steven P.No Group Specified12-1-1973
AN INTERACTIVE IMPLEMENTATION OF THE TODD-COXETER ALGORITHMMIT-LCS-TM-035Bonneau, Robert J.No Group Specified12-1-1973
POLYNOMIAL EXPONENTIATION: THE FAST FOURIER TRANSFORM REVISITEDMIT-LCS-TM-034Bonneau, Richard J.No Group Specified6-1-1973
A DECISION PROCEDURE FOR THE FIRST ORDER THEORY OF REAL ADDITION WITH ORDERMIT-LCS-TM-033Ferrante, JeanneNo Group Specified5-1-1973
AN OPERATOR EMBEDDING THEOREM FOR COMPLEXITY CLASSES OF RECURSIVE FUNCTIONSMIT-LCS-TM-032Moll, RobertNo Group Specified5-1-1973
A CLASS OF FINITE COMPUTATION STRUCTURES SUPPORTING THE FAST FOURIER TRANSFORMMIT-LCS-TM-031Bonneau, Richard J.No Group Specified3-1-1973
SIM360: A S/360 SIMULATIONMIT-LCS-TM-030McCray, W.M.No Group Specified5-1-1972
THE EMPTINESS PROBLEM FOR AUTOMATA ON INFINITE TREESMIT-LCS-TM-029Hossley, RobertNo Group Specified6-1-1972
CONSTRUCTION HEURISTICS FOR GEOMETRY AND A VECTOR ALGEBRA REPRESENTATION OF GEOMETRYMIT-LCS-TM-028Wong, R.No Group Specified6-1-1972
ECONOMY OF DESCRIPTIONS AND MINIMAL INDICESMIT-LCS-TM-027Bagchi, AmitavaNo Group Specified1-1-1972
HELPING PEOPLE THINKMIT-LCS-TM-025Goldstein, Robert C.No Group Specified4-1-1971
THE MACAIMS DATA MANAGEMENT SYSTEMMIT-LCS-TM-024Goldstein, Robert C.No Group Specified4-1-1971
THE RELATIONAL APPROACH TO THE MANAGEMENT OF DATA BASESMIT-LCS-TM-023Strnad, Alois J.No Group Specified4-1-1971
TRANSMISSION OF INFORMATION BETWEEN A MAN-MACHINE DECISION SYSTEM AND ITS ENVIRONMENTMIT-LCS-TM-022Wells, Douglas M.No Group Specified4-1-1971
THE SUBSTANTIVE USE OF COMPUTERS FOR INTELLECTUAL ACTIVITIESMIT-LCS-TM-021Goldstein, Robert C.No Group Specified4-1-1971
A COMPUTER MODEL OF SIMPLE FORMS OF LEARNINGMIT-LCS-TM-020Jones, T.L.No Group Specified1-1-1971
A NEW LIST-TRACING ALGORITHMMIT-LCS-TM-019Fenichel, Robert R.No Group Specified10-1-1970
AUTOMATIC CODE-GENERATION FROM AN OBJECT-MACHINE DESCRIPTIONMIT-LCS-TM-018Miller, Peter L.No Group Specified10-1-1970
COMPLEXITY MEASURES FOR PROGRAMMING LANGUAGESMIT-LCS-TM-017Goodman, Leonard I.No Group Specified9-1-1971
PSEUDO-RANDOM SEQUENCESMIT-LCS-TM-016Bruere - Dawson, GerardNo Group Specified10-1-1970
AN EXPANSION OF THE DATA STRUCTURING CAPABILITIES OF PALMIT-LCS-TM-015Zilles, Stephen N.No Group Specified10-1-1970
SUSPENSION OF PROCESSES IN A MULTIPROCESSING COMPUTER SYSTEMMIT-LCS-TM-014Vogt, Carla M.No Group Specified9-1-1970
USE OF HIGH LEVEL LANGUAGES FOR SYSTEMS PROGRAMMINGMIT-LCS-TM-013Graham, Robert M.No Group Specified9-1-1970
FILE MANAGEMENT AND RELATED TOPICS, JUNE 12, 1970MIT-LCS-TM-012Graham, Robert M.No Group Specified9-1-1970
DESCRIPTION AND FLOW CHART OF THE PDP-7/9 COMMUNICATIONS PACKAGEMIT-LCS-TM-011Ward, Philip W.No Group Specified7-1-1970
INTERACTIVE DESIGN COORDINATION FOR THE BUILDING INDUSTRYMIT-LCS-TM-010Jackson, James N.No Group Specified6-1-1970
horizontal line

MIT logo Computer Science and Artificial Intelligence Laboratory (CSAIL)
The Stata Center, Building 32 - 32 Vassar Street - Cambridge, MA 02139 - USA
tel:+1-617-253-0073 - publications@csail.mit.edu