introduction to algorithms massachusetts institute of technology professors erik demaine

6

Introduction to Algorithms March 18, 2004 Massachusetts Institute of T echnology 6.046J/18.410J Professors Erik Demaine and Shaﬁ Goldwasser Handout 14 Lecture Notes on Skip Lists Lecture 12 — March 18, 2004 Erik Demaine Balanced tree structures we know at this point: B-trees, red-black trees, treaps. Could you implement them right now? Probably, with time... but witho ut looking up any detai ls in a book? Skip lists are a simple randomized structure you’ll never forget. Starting from scratch Initial goal: just searches — ignore updates (Insert/Delete) for now Simplest data structure: linked list Sorted linked list: time 2 sorted linked lists: – Each element can appear in 1 or both lists – How to speed up search ? – Idea: Express and local subway lines – Example: 14 , 23, 34 , 42 , 5 0, 5 9, 6 6, 72 , 79, 86, 96 , 1 03, 110, 116, 125 (What is this sequence?) – Boxe d valu es are “express” stops; ot hers are normal stops – Can quickly jump from express stop to next express stop, or from any stop to next normal stop – Repre sented as two linked lists , one for express stops and one for all stops: 14 14 23 34 42 72 96 34 42 72 96 50 59 66 79 86 103 110 116 125 – Every element is in linked list 2 (LL2); some elements also in linked list 1 (LL1) – Link equal elements between the two levels – To search, ﬁrst search in LL1 until about to go too far, then go down and search in LL2

Upload: sonal

Post on 30-May-2018

221 views

Category:

Documents

1 download

Report

Download

Embed Size (px):

TRANSCRIPT

Page 1: Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

8/14/2019 Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

http://slidepdf.com/reader/full/introduction-to-algorithms-massachusetts-institute-of-technology-professors 1/6

Page 2: Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

8/14/2019 Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

http://slidepdf.com/reader/full/introduction-to-algorithms-massachusetts-institute-of-technology-professors 2/6

Page 3: Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

8/14/2019 Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

http://slidepdf.com/reader/full/introduction-to-algorithms-massachusetts-institute-of-technology-professors 3/6

Page 4: Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

8/14/2019 Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

http://slidepdf.com/reader/full/introduction-to-algorithms-massachusetts-institute-of-technology-professors 4/6

Page 5: Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

8/14/2019 Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

http://slidepdf.com/reader/full/introduction-to-algorithms-massachusetts-institute-of-technology-professors 5/6

Page 6: Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

8/14/2019 Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine

http://slidepdf.com/reader/full/introduction-to-algorithms-massachusetts-institute-of-technology-professors 6/6

Folding and Unfolding - Erik Demaineerikdemaine.org/papers/dthesis/paper.pdf · 2001. 11. 17. · Folding and Unfolding by Erik D. Demaine Athesis presentedtotheUniversityofWaterloo

1 Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 20 Prof. Erik Demaine

1 Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 17 Prof. Erik Demaine

Part II: Paper b: One-Cut Theorem Joseph ORourke Smith College (Many slides made by Erik Demaine)

Part I: Linkages c: Locked Chains Joseph ORourke Smith College (Many slides made by Erik Demaine)

Retroactive Data Structures - Erik Demaine

