- 5 Ergebnisse
Kleinster Preis: € 117,69, größter Preis: € 179,00, Mittelwert: € 141,45
1
Algorithms -- ESA 2004 - >100
Bestellen
bei ebooks.com
€ 179,00
Bestellengesponserter Link
>100:

Algorithms -- ESA 2004 - neues Buch

2004, ISBN: 9783540301400

This volume contains the 70 contributed papers and abstracts of two invited l- tures presented at the 12th Annual European Symposium on Algorithms (ESA 2004), held in Bergen, Norway, Sept… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
2
Algorithms -- ESA 2004
Bestellen
bei Hugendubel.de
€ 144,99
Versand: € 0,001
Bestellengesponserter Link
Algorithms -- ESA 2004 - neues Buch

2004, ISBN: 9783540301400

Algorithms -- ESA 2004 ab 144.99 € als pdf eBook: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Aus dem Bereich: eBooks, Belletristik, Erzählungen, h… Mehr…

  - Nr. Versandkosten:, , DE. (EUR 0.00)
3
Algorithms -- ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - Viola Hach-Wunderle
Bestellen
bei hive.co.uk
£ 107,10
(ca. € 120,58)
Bestellengesponserter Link
Viola Hach-Wunderle:
Algorithms -- ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - neues Buch

2004

ISBN: 9783540301400

; PDF; Computing > Computer programming / software development, Springer Berlin Heidelberg

  - No. 9783540301400. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
4
Bestellen
bei eBook.de
€ 144,99
Versand: € 0,001
Bestellengesponserter Link
Algorithms -- ESA 2004 - neues Buch

2004, ISBN: 9783540301400

Algorithms -- ESA 2004 ab 144.99 EURO 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings Medien > Bücher, [PU: Springer, Berlin/Heidelberg]

  - Nr. Versandkosten:, , DE. (EUR 0.00)
5
Algorithms -- ESA 2004 - Susanne Albers; Tomasz Radzik
Bestellen
bei Springer.com
€ 117,69
Versand: € 0,001
Bestellengesponserter Link
Susanne Albers; Tomasz Radzik:
Algorithms -- ESA 2004 - neues Buch

2004, ISBN: 9783540301400

There is currently no description available Books > Computer Science eBook, Springer Shop

new in stock. Versandkosten:zzgl. Versandkosten. (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

Detailangaben zum Buch - Algorithms -- ESA 2004


EAN (ISBN-13): 9783540301400
Erscheinungsjahr: 2004
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-04-24T11:54:55+02:00 (Berlin)
Detailseite zuletzt geändert am 2021-03-25T11:04:39+01:00 (Berlin)
ISBN/EAN: 9783540301400

ISBN - alternative Schreibweisen:
978-3-540-30140-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: wunderle
Titel des Buches: esa, one norway, kam aus den bergen


Daten vom Verlag:

Autor/in: Susanne Albers; Tomasz Radzik
Titel: Lecture Notes in Computer Science; Algorithms -- ESA 2004 - 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings
Verlag: Springer; Springer Berlin
836 Seiten
Erscheinungsjahr: 2004-09-01
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XXXVI, 836 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Variable; algorithm analysis; algorithm design; algorithm theory; algorithmic mathematics; algorithmics; algorithms; approximation; calculus; complexity; computational complexity; data structures; external memory; graph algorithms; modeling; algorithm analysis and problem complexity; C; Software Engineering; Algorithms; Numerical Analysis; Discrete Mathematics in Computer Science; Data Science; Computer Communication Networks; Computer Science; Algorithmen und Datenstrukturen; Numerische Mathematik; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; Netzwerk-Hardware; BC

Invited Lectures.- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing.- Algorithmic Aspects of Web Search Engines.- Design and Analysis Track.- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects.- Swap and Mismatch Edit Distance.- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design.- Optimal External Memory Planar Point Enclosure.- Maximizing Throughput in Multi-queue Switches.- An Improved Algorithm for CIOQ Switches.- Labeling Smart Dust.- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods.- Modeling Locality: A Probabilistic Analysis of LRU and FWF.- An Algorithm for Computing DNA Walks.- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.- Direct Routing: Algorithms and Complexity.- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families.- A Parameterized Algorithm for Upward Planarity Testing.- Fisher Equilibrium Price with a Class of Concave Utility Functions.- Hardness and Approximation Results for Packing Steiner Trees.- Approximation Hardness of Dominating Set Problems.- Improved Online Algorithms for Buffer Management in QoS Switches.- Time Dependent Multi Scheduling of Multicast.- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems.- The Average Case Analysis of Partition Sorts.- A Fast Distributed Algorithm for Approximating the Maximum Matching.- Extreme Points Under Random Noise.- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.- On Variable-Sized Multidimensional Packing.- An Inductive Construction for Plane Laman Graphs via Vertex Splitting.- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.- On the Evolution of Selfish Routing.- Competitive Online Approximation of the Optimal Search Ratio.- Incremental Algorithms for Facility Location and k-Median.- Dynamic Shannon Coding.- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries.- Negotiation-Range Mechanisms: Coalition-Resistant Markets.- Approximation Algorithms for Quickest Spanning Tree Problems.- An Approximation Algorithm for Maximum Triangle Packing.- Approximate Parameterized Matching.- Approximation of Rectangle Stabbing and Interval Stabbing Problems.- Fast 3-Coloring Triangle-Free Planar Graphs.- Approximate Unions of Lines and Minkowski Sums.- Radio Network Clustering from Scratch.- Seeking a Vertex of the Planar Matching Polytope in NC.- Equivalence of Search Capability Among Mobile Guards with Various Visibilities.- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors.- On the Stability of Multiple Partner Stable Marriages with Ties.- Flows on Few Paths: Algorithms and Lower Bounds.- Maximum Matchings in Planar Graphs via Gaussian Elimination.- Fast Multipoint Evaluation of Bivariate Polynomials.- On Adaptive Integer Sorting.- Tiling a Polygon with Two Kinds of Rectangles.- On Dynamic Shortest Paths Problems.- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries.- Fast Sparse Matrix Multiplication.- Engineering and Applications Track.- An Experimental Study of Random Knapsack Problems.- Contraction and Treewidth Lower Bounds.- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks.- Comparing Real Algebraic Numbers of Small Degree.- Code Flexibility and Program Efficiency by Genericity: Improving Cgal ’sArrangements.- Finding Dominators in Practice.- Data Migration on Parallel Disks.- Classroom Examples of Robustness Problems in Geometric Computations.- Stable Minimum Storage Merging by Symmetric Comparisons.- On Rectangular Cartograms.- Multi-word Atomic Read/Write Registers on Multiprocessor Systems.- Beyond Optimal Play in Two-Person-Zerosum Games.- Solving Geometric Covering Problems by Data Reduction.- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions.- Super Scalar Sample Sort.- Construction of Minimum-Weight Spanners.- A Straight Skeleton Approximating the Medial Axis.- Non-additive Shortest Paths.
Includes supplementary material: sn.pub/extras

< zum Archiv...