Anmelden

Registrieren
Passwort vergessen?

Such-Historie
Merkliste
Links zu eurobuch.de
Cookie-Einstellungen

Tipp von eurobuch.de

Buch verkaufen

Suchtools

Aktuelles

NEU: Endlose Ergebnisliste als Mitglied ein- oder ausschalten.

Sie haben JavaScript in Ihren Browsereinstellungen deaktiviert!
Für eine optimale Bedienbarkeit der Buchsuche empfehlen wir, JavaScript für eurobuch.de zu aktivieren.
Um ein aktuelles Suchergebnis ohne JavaScript zu sehen, müssen Sie u.U. mehrmals auf "Suchen" klicken.

- 5 Ergebnisse

Kleinster Preis: € 48,37, größter Preis: € 53,49, Mittelwert: € 52,47

Algorithms and Computation - Pat Morin

(*)

Pat Morin:
Algorithms and Computation - Taschenbuch

2002, ISBN: 3540001425

[EAN: 9783540001423], Neubuch, [PU: Springer Berlin Heidelberg Nov 2002], ALGORITHMUS; KOMBINATORIK; AAC; ALGORITHMICS; COMBINATORIALOPTIMIZATION; COMPUTATIONALGEOMETRY; DATASTRUCTURES; O… Mehr…

[EAN: 9783540001423], Neubuch, [PU: Springer Berlin Heidelberg Nov 2002], ALGORITHMUS; KOMBINATORIK; AAC; ALGORITHMICS; COMBINATORIALOPTIMIZATION; COMPUTATIONALGEOMETRY; DATASTRUCTURES; OPTIMIZATION; ALGORITHMANALYSISANDPROBLEMCOMPLEXITY, This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the papers selected for presentation at the Thirteenth - nual International Symposium on Algorithms and Computation (ISAAC 2002) tobeheldinVancouver,CanadaonNovember21-23,2002.Thisisthe rsttime thatISAAChasventuredintoNorthAmerica,asitistraditionallyheldinthe Asia-Paci c region. ISAAC is an annual international symposium that covers the very broad areas of algorithms and computing in general. The scope of this symposium - cludes both theoretical and applied research from these elds. The main aim of the symposium is to promote the exchange of ideas in this active research community. The speci c themes targeted for ISAAC 2002 were Computational Geometry,AlgorithmsandDataStructures,ApproximationAlgorithms,Ran- mizedAlgorithms,GraphDrawingandGraphAlgorithms,Combinatorial- timization,ComputationalBiology,ComputationalFinance,Cryptography,and Parallel and Distributed Computing. Inresponsetoourcallforpapers,wereceivedcloseto160submissions.The challenging task of selecting the papers for presentation was performed by the membersofourprogramcommittee,theirsupportsta ,andreferees.Allof them deserve special thanks for their hard work in the di cult task of selecting amere54papersfromthehigh-qualitysubmissions.Unfortunately,duetothe timeconstraintsimposedbyathree-dayconference,wewereforcedtoturn away many excellent papers. John Iacono will receive the traditionalbestpaperaward for his paper entitled KeyIndependentOptimality. Our three invited speakers are Luc Devroye from McGill University who will speak onRandomTries,J anos Pach from New York University who will speak onMonotoneDrawingsofPlanarGraphs,andNic- las Pippenger from the University of British Columbia who will speak on the ExpectedAcceptanceCountsforFiniteAutomatawithAlmostUniformInput. No conference can succeed without exceptional local organization. For the often overlooked and thankless task of nding a suitable venue and banquet location,dealingwiththelogisticsofregistration,organizinglunchesandco ee, etc.,wewouldliketothankthetheorganizingcommittee,NadjaRence,andOlga Stachova for all their e orts above and beyond the call of duty. We thank our sponsorsSimonFraserUniversity,thePaci cInstituteofMathematicalSciences, the institute for Mathematics of Information Technology and Complex Systems, andBajaiInc.fortheirgeneroussupport.Finally,wethankalltheauthorsand participants. We hope this edition of ISAAC will be a success. 676 pp. Englisch, Books<

AbeBooks.de

BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00)
Details...

