Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithms and Order -

Algorithms and Order

Ivan Rival (Herausgeber)

Buch | Hardcover
498 Seiten
1988
Springer (Verlag)
978-0-7923-0007-6 (ISBN)
CHF 589,95 inkl. MwSt
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. 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.
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.

I Graphical Data Structures.- Graphical data structures for ordered sets.- Lattices in data analysis: how to draw them with a computer.- A computer program for orthomodular lattices.- II Computational Complexity.- Computationally tractable classes of ordered sets.- The complexity of orders.- The calculation of invariants for ordered sets.- III Sorting and Scheduling.- Data manipulations based on orderings.- Preemptive scheduling.- IV Enumeration.- Enumeration of ordered sets.- 0–1 laws in logic and combinatorics.- V Geometry.- Partial orders and Euclidean geometry.- VI Decision Making.- Human decision making and ordered sets.- VII Problem Sessions.- ORDER’s problem list.- Scheduling.- The diagram.- Linear extensions.- Enumeration.- Sorting.- Miscellany.- VIII IndeX.

Erscheint lt. Verlag 31.12.1988
Reihe/Serie NATO Science Series C ; 255
Zusatzinfo X, 498 p.
Verlagsort Dordrecht
Sprache englisch
Maße 210 x 297 mm
Themenwelt Informatik Theorie / Studium Algorithmen
Medizin / Pharmazie Medizinische Fachgebiete
ISBN-10 0-7923-0007-6 / 0792300076
ISBN-13 978-0-7923-0007-6 / 9780792300076
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15