Algorithms and Order

  • Ivan Rival

Part of the NATO ASI Series book series (ASIC, volume 255)

Table of contents

  1. Front Matter
    Pages i-x
  2. Graphical Data Structures

    1. Front Matter
      Pages 1-1
    2. William David Miller
      Pages 59-102
  3. Computational Complexity

    1. Front Matter
      Pages 103-103
    2. Rolf H. Möhring
      Pages 105-193
    3. M. D. Atkinson
      Pages 195-230
    4. V. Bouchitte, M. Habib
      Pages 231-279
  4. Sorting and Scheduling

    1. Front Matter
      Pages 281-281
    2. J. Ian Munro
      Pages 283-306
    3. N. W. Sauer, M. G. Stone
      Pages 307-323
  5. Enumeration

    1. Front Matter
      Pages 325-325
    2. Mohamed H. El-Zahar
      Pages 327-352
    3. Kevin J. Compton
      Pages 353-383
  6. Geometry

    1. Front Matter
      Pages 385-385
    2. Jorge Urrutia
      Pages 387-434
  7. Decision Making

    1. Front Matter
      Pages 435-435
    2. Peter C. Fishburn
      Pages 437-465
  8. Problem Sessions

    1. Front Matter
      Pages 467-467
    2. Ivan Rival
      Pages 469-469
    3. Ivan Rival
      Pages 471-474
    4. Ivan Rival
      Pages 475-476
    5. Ivan Rival
      Pages 477-479
    6. Ivan Rival
      Pages 481-482
    7. Ivan Rival
      Pages 483-486
    8. Ivan Rival
      Pages 487-487
    9. Ivan Rival
      Pages 489-491
  9. Back Matter
    Pages 493-498

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.


Scheduling algorithms ants combinatorics complexity data structures geometry logic sets sorting

Editors and affiliations

  • Ivan Rival
    • 1
  1. 1.Departments of Computer Science and MathematicsUniversity of OttawaOttawaCanada

Bibliographic information

  • DOI
  • Copyright Information Springer Science+Business Media B.V. 1989
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-94-010-7691-3
  • Online ISBN 978-94-009-2639-4
  • Series Print ISSN 1389-2185
  • Buy this book on publisher's site