(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

Algorithms and Computation - Pat Morin

(*)

Pat Morin:
Algorithms and Computation - Taschenbuch

2008, ISBN: 9783540001423

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the papers selected for presentation at the Thirteenth - nual International Symposium on Algorithms and… Mehr…

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the papers selected for presentation at the Thirteenth - nual International Symposium on Algorithms and Computation (ISAAC 2002) tobeheldinVancouver,CanadaonNovember21-23,2002.Thisisthe rsttime thatISAAChasventuredintoNorthAmerica,asitistraditionallyheldinthe Asia-Paci c region. ISAAC is an annual international symposium that covers the very broad areas of algorithms and computing in general. The scope of this symposium - cludes both theoretical and applied research from these elds. The main aim of the symposium is to promote the exchange of ideas in this active research community. The speci c themes targeted for ISAAC 2002 were Computational Geometry,AlgorithmsandDataStructures,ApproximationAlgorithms,Ran- mizedAlgorithms,GraphDrawingandGraphAlgorithms,Combinatorial- timization,ComputationalBiology,ComputationalFinance,Cryptography,and Parallel and Distributed Computing. Inresponsetoourcallforpapers,wereceivedcloseto160submissions.The challenging task of selecting the papers for presentation was performed by the membersofourprogramcommittee,theirsupportsta ,andreferees.Allof them deserve special thanks for their hard work in the di cult task of selecting amere54papersfromthehigh-qualitysubmissions.Unfortunately,duetothe timeconstraintsimposedbyathree-dayconference,wewereforcedtoturn away many excellent papers. John Iacono will receive the traditionalbestpaperaward for his paper entitled KeyIndependentOptimality. Our three invited speakers are Luc Devroye from McGill University who will speak onRandomTries,J anos Pach from New York University who will speak onMonotoneDrawingsofPlanarGraphs,andNic- las Pippenger from the University of British Columbia who will speak on the ExpectedAcceptanceCountsforFiniteAutomatawithAlmostUniformInput. No conference can succeed without exceptional local organization. For the often overlooked and thankless task of nding a suitable venue and banquet location,dealingwiththelogisticsofregistration,organizinglunchesandco ee, etc.,wewouldliketothankthetheorganizingcommittee,NadjaRence,andOlga Stachova for all their e orts above and beyond the call of duty. We thank our sponsorsSimonFraserUniversity,thePaci cInstituteofMathematicalSciences, the institute for Mathematics of Information Technology and Complex Systems, andBajaiInc.fortheirgeneroussupport.Finally,wethankalltheauthorsand participants. We hope this edition of ISAAC will be a success.- Besorgungstitel - vorauss. Lieferzeit 3-5 Tage., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 235x155x37 mm, 676, [GW: 1007g], Banküberweisung, Offene Rechnung, Kreditkarte, PayPal, Offene Rechnung (Vorkasse vorbehalten), Internationaler Versand<

booklooker.de

AHA-BUCH GmbH
Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00)
Details...

(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

Algorithms and Computation - Bose, Prosenjit|Morin, Pat

(*)

Bose, Prosenjit|Morin, Pat:
Algorithms and Computation - Taschenbuch

2002, ISBN: 3540001425

[EAN: 9783540001423], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS KOMBINATORIK AAC ALGORITHMICS COMBINATORIALOPTIMIZATION COMPUTATIONALGEOMETRY DATASTRUCTURES OPTIMIZATION ALGO… Mehr…

AbeBooks.de

moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]
NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00)
Details...

