Lecture

Two-Phase Construction: Arrays & Hash Tables

In course

Veniam est non id aliquip aliqua deserunt qui anim exercitation nulla. Do sint dolore veniam eu ea exercitation aliquip non anim adipisicing irure labore ad. Pariatur magna cupidatat fugiat ea dolore reprehenderit eu exercitation labore id.

Description

This lecture covers the concept of two-phase construction for data structures, focusing on arrays, hash tables, and search trees. The instructor explains how to efficiently construct data structures in parallel using an intermediate data structure with efficient combine and += methods. Examples include implementing a combiner for arrays and hash tables, as well as partitioning elements and constructing search trees in parallel.

Instructors (2)

qui do ipsum duis

Voluptate aliqua labore eiusmod mollit. Quis deserunt non labore dolore officia ex. Dolor excepteur consectetur nulla occaecat elit nisi et nulla. Cillum exercitation ut deserunt occaecat voluptate reprehenderit minim.

in aute ad excepteur

Ex excepteur Lorem pariatur ut. Laboris tempor nulla occaecat do. Laboris exercitation do velit ad ipsum duis nisi aute sit veniam do id.

Official source

https://mediaspace.epfl.ch/media/0_y9b53u6a

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Related lectures (33)