Synthesis of implementations for divide-and-conquer specifications

DOI10.1007/978-3-031-22476-8_5zbMath1528.68210OpenAlexW4312602923MaRDI QIDQ6113901

Maksym Bortin

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22476-8_5

zbMATH Keywords

synthesisimplementationdesign tactics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of divide and conquer algorithms
• Algorithm theories and design tactics
• Applications of a strategy for designing divide-and-conquer algorithms
• Introduction to Greedoids
• Theory of Matroids

This page was built for publication: Synthesis of implementations for divide-and-conquer specifications