(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

Algorithms and Computation

(*)

Algorithms and Computation - Taschenbuch

2002, ISBN: 9783540001423

*Algorithms and Computation* - 13th International Symposium ISAAC 2002 Vancouver BC Canada November 21-23 2002 Proceedings. Auflage 2002 / Taschenbuch für 53.49 € / Aus dem Bereich: Büche… Mehr…

Hugendubel.de

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
Details...

(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

Algorithms and Computation

(*)

Algorithms and Computation - Taschenbuch

2002, ISBN: 9783540001423

*Algorithms and Computation* - 13th International Symposium ISAAC 2002 Vancouver BC Canada November 21-23 2002 Proceedings. Auflage 2002 / Taschenbuch für 53.49 € / Aus dem Bereich: Büche… Mehr…

Hugendubel.de

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
Details...

(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

1

Algorithms and Computation - Pat Morin

Bestellen
bei AbeBooks.de

€ 53,49

Versand: € 0,00¹

Details beim Anbieter

gesponserter Link

Pat Morin:

Algorithms and Computation - Taschenbuch

2002, ISBN: 3540001425

[EAN: 9783540001423], Neubuch, [PU: Springer Berlin Heidelberg Nov 2002], ALGORITHMUS; KOMBINATORIK; AAC; ALGORITHMICS; COMBINATORIALOPTIMIZATION; COMPUTATIONALGEOMETRY; DATASTRUCTURES; O… Mehr…

[EAN: 9783540001423], Neubuch, [PU: Springer Berlin Heidelberg Nov 2002], ALGORITHMUS; KOMBINATORIK; AAC; ALGORITHMICS; COMBINATORIALOPTIMIZATION; COMPUTATIONALGEOMETRY; DATASTRUCTURES; OPTIMIZATION; ALGORITHMANALYSISANDPROBLEMCOMPLEXITY, This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the papers selected for presentation at the Thirteenth - nual International Symposium on Algorithms and Computation (ISAAC 2002) tobeheldinVancouver,CanadaonNovember21-23,2002.Thisisthe rsttime thatISAAChasventuredintoNorthAmerica,asitistraditionallyheldinthe Asia-Paci c region. ISAAC is an annual international symposium that covers the very broad areas of algorithms and computing in general. The scope of this symposium - cludes both theoretical and applied research from these elds. The main aim of the symposium is to promote the exchange of ideas in this active research community. The speci c themes targeted for ISAAC 2002 were Computational Geometry,AlgorithmsandDataStructures,ApproximationAlgorithms,Ran- mizedAlgorithms,GraphDrawingandGraphAlgorithms,Combinatorial- timization,ComputationalBiology,ComputationalFinance,Cryptography,and Parallel and Distributed Computing. Inresponsetoourcallforpapers,wereceivedcloseto160submissions.The challenging task of selecting the papers for presentation was performed by the membersofourprogramcommittee,theirsupportsta ,andreferees.Allof them deserve special thanks for their hard work in the di cult task of selecting amere54papersfromthehigh-qualitysubmissions.Unfortunately,duetothe timeconstraintsimposedbyathree-dayconference,wewereforcedtoturn away many excellent papers. John Iacono will receive the traditionalbestpaperaward for his paper entitled KeyIndependentOptimality. Our three invited speakers are Luc Devroye from McGill University who will speak onRandomTries,J anos Pach from New York University who will speak onMonotoneDrawingsofPlanarGraphs,andNic- las Pippenger from the University of British Columbia who will speak on the ExpectedAcceptanceCountsforFiniteAutomatawithAlmostUniformInput. No conference can succeed without exceptional local organization. For the often overlooked and thankless task of nding a suitable venue and banquet location,dealingwiththelogisticsofregistration,organizinglunchesandco ee, etc.,wewouldliketothankthetheorganizingcommittee,NadjaRence,andOlga Stachova for all their e orts above and beyond the call of duty. We thank our sponsorsSimonFraserUniversity,thePaci cInstituteofMathematicalSciences, the institute for Mathematics of Information Technology and Complex Systems, andBajaiInc.fortheirgeneroussupport.Finally,wethankalltheauthorsand participants. We hope this edition of ISAAC will be a success. 676 pp. Englisch, Books<

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]

Infos zur Preistendenz

2

Algorithms and Computation - Pat Morin

Bestellen
bei booklooker.de

€ 53,49

Versand: € 0,00¹

Details beim Anbieter

gesponserter Link

Pat Morin:

Algorithms and Computation - Taschenbuch

2008, ISBN: 9783540001423

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the papers selected for presentation at the Thirteenth - nual International Symposium on Algorithms and… Mehr…

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the papers selected for presentation at the Thirteenth - nual International Symposium on Algorithms and Computation (ISAAC 2002) tobeheldinVancouver,CanadaonNovember21-23,2002.Thisisthe rsttime thatISAAChasventuredintoNorthAmerica,asitistraditionallyheldinthe Asia-Paci c region. ISAAC is an annual international symposium that covers the very broad areas of algorithms and computing in general. The scope of this symposium - cludes both theoretical and applied research from these elds. The main aim of the symposium is to promote the exchange of ideas in this active research community. The speci c themes targeted for ISAAC 2002 were Computational Geometry,AlgorithmsandDataStructures,ApproximationAlgorithms,Ran- mizedAlgorithms,GraphDrawingandGraphAlgorithms,Combinatorial- timization,ComputationalBiology,ComputationalFinance,Cryptography,and Parallel and Distributed Computing. Inresponsetoourcallforpapers,wereceivedcloseto160submissions.The challenging task of selecting the papers for presentation was performed by the membersofourprogramcommittee,theirsupportsta ,andreferees.Allof them deserve special thanks for their hard work in the di cult task of selecting amere54papersfromthehigh-qualitysubmissions.Unfortunately,duetothe timeconstraintsimposedbyathree-dayconference,wewereforcedtoturn away many excellent papers. John Iacono will receive the traditionalbestpaperaward for his paper entitled KeyIndependentOptimality. Our three invited speakers are Luc Devroye from McGill University who will speak onRandomTries,J anos Pach from New York University who will speak onMonotoneDrawingsofPlanarGraphs,andNic- las Pippenger from the University of British Columbia who will speak on the ExpectedAcceptanceCountsforFiniteAutomatawithAlmostUniformInput. No conference can succeed without exceptional local organization. For the often overlooked and thankless task of nding a suitable venue and banquet location,dealingwiththelogisticsofregistration,organizinglunchesandco ee, etc.,wewouldliketothankthetheorganizingcommittee,NadjaRence,andOlga Stachova for all their e orts above and beyond the call of duty. We thank our sponsorsSimonFraserUniversity,thePaci cInstituteofMathematicalSciences, the institute for Mathematics of Information Technology and Complex Systems, andBajaiInc.fortheirgeneroussupport.Finally,wethankalltheauthorsand participants. We hope this edition of ISAAC will be a success.- Besorgungstitel - vorauss. Lieferzeit 3-5 Tage., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 235x155x37 mm, 676, [GW: 1007g], Banküberweisung, Offene Rechnung, Kreditkarte, PayPal, Offene Rechnung (Vorkasse vorbehalten), Internationaler Versand<

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) AHA-BUCH GmbH

Infos zur Preistendenz

3

Algorithms and Computation - Bose, Prosenjit|Morin, Pat

Bestellen
bei AbeBooks.de

€ 48,37

Versand: € 0,00¹

Details beim Anbieter

gesponserter Link

Bose, Prosenjit|Morin, Pat:
Algorithms and Computation - Taschenbuch

2002

ISBN: 3540001425

[EAN: 9783540001423], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS KOMBINATORIK AAC ALGORITHMICS COMBINATORIALOPTIMIZATION COMPUTATIONALGEOMETRY DATASTRUCTURES OPTIMIZATION ALGO… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]

