Kooperativer Bibliotheksverbund

UID:

Format: XIV, 582 p. , online resource.

Edition: 1st ed. 2000.

ISBN: 9783540409960

Series Statement: Lecture Notes in Computer Science, 1969

Content: The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electro- cally. Thanks to the excellent software developed by the Institute of Information Science, Academia Sinica, we were able to carry out virtually all communication via the World Wide Web. In response to the call for papers, a total of 87 extended abstracts were submitted from 25 countries. Each submitted paper was handled by at least three program committee members, with the assistance of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee's task extremely di cult. Finally 46 papers were selected for presentation at the Symposium. In addition to these contributed papers, the conference also included two invited presentations by Dr. Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France and Professor Jin-Yi Cai, University of Wisconsin at Madison, Wisconsin, USA. It is expected that most of the accepted papers will appear in a more complete form in scienti c journals.

Note: Invited Presentations -- Voronoi-Based Systems of Coordinates and Surface Reconstruction -- Essentially Every Unimodular Matrix Defines an Expander -- Algorithms and Data Structures (I) -- Strategies for Hotlink Assignments -- A New Competitive Analysis of Randomized Caching -- Online Routing in Convex Subdivisions -- Combinatorial Optimization -- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors -- Classification of Various Neighborhood Operations for the Nurse Scheduling Problem -- Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets -- Algorithms and Data Structures (II) -- Coping with Delays and Time-Outs in Binary Search Procedures -- Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm -- Reasoning with Ordered Binary Decision Diagrams -- Approximation and Randomized Algorithms (I) -- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching -- A 2-Approximation Algorithm for Path Coloring on Trees of Rings -- An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree -- Algorithms and Data Structures (III) -- Finding Independent Spanning Trees in Partial k-Trees -- On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover -- Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width -- Approximation and Randomized Algorithms (II) -- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits -- A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane -- Simple Algorithms for a Weighted Interval Selection Problem -- Graph Drawing and Algorithms -- Efficient Minus and Signed Domination in Graphs -- Convex Grid Drawings of Four-Connected Plane Graphs -- An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs -- Automata, Cryptography, and Complexity Theory -- Undecidability Results for Monoids with Linear-Time Decidable Word Problems -- Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures -- Derandomizing Arthur-Merlin Games under Uniform Assumptions -- Algorithms and Data Structures (IV) -- A Near Optimal Algorithm for Vertex Connectivity Augmentation -- Simultaneous Augmentation of Two Graphs to an ?Edge-Connected Graph and a Biconnected Graph -- Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets -- Parallel and Distributed Algorithms -- An Intuitive and Effective New Representation for Interconnection Network Structures -- Randomized Leader Election Protocols in Radio Networks with no Collision Detection -- Deterministic Broadcasting Time with Partial Knowledge of the Network -- Algorithms and Data Structures (V) -- Minimizing Makespan in Batch Machine Scheduling -- Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time -- Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array -- Computational Geometry (I) -- A Better Lower Bound for Two-Circle Point Labeling -- Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set -- An Improved Algorithm for Subdivision Traversal without Extra Storage -- Algorithms and Data Structures (VI) -- Generalized H-Coloring of Graphs -- Finding a Two-Core of a Tree in Linear Time -- Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison -- Computational Geometry (II) -- Optimal Beam Penetrations in Two and Three Dimensions -- Searching a Simple Polygon by a k-Searcher -- Characterization of Rooms Searchable by Two Guards -- Computational Biology -- Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers -- Phylogenetic k-Root and Steiner k-Root -- Computational Geometry (III) -- Maintenance of a Piercing Set for Intervals with Applications -- Optimal Polygon Cover Problems and Applications.

In: Springer Nature eBook

Additional Edition: Printed edition: ISBN 9783662182901

Additional Edition: Printed edition: ISBN 9783540412557

Language: English

DOI: 10.1007/3-540-40996-3

URL: https://doi.org/10.1007/3-540-40996-3

UID:

Format: X, 414 p. , online resource.

Edition: 1st ed. 1998.

ISBN: 9783540685333

Series Statement: Lecture Notes in Computer Science, 1457

Content: This book constitutes the refereed proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'98, held in Berkeley, California, in August 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion from several dozen submissions. Also included are abstracts of four invited talks and 6 invited presentations given during minisymposia held in parallel. The book presents a unique overview on algorithmic, applicational, and systems aspects arising in the development of efficient parallel solutions to irregularly structured problems.

