The Resource Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)
Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)
Resource Information
The item Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 This book constitutes the refereed proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, held in Honolulu, Hawaii, USA in December 2009. The 120 revised full papers presented were carefully reviewed and selected from 279 submissions for inclusion in the book. This volume contains topics such as algorithms and data structures, approximation algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, cryptography, experimental algorithm methodologies, graph drawing and graph algorithms, internet algorithms, online algorithms, parallel and distributed algorithms, quantum computing and randomized algorithms
 Language
 eng
 Extent
 1 online resource (xix, 1228 pages)
 Contents

 Bubblesort and Juggling Sequences
 A Proof of the Molecular Conjecture
 Exact Algorithms for Dominating Clique Problems
 Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
 Exact Algorithms for the Bottleneck Steiner Tree Problem
 Exact Algorithms for Set Multicover and Multiset Multicover Problems
 Practical Discrete Unit Disk Cover Using an Exact LineSeparable Algorithm
 DivideandConquer Algorithms for Partitioning Hypergraphs and Submodular Systems
 On Protein Structure Alignment under Distance Constraint
 A Structural Lemma in 2Dimensional Packing, and Its Implications on Approximability
 MaxColoring Paths: Tight Bounds and Extensions
 Fréchet Distance Problems in Weighted Regions
 The Complexity of Solving Stochastic Games on Graphs
 Computational Complexity of Cast Puzzles
 New Bounds on the Average Distance from the FermatWeber Center of a Planar Convex Body
 Reconstructing Numbers from Pairwise Function Values
 Hilbert's Thirteenth Problem and Circuit Complexity
 Interval Stabbing Problems in Small Integer Ranges
 Online Sorted Range Reporting
 Data Structures for Approximate Orthogonal Range Counting
 Dynamic 3Sided Planar Range Queries with Expected Doubly Logarithmic Time
 Untangled Monotonic Chains and Adaptive Range Search
 Geodesic Spanners on Polyhedral Surfaces
 Approximating Points by a Piecewise Linear Function: I
 Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
 Computing the Map of Geometric Minimal Cuts
 On the Camera Placement Problem
 Graph Orientations with Set Connectivity Requirements
 A Linear Vertex Kernel for Maximum Internal Spanning Tree
 Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
 On Shortest Disjoint Paths in Planar Graphs
 An Optimal Labeling for Node Connectivity
 SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
 1Bounded Space Algorithms for 2Dimensional Bin Packing
 On the Advice Complexity of Online Problems
 Online Knapsack Problems with Limited Cuts
 Online Paging for Flash Memory Devices
 Shifting Strategy for Geometric Graphs without Geometry
 Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics
 Approximation Algorithms for MinMax Path Cover Problems with Service Handling Time
 Minimum Covering with Travel Cost
 RouteEnabling Graph Orientation Problems
 Complexity of Approximating the Vertex Centroid of a Polyhedron
 Popular Matchings with Variable Job Capacities
 On the Tightness of the BuhrmanCleveWigderson Simulation
 Bounds on Contention Management Algorithms
 Algorithmic Folding Complexity
 MinEnergy Scheduling for Aligned Jobs in Accelerate Model
 Posimodular Systems with Modulotone Requirements under Permutation Constraints
 Generalized Reduction to Compute Toric Ideals
 Linear and Sublinear Time Algorithms for Basis of Abelian Groups
 Good Programming in Transactional Memory
 Induced Packing of Odd Cycles in a Planar Graph
 On the Infinitesimal Rigidity of BarandSlider Frameworks
 Exploration of Periodically Varying Graphs
 Parameterized Complexity of ArcWeighted Directed Steiner Problems
 Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
 Minimum Cycle Bases of Weighted Outerplanar Graphs
 Bandwidth on ATFree Graphs
 Editing Graphs into Disjoint Unions of Dense Clusters
 A Certifying Algorithm for 3Colorability of P 5Free Graphs
 Parameterizing Cut Sets in a Graph by the Number of Their Components
 Inapproximability of Maximal Strip Recovery
 The Complexity of Perfect Matching Problems on Dense Hypergraphs
 On Lower Bounds for Constant Width Arithmetic Circuits
 Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and ArrowDebreu Equilibria
 The Identity Correspondence Problem and Its Applications
 Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs
 An Improved Approximation Algorithm for the Traveling Tournament Problem
 The FaultTolerant Facility Allocation Problem
 Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
 Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
 The Directed Hausdorff Distance between Imprecise Point Sets
 Computing Multidimensional Persistence
 Locating an Obnoxious Line among Planar Objects
 Finding Fullerene Patches in Polynomial Time
 Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
 A Selfstabilizing and Local Delaunay Graph Construction
 Succinct Greedy Geometric Routing in the Euclidean Plane
 Electric Routing and Concurrent Flow Cutting
 A PolynomialTime Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform PathLengths
 Strong Robustness of Randomized Rumor Spreading Protocols
 Data Structures for Range Median Queries
 Deletion without Rebalancing in Multiway Search Trees
 Counting in the Presence of Memory Faults
 A Simple, Fast, and Compact Static Dictionary
 Reconstructing Polygons from Scanner Data
 Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
 CrossingFree Acyclic Hamiltonian Path Completion for Planar stDigraphs
 Covering a Graph with a Constrained Forest (Extended Abstract)
 TriEdgeConnectivity Augmentation for Planar Straight Line Graphs
 Upward StarShaped Polyhedral Graphs
 Conditional Hardness of Approximating Satisfiable Max 3CSPq
 The Roles of Advice to OneTape LinearTime Turing Machines and Finite Automata (Extended Abstract)
 Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
 StepAssembly with a Constant Number of Tile Types
 Lower Bounds on Fast Searching
 Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
 ConstantFactor Approximations of BranchDecomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time
 PTAS for kTour Cover Problem on the Plane for Moderately Large Values of k
 Optimal Randomized Algorithm for the Density Selection Problem
 New Results on Simple Stochastic Games
 WorstCase and Smoothed Analysis of kMeans Clustering with Bregman Divergences
 Succinct Index for Dynamic Dictionary Matching
 Range Nonoverlapping Indexing
 Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
 Pattern Matching for 321Avoiding Permutations
 Folding a Better Checkerboard
 Finding All Approximate Gapped Palindromes
 General Pseudorandom Generators from Weaker Models of Computation
 Random Generation and Enumeration of Bipartite Permutation Graphs
 A Combinatorial Algorithm for Horn Programs
 Online Maximum Directed Cut
 Maintaining Nets and Net Trees under Incremental Motion
 Distributed Scheduling of Parallel Hybrid Computations
 I/OEfficient Contour Tree Simplification
 Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
 I/O and SpaceEfficient Path Traversal in Planar Graphs
 Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
 TwoVertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
 Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets
 On Partitioning a Graph into Two Connected Subgraphs
 Isbn
 9783642106316
 Label
 Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings
 Title
 Distributed computing
 Title remainder
 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings
 Statement of responsibility
 Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)
 Title variation
 ISAAC 2009
 Subject

 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Electronic data processing  Distributed processing
 Electronic data processing  Distributed processing
 Electronic data processing  Distributed processing  Congresses
 Informatique
 Numerical calculations  Data processing
 Numerical calculations  Data processing
 Numerical calculations  Data processing  Congresses
 Computer algorithms
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, held in Honolulu, Hawaii, USA in December 2009. The 120 revised full papers presented were carefully reviewed and selected from 279 submissions for inclusion in the book. This volume contains topics such as algorithms and data structures, approximation algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, cryptography, experimental algorithm methodologies, graph drawing and graph algorithms, internet algorithms, online algorithms, parallel and distributed algorithms, quantum computing and randomized algorithms
 Cataloging source
 GW5XE
 Dewey number
 004/.36
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.9.A43
 LC item number
 I73 2009
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2009
 http://bibfra.me/vocab/lite/meetingName
 ISAAC (Symposium)
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Dong, Yingfei
 Du, Dingzhu
 Ibarra, Oscar H
 Series statement

 Lecture notes in computer science,
 LNCS sublibrary: SL 1  Theoretical computer science and general issues
 Series volume
 5878
 http://library.link/vocab/subjectName

 Electronic data processing
 Computer algorithms
 Numerical calculations
 Informatique
 Computer algorithms
 Electronic data processing
 Numerical calculations
 Label
 Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Bubblesort and Juggling Sequences  A Proof of the Molecular Conjecture  Exact Algorithms for Dominating Clique Problems  Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming  Exact Algorithms for the Bottleneck Steiner Tree Problem  Exact Algorithms for Set Multicover and Multiset Multicover Problems  Practical Discrete Unit Disk Cover Using an Exact LineSeparable Algorithm  DivideandConquer Algorithms for Partitioning Hypergraphs and Submodular Systems  On Protein Structure Alignment under Distance Constraint  A Structural Lemma in 2Dimensional Packing, and Its Implications on Approximability  MaxColoring Paths: Tight Bounds and Extensions  Fréchet Distance Problems in Weighted Regions  The Complexity of Solving Stochastic Games on Graphs  Computational Complexity of Cast Puzzles  New Bounds on the Average Distance from the FermatWeber Center of a Planar Convex Body  Reconstructing Numbers from Pairwise Function Values  Hilbert's Thirteenth Problem and Circuit Complexity  Interval Stabbing Problems in Small Integer Ranges  Online Sorted Range Reporting  Data Structures for Approximate Orthogonal Range Counting  Dynamic 3Sided Planar Range Queries with Expected Doubly Logarithmic Time  Untangled Monotonic Chains and Adaptive Range Search  Geodesic Spanners on Polyhedral Surfaces  Approximating Points by a Piecewise Linear Function: I  Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers  Computing the Map of Geometric Minimal Cuts  On the Camera Placement Problem  Graph Orientations with Set Connectivity Requirements  A Linear Vertex Kernel for Maximum Internal Spanning Tree  Geometric Minimum Diameter Minimum Cost Spanning Tree Problem  On Shortest Disjoint Paths in Planar Graphs  An Optimal Labeling for Node Connectivity  SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks  1Bounded Space Algorithms for 2Dimensional Bin Packing  On the Advice Complexity of Online Problems  Online Knapsack Problems with Limited Cuts  Online Paging for Flash Memory Devices  Shifting Strategy for Geometric Graphs without Geometry  Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics  Approximation Algorithms for MinMax Path Cover Problems with Service Handling Time  Minimum Covering with Travel Cost  RouteEnabling Graph Orientation Problems  Complexity of Approximating the Vertex Centroid of a Polyhedron  Popular Matchings with Variable Job Capacities  On the Tightness of the BuhrmanCleveWigderson Simulation  Bounds on Contention Management Algorithms  Algorithmic Folding Complexity  MinEnergy Scheduling for Aligned Jobs in Accelerate Model  Posimodular Systems with Modulotone Requirements under Permutation Constraints  Generalized Reduction to Compute Toric Ideals  Linear and Sublinear Time Algorithms for Basis of Abelian Groups  Good Programming in Transactional Memory  Induced Packing of Odd Cycles in a Planar Graph  On the Infinitesimal Rigidity of BarandSlider Frameworks  Exploration of Periodically Varying Graphs  Parameterized Complexity of ArcWeighted Directed Steiner Problems  Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries  Minimum Cycle Bases of Weighted Outerplanar Graphs  Bandwidth on ATFree Graphs  Editing Graphs into Disjoint Unions of Dense Clusters  A Certifying Algorithm for 3Colorability of P 5Free Graphs  Parameterizing Cut Sets in a Graph by the Number of Their Components  Inapproximability of Maximal Strip Recovery  The Complexity of Perfect Matching Problems on Dense Hypergraphs  On Lower Bounds for Constant Width Arithmetic Circuits  Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and ArrowDebreu Equilibria  The Identity Correspondence Problem and Its Applications  Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs  An Improved Approximation Algorithm for the Traveling Tournament Problem  The FaultTolerant Facility Allocation Problem  Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks  Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms  The Directed Hausdorff Distance between Imprecise Point Sets  Computing Multidimensional Persistence  Locating an Obnoxious Line among Planar Objects  Finding Fullerene Patches in Polynomial Time  Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids  A Selfstabilizing and Local Delaunay Graph Construction  Succinct Greedy Geometric Routing in the Euclidean Plane  Electric Routing and Concurrent Flow Cutting  A PolynomialTime Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform PathLengths  Strong Robustness of Randomized Rumor Spreading Protocols  Data Structures for Range Median Queries  Deletion without Rebalancing in Multiway Search Trees  Counting in the Presence of Memory Faults  A Simple, Fast, and Compact Static Dictionary  Reconstructing Polygons from Scanner Data  Computing Large Matchings in Planar Graphs with Fixed Minimum Degree  CrossingFree Acyclic Hamiltonian Path Completion for Planar stDigraphs  Covering a Graph with a Constrained Forest (Extended Abstract)  TriEdgeConnectivity Augmentation for Planar Straight Line Graphs  Upward StarShaped Polyhedral Graphs  Conditional Hardness of Approximating Satisfiable Max 3CSPq  The Roles of Advice to OneTape LinearTime Turing Machines and Finite Automata (Extended Abstract)  Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement  StepAssembly with a Constant Number of Tile Types  Lower Bounds on Fast Searching  Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity  ConstantFactor Approximations of BranchDecomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time  PTAS for kTour Cover Problem on the Plane for Moderately Large Values of k  Optimal Randomized Algorithm for the Density Selection Problem  New Results on Simple Stochastic Games  WorstCase and Smoothed Analysis of kMeans Clustering with Bregman Divergences  Succinct Index for Dynamic Dictionary Matching  Range Nonoverlapping Indexing  Querying Two Boundary Points for Shortest Paths in a Polygonal Domain  Pattern Matching for 321Avoiding Permutations  Folding a Better Checkerboard  Finding All Approximate Gapped Palindromes  General Pseudorandom Generators from Weaker Models of Computation  Random Generation and Enumeration of Bipartite Permutation Graphs  A Combinatorial Algorithm for Horn Programs  Online Maximum Directed Cut  Maintaining Nets and Net Trees under Incremental Motion  Distributed Scheduling of Parallel Hybrid Computations  I/OEfficient Contour Tree Simplification  Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes  I/O and SpaceEfficient Path Traversal in Planar Graphs  Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model  TwoVertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)  Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets  On Partitioning a Graph into Two Connected Subgraphs
 Control code
 534951202
 Dimensions
 unknown
 Extent
 1 online resource (xix, 1228 pages)
 Form of item
 online
 Isbn
 9783642106316
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations (some color)
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642106309
 Specific material designation
 remote
 System control number
 (OCoLC)534951202
 Label
 Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Bubblesort and Juggling Sequences  A Proof of the Molecular Conjecture  Exact Algorithms for Dominating Clique Problems  Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming  Exact Algorithms for the Bottleneck Steiner Tree Problem  Exact Algorithms for Set Multicover and Multiset Multicover Problems  Practical Discrete Unit Disk Cover Using an Exact LineSeparable Algorithm  DivideandConquer Algorithms for Partitioning Hypergraphs and Submodular Systems  On Protein Structure Alignment under Distance Constraint  A Structural Lemma in 2Dimensional Packing, and Its Implications on Approximability  MaxColoring Paths: Tight Bounds and Extensions  Fréchet Distance Problems in Weighted Regions  The Complexity of Solving Stochastic Games on Graphs  Computational Complexity of Cast Puzzles  New Bounds on the Average Distance from the FermatWeber Center of a Planar Convex Body  Reconstructing Numbers from Pairwise Function Values  Hilbert's Thirteenth Problem and Circuit Complexity  Interval Stabbing Problems in Small Integer Ranges  Online Sorted Range Reporting  Data Structures for Approximate Orthogonal Range Counting  Dynamic 3Sided Planar Range Queries with Expected Doubly Logarithmic Time  Untangled Monotonic Chains and Adaptive Range Search  Geodesic Spanners on Polyhedral Surfaces  Approximating Points by a Piecewise Linear Function: I  Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers  Computing the Map of Geometric Minimal Cuts  On the Camera Placement Problem  Graph Orientations with Set Connectivity Requirements  A Linear Vertex Kernel for Maximum Internal Spanning Tree  Geometric Minimum Diameter Minimum Cost Spanning Tree Problem  On Shortest Disjoint Paths in Planar Graphs  An Optimal Labeling for Node Connectivity  SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks  1Bounded Space Algorithms for 2Dimensional Bin Packing  On the Advice Complexity of Online Problems  Online Knapsack Problems with Limited Cuts  Online Paging for Flash Memory Devices  Shifting Strategy for Geometric Graphs without Geometry  Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics  Approximation Algorithms for MinMax Path Cover Problems with Service Handling Time  Minimum Covering with Travel Cost  RouteEnabling Graph Orientation Problems  Complexity of Approximating the Vertex Centroid of a Polyhedron  Popular Matchings with Variable Job Capacities  On the Tightness of the BuhrmanCleveWigderson Simulation  Bounds on Contention Management Algorithms  Algorithmic Folding Complexity  MinEnergy Scheduling for Aligned Jobs in Accelerate Model  Posimodular Systems with Modulotone Requirements under Permutation Constraints  Generalized Reduction to Compute Toric Ideals  Linear and Sublinear Time Algorithms for Basis of Abelian Groups  Good Programming in Transactional Memory  Induced Packing of Odd Cycles in a Planar Graph  On the Infinitesimal Rigidity of BarandSlider Frameworks  Exploration of Periodically Varying Graphs  Parameterized Complexity of ArcWeighted Directed Steiner Problems  Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries  Minimum Cycle Bases of Weighted Outerplanar Graphs  Bandwidth on ATFree Graphs  Editing Graphs into Disjoint Unions of Dense Clusters  A Certifying Algorithm for 3Colorability of P 5Free Graphs  Parameterizing Cut Sets in a Graph by the Number of Their Components  Inapproximability of Maximal Strip Recovery  The Complexity of Perfect Matching Problems on Dense Hypergraphs  On Lower Bounds for Constant Width Arithmetic Circuits  Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and ArrowDebreu Equilibria  The Identity Correspondence Problem and Its Applications  Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs  An Improved Approximation Algorithm for the Traveling Tournament Problem  The FaultTolerant Facility Allocation Problem  Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks  Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms  The Directed Hausdorff Distance between Imprecise Point Sets  Computing Multidimensional Persistence  Locating an Obnoxious Line among Planar Objects  Finding Fullerene Patches in Polynomial Time  Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids  A Selfstabilizing and Local Delaunay Graph Construction  Succinct Greedy Geometric Routing in the Euclidean Plane  Electric Routing and Concurrent Flow Cutting  A PolynomialTime Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform PathLengths  Strong Robustness of Randomized Rumor Spreading Protocols  Data Structures for Range Median Queries  Deletion without Rebalancing in Multiway Search Trees  Counting in the Presence of Memory Faults  A Simple, Fast, and Compact Static Dictionary  Reconstructing Polygons from Scanner Data  Computing Large Matchings in Planar Graphs with Fixed Minimum Degree  CrossingFree Acyclic Hamiltonian Path Completion for Planar stDigraphs  Covering a Graph with a Constrained Forest (Extended Abstract)  TriEdgeConnectivity Augmentation for Planar Straight Line Graphs  Upward StarShaped Polyhedral Graphs  Conditional Hardness of Approximating Satisfiable Max 3CSPq  The Roles of Advice to OneTape LinearTime Turing Machines and Finite Automata (Extended Abstract)  Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement  StepAssembly with a Constant Number of Tile Types  Lower Bounds on Fast Searching  Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity  ConstantFactor Approximations of BranchDecomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time  PTAS for kTour Cover Problem on the Plane for Moderately Large Values of k  Optimal Randomized Algorithm for the Density Selection Problem  New Results on Simple Stochastic Games  WorstCase and Smoothed Analysis of kMeans Clustering with Bregman Divergences  Succinct Index for Dynamic Dictionary Matching  Range Nonoverlapping Indexing  Querying Two Boundary Points for Shortest Paths in a Polygonal Domain  Pattern Matching for 321Avoiding Permutations  Folding a Better Checkerboard  Finding All Approximate Gapped Palindromes  General Pseudorandom Generators from Weaker Models of Computation  Random Generation and Enumeration of Bipartite Permutation Graphs  A Combinatorial Algorithm for Horn Programs  Online Maximum Directed Cut  Maintaining Nets and Net Trees under Incremental Motion  Distributed Scheduling of Parallel Hybrid Computations  I/OEfficient Contour Tree Simplification  Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes  I/O and SpaceEfficient Path Traversal in Planar Graphs  Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model  TwoVertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)  Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets  On Partitioning a Graph into Two Connected Subgraphs
 Control code
 534951202
 Dimensions
 unknown
 Extent
 1 online resource (xix, 1228 pages)
 Form of item
 online
 Isbn
 9783642106316
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations (some color)
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642106309
 Specific material designation
 remote
 System control number
 (OCoLC)534951202
Subject
 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Electronic data processing  Distributed processing
 Electronic data processing  Distributed processing
 Electronic data processing  Distributed processing  Congresses
 Informatique
 Numerical calculations  Data processing
 Numerical calculations  Data processing
 Numerical calculations  Data processing  Congresses
 Computer algorithms
Genre
Member of
 Lecture notes in computer science, 5878
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Distributedcomputing20thinternational/DrJqpFFQYfg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Distributedcomputing20thinternational/DrJqpFFQYfg/">Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Distributedcomputing20thinternational/DrJqpFFQYfg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Distributedcomputing20thinternational/DrJqpFFQYfg/">Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 1618, 2009 : proceedings, Yingfei Dong, DingZhu Du, Oscar Ibarra (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>