Infos zur Preistendenz

4

Algorithms and Computation

Bestellen
bei Hugendubel.de

€ 53,49

Versand: € 0,00¹

Details beim Anbieter

gesponserter Link

Algorithms and Computation - Taschenbuch

2002, ISBN: 9783540001423

*Algorithms and Computation* - 13th International Symposium ISAAC 2002 Vancouver BC Canada November 21-23 2002 Proceedings. Auflage 2002 / Taschenbuch für 53.49 € / Aus dem Bereich: Büche… Mehr…

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)

Infos zur Preistendenz

5

Algorithms and Computation

Bestellen
bei Hugendubel.de

€ 53,49

Versand: € 0,00¹

Details beim Anbieter

gesponserter Link

Algorithms and Computation - Taschenbuch

2002, ISBN: 9783540001423

*Algorithms and Computation* - 13th International Symposium ISAAC 2002 Vancouver BC Canada November 21-23 2002 Proceedings. Auflage 2002 / Taschenbuch für 53.49 € / Aus dem Bereich: Büche… Mehr…

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)

Infos zur Preistendenz

¹Da 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

Autor:	Pat Morin
Titel:	Algorithms and Computation
ISBN-Nummer:	9783540001423

This book constitutes the refereed proceedings of the 13th Annual International Symposium on Algorithms and Computation, ISAAC 2002, held in Vancouver, BC, Canada in November 2002.The 54 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from close to 160 submissions. The papers cover all relevant topics in algorithmics and computation, in particular computational geometry, algorithms and data structures, approximation algorithms, randomized algorithms, graph drawing and graph algorithms, combinatorial optimization, computational biology, computational finance, cryptography, and parallel and distributedd algorithms.

Detailangaben zum Buch - Algorithms and Computation

EAN (ISBN-13): 9783540001423
ISBN (ISBN-10): 3540001425
Taschenbuch
Erscheinungsjahr: 2002
Herausgeber: Springer Berlin Heidelberg
676 Seiten
Gewicht: 1,005 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-24T23:06:48+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-03-13T14:05:51+01:00 (Berlin)
ISBN/EAN: 9783540001423

