Lossless faulttolerant data structures with additive. Classes and teaching by erik demaine want video lectures. Cacheoblivious algorithms and data structures erik d. Lazy evaluation and snotation, amortization and persistence via lazy evaluation, eliminating amortization, lazy rebuilding, numerical representations, datastructural bootstrapping, implicit. Linked lists, stacks, queues, priority queues, heaps. For data structures in specific, you can go through following courses.
For everyone interested in this, i would like to recommend the mit advanced data structures course, by prof. Invited to special issue of acm transactions on algorithms. Adam smith data structures and algorithms cmpsc 465 lecture 24 balanced search trees redblack trees 41812 a. Interpolation search for nonindependent data, with erik demaine and thouis jones. Demaine s research interests span much of theoretical computer science and mathematics, in particular with connections to algorithms. We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. In particular, we begin with general background in combinatorial game theory, which analyzes ideal play in perfectinformation games, and. Erik demaines hedrick lectures at augusts mathfest gave a delightful and masterful summary overview of how mathematics has been applied to novel areas of geometry, such as origami, linkages, hinged dissections, and transformer figures. Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. Among these 2263 common developments, there is only one pear development 1. Cacheoblivious algorithms and data structures erikd. Data structures play a central role in modern computer science.
Fundamentals of data structure, simple data structures, ideas for algorithm design, the table data type, free storage management, sorting, storage on external media, variants on the set data type, pseudorandom numbers, data compression, algorithms on graphs, algorithms on strings and geometric. In computational geometry and data structures he has solved or made significant progress on classic problems such as the carpenters rule problem, the. Confluently persistent tries for efficient version control, by erik d. More generally, we characterize the possible boolean functions characterizing. This construction makes for some fun mathematical magic performances. He herbert edelsbrunner graduate level notes with detailed technical explanations. The purpose of this paper is to provide an overview of the area to encourage further research.
Erik demaine, is a paradigm which can be used to store information about the development of a data structure so that we could easily perform any operation on the host data structure at any point of time. A persistent data structure maintains several versions of a data structure, and. The idea of retroactive data structures is related at a high level to the classic notion of persistent data structures because they both consider the notion of time, but otherwise they di. Erik demaine, born in 1981, has made outstanding contributions in several fields of algorithms, namely computational geometry, data structures, graph algorithms and recreational algorithms. Demaine, cacheoblivious algorithms and data structures, in lecture notes from the eef summer school on massive data sets, brics, university of aarhus, denmark, june 27july 1, 2002 abstract. Despite decades of research, the most funda mental question. Lower bound techniques for data structures by mihai p atra.
And gone you in fact need a book to read, choose this design and analysis of algorithms for cs2251 as fine reference. He specializes in computational origamithe geometry of paper folding. Algorithms for planar graphs and beyond fall 2011 6. The part of the course about cache oblivious data structures starts on this lecture.
Advanced data structures spring 2007 lecture 5 february 26, 2007 prof. Professor of electrical engineering and computer science, massachusetts institute of technology. From the age of 7, he was identified as a child prodigy and spent time traveling across north. Feb 06, 2018 for everyone interested in this, i would like to recommend the mit advanced data structures course, by prof. Erik demaine center for future civic media, massachusetts. Algorithms, combinatorics and logic dagstuhl seminar 121, authorerik d. It is going to depend on what level of education you currently have and how thorough you want to be. Dil07 defined two classes of retroactive data structures. Cop 5536 advanced data structures, prof sahni ufl 4 all above courses focus on ideas than on mathematical rigour. Erik demaine s hedrick lectures at augusts mathfest gave a delightful and masterful summary overview of how mathematics has been applied to novel areas of geometry, such as origami, linkages, hinged dissections, and transformer figures. Data structures dagstuhl seminar lars arge 1, erik demaine 2 and raimund seidel 3 1 univ. More generally, we characterize the possible boolean. Major research foci include discrete and computational geometry particularly folding and unfolding of linkages, paper, polyhedra, and proteins, advanced data structures, graph algorithms, and recreational.
Ml michael littman low level undergraduate lecture notes. Katherine lai 1 overview in the last lecture we discussed the linkcut tree. Both of these data structures are functional, which is a stronger property than. Introduction to algorithms electrical engineering and. Construct a graph g with a vertex for each block, and an edge between the the block contain ing each parenthesis and the block containing its match. Intro to graphs, adjacency lists and adjacency arrays. In abel, demaine, demaine, matsui, rote, uehara 2011 the number of common developments of area 22 that fold into two boxes of size 1. Cacheoblivious algorithms perform well on a multilevel memory. Arecent direction in thedesign of cacheecient anddiskecient algorithms and data structures is the notion of cacheobliviousness,introducedbyfrigo,leiserson,prokop,andramachandranin 1999. This course provides an introduction to mathematical modeling of computational problems. Fundamentals of data structure, simple data structures, ideas for algorithm design, the table data type, free storage management, sorting, storage on external media, variants on the set data type, pseudorandom numbers, data compression, algorithms on graphs, algorithms on strings and geometric algorithms. Demaine born 28 february 1981 is a professor of computer science at the massachusetts institute of technology and a former child prodigy. We initiate the study of retroactive data structures by formally defining the model and its variants. Dl erik demaine and charles leiserson undergraduate level lecture notes by clrs textbook author.
What are the best books on algorithms and data structures. Ammar ammar, iting angelina lee, huy ngoc nguyen, tao b schardl. Presents several data structures for tries that have efficient navigation and modification near the leaves. Home conferences soda proceedings soda 04 retroactive data structures. Demaine, sarah eisenstat, jeffrey shallit, and david a. In this approach, a set of data is maintained with respect to a timeline. Demaine was born in halifax, nova scotia, to artist sculptor martin l. Two simplified algorithms for maintaining order in a. We designed algorithms and data structures for fully retroactive bst, hash and unionsameset. We believe this area of research is in an auspicious position where practical and theoretical goals. Demaines research interests span much of theoretical computer science and mathematics, in particular with connections to algorithms. The authors show that there are underlying mathematical reasons for why games and puzzles are challenging and perhaps why they are so much fun.
Lower bound techniques for data structures erik demaine. A recent direction in the design of cacheefficient and diskefficient algorithms and data structures is the notion of cache obliviousness, introduced. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. He makes sure he begins with an outline of the entire lecture and that he sticks to that outl. Tight bounds for the partialsums problem, with erik demaine. Advanced data structures fall 2017spring 20142012 6. Advanced data structures spring 2010 lecture 18 april 14, 2010 prof. Video recording for future generations, with martin demaine and jeanjacques quisquater. Mit laboratory for computer science, cambridge, ma. Prodigy prof skipped school until he started college at 12.
Erik demaine 1 overview in the last lecture we introduced euler tour trees 3, dynamic data structures that can perform linkcut tree operations in olg n time. When i started on this, i had little mathematical comprehension so most books were impossible for me to penetrate. When he was 12, erik demaine talked himself into dalhousie university in his home town of halifax, nova scotia, despite having no grades or academic record to speak of. Introduction to algorithms massachusetts institute of technology professors erik demaine and madhu sudan september. Advanced data structures electrical engineering and. Retroactive data structures proceedings of the fifteenth. Cacheoblivious algorithms and data structures erik demaine. What was it like to attend erik demaines classes at mit. In proceedings of the 12th international symposium on algorithms and data structures wads 20. We prove that, unlike persistence, efficient retroactivity is not always achievable.
Data structures retroactive data structures, originally introduced by prof. In addition, data structures are essential building blocks in obtaining efficient algorithms. This data structure is substantially faster for deep updates, i. We describe new techniques for proving lower bounds on datastructure problems, with the following broad consequences. Thus, we present efficient retroactive data structures for queues, doubly ended queues, priority queues, unionfind, and decomposable search structures.
Binary search trees bsts are one of the most fundamental data structures in computer science. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. This course covers major results and current directions of research in data structure. Cop 3530 data structures and algorithms, prof sahni, ufl 2, videos are available at 3 3. Ammar ammar, iting angelina lee, huy ngoc nguyen, tao b schardl lecture.
If youve seen his lectures online, you can tell that he has very neat handwriting and very organized lectures. Retroactive data structures acm transactions on algorithms. Anly 550 structures and algorithms for analytics spring. Confluently persistent tries for efficient version. In this lecture, we leave the bst model and enter the pointermachine model. File type pdf design and analysis of algorithms for cs2251 your daily activity.
1561 942 88 512 877 597 297 1486 870 1552 1210 829 1058 339 36 91 699 397 277 1098 831 577 989 1112 727 1162 167 1501 1007 962 15 1364 1509 418 858 364 1156 439 622 847 540 872 622 1230 600 1137 57