peyman afshani

Explaining the binary search behavior Part 2

peyman afshani

Explaining the binary search behavior Part 1

peyman afshani

Some examples of system calls in Linux

peyman afshani

Introduction to System Calls

peyman afshani

Basic Introduction to Virtual Memory

peyman afshani

Hardware support for privileges

peyman afshani

Introduction to Operating Systems, Start

peyman afshani

Brief video on how to model a cache hierarchy

peyman afshani

Caching effects in practice

peyman afshani

Introduction to caches

peyman afshani

07 Cutting lemma and multilevel data structures

peyman afshani

06 Cutting Lemma and fast queries

peyman afshani

05 Multilevel partition trees

peyman afshani

04 A 34 partition theorem (via Ham-sandwich-cut theorem)

peyman afshani

03 Canonical sets

peyman afshani

02 Partition Theorem and A partition tree

peyman afshani

01 Introduction to simplex range searching

peyman afshani

10 The shortest path problem

peyman afshani

09 The visibility graph

peyman afshani

08 Final remarks for the reachability problem

peyman afshani

07 An algorithm to compute the union

peyman afshani

06 Minkowski sum of convex and nonconvex polygons

peyman afshani

05 Minkowski sum of polygons

peyman afshani

04 Pseudodisks

peyman afshani

03 Minkowski sum

peyman afshani

02 Reachability of a point robot

peyman afshani

01 introduction to robot motion planning

peyman afshani

11 An Incremental algorithm for 3d Convex hull

peyman afshani

10 Gift Wrapping in 3D

peyman afshani

09 Introduction to 3D convex hull

peyman afshani