• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

10% studentrabatt med kod TERM26

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare

    Mina sidor

      Hjälp

      • Kundservice
      • Vanliga frågor och svar
      • Frakt och leverans
      • Retur vid ångerrätt
      • Reklamera vara
      • Betalning
      • Köpvillkor
      • Allmänna villkor
      • Information om webbplatsens tillgänglighet

      Om Bokus

      • Om oss
      • Pressrum
      • För studenter
      • För företag
      • För bibliotek och offentlig verksamhet
      • För leverantörer
      • Hållbarhet

      Populärt

      • Aktuella erbjudanden
      • Presentkort
      • Studentlitteratur
      • Nya böcker
      • Topplistor
      • Signerade böcker
      • Engelska böcker

      Inspiration

      • Boktips
      • BookTok
      • Populära bokserier
      • Barnbokskaraktärer
      • Populära författare
      Logotyp för Bokus
      Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
      bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
      Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
      1. Data och IT
      2. Programmeringsböcker

      Algorithms - ESA 2006

      14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings

      AvYossi Azar,Thomas Erlebach

      Häftad, Engelska, 2006

      Del i serien Lecture Notes in Computer Science

      1 124 kr

      Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

      Beskrivning

      This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in the context of the combined conference ALGO 2006. The book presents 70 revised full papers together with abstracts of 3 invited lectures. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.

      Produktinformation

      • Utgivningsdatum:2006-08-31
      • Mått:155 x 235 x 47 mm
      • Vikt:1 288 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:850
      • Upplaga:2006
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540388753

      Utforska kategorier

      • Programmeringsböcker inom Data och IT

      Innehållsförteckning

      • Invited Lectures.- Origami, Linkages, and Polyhedra: Folding with Algorithms.- Reliable and Efficient Geometric Computing.- Some Computational Challenges in Today’s Bio-medicine.- Contributed Papers: Design and Analysis Track.- Kinetic Collision Detection for Convex Fat Objects.- Dynamic Connectivity for Axis-Parallel Rectangles.- Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.- Cooperative TSP.- Fréchet Distance for Curves, Revisited.- Resource Allocation in Bounded Degree Trees.- Dynamic Algorithms for Graph Spanners.- Latency Constrained Aggregation in Sensor Networks.- Competitive Analysis of Flash-Memory Algorithms.- Contention Resolution with Heterogeneous Job Sizes.- Deciding Relaxed Two-Colorability—A Hardness Jump.- Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.- Estimating Entropy over Data Streams.- Necklaces, Convolutions, and X + Y.- Purely Functional Worst Case Constant Time Catenable Sorted Lists.- Taxes for Linear Atomic Congestion Games.- Spanners with Slack.- Compressed Indexes for Approximate String Matching.- Traversing the Machining Graph.- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games.- Distributed Almost Exact Approximations for Minor-Closed Families.- Spectral Clustering by Recursive Partitioning.- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data.- Dynamic Programming and Fast Matrix Multiplication.- Near-Entropy Hotlink Assignments.- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods.- Finding Total Unimodularity in Optimization Problems Solved by Linear Programs.- Preemptive Online Scheduling: Optimal Algorithms for All Speeds.- On the Complexity of theMultiplication Method for Monotone CNF/DNF Dualization.- Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.- Graph Coloring with Rejection.- A Doubling Dimension Threshold ?(loglogn) for Augmented Graph Navigability.- Violator Spaces: Structure and Algorithms.- Region-Restricted Clustering for Geographic Data Mining.- An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths.- Cheating by Men in the Gale-Shapley Stable Matching Algorithm.- Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold.- Enumerating Spanning and Connected Subsets in Graphs and Matroids.- Less Hashing, Same Performance: Building a Better Bloom Filter.- A Unified Approach to Approximating Partial Covering Problems.- Navigating Low-Dimensional and Hierarchical Population Networks.- Popular Matchings in the Capacitated House Allocation Problem.- Inner-Product Based Wavelet Synopses for Range-Sum Queries.- Approximation in Preemptive Stochastic Online Scheduling.- Greedy in Approximation Algorithms.- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths.- Stochastic Shortest Paths Via Quasi-convex Maximization.- Path Hitting in Acyclic Graphs.- Minimum Transversals in Posi-modular Systems.- An LP-Designed Algorithm for Constraint Satisfaction.- Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing.- Balancing Applied to Maximum Network Flow Problems.- Contributed Papers: Engineering and Applications Track.- Out-of-Order Event Processing in Kinetic Data Structures.- Kinetic Algorithms Via Self-adjusting Computation.- Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions.- Reporting Flock Patterns.- On Exact Algorithms for Treewidth.- An ImprovedConstruction for Counting Bloom Filters.- An MINLP Solution Method for a Water Network Problem.- Skewed Binary Search Trees.- Algorithmic Aspects of Proportional Symbol Maps.- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?.- Multiline Addressing by Network Flow.- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression.- The Price of Resiliency: A Case Study on Sorting with Memory Faults.- How Branch Mispredictions Affect Quicksort.- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces.- Engineering Highway Hierarchies.- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited.- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method.
      Hoppa över listan

      Du kanske också är intresserad av

      Thomas Erlebach, Yossi Azar - Algorithms - ESA 2006, E-bok

      Algorithms - ESA 2006

      Thomas Erlebach, Yossi Azar

      E-bok
      2006

      1 413 kr

      Christos Kaklamanis, Thomas Erlebach - Approximation and Online Algorithms, E-bok

      Approximation and Online Algorithms

      Christos Kaklamanis, Thomas Erlebach

      E-bok
      2007

      710 kr

      Giuseppe Persiano, Thomas Erlebach - Approximation and Online Algorithms, E-bok

      Approximation and Online Algorithms

      Giuseppe Persiano, Thomas Erlebach

      E-bok
      2006

      710 kr

      Daniel Paulusma, Tom Friedetzky, Thomas Erlebach, Hajo Broersma - Graph-Theoretic Concepts in Computer Science, E-bok

      Graph-Theoretic Concepts in Computer Science

      Daniel Paulusma, Tom Friedetzky, Thomas Erlebach, Hajo Broersma

      E-bok
      2008

      710 kr

      Thomas Erlebach, Sotiris Nikoletseas, Pekka Orponen - Algorithms for Sensor Systems, Häftad

      Algorithms for Sensor Systems

      Thomas Erlebach, Sotiris Nikoletseas, Pekka Orponen

      Häftad, 2012

      566 kr

      Giuseppe Persiano, Thomas Erlebach - Approximation and Online Algorithms, E-bok

      Approximation and Online Algorithms

      Giuseppe Persiano, Thomas Erlebach

      E-bok
      2013

      712 kr

      Thomas Erlebach, Thomas Erlebach - Combinatorial and Algorithmic Aspects of Networking, Häftad

      Combinatorial and Algorithmic Aspects of Networking

      Thomas Erlebach, Thomas Erlebach

      Häftad, 2006

      566 kr

      Leah Epstein, Thomas Erlebach - Approximation and Online Algorithms, Häftad
      Del 11312

      Approximation and Online Algorithms

      Leah Epstein, Thomas Erlebach

      Häftad, 2018

      549 kr

      Thomas Erlebach, Michael Segal - Algorithmics of Wireless Networks, Häftad

      Algorithmics of Wireless Networks

      Thomas Erlebach, Michael Segal

      Häftad, 2022

      665 kr

      Pekka Orponen, Sotiris Nikoletseas, Thomas Erlebach - Algorithms for Sensor Systems, E-bok

      Algorithms for Sensor Systems

      Pekka Orponen, Sotiris Nikoletseas, Thomas Erlebach

      E-bok
      2012

      734 kr