Note: Combinatorial preconditioning for sparse linear systems -- A threaded sliding window executor for irregular computation on a NOW -- Parallel profile matching for large scale webcasting -- Large-scale SVD and subspace-based methods for information retrieval -- Thick-restart Lanczos method for symmetric eigenvalue problems -- Portable parallel adaptation of unstructured 3D meshes -- Partitioning sparse rectangular matrices for parallel processing -- Locality preserving load balancing with provably small overhead -- Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers -- Coarse-grid selection for parallel algebraic multigrid -- Overlapping and short-cutting techniques in loosely synchronous irregular problems -- Control volume meshes using sphere packing -- Using multithreading for the automatic load balancing of adaptive finite element meshes -- Dynamic load balancing for parallel adaptive mesh refinement -- A robust and scalable library for parallel adaptive mesh refinement on unstructured meshes -- Quality balancing for parallel adaptive FEM -- Parallelization of an unstructured grid, hydrodynamic-diffusion code -- Exchange of messages of different sizes -- The distributed object-oriented threads system DOTS -- Graph partitioning and parallel solvers: Has the emperor no clothes? -- Parallel simulation of particulate flows -- Parallel vertex-to-vertex radiosity on a distributed shared memory system -- Load balancing in parallel molecular dynamics -- COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications -- Transformations of Cauchy matrices, Trummer's problem and a Cauchy-like linear solver -- A parallel GRASP for the Steiner problem in graphs -- A new simple parallel tree contraction scheme and its application on distance-hereditary graphs -- Cooperative multi-thread parallel tabu search with an application to circuit partitioning -- Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via Irregularization -- Balancing the load in large-scale distributed entity-level simulations -- Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution -- Relaxed Implementation of spectral methods for graph partitioning -- S-HARP: A parallel dynamic spectral partitioner -- Information filtering using the Riemannian SVD (R-SVD) -- Parallel run-time system for adaptive mesh refinement.

In: Springer Nature eBook

Additional Edition: Printed edition: ISBN 9783662196489

Additional Edition: Printed edition: ISBN 9783540648093

Language: English

DOI: 10.1007/BFb0018521

URL: https://doi.org/10.1007/BFb0018521

UID:

Format: X, 414 p. , online resource.

ISBN: 9783540685333

Series Statement: Lecture Notes in Computer Science, 1457

Content: This book constitutes the refereed proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'98, held in Berkeley, California, in August 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion from several dozen submissions. Also included are abstracts of four invited talks and 6 invited presentations given during minisymposia held in parallel. The book presents a unique overview on algorithmic, applicational, and systems aspects arising in the development of efficient parallel solutions to irregularly structured problems.

Note: Combinatorial preconditioning for sparse linear systems -- A threaded sliding window executor for irregular computation on a NOW -- Parallel profile matching for large scale webcasting -- Large-scale SVD and subspace-based methods for information retrieval -- Thick-restart Lanczos method for symmetric eigenvalue problems -- Portable parallel adaptation of unstructured 3D meshes -- Partitioning sparse rectangular matrices for parallel processing -- Locality preserving load balancing with provably small overhead -- Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers -- Coarse-grid selection for parallel algebraic multigrid -- Overlapping and short-cutting techniques in loosely synchronous irregular problems -- Control volume meshes using sphere packing -- Using multithreading for the automatic load balancing of adaptive finite element meshes -- Dynamic load balancing for parallel adaptive mesh refinement -- A robust and scalable library for parallel adaptive mesh refinement on unstructured meshes -- Quality balancing for parallel adaptive FEM -- Parallelization of an unstructured grid, hydrodynamic-diffusion code -- Exchange of messages of different sizes -- The distributed object-oriented threads system DOTS -- Graph partitioning and parallel solvers: Has the emperor no clothes? -- Parallel simulation of particulate flows -- Parallel vertex-to-vertex radiosity on a distributed shared memory system -- Load balancing in parallel molecular dynamics -- COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications -- Transformations of Cauchy matrices, Trummer's problem and a Cauchy-like linear solver -- A parallel GRASP for the Steiner problem in graphs -- A new simple parallel tree contraction scheme and its application on distance-hereditary graphs -- Cooperative multi-thread parallel tabu search with an application to circuit partitioning -- Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via Irregularization -- Balancing the load in large-scale distributed entity-level simulations -- Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution -- Relaxed Implementation of spectral methods for graph partitioning -- S-HARP: A parallel dynamic spectral partitioner -- Information filtering using the Riemannian SVD (R-SVD) -- Parallel run-time system for adaptive mesh refinement.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540648093

Language: English

DOI: 10.1007/BFb0018521

URL: http://dx.doi.org/10.1007/BFb0018521

UID:

Format: 1 online resource (XIV, 416 p.)

ISBN: 9783110755411 , 9783110766820

Series Statement: De Gruyter Proceedings in Mathematics

Content: Elwyn Berlekamp, John Conway, and Richard Guy wrote 'Winning Ways for your Mathematical Plays' and turned a recreational mathematics topic into a full mathematical fi eld. They combined set theory, combinatorics, codes, algorithms, and a smattering of other fi elds, leavened with a liberal dose of humor and wit. Their legacy is a lively fi eld of study that still produces many surprises. Despite being experts in other areas of mathematics, in the 50 years since its publication, they also mentored, talked, and played games, giving their time, expertise, and guidance to several generations of mathematicians. This volume is dedicated to Elwyn Berlekamp, John Conway, and Richard Guy. It includes 20 contributions from colleagues that refl ect on their work in combinatorial game theory.