ISBN - alternative Schreibweisen:
3-540-00142-5, 978-3-540-00142-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: bossert, manz, bose, morin
Titel des Buches: algorithms computation, november, vancouver, science

Daten vom Verlag:

Autor/in: Prosenjit K. Bose; Pat Morin
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings
Verlag: Springer; Springer Berlin
662 Seiten
Erscheinungsjahr: 2002-11-08
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIV, 662 p.

BC; Hardcover, Softcover / Mathematik/Sonstiges; Angewandte Mathematik; Verstehen; AAC; algorithmics; algorithms; combinatorial optimization; computational geometry; data structures; optimization; algorithm analysis and problem complexity; Applications of Mathematics; Theory of Computation; Programming Techniques; Algorithms; Computer Communication Networks; Data Science; Theoretische Informatik; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Netzwerk-Hardware; Datenbanken; EA

Session 1A.- Biased Skip Lists.- Space-Efficient Data Structures for Flexible Text Retrieval Systems.- Key Independent Optimality.- On the Comparison-Addition Complexity of All-Pairs Shortest Paths.- On the Comparison-Addition Complexity of All-Pairs Shortest Paths.- On the Clique-Width of Graphs in Hereditary Classes.- On the Clique-Width of Graphs in Hereditary Classes.- The Probability of a Rendezvous Is Minimal in Complete Graphs.- The Probability of a Rendezvous Is Minimal in Complete Graphs.- On the Minimum Volume of a Perturbed Unit Cube.- On the Minimum Volume of a Perturbed Unit Cube.- Non-Delaunay-Based Curve Reconstruction.- Non-Delaunay-Based Curve Reconstruction.- Cutting a Country for Smallest Square Fit.- Cutting a Country for Smallest Square Fit.- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.- Some Remarks on the L-Conjecture.- Some Remarks on the L-Conjecture.- Session 3A.- A Framework for Network Reliability Problems on Graphs of Bounded Treewidth.- A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.- Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.- Session 3B.- An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint.- A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.- Session 4A.- Queaps.- Funnel Heap-A Cache Oblivious Priority Queue.- Characterizing History Independent Data Structures.- Session4B.- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.- An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.- Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs.- Session 5A.- Casting a Polyhedron with Directional Uncertainty.- Hierarchy of Surface Models and Irreducible Triangulation.- Algorithms and Complexity for Tetrahedralization Detections.- Session 5B.- Average-Case Communication-Optimal Parallel Parenthesis Matching.- Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.- New Results for Energy-Efficient Broadcasting in Wireless Networks.- Session 6A.- An Improved Algorithm for the Minimum Manhattan Network Problem.- Approximate Distance Oracles Revisited.- Flat-State Connectivity of Linkages under Dihedral Motions.- Session 6B.- Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms.- Scheduling of Independent Dedicated Multiprocessor Tasks.- On the Approximability of Multiprocessor Task Scheduling Problems.- Session 7A.- Bounded-Degree Independent Sets in Planar Graphs.- Minimum Edge Ranking Spanning Trees of Threshold Graphs.- File Transfer Tree Problems.- Session 7B.- Approximation Algorithms for Some Parameterized Counting Problems.- Approximating MIN k-SAT.- Average-Case Competitive Analyses for Ski-Rental Problems.- Session 8A.- On the Clique Problem in Intersection Graphs of Ellipses.- A Geometric Approach to Boolean Matrix Multiplication.- The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.- Session 8B.- Improved Distance Oracles for Avoiding Link-Failure.- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks.- A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm.- Session 9A.- Crossing Minimization for Symmetries.- Simultaneous Embedding of a Planar Graph and Its Dual on the Grid.- Meaningful Information.- Session 9B.- Optimal Clearing of Supply/Demand Curves.- Partitioning Trees of Supply and Demand.- Maximizing a Voronoi Region: The Convex Case.- Invited Talks.- Random Tries.- Expected Acceptance Counts for Finite Automata with Almost Uniform Input.- Monotone Drawings of Planar Graphs.
Includes supplementary material: sn.pub/extras

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

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

9783319046563 Algorithms and Computation (Sudebkumar Prasant Pal)

Preisentwicklung...

< zum Archiv...