2001, ISBN: 9783540230250
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the 70 contributed papers and abstracts of two invited l- tures presented at the 12th Annual European S… Mehr…
booklooker.de |
Algorithms -- ESA 2004 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - neues Buch
2004, ISBN: 3540230254
2004 Kartoniert / Broschiert Algorithmus, Diskrete Mathematik, Netzwerk-Hardware, Algorithmen und Datenstrukturen, Software Engineering, Datenbanken, Mathematik für Informatiker, Variab… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Algorithms -- ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings (Lecture Notes in Computer Science) - Taschenbuch
2004, ISBN: 9783540230250
Springer, 2004-10-15. Paperback. Very Good. Ex-library paperback in nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding., Springer, 2004… Mehr…
Biblio.co.uk |
Algorithms -- Esa 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - Taschenbuch
2004, ISBN: 9783540230250
Springer-Verlag New York Inc, 2004. Paperback. New. 1st edition. 836 pages. German language. 9.25x6.00x0.75 inches., Springer-Verlag New York Inc, 2004, 6
Biblio.co.uk |
Algorithms -- Esa 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - Erstausgabe
2004, ISBN: 3540230254
Taschenbuch
[EAN: 9783540230250], Neubuch, [PU: Springer-Verlag New York Inc], 1st edition. 836 pages. German language. 9.25x6.00x0.75 inches. In Stock., Books
AbeBooks.de Revaluation Books, Exeter, United Kingdom [2134736] [Rating: 5 (von 5)] NEW BOOK. Versandkosten: EUR 11.50 Details... |
2001, ISBN: 9783540230250
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the 70 contributed papers and abstracts of two invited l- tures presented at the 12th Annual European S… Mehr…
Radzik, Tomasz (Herausgeber); Albers, Susanne (Herausgeber):
Algorithms -- ESA 2004 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - neues Buch2004, ISBN: 3540230254
2004 Kartoniert / Broschiert Algorithmus, Diskrete Mathematik, Netzwerk-Hardware, Algorithmen und Datenstrukturen, Software Engineering, Datenbanken, Mathematik für Informatiker, Variab… Mehr…
Algorithms -- ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings (Lecture Notes in Computer Science) - Taschenbuch
2004
ISBN: 9783540230250
Springer, 2004-10-15. Paperback. Very Good. Ex-library paperback in nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding., Springer, 2004… Mehr…
Algorithms -- Esa 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - Taschenbuch
2004, ISBN: 9783540230250
Springer-Verlag New York Inc, 2004. Paperback. New. 1st edition. 836 pages. German language. 9.25x6.00x0.75 inches., Springer-Verlag New York Inc, 2004, 6
Algorithms -- Esa 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings - Erstausgabe
2004, ISBN: 3540230254
Taschenbuch
[EAN: 9783540230250], Neubuch, [PU: Springer-Verlag New York Inc], 1st edition. 836 pages. German language. 9.25x6.00x0.75 inches. In Stock., Books
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Algorithms -- ESA 2004
EAN (ISBN-13): 9783540230250
ISBN (ISBN-10): 3540230254
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin
860 Seiten
Gewicht: 1,274 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-05-07T14:45:08+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-05-23T13:59:21+02:00 (Berlin)
ISBN/EAN: 9783540230250
ISBN - alternative Schreibweisen:
3-540-23025-4, 978-3-540-23025-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: albers, bergen david, springer, radzik
Titel des Buches: notes, algorithms, esa, european symposium, berg 2004, one norway, kam aus den bergen, september
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
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XXXVI, 836 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Software Engineering; Verstehen; Mathematik; Informatik; 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; Software Engineering; Algorithms; Numerical Analysis; Discrete Mathematics in Computer Science; Data Science; Computer Communication Networks; Algorithmen und Datenstrukturen; Numerische Mathematik; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; Netzwerk-Hardware; EA
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
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783540301400 Algorithms -- ESA 2004 (Susanne Albers; Tomasz Radzik)
- 9783540301400 Algorithms -- ESA 2004 (Susanne Albers; Tomasz Radzik)
- 9783540410041 Algorithms - ESA 2000: 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings Mike Paterson Editor (Mike Paterson)
- 9780387572734 Algorithms -Esa '93: First Annual European Symposium Bad Honnef, Germany September 30-October 2, 1993 : Proceedings (Lecture Notes in Computer Science) (Thomas Lengauer)
- Algorithms - ESA '97: 5th Annual European Symposium, Graz, Austria, September 15-17, 1997. Proceedings (Lecture Notes in Computer Science) (2008-06-13) (unknown)
< zum Archiv...