Radzik Tomasz (42 results)

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Condition: New. pp. 424.

Condition: New.

Paperback. Condition: Brand New. 444 pages. 9.25x6.10x1.00 inches. In Stock.

Condition: New.

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the31st International Workshop onCombinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8-10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format.The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes revised selected papers from the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, held in Lisbon, Portugal\*, in September 2021.The 10 full papers presented in this volume were carefully reviewed and selected from 28 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks.\*The conference was held virtually due to the COVID-19 pandemic.…

Taschenbuch. Condition: Neu. Combinatorial Algorithms | 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings | Leszek G¿sieniec (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xix | Englisch | 2020 | Springer | EAN 9783030489656 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Taschenbuch. Condition: Neu. Algorithms for Sensor Systems | 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, Proceedings | Leszek G¿sieniec (u. a.) | Taschenbuch | Lecture Notes in Computer Science | x | Englisch | 2021 | Springer | EAN 9783030892395 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. In English.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.- Solvi. …

Paperback. Condition: Brand New. 1st edition. 836 pages. German language. 9.25x6.00x0.75 inches. In Stock.

Condition: new. Questo è un articolo print on demand.

Condition: new. Questo è un articolo print on demand.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.