Lecture
Purely Functional Priority Queue
Description
This lecture covers the optimal purely functional priority queues, starting with an overview of imperative and purely functional implementations, followed by Scala implementation and testing, Stainless integration, operations properties, and binomial queues. The presentation also includes results, future works, and explicit requirements for binomial queues.
Official source
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.