Algorithms and Order:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Dordrecht
Springer Netherlands
1989
|
| Series: | NATO ASI Series, Series C: Mathematical and Physical Sciences
255 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | 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 |
| Physical Description: | 1 Online-Ressource (X, 498 p) |
| ISBN: | 9789400926394 9789401076913 |
| ISSN: | 1389-2185 |
| DOI: | 10.1007/978-94-009-2639-4 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042415034 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150316s1989 |||| o||u| ||||||eng d | ||
| 020 | |a 9789400926394 |c Online |9 978-94-009-2639-4 | ||
| 020 | |a 9789401076913 |c Print |9 978-94-010-7691-3 | ||
| 024 | 7 | |a 10.1007/978-94-009-2639-4 |2 doi | |
| 035 | |a (OCoLC)905421291 | ||
| 035 | |a (DE-599)BVBBV042415034 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-83 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a PHY 000 |2 stub | ||
| 100 | 1 | |a Rival, Ivan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms and Order |c edited by Ivan Rival |
| 246 | 1 | 3 | |a Proceedings of the NATO Advanced Study Institute, Ottawa, Canada, May 31-June 13, 1987 |
| 264 | 1 | |a Dordrecht |b Springer Netherlands |c 1989 | |
| 300 | |a 1 Online-Ressource (X, 498 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a NATO ASI Series, Series C: Mathematical and Physical Sciences |v 255 |x 1389-2185 | |
| 500 | |a 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 | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Algebra | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Order, Lattices, Ordered Algebraic Structures | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Geordnete Menge |0 (DE-588)4156748-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 1987 |z Ottawa |2 gnd-content | |
| 689 | 0 | 0 | |a Geordnete Menge |0 (DE-588)4156748-1 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-94-009-2639-4 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-PHA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-PHA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027850527 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804153081575768064 |
|---|---|
| any_adam_object | |
| author | Rival, Ivan |
| author_facet | Rival, Ivan |
| author_role | aut |
| author_sort | Rival, Ivan |
| author_variant | i r ir |
| building | Verbundindex |
| bvnumber | BV042415034 |
| classification_tum | PHY 000 |
| collection | ZDB-2-PHA ZDB-2-BAE |
| ctrlnum | (OCoLC)905421291 (DE-599)BVBBV042415034 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Physik Informatik |
| doi_str_mv | 10.1007/978-94-009-2639-4 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03498nmm a2200565zcb4500</leader><controlfield tag="001">BV042415034</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150316s1989 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789400926394</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-009-2639-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789401076913</subfield><subfield code="c">Print</subfield><subfield code="9">978-94-010-7691-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-94-009-2639-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)905421291</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042415034</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">PHY 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rival, Ivan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and Order</subfield><subfield code="c">edited by Ivan Rival</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Proceedings of the NATO Advanced Study Institute, Ottawa, Canada, May 31-June 13, 1987</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 498 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">NATO ASI Series, Series C: Mathematical and Physical Sciences</subfield><subfield code="v">255</subfield><subfield code="x">1389-2185</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Order, Lattices, Ordered Algebraic Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geordnete Menge</subfield><subfield code="0">(DE-588)4156748-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1987</subfield><subfield code="z">Ottawa</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Geordnete Menge</subfield><subfield code="0">(DE-588)4156748-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-94-009-2639-4</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-PHA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-PHA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027850527</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift 1987 Ottawa gnd-content |
| genre_facet | Konferenzschrift 1987 Ottawa |
| id | DE-604.BV042415034 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:20:56Z |
| institution | BVB |
| isbn | 9789400926394 9789401076913 |
| issn | 1389-2185 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027850527 |
| oclc_num | 905421291 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-83 |
| owner_facet | DE-91 DE-BY-TUM DE-83 |
| physical | 1 Online-Ressource (X, 498 p) |
| psigel | ZDB-2-PHA ZDB-2-BAE ZDB-2-PHA_Archive |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Springer Netherlands |
| record_format | marc |
| series2 | NATO ASI Series, Series C: Mathematical and Physical Sciences |
| spelling | Rival, Ivan Verfasser aut Algorithms and Order edited by Ivan Rival Proceedings of the NATO Advanced Study Institute, Ottawa, Canada, May 31-June 13, 1987 Dordrecht Springer Netherlands 1989 1 Online-Ressource (X, 498 p) txt rdacontent c rdamedia cr rdacarrier NATO ASI Series, Series C: Mathematical and Physical Sciences 255 1389-2185 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 Computer science Information theory Algebra Combinatorics Computer Science Theory of Computation Order, Lattices, Ordered Algebraic Structures Informatik Algorithmus (DE-588)4001183-5 gnd rswk-swf Geordnete Menge (DE-588)4156748-1 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 1987 Ottawa gnd-content Geordnete Menge (DE-588)4156748-1 s Algorithmus (DE-588)4001183-5 s 2\p DE-604 https://doi.org/10.1007/978-94-009-2639-4 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Rival, Ivan Algorithms and Order Computer science Information theory Algebra Combinatorics Computer Science Theory of Computation Order, Lattices, Ordered Algebraic Structures Informatik Algorithmus (DE-588)4001183-5 gnd Geordnete Menge (DE-588)4156748-1 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4156748-1 (DE-588)1071861417 |
| title | Algorithms and Order |
| title_alt | Proceedings of the NATO Advanced Study Institute, Ottawa, Canada, May 31-June 13, 1987 |
| title_auth | Algorithms and Order |
| title_exact_search | Algorithms and Order |
| title_full | Algorithms and Order edited by Ivan Rival |
| title_fullStr | Algorithms and Order edited by Ivan Rival |
| title_full_unstemmed | Algorithms and Order edited by Ivan Rival |
| title_short | Algorithms and Order |
| title_sort | algorithms and order |
| topic | Computer science Information theory Algebra Combinatorics Computer Science Theory of Computation Order, Lattices, Ordered Algebraic Structures Informatik Algorithmus (DE-588)4001183-5 gnd Geordnete Menge (DE-588)4156748-1 gnd |
| topic_facet | Computer science Information theory Algebra Combinatorics Computer Science Theory of Computation Order, Lattices, Ordered Algebraic Structures Informatik Algorithmus Geordnete Menge Konferenzschrift 1987 Ottawa |
| url | https://doi.org/10.1007/978-94-009-2639-4 |
| work_keys_str_mv | AT rivalivan algorithmsandorder AT rivalivan proceedingsofthenatoadvancedstudyinstituteottawacanadamay31june131987 |