Create New Account
Join the Academic Earth community! Already have an account? Sign in here
New! Join faster with your social account!
We will not share your information
Or enter your email and a password below:
We're Sorry
Please login to access this feature.
New to Academic Earth? community! Create an Account
Academic Earth
Welcome
Profile
Favorites (0)
Advanced Search
Logout
or Login | Create an Account
Forgot your password?
Subjects
Business
AccountingEntrepreneurshipFinanceManagementMarketingNegotiations
Computer Science
Applied CompSciArtificial IntelligenceInformation SecurityProgrammingSystems ArchitectureTheoretical CompSciVisualization & Graphics
Mathematics
AlgebraArithmeticCalculusGeometryStatisticsTrigonometry
Engineering
BiomedicalChemicalElectricalIndustrialMechanicalOther Engineering
Science
AstronomyBiologyChemistryEarth SciencesMedicine & HealthcarePhysics
Humanities
CommunicationsEducationEnvironmental StudiesHistoryLanguagesLiteraturePhilosophyReligious Studies
Social Science
AnthropologyEconomicsInternational RelationsLawLiberal StudiesPolitical SciencePsychologySociology
Art & Design
ArchitectureArt HistoryDesignFine ArtsMusic
Test Preparation
ACTGMATGRELSATMCATSAT
Universities Instructors Playlists Blog
searching...
...
Home Instructors Erik Demaine

Erik Demaine

Associate Professor, Department of Electrical Engineering and Computer Sciences, MIT; MacArthur Fellow, MIT

Harvard

Sort by:
Show:
Algorithms for Planar Graphs and Beyond Course

Algorithms for Planar Graphs and Beyond

MIT | Erik Demaine | Shay Mozes | Siamak Tazari | Christian Sommer

Static Trees: Least Common Ancestor, Range Minimum Queries, Level Ancestor Lecture Add to favorites

Static Trees: Least Common Ancestor, Range Minimum Queries, Level Ancestor

MIT | Erik Demaine

Dynamic Optimality: Independent Rectangle, Wilber, And Signed Greedy Lower Bounds; Key-Independent Optimality; O(Lg Lg N)-Competitive Tango Trees Lecture Add to favorites

Dynamic Optimality: Independent Rectangle, Wilber, And Signed Greedy Lower Bounds; Key-Independent Optimality; O(Lg Lg N)-Competitive Tango Trees

MIT | Erik Demaine

History of Memory Models: Idealized 2-Level, Red-Blue Pebble Game, External Memory, Hmm, Bt, (U)Mh, Cache Oblivious Lecture Add to favorites

History of Memory Models: Idealized 2-Level, Red-Blue Pebble Game, External Memory, Hmm, Bt, (U)Mh, Cache Oblivious

MIT | Erik Demaine

Integer: Sorting In Linear Time For W = O(Lg2+Ε N), Priority Queues Lecture Add to favorites

Integer: Sorting In Linear Time For W = O(Lg2+Ε N), Priority Queues

MIT | Erik Demaine

Memory Hierarchy: Models, Cache-Oblivious B-Trees Lecture Add to favorites

Memory Hierarchy: Models, Cache-Oblivious B-Trees

MIT | Erik Demaine

Dynamic Graphs: Ω(Lg N) Lower Bound For Dynamic Connectivity Lecture Add to favorites

Dynamic Graphs: Ω(Lg N) Lower Bound For Dynamic Connectivity

MIT | Erik Demaine

Class Overview, Pointer Machine, Partial Persistence, Full Persistence, Confluent Persistence, Functional Lecture Add to favorites

Class Overview, Pointer Machine, Partial Persistence, Full Persistence, Confluent Persistence, Functional

MIT | Erik Demaine

Integer: Fusion Trees: Sketching, Parallel Comparison, Most Significant Set Bit Lecture Add to favorites

Integer: Fusion Trees: Sketching, Parallel Comparison, Most Significant Set Bit

MIT | Erik Demaine

previous 1 | 2 | 3 next

About Harvard

Harvard University, founded in 1636, is America's oldest Ivy League university. Located in Cambridge, Massachusetts, Harvard consists of an undergraduate program, the College, as well as 13 other graduate level schools and institutes offering top-ranked programs in fields such as Medicine, Business, and Law. Notable alumni include former U.S. president Franklin Delano Roosevelt, poet Robert Frost, architect Frank Gehry, songwriter Leonard Bernstein, and comedian Conan O'Brien.

Explore Our Degree Programs
About UsFAQContactPrivacy PolicyTerms of Use
© 2013 Academic Earth. All rights reserved.