Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Order

  • Book
  • © 1989

Overview

Editors:
  1. Ivan Rival

    1. Departments of Computer Science and Mathematics, University of Ottawa, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Nato Science Series C: (ASIC, volume 255)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 449.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (20 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Graphical Data Structures

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Graphical Data Structures for Ordered Sets

      • Ivan Rival
      Pages 3-31

    3. Lattices in Data Analysis: How to Draw Them with a Computer

      • Rudolf Wille
      Pages 33-58

    4. A Computer Program for Orthomodular Lattices

      • William David Miller
      Pages 59-102

  3. Computational Complexity

    1. Front Matter

      Pages 103-103
      Download chapter PDF

    2. Computationally Tractable Classes of Ordered Sets

      • Rolf H. Möhring
      Pages 105-193

    3. The Complexity of Orders

      • M. D. Atkinson
      Pages 195-230

    4. The Calculation of Invariants for Ordered Sets

      • V. Bouchitte, M. Habib
      Pages 231-279

  4. Sorting and Scheduling

    1. Front Matter

      Pages 281-281
      Download chapter PDF

    2. Data Manipulations Based on Orderings

      • J. Ian Munro
      Pages 283-306

    3. Preemptive Scheduling

      • N. W. Sauer, M. G. Stone
      Pages 307-323

  5. Enumeration

    1. Front Matter

      Pages 325-325
      Download chapter PDF

    2. Enumeration of Ordered Sets

      • Mohamed H. El-Zahar
      Pages 327-352

    3. Laws in Logic and Combinatorics

      • Kevin J. Compton
      Pages 353-383

  6. Geometry

    1. Front Matter

      Pages 385-385
      Download chapter PDF

    2. Partial Orders and Euclidean Geometry

      • Jorge Urrutia
      Pages 387-434

  7. Decision Making

    1. Front Matter

      Pages 435-435
      Download chapter PDF

    2. Human Decision Making and Ordered Sets

      • Peter C. Fishburn
      Pages 437-465

  8. Problem Sessions

    1. Front Matter

      Pages 467-467
      Download chapter PDF
Back to top

Keywords

About this book

This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.

Editors and Affiliations

  • Departments of Computer Science and Mathematics, University of Ottawa, Ottawa, Canada

    Ivan Rival

Bibliographic Information

  • Book Title: Algorithms and Order

  • Editors: Ivan Rival

  • Series Title: Nato Science Series C:

  • DOI: https://doi.org/10.1007/978-94-009-2639-4

  • Publisher: Springer Dordrecht

  • eBook Packages: Springer Book Archive

  • Copyright Information: Kluwer Academic Publishers 1989

  • Hardcover ISBN: 978-0-7923-0007-6Published: 31 December 1988

  • Softcover ISBN: 978-94-010-7691-3Published: 05 October 2011

  • eBook ISBN: 978-94-009-2639-4Published: 06 December 2012

  • Series ISSN: 1389-2185

  • Edition Number: 1

  • Number of Pages: X, 498

  • Topics: Programming Techniques, Neurology, Pediatrics, Combinatorics

Publish with us

Policies and ethics

Back to top

Search

Navigation