Note: Frontmatter -- , Preface -- , Contents -- , The game of flipping coins -- , The game of blocking pebbles -- , Transverse Wave: an impartial color-propagation game inspired by social influence and Quantum Nim -- , A note on numbers -- , Ordinal sums, clockwise hackenbush, and domino shave -- , Advances in finding ideal play on poset games -- , Strings-and-Coins and Nimstring are PSPACE-complete -- , Partizan subtraction games -- , Circular Nim games CN(7, 4) -- , Misère domineering on 2 × n boards -- , Relator games on groups -- , Playing Bynum's game cautiously -- , Genetically modified games -- , Game values of arithmetic functions -- , A base-p Sprague-Grundy-type theorem for p-calm subtraction games: Welter's game and representations of generalized symmetric groups -- , Recursive comparison tests for dicot and dead-ending games under misère play -- , Impartial games with entailing moves -- , Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees -- , Grundy numbers of impartial three-dimensional chocolate-bar games -- , On the structure of misère impartial games , Issued also in print. , Mode of access: Internet via World Wide Web. , In English.

In: DG Plus DeG Package 2022 Part 1, De Gruyter, 9783110766820

In: EBOOK PACKAGE COMPLETE 2022 English, De Gruyter, 9783110993899

In: EBOOK PACKAGE COMPLETE 2022, De Gruyter, 9783110994810

In: EBOOK PACKAGE Mathematics 2022 English, De Gruyter, 9783110993868

In: EBOOK PACKAGE Mathematics 2022, De Gruyter, 9783110770445

Additional Edition: ISBN 9783110755497

Additional Edition: ISBN 9783110755343

Language: English

DOI: 10.1515/9783110755411

URL: https://doi.org/10.1515/9783110755411

URL: https://www.degruyter.com/isbn/9783110755411

URL: Cover

UID:

Format: XIV, 582 p. , online resource.

ISBN: 9783540409960

Series Statement: Lecture Notes in Computer Science, 1969

Content: The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electro- cally. Thanks to the excellent software developed by the Institute of Information Science, Academia Sinica, we were able to carry out virtually all communication via the World Wide Web. In response to the call for papers, a total of 87 extended abstracts were submitted from 25 countries. Each submitted paper was handled by at least three program committee members, with the assistance of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee’s task extremely di cult. Finally 46 papers were selected for presentation at the Symposium. In addition to these contributed papers, the conference also included two invited presentations by Dr. Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France and Professor Jin-Yi Cai, University of Wisconsin at Madison, Wisconsin, USA. It is expected that most of the accepted papers will appear in a more complete form in scienti c journals.

Note: Invited Presentations -- Voronoi-Based Systems of Coordinates and Surface Reconstruction -- Essentially Every Unimodular Matrix Defines an Expander -- Algorithms and Data Structures (I) -- Strategies for Hotlink Assignments -- A New Competitive Analysis of Randomized Caching -- Online Routing in Convex Subdivisions -- Combinatorial Optimization -- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors -- Classification of Various Neighborhood Operations for the Nurse Scheduling Problem -- Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets -- Algorithms and Data Structures (II) -- Coping with Delays and Time-Outs in Binary Search Procedures -- Some Formal Analysis of Rocchio’s Similarity-Based Relevance Feedback Algorithm -- Reasoning with Ordered Binary Decision Diagrams -- Approximation and Randomized Algorithms (I) -- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching -- A 2-Approximation Algorithm for Path Coloring on Trees of Rings -- An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree -- Algorithms and Data Structures (III) -- Finding Independent Spanning Trees in Partial k-Trees -- On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover -- Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width -- Approximation and Randomized Algorithms (II) -- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits -- A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane -- Simple Algorithms for a Weighted Interval Selection Problem -- Graph Drawing and Algorithms -- Efficient Minus and Signed Domination in Graphs -- Convex Grid Drawings of Four-Connected Plane Graphs -- An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs -- Automata, Cryptography, and Complexity Theory -- Undecidability Results for Monoids with Linear-Time Decidable Word Problems -- Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures -- Derandomizing Arthur-Merlin Games under Uniform Assumptions -- Algorithms and Data Structures (IV) -- A Near Optimal Algorithm for Vertex Connectivity Augmentation -- Simultaneous Augmentation of Two Graphs to an ?Edge-Connected Graph and a Biconnected Graph -- Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets -- Parallel and Distributed Algorithms -- An Intuitive and Effective New Representation for Interconnection Network Structures -- Randomized Leader Election Protocols in Radio Networks with no Collision Detection -- Deterministic Broadcasting Time with Partial Knowledge of the Network -- Algorithms and Data Structures (V) -- Minimizing Makespan in Batch Machine Scheduling -- Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time -- Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array -- Computational Geometry (I) -- A Better Lower Bound for Two-Circle Point Labeling -- Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set -- An Improved Algorithm for Subdivision Traversal without Extra Storage -- Algorithms and Data Structures (VI) -- Generalized H-Coloring of Graphs -- Finding a Two-Core of a Tree in Linear Time -- Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison -- Computational Geometry (II) -- Optimal Beam Penetrations in Two and Three Dimensions -- Searching a Simple Polygon by a k-Searcher -- Characterization of Rooms Searchable by Two Guards -- Computational Biology -- Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers -- Phylogenetic k-Root and Steiner k-Root -- Computational Geometry (III) -- Maintenance of a Piercing Set for Intervals with Applications -- Optimal Polygon Cover Problems and Applications.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540412557

