Now showing items 1-20 of 108

    • 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.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 ...
    • 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.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, ...
    • 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 ...
    • 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 ...
    • 18.013A Calculus with Applications, Fall 2001 

      Kleitman, Daniel J. (2001-12)
      Differential calculus in one and several dimensions. Java applets and spreadsheet assignments. Vector algebra in 3D, vector- valued functions, gradient, divergence and curl, Taylor series, numerical methods and applications. ...
    • 22.00J / 1.021J / 3.021J / 10.333J / 18.361J / 2.030J / HST.558 Introduction to Modeling and Simulation, Spring 2002 

      Yip, Sidney; Powell, Adam C.; Bazant, Martin Z.; Carter, W. Craig; Marzari, Nicola; e.a. (2002-06)
      Basic concepts of computer modeling in science and engineering using discrete particle systems and continuum fields. Techniques and software for statistical sampling, simulation, data analysis and visualization. Use of ...
    • 18.441 Statistical Inference, Spring 2002 

      Hardy, Michael (2002-06)
      Reviews probability and introduces statistical inference. Point and interval estimation. The maximum likelihood method. Hypothesis testing. Likelihood-ratio tests and Bayesian methods. Nonparametric methods. Analysis of ...
    • 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 ...
    • 18.155 Differential Analysis, Fall 2002 

      Melrose, Richard B. (2002-12)
      Fundamental solutions for elliptic, hyperbolic and parabolic differential operators. Method of characteristics. Review of Lebesgue integration. Distributions. Fourier transform. Homogeneous distributions. Asymptotic methods.
    • 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.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.310 Principles of Applied Mathematics, Fall 2002 

      Kleitman, Daniel J. (2002-12)
      Principles of Applied Mathematics is a study of illustrative topics in discrete applied mathematics including sorting algorithms, information theory, coding theory, secret codes, generating functions, linear programming, ...
    • 18.385 Nonlinear Dynamics and Chaos, Fall 2002 

      Rosales, Rodolfo (2002-12)
      Nonlinear dynamics with applications. Intuitive approach with emphasis on geometric thinking, computational and analytical methods. Extensive use of demonstration software. Topics: Bifurcations. Phase plane. Nonlinear ...
    • 18.014 Calculus with Theory I, Fall 2002 

      Munkres, James; Lachowska, Anna (2002-12)
      18.014, Calculus with Theory, covers the same material as 18.01 (Calculus), but at a deeper and more rigorous level. It emphasizes careful reasoning and understanding of proofs. The course assumes knowledge of elementary ...
    • 18.100B Analysis I, Fall 2002 

      Melrose, Richard B. (2002-12)
      Two options offered, both covering fundamentals of mathematical analysis: convergence of sequences and series, continuity, differentiability, Riemann integral, sequences and series of functions, uniformity, interchange of ...
    • 18.06 Linear Algebra, Fall 2002 

      Strang, Gilbert (2002-12)
      Basic subject on matrix theory and linear algebra, emphasizing topics useful in other disciplines, including systems of equations, vector spaces, determinants, eigenvalues, similarity, and positive definite matrices. ...
    • 18.S34 Problem Solving Seminar, Fall 2002 

      Stanley, Richard P., 1944-; Rogers, H. (Hartley), 1926- (2002-12)
      This course is an undergraduate seminar on mathematical problem solving. It is intended for students who enjoy solving challenging mathematical problems and who are interested in learning various techniques and background ...
    • 18.085 Mathematical Methods for Engineers I, Fall 2002 

      Strang, Gilbert (2002-12)
      Review of linear algebra, applications to networks, structures, and estimation, Lagrange multipliers, differential equations of equilibrium, Laplace's equation and potential flow, boundary-value problems, minimum principles ...