Breadth-first numbering

DOI10.1145/351240.351253MaRDI QIDQ2943362zbMATH OpenOpenAlexFDO

Authors Chris Okasaki

Publication date 11 September 2015

Published in Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/351240.351253

zbMATH Keywords

breadth-first numberingbreadth-first traversalviews

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 5817498
• Theory and techniques for synthesizing efficient breadth-first search algorithms
• Breadth-first traversal of trees and integer sorting in parallel
• Coding properties of breadth-first search orderings
• Extended breadth-first search algorithm in practice
• scientific article; zbMATH DE number 4162250
• Fast breadth-first search in still less space
• scientific article; zbMATH DE number 845500
• Certification of breadth-first algorithms by extraction
• An elementary approach to design and analysis of algorithms

Cited in

(4)

• On the dynamic extent of delimited continuations
• Clowns to the left of me, jokers to the right (pearl)
• Martin Hofmann's Case for Non-Strictly Positive Data Types
• Breadth-first traversal via staging

This page was built for publication: Breadth-first numbering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943362)