Generic top-down discrimination for sorting and partitioning in linear time

DOI10.1017/S0956796812000160zbMath1311.68046OpenAlexW2090208917MaRDI QIDQ5398338

Fritz Henglein

Publication date: 27 February 2014

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796812000160

Mathematics Subject Classification ID

Searching and sorting (68P10) Functional programming and lambda calculus (68N18)

Related Items (1)

Generic multiset programming with discrimination-based joins and symbolic Cartesian products

Cites Work

• Unnamed Item
• Unnamed Item
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• Using multiset discrimination to solve language processing problems without hashing
• Sorting in \(c \log n\) parallel steps
• On multiset orderings
• Sorting in linear time?
• Surpassing the information theoretic bound with fusion trees
• Fundamental concepts in programming languages
• POETS: process-oriented event-driven transaction systems
• Three Partition Refinement Algorithms
• Proving termination with multiset orderings
• Generalizing generalized tries
• Generic discrimination
• Efficient algorithms for isomorphisms of simple types
• Efficient algorithms for isomorphisms of simple types

This page was built for publication: Generic top-down discrimination for sorting and partitioning in linear time