Picture-Hanging Puzzles - arXiv · PDF filePicture-Hanging Puzzles Erik D. Demaine yMartin L. Demaine Yair N. Minskyz Joseph S. B. Mitchellx Ronald L. Rivesty Mihai P atra˘scu{Abstract

Prof. Erik Demaine Spring ’12 Scribe Notes Collection · Prof. Erik Demaine Spring ’12 Scribe Notes Collection TA: Tom Morgan, Justin Zhang Editing: Justin Zhang. Contents 1 1

Part II: Paper a: Flat Origami Joseph ORourke Smith College (Many slides made by Erik Demaine)

Prof. Erik Demaine Spring ’12 Scribe Notes Collectioncourses.csail.mit.edu/6.851/spring14/scribe/2012scribes.pdfMIT 6.851 Advanced Data Structures Prof. Erik Demaine Spring ’12

When Can You Fold a Map? - Erik Demaine

Origami Lab / Tachi Lab - Rigid Flattening of Polyhedra with …origami.c.u-tokyo.ac.jp/~tachi/cg/ACDDHLT2017Slit.pdfZachary Abel, Robert Connelly, Erik D. Demaine, Martin L. Demaine,

September 26, 2005Copyright © 2001-5 Erik D. Demaine and Charles E. Leiserson L5.1 Introduction to Algorithms 6.046J/18.401J Prof. Erik Demaine LECTURE5

Final Exam - courses.csail.mit.edu · Introduction to Algorithms May 19, 2011 Massachusetts Institute of Technology 6.006 Spring 2011 Professors Erik Demaine, Piotr Indyk, and Manolis

lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence

Fun with Fonts: Algorithmic Typography1Fun with Fonts: AlgorithmicTypographyI Erik D. Demaine a, Martin L. Demaine aMIT CSAIL, 32 Vassar St., Cambridge, MA 02139 Abstract Over the

On Rolling Cube Puzzles - Logic Mazes · On Rolling Cube Puzzles Kevin Buchin ∗Maike Buchin Erik D. Demaine† Martin L. Demaine† Dania El-Khechen‡ S´andor P. Fekete§ Christian

Prof. Erik Demainecourses.csail.mit.edu/6.006/spring11/lectures/lec02.pdf · 2011-02-03 · Lecture 2: Peak Finding Prof. Erik Demaine. Today • Peak finding (new problem) – 1D

Fun with Fonts: Algorithmic Typography - Erik Demaineerikdemaine.org/papers/Fonts_FUN2014/paper.pdf · 2014. 4. 7. · Fun with Fonts: Algorithmic Typography Erik D. Demaine and Martin

1 Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 18 Prof. Erik Demaine

Folding Martin Gardner - Gathering 4 Gardner · Folding Martin Gardner Erik D. Demaine Martin L. Demaine The 2200 2800print shown on the next page (\Martin Gardner", Rives paper,

Lecture 4 NotesLecture 4 Notes Author Demaine, Erik Created Date 2/28/2012 12:57:49 PM

Erik D. Demaine

Erik and Martin Demaine apply mathematical rigor to uncommon

Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 2 Prof. Erik Demaine

Conveyer-Belt Alphabet - Erik Demaineerikdemaine.org/papers/ConveyerAlphabet_Elasticity/paper.pdfConveyer-Belt Alphabet Erik D. Demaine Martin L. Demaine Bel en Palopy Mathematics

Introduction to the Study of Law Professors Lisa Dufraimont and Erik Knutsen (2012)

Fun with Fonts: Algorithmic Typography1 - Erik …erikdemaine.org/papers/Fonts_TCS/paper.pdfFun with Fonts: Algorithmic TypographyI Erik D. Demaine a, Martin L. Demaine aMIT CSAIL,

New Bounds on Optimal Binary Search Trees Dion - Erik Demaine

An Algorithmic Approach to Social Networks - Erik Demaine

Folding & Unfolding in Computational Geometry: Introduction Joseph ORourke Smith College (Many slides made by Erik Demaine)

ºp ¯ T ¤ Ø .hirata/folding/130729-hirata.pdf · 2013-07-29 · ß Y >Ò° Demaine-O'Rourke w hh ç°æ¶Ü:¶·ÛÆ z 2009 åz 1Dø 9 ß Y Erik Demaine & Joseph OÕRourke Geometric

The Theory and Practice of Origami Erik Demaine M.I.T

thesis - Erik Demaine

Cache-Oblivious B-Trees Michael A. Bender, Erik D. Demaine, Martin Farach-Colton. Presented by: Itai Lahan