Live briefing
Everything about Pointer jumping
Design technique for parallel algorithms
Pointer jumping or path doubling is a design technique for parallel algorithms that operate on pointer structures, such as linked lists and directed graphs. Pointer jumping allows an algorithm to follow paths with a time complexity that is logarithmic with respect to the length of the longest path. It does this by "jumping" to the end of the path computed by neighbors. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Pointer jumpingA 5-minute orientation
- Pick up a classic book: Intelligence BulletinThe most-reprinted book on the subject
- Read the landmark paper: Some bounds on multiparty communication complexity of pointer jumpingCited 15 times
- Go sideways: Breadth-first searchA closely related topic
- Go sideways: Level ancestor problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
What If?Randall Munroe · 1980
The C# programming languageAnders Hejlsberg, Scott Wiltamuth · 2004
Jump into fitnessEdward J. Jackowski · 2004
Soul trainQuestlove · 2013
Mapping the Commodore 64 & 64CSheldon Leemon · 1987- 📕Learn C# in 7 daysGaurav Aroraa · 2017
VX-REXX Programmer's GuideWatcom International Corporation · 1995
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Breadth-first search In computer science, breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts…
- Level ancestor problem In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure…
- Topological sorting In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge…
- Graph traversal In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph.…
- Dijkstra's algorithm Dijkstra's algorithm (/ˈdaɪk.strəz/, DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent…
- Depth-first search In computer science, depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root…
- Parallel all-pairs shortest path algorithm A central problem in algorithmic graph theory is the shortest path problem. Hereby, the problem of finding the shortest path between every pair of nodes…
- Euler tour technique The Euler tour technique (ETT), named after Leonhard Euler, is a method in graph theory for representing trees. The tree is viewed as a directed graph…