Some beautiful arguments using mathematical induction

DOI10.1007/BF00288531MaRDI QIDQ1140430zbMATH OpenOpenAlexFDO

Authors Edsger W. Dijkstra

Publication date 1980

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00288531

zbMATH Keywords

mathematical induction

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Discrete mathematics in relation to computer science (68R99)

Cited in

(14)

• An efficient algorithm for maxdominance, with applications
• Finding a minimum independent dominating set in a permutation graph
• An algorithm for the determination of longest increasing subsequence in a sequence
• Another look at the longest ascending subsequence problem
• Some modified algorithms for Dijkstra's longest upsequence problem
• Drawing graphs in two layers
• Election in fully anonymous shared memory systems: tight space bounds and algorithms
• A visit to mutual exclusion in seven dates
• The impact of the apex node on routing inside a pyramid structure
• Computing the all-pairs longest chains in the plane
• A self-stabilizing algorithm for finding articulation points
• A note on adaptive parallel sorting
• On difunctions
• Fast RSK correspondence by doubling search

This page was built for publication: Some beautiful arguments using mathematical induction

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