Bounds for Sorting by Prefix Reversal -- Pancake Problem

Slides:



Advertisements
Similar presentations
Great Theoretical Ideas in Computer Science.
Advertisements

PERMUTATION CIRCUITS Presented by Wooyoung Kim, 1/28/2009 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
Can You Trust Your Computer? CS365 – Mathematics of Computer Science Spring 2007 David Uhrig Tiffany Sharrard.
Great Theoretical Ideas in Computer Science
Everything you always wanted to know about theoretical computer science (but were afraid to ask) Dimitris Achlioptas Microsoft Research.
1 Vol. 01. p Vol. 01. p Vol. 01. p.20.
1 Vol. 03. p Vol. 03. p Vol. 03. p.21.
1 Vol. 02. p Vol. 02. p Vol. 02. p.19.
1 Vol. 03. p Vol. 03. p Vol. 03. p.16.
1 Vol. 02. p Vol. 02. p Vol. 02. p.30.
1 Vol. 03. p Vol. 03. p Vol. 03. p.35.
1 Vol. 02. p Vol. 02. p Vol. 02. p.10.
1 Vol. 01. p Vol. 01. p Vol. 01. p.14.
Cooking for Computer Scientists. I understand that making pancakes can be a dangerous activity and that, by doing so, I am taking a risk that I.
Bioinformatics Chromosome rearrangements Chromosome and genome comparison versus gene comparison Permutations and breakpoint graphs Transforming Men into.
Introduction of video retrieval 報告人 : 于尚立. Outline Introduction Motion-based video retrieval Conclusion.
A More Efficient Algorithm for Lattice Basis Reduction C.P.SCHNORR Journal of algorithm 9,47-62(1988) 報告者 張圻毓.
Introduction to Bioinformatics Algorithms Greedy Algorithms And Genome Rearrangements.
Discrete Structures & Algorithms EECE 320 : UBC : Spring 2009 Matei Ripeanu 1.
Pancakes With A Problem! Great Theoretical Ideas In Computer Science Steven Rudich CS Spring 2004 Lecture 1 Jan 13, 2004 Carnegie Mellon University.
Visualization of Clusters with a Density-Based Similarity Measure Rebecca Nugent Department of Statistics, Carnegie Mellon University June 9, 2007 Joint.
後卓越計畫進度報告 (2007/6/4) 中央大學 許健平教授 淡江大學 張志勇教授. Routing with Hexagonal Virtual Coordinate in Wireless Sensor Networks.
1 Sorting by Transpositions Based on the First Increasing Substring Concept Advisor: Professor R.C.T. Lee Speaker: Ming-Chiang Chen.
Selection Sort
Pancakes With A Problem Steven Rudich The chef at our place is sloppy, and when he prepares a stack of pancakes they come out all different sizes.
Pancakes With A Problem! Great Theoretical Ideas In Computer Science Vince Conitzer COMPSCI 102 Fall 2007 Lecture 1 August 27, 2007 Duke University.
Cooking for Computer Scientists. I understand that making pancakes can be a dangerous activity and that, by doing so, I am taking a risk that I.
CompSci 102 Spring 2012 Prof. Rodger January 11, 2012.
Pancakes With A Problem! Great Theoretical Ideas In Computer Science Anupam Gupta CS Fall 2O05 Lecture 1 Aug 29 th, 2OO5 Aug 29 th, 2OO5 Carnegie.
Pancakes With A Problem! Great Theoretical Ideas In Computer Science Anupam Gupta CS Fall 2006 Lecture 1 Aug 29 th, 2OO6 Aug 29 th, 2OO6 Carnegie.
Great Theoretical Ideas in Computer Science.
1 A Simpler 1.5- Approximation Algorithm for Sorting by Transpositions Combinatorial Pattern Matching (CPM) 2003 Authors: T. Hartman & R. Shamir Speaker:
Bluetooth – an Enabler for Personal Area Networking 報告人:古建華 學號:
ELEC 5270 – Low Power Design of Electronic Circuits Spring 2009 Grant Lewis 1.
computer
Distributed Computing 3. Leader Election – lower bound for ring networks Shmuel Zaks ©
Great Theoretical Ideas in Computer Science.
Andrew’s Leap 2011 Pancakes With A Problem Steven Rudich.
Computer Science 210 Computer Organization Course Introduction.
Reversible Date Hiding Based on Histogram Modification of pixel Differences IEEE Transactions on circuits and systems for video technology, VOL. 19, NO.
Imaged Document Text Retrieval without OCR IEEE Trans. on PAMI vol.24, no.6 June, 2002 報告人:周遵儒.
Selection Sort
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
Pancakes With A Problem! Great Theoretical Ideas In Computer Science Steven Rudich CS Spring 2005 Lecture 3 Jan 18, 2005 Carnegie Mellon University.
Kaifeng Chen Institute for Theoretical Physics Synthetic Biology with Engineering Tools 1 Francis Chen.
Pancake Problem 許凱平 & 張傑生. Resources Google “ Bounds for Sorting by Prefix Reversal ” (63) “ Pancake Problem ” (218) Slides [S1] CMU ’ s “ Great Theoretical.
A Simple Transmit Diversity Technique for Wireless Communications 指導老師 : 黃文傑 博士 學生 : 吳濟廷
Great Theoretical Ideas in Computer Science for Some.
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
人力資源報告 Image and Signal Processing 1 Steganography Using Sudoku Revisited Wien Hong, Tung-Shou Chen, Chih-Wei Shiu Department of Information Management,
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
CSC305: COMPUTER PROGRAMMING II (JAVA)
Pancakes With A Problem!
CAP 5636 – Advanced Artificial Intelligence
Animation of Bubble Sort
Pancakes With A Problem!
Bitonic Sorting and Its Circuit Design
Regularization in Statistics
سنوات خدمت در تربیت معلم: 15سال پردیس/مرکز محل خدمت: بحرالعلوم شهرکرد
طبقه بندی نشریات علمی و فنی
The Stable Circuit Problem
Exam Preparation Spring 2017
Cooking for Computer Scientists.
Regularization in Statistics
CS148 Introduction to Programming II
The Theory of Computation
Կարգավորում Insertion Sort, Merge Sort
Exam Preparation Spring 2018
Presentation transcript:

Bounds for Sorting by Prefix Reversal -- Pancake Problem 2004/05/12 報告人:d91922014 許凱平 d91921012 張傑生

Outline Introduction to pancake problem Bounds for sorting by prefix reversal Pancake Network

Reference Steven Rudich, Great Theoretical Ideas In Computer Science Spring 2004, CMU http://www-2.cs.cmu.edu/~15251/ Bill Gates & Christos Papadimitriou, Bounds For Sorting By Prefix Reversal. Discrete Mathematics, vol 27, pp 47-57, 1979. H. Heydari & H. I. Sudborough, On the Diameter of the Pancake Network. Journal of Algorithms, vol 25, pp 67-94, 1997