Cache-Oblivious Red-Blue Line Segment Intersection Lars Arge1,? , Thomas Mølhave1,?? , and Norbert Zeh2,? ? ? 1 2

First Page		Document Content
Date: 2014-03-13 08:10:55 Sorting algorithms B-tree Analysis of algorithms Line segment intersection Cache-oblivious algorithm Line segment Merge sort Point location Bentley–Ottmann algorithm Mathematics Combinatorics Order theory		Cache-Oblivious Red-Blue Line Segment Intersection Lars Arge1,? , Thomas Mølhave1,?? , and Norbert Zeh2,? ? ? 1 2 Add to Reading List Source URL: www.cs.duke.edu Download Document from Source Website File Size: 198,26 KB Share Document on Facebook

	Lecture 8: The Cache Oblivious Approach www.cs.illinois.edu/~wgropp Designing for Memory Hierarchy DocID: 1rpNE - View Document
	Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner DocID: 1r4Mz - View Document
	Seven at One Stroke: Results from a Cache-Oblivious ∗ Paradigm for Scalable Matrix Algorithms Michael D. Adams David S. Wise DocID: 1r10T - View Document
	IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 3, MARCH 2003 DocID: 1qlb7 - View Document
	Adaptive Matrix Transpose Algorithms for Distributed Multicore Processors John C. Bowman and Malcolm Roberts Abstract An adaptive parallel matrix transpose algorithm optimized for distributed multicore architectures runn DocID: 1q14M - View Document