Language: English

DOI: 10.1007/3-540-40996-3

URL: http://dx.doi.org/10.1007/3-540-40996-3

UID:

Format: 1 online resource (XIV, 416 p.)

ISBN: 9783110755411

Series Statement: De Gruyter Proceedings in Mathematics

Content: Elwyn Berlekamp, John Conway, and Richard Guy wrote ‘Winning Ways for your Mathematical Plays’ and turned a recreational mathematics topic into a full mathematical fi eld. They combined set theory, combinatorics, codes, algorithms, and a smattering of other fi elds, leavened with a liberal dose of humor and wit. Their legacy is a lively fi eld of study that still produces many surprises. Despite being experts in other areas of mathematics, in the 50 years since its publication, they also mentored, talked, and played games, giving their time, expertise, and guidance to several generations of mathematicians. This volume is dedicated to Elwyn Berlekamp, John Conway, and Richard Guy. It includes 20 contributions from colleagues that refl ect on their work in combinatorial game theory.

Note: Frontmatter -- , Preface -- , Contents -- , The game of flipping coins -- , The game of blocking pebbles -- , Transverse Wave: an impartial color-propagation game inspired by social influence and Quantum Nim -- , A note on numbers -- , Ordinal sums, clockwise hackenbush, and domino shave -- , Advances in finding ideal play on poset games -- , Strings-and-Coins and Nimstring are PSPACE-complete -- , Partizan subtraction games -- , Circular Nim games CN(7, 4) -- , Misère domineering on 2 × n boards -- , Relator games on groups -- , Playing Bynum’s game cautiously -- , Genetically modified games -- , Game values of arithmetic functions -- , A base-p Sprague–Grundy-type theorem for p-calm subtraction games: Welter’s game and representations of generalized symmetric groups -- , Recursive comparison tests for dicot and dead-ending games under misère play -- , Impartial games with entailing moves -- , Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees -- , Grundy numbers of impartial three-dimensional chocolate-bar games -- , On the structure of misère impartial games , Issued also in print. , In English.

Additional Edition: ISBN 9783110755497

Additional Edition: ISBN 9783110755343

Language: English

DOI: 10.1515/9783110755411

URL: https://doi.org/10.1515/9783110755411

URL: https://www.degruyter.com/isbn/9783110755411

UID:

Format: Online-Ressource (1 online resource (1289 pages))

Edition: Association for Computing Machinery-Digital Library

Series Statement: ACM Digital Library

Note: Title from The ACM Digital Library

Language: English

Keywords: Konferenzschrift

DOI: 10.5555/1347082

URL: Volltext

URL: lizenzpflichtig

UID:

Format: Online-Ressource

ISBN: 9783540409960 , 3540412557

Series Statement: Lecture Notes in Computer Science 1969

Content: This book constitutes the refereed proceedings of the 11th International Conference on Algorithms and Computation, ISAAC 2000, held in Taipei, Taiwan in December 2000. The 46 revised papers presented together with an invited paper were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on algorithms and data structures; combinatorial optimization; approximation and randomized algorithms; graph drawing and graph algorithms; automata, cryptography, and complexity theory; parallel and distributed algorithms; computational geometry; and computational biology

Additional Edition: ISBN 9783540412557

Additional Edition: Buchausg. u.d.T. Algorithms and computation Berlin : Springer, 2000 ISBN 3540412557

Language: English

Subjects: Computer Science

Keywords: Algorithmus ; Datenstruktur ; Algorithmische Geometrie ; Algorithmus ; Datenstruktur ; Algorithmische Geometrie ; Konferenzschrift ; Konferenzschrift

DOI: 10.1007/3-540-40996-3

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Cover

URL: Inhaltsverzeichnis

URL: Kapitel 1

URL: Inhaltstext

Author information: Goos, Gerhard 1937-2020