Now showing items 1-20 of 123

    • 6.854J / 18.415J Advanced Algorithms, Fall 1999 

      Karger, David (1999-12)
      A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...
    • 6.002 Circuits and Electronics, Fall 2000 

      Lang, Jeffrey (Jeffrey H.); Agarwal, Anant (2000-12)
      Fundamentals of the lumped circuit abstraction. Resistive elements and networks; independent and dependent sources; switches and MOS devices; digital abstraction; amplifiers; and energy storage elements. Dynamics of first- ...
    • 6.046J / 18.410J Introduction to Algorithms, Fall 2001 

      Demaine, Erik D.; Leiserson, Charles Eric; Lee, Wee Sun (2001-12)
      Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph ...
    • 6.852J / 18.437J Distributed Algorithms, Fall 2001 

      Lynch, Nancy A. (Nancy Ann), 1948- (2001-12)
      Design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks. Process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, ...
    • 6.170 Laboratory in Software Engineering, Fall 2001 

      Jackson, Daniel; Devadas, Srinivas (2001-12)
      Introduces concepts and techniques relevant to the production of large software systems. Students taught a programming method based on the recognition and description of useful abstractions. Topics: modularity; specification; ...
    • 6.763 Applied Superconductivity, Fall 2001 

      Orlando, Terry P.; Segall, Kenneth J. (2001-12)
      Phenomenological approach to superconductivity, with emphasis on superconducting electronics. Electrodynamics of superconductors, London's model, and flux quantization. Josephson Junctions and superconducting quantum ...
    • 18.405J / 6.841J Advanced Complexity Theory, Fall 2001 

      Spielman, Daniel (2001-12)
      The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no ...
    • 18.335J / 6.337J Numerical Methods of Applied Mathematics I, Fall 2001 

      Stefanica-Nica, Dan Octavian (2001-12)
      IEEE-standard, iterative and direct linear system solution methods, eigendecomposition and model-order reduction, fast Fourier transforms, multigrid, wavelets and other multiresolution methods, matrix sparsification. ...
    • 6.854J / 18.415J Advanced Algorithms, Fall 2001 

      Goemans, Michel (2001-12)
      A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...
    • 6.542J / 24.966J / HST.712J Laboratory on the Physiology, Acoustics, and Perception of Speech, Fall 2001 

      Stevens, Kenneth N., 1924-; Perkell, Joseph S.; Shattuck, Stefanie Rumrill; Hanson, Helen M.; Slifka, Janet Louise Khoenle, 1964- (2001-12)
      Experimental investigations of speech processes. Topics: measurement of articulatory movements; measurements of pressures and airflows in speech production; computer-aided waveform analysis and spectral analysis of speech; ...
    • 1.203J / 6.281J / 13.665J / 15.073J / 16.76J / ESD.216J Logistical and Transportation Planning Methods, Fall 2001 

      Barnett, Arnold; Larson, Richard C., 1943-; Odoni, Amedeo R. (2001-12)
      Quantitative techniques of operations research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, and pickup and delivery systems) and in the planning and design of logistically ...
    • 6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002 

      Rivest, Ronald L. (2002-06)
      Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite representation of infinite objects. Finite automata and regular languages. Context-free languages. Turing machines. Partial ...
    • 6.823 Computer System Architecture, Spring 2002 

      Asanovic, Krste; Arvind, V.; Devadas, Srinivas; Hoe, James C. (James Chu-Yue) (2002-06)
      Emphasizes the relationship among technology, hardware organization, and programming systems in the evolution of computer architecture. Pipelined, out-of-order, and speculative execution. Superscaler, VLIW, vector, and ...
    • 6.805J / 6.806 / STS.085 Ethics and Law on the Electronic Frontier, Spring 2002 

      Abelson, Harold; Zittrain, Jonathan (2002-06)
      The interaction between law, policy, and technology as they relate to the evolving controversies over control of the Internet. Topics include: intellectual property and copyright control, privacy and government surveillance, ...
    • 6.720J / 3.43J Integrated Microelectronic Devices, Fall 2002 

      Del Alamo, Jesus; Tuller, Harry L. (2002-12)
      The physics of microelectronic semiconductor devices for silicon integrated circuit applications. Topics: semiconductor fundamentals, p-n junction, metal-oxide semiconductor structure, metal-semiconductor junction, MOS ...
    • 6.042J / 18.062J Mathematics for Computer Science (SMA 5512), Fall 2002 

      Nagpal, Radhika; Meyer, Albert R. (2002-12)
      This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, ...
    • 18.404J / 6.840J Theory of Computation, Fall 2002 

      Sipser, Michael (2002-12)
      A more extensive and theoretical treatment of the material in 6.045J/18.400J, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, ...
    • 6.302 Feedback Systems, Fall 2002 

      Lundberg, Kent H.; Roberge, Jim; Leeb, Steven B. (2002-12)
      Introduction to design of feedback systems. Properties and advantages of feedback systems. Time-domain and frequency-domain performance measures. Stability and degree of stability. Nyquist criterion. Frequency-domain design. ...
    • 6.101 Introductory Analog Electronics Laboratory, Fall 2002 

      Roscoe, Byron M. (2002-12)
      Introductory experimental laboratory explores the design, construction, and debugging of analog electronic circuits. Lectures and six laboratory projects investigate the performance characteristics of diodes, transistors, ...
    • 6.034 Artificial Intelligence, Fall 2002 

      Winston, Patrick Henry (2002-12)
      Introduces representations, techniques, and architectures used to build applied systems and to account for intelligence from a computational point of view. Applications of rule chaining, heuristic search, constraint ...