Explore the latest books of this year!
Bookbot

Distinguished Dissertations in Computer Science Series

This series showcases a curated selection of the best British PhD dissertations in computer science, chosen annually by a distinguished committee. Its goal is to highlight significant British contributions to the field and serve as a benchmark for aspiring researchers. Each volume features a high standard of exposition, clearly contextualizing its findings within the broader landscape of computer science.

Efficient Algorithms for Listing Combinatorial Structures

  • Efficient Algorithms for Listing Combinatorial Structures

    • 178 pages
    • 7 hours of reading

    Focusing on the design of efficient algorithms, this thesis explores methods for listing combinatorial structures. It delves into the intricacies of combinatorial design and algorithmic efficiency, providing insights that are essential for researchers and practitioners in the field. The work, first published in 1993, contributes to the understanding of how to effectively generate and manage combinatorial configurations.

    Efficient Algorithms for Listing Combinatorial Structures