- 5 Ergebnisse
Kleinster Preis: € 52,96, größter Preis: € 96,29, Mittelwert: € 86,08
1
Algorithms and Computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings - Oscar H. Ibarra
Bestellen
bei ZVAB.com
€ 52,96
Versand: € 0,001
Bestellengesponserter Link
Oscar H. Ibarra:

Algorithms and Computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings - Taschenbuch

1998, ISBN: 3540653856

[EAN: 9783540653851], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; AAC; CAM; ALGORITHM; COMPLEXITY; COMPUTATIONALGEOMETRY; SCHEDULING; ALGORITHMANALYSISANDPROBLEMCOM… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Algorithms and Computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings - Oscar H. Ibarra
Bestellen
bei ZVAB.com
€ 88,59
Versand: € 0,001
Bestellengesponserter Link

Oscar H. Ibarra:

Algorithms and Computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings - Taschenbuch

1998, ISBN: 3540653856

[EAN: 9783540653851], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; AAC; CAM; ALGORITHM; COMPLEXITY; COMPUTATIONALGEOMETRY; SCHEDULING; ALGORITHMANALYSISANDPROBLEMCOM… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
3
Algorithms and Computation - Oscar H. Ibarra
Bestellen
bei booklooker.de
€ 96,29
Versand: € 2,701
Bestellengesponserter Link
Oscar H. Ibarra:
Algorithms and Computation - Taschenbuch

2023

ISBN: 9783540653851

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The papers in this volume were selected for presentation at the Ninth Annual International Symposium on Algorithms and Compu… Mehr…

Versandkosten:Versand nach Deutschland. (EUR 2.70) AHA-BUCH GmbH
4
Algorithms and Computation - Oscar H. Ibarra
Bestellen
bei AbeBooks.de
€ 96,29
Versand: € 0,001
Bestellengesponserter Link
Oscar H. Ibarra:
Algorithms and Computation - Taschenbuch

1998, ISBN: 3540653856

[EAN: 9783540653851], Neubuch, [PU: Springer Berlin Heidelberg Nov 1998], ALGORITHMUS; AAC; CAM; ALGORITHM; COMPLEXITY; COMPUTATIONALGEOMETRY; SCHEDULING; ALGORITHMANALYSISANDPROBLEMCOMPL… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
5
Algorithms and Computation - Kyung-Yong Chwa; Oscar H. Ibarra
Bestellen
bei lehmanns.de
€ 96,29
Versand: € 0,001
Bestellengesponserter Link
Kyung-Yong Chwa; Oscar H. Ibarra:
Algorithms and Computation - Taschenbuch

1998, ISBN: 9783540653851

9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1998

Versandkosten:Versand in 10-14 Tagen. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Algorithms and Computation

This book constitutes the refereed proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98, held in Taejon, Korea, in December 1998.The 47 revised full papers presented were carefully reviewed and selected from a total of 102 submissions. The book is divided in topical sections on computational geometry, complexity, graph drawing, online algorithms and scheduling, CAD/CAM and graphics, graph algorithms, randomized algorithms, combinatorial problems, computational biology, approximation algorithms, and parallel and distributed algorithms.

Detailangaben zum Buch - Algorithms and Computation


EAN (ISBN-13): 9783540653851
ISBN (ISBN-10): 3540653856
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1998
Herausgeber: Springer Berlin
500 Seiten
Gewicht: 0,748 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-04T19:36:15+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-05-12T17:46:45+02:00 (Vienna)
ISBN/EAN: 9783540653851

ISBN - alternative Schreibweisen:
3-540-65385-6, 978-3-540-65385-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: and yong, ibar, bosch
Titel des Buches: 1998, december, algorithms computation, korea, isaac, proceedings the 9th international, tae, symposium notes


Daten vom Verlag:

Autor/in: Kyung-Yong Chwa; Oscar H. Ibarra
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings
Verlag: Springer; Springer Berlin
486 Seiten
Erscheinungsjahr: 1998-11-23
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 1,530 kg
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
D, 486 p.

BC; Theory of Computation; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; AAC; CAM; algorithm; algorithms; complexity; computational geometry; scheduling; algorithm analysis and problem complexity; Programming Techniques; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computation by Abstract Devices; Computer Communication Networks; Theory of Computation; Programming Techniques; Algorithms; Discrete Mathematics in Computer Science; Computer Communication Networks; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Netzwerk-Hardware; EA

Invited Presentation.- The Discrepancy Method.- Implementing Algorithms and Data Structures: An Educational and Research Perspective.- Geometry I.- L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing.- Facility Location on Terrains.- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles.- Complexity I.- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words.- Disjunctions of Horn Theories and Their Cores.- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It.- Graph Drawing.- Two-Layer Planarization in Graph Drawing.- Computing Orthogonal Drawings in a Variable Embedding Setting.- Dynamic Grid Embedding with Few Bends and Changes.- On-Line Algorithm and Scheduling.- Two New Families of List Update Algorithms.- An Optimal Algorithm for On-Line Palletizing at Delivery Industry.- On-Line Scheduling of Parallel Jobs with Runtime Restrictions.- CAD/CAM and Graphics.- Testing the Quality of Manufactured Disks and Cylinders.- Casting with Skewed Ejection Direction.- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image.- Graph Algorithm I.- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.- Polyhedral Structure of Submodular and Posi-modular Systems.- Maximizing the number of Connections in Optical Tree Networks.- Best Paper Presentation.- Selecting the k Largest Elements with Parity Tests.- Randomized Algorithm.- Randomized K-Dimensional Binary Search Trees.- Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks.- Random Regular Graphs with Edge Faults: Expansion through Cores.- Complexity II.- A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem.- Generalized Graph Colorability and Compressibility of Boolean Formulae.- On the Complexity of Free Monoid Morphisms.- Graph Algorithm II.- Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs.- Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs.- Finding Planar Geometric Automorphisms in Planar Graphs.- Combinatorial Problem.- New Approach for Speeding Up Enumeration Algorithms.- Hamiltonian Decomposition of Recursive Circulants.- Convertibility among Grid Filling Curves.- Geometry II.- Generalized Self-Approaching Curves.- The Steiner Tree Problem in ?4-geometry Plane.- Computational Biology.- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages.- On the Multiple Gene Duplication Problem.- Geometry III.- Visibility Queries in Simple Polygons and Applications.- Quadtree Decomposition, Steiner Triangulation, and Ray Shooting.- Optimality and Integer Programming Formulations of Triangulations in General Dimension.- Approximation Algorithm.- Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.- A Capacitated Vehicle Routing Problem on a Tree.- Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.- Complexity III.- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.- Inapproximability Results for Guarding Polygons without Holes.- The Inapproximability of Non NP-hard Optimization Problems.- Parallel and Distributed Algorithm.- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution.- Optimal Approximate Agreement with Omission Faults.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783319046563 Algorithms and Computation (Sudebkumar Prasant Pal)


< zum Archiv...