Stable marriages by coroutines

DOI10.1016/0020-0190(83)90025-XMaRDI QIDQ1050775zbMATH OpenWikidataFDO

Authors Lloyd Allison

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmstable marriagecoroutinesModula-2

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) General topics in the theory of software (68N01) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites work

• scientific article; zbMATH DE number 3725672 (Why is no real title available?)
• scientific article; zbMATH DE number 3767008 (Why is no real title available?)
• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• An experiment in structured programming
• College Admissions and the Stability of Marriage
• Coroutines. A programming methodology, a language design and an implementation
• Stable marriage assignment for unequal sets
• The SL5 procedure mechanism

Cited in

(3)

• The average performance of a parallel stable mariage algorithm
• Worst-case choice for the stable marriage problem
• A parallel algorithm to solve the stable marriage problem

Describes a project that uses

Uses Software

• Modula

This page was built for publication: Stable marriages by coroutines

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