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 Reports

Click on the title of the document for more information. Click the column headers to sort by different fields.

Page 1 of 10 | First Page | Previous Page | Next Page | Last PageShow 10 | 25 | 50 | 100 per page
Publication Title LCS Document Number Publication Author LCS Group Publication Date
Automatic Software Upgrades for Distributed SystemsMIT-LCS-TR-1012Ajmani, SameerProgramming Methodology11-30-2005
Accurate and Scalable Surface Representation and Reconstruction from ImagesMIT-LCS-TR-1011Zeng, GangComputer Graphics11-18-2005
On Field Constraint AnalysisMIT-LCS-TR-1010Wies, ThomasComputer Architecture11-3-2005
Towards Realizing the Performance and Availability Benefits of a Global Overlay NetworkMIT-LCS-TR-1009Rahul, HariharanNetworks and Mobile Systems11-1-2005
Using Cyclic Memory Allocation to Eliminate Memory LeaksMIT-LCS-TR-1008Nguyen, Huu HaiComputer Architecture10-26-2005
Knowledge Flow Analysis for Security ProtocolsMIT-LCS-TR-1007Torlak, EminaSoftware Design10-19-2005
Victim Migration: Dynamically Adapting Between Private and Shared CMP CachesMIT-LCS-TR-1006Zhang, MIchaelComputer Architecture10-10-2005
Automatic Software Upgrades for Distributed SystemsMIT-LCS-TR-1005Ajmani, SameerProgramming Methodology10-6-2005
Automatic Software Upgrades for Distributed Systems (PhD thesis)MIT-LCS-TR-1004Ajmani, SameerProgramming Methodology10-6-2005
Secondary Structure Prediction of All-Helical Proteins Using Hidden Markov Support Vector MachinesMIT-LCS-TR-1003Gassend, B.Computation Structures10-6-2005
Combining diagrammatic and symbolic reasoningMIT-LCS-TR-1002Arkoudas, KonstantineProgram Analysis10-6-2005
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer ProtocolMIT-LCS-TR-1001Canetti, RanTheory of Distributed Systems8-19-2005
Using Probabilistic I/O Automata to Analyze an Oblivious TransferMIT-LCS-TR-1001aCanetti, RanTheory of Distributed Systems12-14-2005
Slicing the Onion: Anonymous Routing Without PKIMIT-LCS-TR-1000Katti, SachinNetworks and Mobile Systems8-15-2005
Self-Stabilizing Mobile Node Location Management and MessageMIT-LCS-TR-999Dolev, ShlomiTheory of Distributed Systems8-11-2005
Implementing Probabilistically Checkable Proofs of ProximityMIT-LCS-TR-998Bhattacharyya, ArnabComplexity Theory8-8-2005
On Algorithms and Complexity for Sets with Cardinality ConstraintsMIT-LCS-TR-997Marnette, BrunoComputer Architecture8-3-2005
How to Construct a Correct and Scalable iBGP ConfigurationMIT-LCS-TR-996Vutukuru, MythiliNetworks and Mobile Systems8-3-2005
Proving Atomicity: An Assertional ApproachMIT-LCS-TR-995Chockler, GregoryTheory of Computation7-22-2005
Byzantine Clients Rendered HarmlessMIT-LCS-TR-994Liskov, BarbaraProgramming Methodology7-21-2005
Etna: a Fault-tolerant Algorithm for Atomic Mutable DHT DataMIT-LCS-TR-993Muthitacharoen, AthichaParallel and Distributed Operating Systems6-15-2005
Autonomous Virtual Mobile NodesMIT-LCS-TR-992Dolev, ShlomiTheory of Computation6-15-2005
Automatic Test Factoring for JavaMIT-LCS-TR-991Saff, DavidProgram Analysis6-8-2005
Theoretical Analysis of Geographic Routing in Social NetworksMIT-LCS-TR-990Kumar, RaviTheory of Computation6-3-2005
A Region-based Architecture for Service-Providing Distributed SystemsMIT-LCS-TR-989Singh, NehaAdvanced Network Architecture5-17-2005
Efficient, Verifiable Binary Sandboxing for a CISC ArchitectureMIT-LCS-TR-988McCamant, StephenProgram Analysis5-2-2005
De-Emphasis of Distracting Image Regions Using Texture Power MapsMIT-LCS-TR-987Su, Sara L.Computer Graphics4-12-2005
Motion Coordination Using Virtual NodesMIT-LCS-TR-986Lynch, NancyTheory of Computation4-6-2005
On Relational Analysis of Algebraic DatatypesMIT-LCS-TR-985Kuncak, ViktorComputer Architecture4-5-2005
Wait-free Regular Storage from Byzantine ComponentsMIT-LCS-TR-984Abraham, IttaiTheory of Distributed Systems4-5-2005
Matrix Approximation and Projective Clustering via Iterative SamplingMIT-LCS-TR-983Rademacher, LuisAlgorithms3-29-2005
Impossibility of boosting distributed service resilienceMIT-LCS-TR-982Attie, PaulTheory of Computation2-25-2005
Stable Policy Routing with Provider IndependenceMIT-LCS-TR-981Feamster, NickNetworks and Mobile Systems2-8-2005
Consensus in Wireless Ad Hoc NetworksMIT-LCS-TR-980Chockler, G.Theory of Computation2-8-2005
Virtual Stationary Automata for Mobile NetworksMIT-LCS-TR-979Dolev, ShlomiTheory of Computation1-21-2005
How Much of a Hypertree can be Captured by Windmills?MIT-LCS-TR-978Liang, PercyAlgorithms1-3-2005
A Dynamic Data Structure for Checking HyperacyclicityMIT-LCS-TR-977Liang, PercyAlgorithms1-3-2005
Machine-Checkable Correctness Proofs forIntra-procedural Dataflow AnalysesMIT-LCS-TR-976Salcianu, AlexandruProgram Analysis12-16-2004
On Decision Procedures for Set-Value FieldsMIT-LCS-TR-975Kuncak, ViktorComputer Architecture11-30-2004
Availability-Consistency Trade-Offs in a Fault-Tolerant Stream Processing SystemMIT-LCS-TR-974Balazinska, MagdalenaNetworks and Mobile Systems11-22-2004
Capacity Allocation in Wireless LANsMIT-LCS-TR-973Tan, GodfreyNetworks and Mobile Systems11-12-2004
The Quorum Deployment ProblemMIT-LCS-TR-972Gilbert, SethTheory of Computation10-29-2004
Managing the 802.11 Energy/Performance Tradeoff with Machine LearningMIT-LCS-TR-971Monteleoni, ClaireNetworks and Mobile Systems10-27-2004
On Spatial Conjunction as Second-Order LogicMIT-LCS-TR-970Kuncak, ViktorComputer Architecture10-25-2004
Botz-4-Sale: Surviving Organized DDoS Attacks that Mimic Flash CrowdsMIT-LCS-TR-969Kandula, SrikanthNetworks and Mobile Systems10-22-2004
Eclat: Automatic Generation and Classification of Test InputsMIT-LCS-TR-968Pacheo, CarlosProgram Analysis10-14-2004
NIRA: A New Internet Routing ArchitectureMIT-LCS-TR-967Yang, XiaoweiAdvanced Network Architecture10-14-2004
Implementing Asynchronous Distributed Systems Using the IOA ToolkitMIT-LCS-TR-966Georgiou, ChryssisTheory of Computation10-6-2004
On Our Experience with Modular Pluggable AnalysesMIT-LCS-TR-965Lam, PatrickComputer Architecture10-4-2004
Comparing Network Coding with Multicommodity Flow for the k-pairs Communication ProblemMIT-LCS-TR-964Harvey, Nicholas J.11-24-2004
EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State ManagementMIT-LCS-TR-963Leong, BenProgramming Methodology8-13-2004
Byzantine Fault Tolerance in Long-Lived SystemsMIT-LCS-TR-962Rodrigues, RodrigoProgramming Methodology8-13-2004
IOA User Guide and Reference ManualMIT-LCS-TR-961Garland, StephenTheory of Computation7-20-2004
Systematic Removal of Nondeterminism for Code Generation in I/O AutomataMIT-LCS-TR-960Vaziri, MandanaTheory of Computation7-19-2004
Definition and Expansion of Composite Automata in IOAMIT-LCS-TR-959Tauber, Joshua A.Theory of Computation7-19-2004
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger ArithmeticMIT-LCS-TR-958Kuncak, ViktorComputer Architecture7-19-2004
Dynamically Resizable Static CMOS Logic for Fine-Grain LeakageMIT-LCS-TR-957Heo, SeongmooComputer Architecture7-12-2004
Middleboxes No Longer Considered HarmfulMIT-LCS-TR-954Walfish, MichaelNetworks and Mobile Systems6-24-2004
The Architecture of MAITA: A Tool for Monitoring, Analysis, and InterpretationMIT-LCS-TR-951Jon, DoyleClinical Decision Making5-18-2004
Data Structure Repair Using Goal-Directed ReasoningMIT-LCS-TR-950Demsky, BrianComputer Architecture5-18-2004
A Combined Pointer and Purity Analysis for Java ProgramsMIT-LCS-TR-949Salcianu, AlexandruComputer Architecture5-17-2004
Verifying the Correctness of Wide-Area Internet RoutingMIT-LCS-TR-948Feamster, NickNetworks and Mobile Systems5-17-2004
Video MatchingMIT-LCS-TR-947Sand, PeterComputer Graphics5-11-2004
On Verifying a File System ImplementationMIT-LCS-TR-946Arkoudas, KonstantineComputer Architecture5-6-2004
M&M: A Passive Toolkit for Measuring, Correlating, and Tracking Path CharacteristicsMIT-LCS-TR-945Katti, SachinNetworks and Mobile Systems4-14-2004
A Quantitative Comparison of Reconfigurable, Tiled, and Conventional Architectures on Bit-level ComputationMIT-LCS-TR-944Wentzlaff, DavidComputer Architecture4-13-2004
Long-Lived Rambo: Trading Knowledge for CommunicationMIT-LCS-TR-943Georgiou, ChryssisTheory of Computation4-12-2004
On Generalized Records and Spatial Conjunction in Role LogicMIT-LCS-TR-942Kuncak, ViktorComputer Architecture4-6-2004
Predicting Problems Caused by Component UpgradesMIT-LCS-TR-941McCamant, StephenProgram Analysis3-30-2004
Converting Java Programs to Use Generic LibrariesMIT-LCS-TR-940Donovan, AlanProgram Analysis3-30-2004
REED: Robust, Efficient Filtering and Event Detection in Sensor NetworksMIT-LCS-TR-939Abadi, Daniel J.3-22-2004
Predicting Unroll Factors Using Nearest NeighborsMIT-LCS-TR-938Stephenson, Mark3-22-2004
Virtual Mobile Nodes for Mobile Ad Hoc NetworksMIT-LCS-TR-937Dolev, ShlomiTheory of Computation2-26-2004
MultiChord: A Resilient Namespace Management ProtocolMIT-LCS-TR-936Lynch, NancyTheory of Computation2-19-2004
Enhancing Availability and Security Through Failure-Oblivious ComputingMIT-LCS-TR-935Rinard, MartinComputer Architecture2-6-2004
Light-Weight Leases for Storage-Centric Coordination MIT-LCS-TR-934Chockler, GregoryTheory of Computation4-22-2004
On Modular Pluggable Analyses Using Set InterfacesMIT-LCS-TR-933Lam, PatrickComputer Architecture12-18-2003
Rosebud: A Scalable Byzantine-Fault-Tolerant Storage ArchitectureMIT-LCS-TR-932Rodrigues, RodrigoProgramming Methodology12-17-2003
Finding Longest Increasing and Common Subsequences in Streaming DataMIT-LCS-TR-931Liben-Nowell, David11-26-2003
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52MIT-LCS-TR-929Hajiaghayi, MohammadTaghiTheory of Computation11-20-2003
Efficient Specification-Assisted Error Localization and CorrectionMIT-LCS-TR-927Demsky, BrianComputer Architecture11-13-2003
Scalable Internet Routing on Topology-Independent Node IdentitiesMIT-LCS-TR-926Ford, Bryan10-31-2003
On Role LogicMIT-LCS-TR-925Kuncak, ViktorComputer Architecture10-24-2003
Generating Trees of (Reducible) 1324-avoiding PermutationsMIT-LCS-TR-924Marinov, Darko10-9-2003
A Correctness Proof for a Byzantine-Fault-Tolerant Read/Write Atomic Memory with Dynamic Replica MembershipMIT-LCS-TR-920Rodrigues, RodrigoProgramming Methodology9-25-2003
Correlated Equilibrium Via Stable Pre-PlayMIT-LCS-TR-918Lepinski, MatthewCryptography and Information Security6-30-2003
The Theory of Timed I/O AutomataMIT-LCS-TR-917Kaynar, Dilsun K.Theory of Computation8-27-2003
The Theory of Timed I/O AutomataMIT-LCS-TR-917aKaynor, Dilsun K.Theory of Computation3-2-2005
On The Boolean Algebra of Shape Analysis ConstraintsMIT-LCS-TR-916Kuncak, ViktorComputer Architecture8-22-2003
A Reliable Broadcast Scheme for Sensor NetworksMIT-LCS-TR-915Livadas, CarolosTheory of Computation8-11-2003
Selecting Refining and Evaluating Properties for Program AnalysisMIT-LCS-TR-914Dodoo, NiiProgram Analysis7-21-2003
Marriage, Honesty, and StabilityMIT-LCS-TR-913Immorlica, NicoleTheory of Computation7-28-2003
Secure Program Execution Via Dynamic Information Flow TrackingMIT-LCS-TR-912Suh, G. EdwardComputation Structures7-21-2003
New Algorithms for Load Balancing in Peer-to-Peer SystemsMIT-LCS-TR-911Karger, DavidTheory of Computation7-16-2003
On the Max-Flow Min-Cut Ratio for Directed Multicommodity FlowsMIT-LCS-TR-910Hajiaghayi, MohammadTaghiTheory of Computation7-5-2003
Bandwidth Management in Wireless Sensor NetworksMIT-LCS-TR-909Hull, BretNetworks and Mobile Systems4-8-2003
Computer-Enforced Immutability for the Java LanguageMIT-LCS-TR-908Birka, AdrianProgram Analysis6-30-2003
Compositionality for Probabilistic AutomataMIT-LCS-TR-907Lynch, NancyTheory of Computation6-30-2003
On a Recursive Spectral Algorithm for Clustering from Pairwide SimilaritiesMIT-LCS-TR-906Cheng, DavidTheory of Computation5-27-2003
Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-minor-free GraphsMIT-LCS-TR-905Demaine, ErikTheory of Computation6-5-2003
Page 1 of 10 | First Page | Previous Page | Next Page | Last PageShow 10 | 25 | 50 | 100 per page
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