top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Algorithms and Computation [[electronic resource] ] : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings / / edited by Takeshi Tokuyama
Algorithms and Computation [[electronic resource] ] : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings / / edited by Takeshi Tokuyama
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (XVII, 929 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer networks
Computer graphics
Theory of Computation
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Communication Networks
Computer Graphics
ISBN 3-540-77120-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Modeling and Analyzing Massive Terrain Data Sets -- Coloring Triangle-Free Graphs on Surfaces -- Best Paper Award Presentation -- Integer Representation and Counting in the Bit Probe Model -- 1A Graph Algorithms I -- Minimum Degree Orderings -- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs -- Dynamic Distance Hereditary Graphs Using Split Decomposition -- Unifying Two Graph Decompositions with Modular Decomposition -- 1B Computational Geometry I -- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem -- Geometric Spanner of Segments -- Dilation-Optimal Edge Deletion in Polygonal Cycles -- 2A Complexity I -- Unbounded-Error Classical and Quantum Communication Complexity -- A Spectral Method for MAX2SAT in the Planted Solution Model -- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices -- The 1-Versus-2 Queries Problem Revisited -- 2B Graph Drawing -- Approximating the Crossing Number of Toroidal Graphs -- Width-Optimal Visibility Representations of Plane Graphs -- Computing Upward Topological Book Embeddings of Upward Planar Digraphs -- Algorithms for the Hypergraph and the Minor Crossing Number Problems -- 3A Distributed Algorithms -- On Mixing and Edge Expansion Properties in Randomized Broadcasting -- Linear Reconfiguration of Cube-Style Modular Robots -- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks -- Sensor Network Gossiping or How to Break the Broadcast Lower Bound -- On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem -- 3B Optimization I -- Capacitated Domination Problem -- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number -- New Bounds for the Nearly Equitable Edge Coloring Problem -- Approximation to the Minimum Cost Edge Installation Problem -- Approximability of Packing Disjoint Cycles -- 4A Data Structure I -- Succinct Representation of Labeled Graphs -- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding -- Kinetic Maintenance of Mobile k-Centres on Trees -- Checking Value-Sensitive Data Structures in Sublinear Space -- 4B Game Theory -- Manipulation in Games -- Using Nash Implementation to Achieve Better Frugality Ratios -- The Price of Nash Equilibria in Multicast Transmissions Games -- 5A Database Applications -- An Efficient Algorithm for Enumerating Pseudo Cliques -- Fast Adaptive Diagnosis with a Minimum Number of Tests -- Dynamic Structures for Top-k Queries on Uncertain Data -- Separating Populations with Wide Data: A Spectral Analysis -- 5B Online Algorithms -- A Constant-Competitive Algorithm for Online OVSF Code Assignment -- Average-Case Analysis of Online Topological Ordering -- Energy Efficient Deadline Scheduling in Two Processor Systems -- On the Relative Dominance of Paging Algorithms -- 6A I/O Algorithms -- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions -- Geometric Streaming Algorithms with a Sorting Primitive -- External Memory Range Reporting on a Grid -- Approximate Range Searching in External Memory -- 6B Networks -- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences -- Hardness and Approximation of Traffic Grooming -- Depth of Field and Cautious-Greedy Routing in Social Networks -- Locating Facilities on a Network to Minimize Their Average Service Radius -- 7A Optimization II -- Faster Combinatorial Algorithms for Determinant and Pfaffian -- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization -- The Parameterized Complexity of the Unique Coverage Problem -- Bounded Tree-Width and CSP-Related Problems -- 7B Computational Geometry II -- Covering Points by Unit Disks of Fixed Location -- Geodesic Disks and Clustering in a Simple Polygon -- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane -- Optimal Triangulation with Steiner Points -- 8A Geometric Applications -- New Algorithm for Field Splitting in Radiation Therapy -- In-Place Algorithm for Image Rotation -- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction -- 8B Data Structures II -- Distributed Relationship Schemes for Trees -- Fast Evaluation of Union-Intersection Expressions -- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem -- 9A Computational Geometry III -- Compressing Spatio-temporal Trajectories -- Finding Popular Places -- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations -- 9B Complexity II -- The Monomial Ideal Membership Problem and Polynomial Identity Testing -- On the Fault Testing for Reversible Circuits -- The Space Complexity of k-Tree Isomorphism -- 10A String -- Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis -- Space Efficient Indexes for String Matching with Don’t Cares -- 2-Stage Fault Tolerant Interval Group Testing -- Approximate String Matching with Swap and Mismatch -- 10B Graph Algorithms II -- Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs -- Weighted Treewidth Algorithmic Techniques and Results -- Spanning Trees with Many Leaves in Regular Bipartite Graphs -- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.
Record Nr. UNINA-9910483466403321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XX, 766 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer networks
Computer graphics
Programming Techniques
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Communication Networks
Computer Graphics
ISBN 3-540-49696-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling.
Record Nr. UNISA-996466065303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XX, 766 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer networks
Computer graphics
Programming Techniques
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Communication Networks
Computer Graphics
ISBN 3-540-49696-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling.
Record Nr. UNINA-9910484314703321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / / edited by Rudolf Fleischer, Gerhard Trippen
Algorithms and Computation [[electronic resource] ] : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / / edited by Rudolf Fleischer, Gerhard Trippen
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (XVII, 935 p.)
Disciplina 004.0151
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Algorithms
Computer science—Mathematics
Numerical analysis
Computer communication systems
Computer graphics
Theory of Computation
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Computer Communication Networks
Computer Graphics
ISBN 3-540-30551-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyline Fitting of Planar Points Under Min-sum Criteria -- A Generalization of Magic Squares with Applications to Digital Halftoning -- Voronoi Diagrams with a Transportation Network on the Euclidean Plane -- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation -- Poly-APX- and PTAS-Completeness in Standard and Differential Approximation -- Efficient Algorithms for k Maximum Sums -- Equipartitions of Measures by 2-Fans -- Augmenting the Edge-Connectivity of a Spider Tree -- On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks -- Structural Similarity in Graphs -- Flexibility of Steiner Trees in Uniform Orientation Metrics -- Random Access to Advice Strings and Collapsing Results -- Bounding the Payment of Approximate Truthful Mechanisms -- The Polymatroid Steiner Problems -- Geometric Optimization Problems Over Sliding Windows -- On-Line Windows Scheduling of Temporary Items -- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy -- An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem -- On the Range Maximum-Sum Segment Query Problem -- An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs -- Efficient Job Scheduling Algorithms with Multi-type Contentions -- Superimposing Voronoi Complexes for Shape Deformation -- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem -- Guarding Art Galleries by Guarding Witnesses -- On p-Norm Based Locality Measures of Space-Filling Curves -- Composability of Infinite-State Activity Automata -- Error Compensation in Leaf Root Problems -- On Compact and Efficient Routing in Certain Graph Classes -- Randomized Insertion and Deletion in Point Quad Trees -- Diagnosis in the Presence of Intermittent Faults -- Three-Round Adaptive Diagnosis in Binary n-Cubes -- Fast Algorithms for Comparison of Similar Unordered Trees -- GCD of Random Linear Forms -- On the Hardness and Easiness of Random 4-SAT Formulas -- Minimum Common String Partition Problem: Hardness and Approximations -- On the Complexity of Network Synchronization -- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs -- Adaptive Spatial Partitioning for Multidimensional Data Streams -- Paired Pointset Traversal -- Approximated Two Choices in Randomized Load Balancing -- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting -- Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs -- The Maximum Agreement of Two Nested Phylogenetic Networks -- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations -- New Bounds on Map Labeling with Circular Labels -- Optimal Buffer Management via Resource Augmentation -- Oriented Paths in Mixed Graphs -- Polynomial Deterministic Rendezvous in Arbitrary Graphs -- Distributions of Points and Large Quadrangles -- Cutting Out Polygons with Lines and Rays -- Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays -- Inner Rectangular Drawings of Plane Graphs -- Approximating the Minmax Subtree Cover Problem in a Cactus -- Boundary-Optimal Triangulation Flooding -- Exact Computation of Polynomial Zeros Expressible by Square Roots -- Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees -- Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks -- Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search -- Dynamic Tree Cross Products -- Spanners, Weak Spanners, and Power Spanners for Wireless Networks -- Techniques for Indexing and Querying Temporal Observations for a Collection of Objects -- Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices -- The Two-Guard Problem Revisited and Its Generalization -- Canonical Data Structure for Interval Probe Graphs -- Efficient Algorithms for the Longest Path Problem -- Randomized Algorithms for Motif Detection -- Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation -- Sweeping Graphs with Large Clique Number -- A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.
Record Nr. UNISA-996466372603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / / edited by Rudolf Fleischer, Gerhard Trippen
Algorithms and Computation [[electronic resource] ] : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / / edited by Rudolf Fleischer, Gerhard Trippen
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (XVII, 935 p.)
Disciplina 004.0151
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Algorithms
Computer science—Mathematics
Numerical analysis
Computer communication systems
Computer graphics
Theory of Computation
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Computer Communication Networks
Computer Graphics
ISBN 3-540-30551-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyline Fitting of Planar Points Under Min-sum Criteria -- A Generalization of Magic Squares with Applications to Digital Halftoning -- Voronoi Diagrams with a Transportation Network on the Euclidean Plane -- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation -- Poly-APX- and PTAS-Completeness in Standard and Differential Approximation -- Efficient Algorithms for k Maximum Sums -- Equipartitions of Measures by 2-Fans -- Augmenting the Edge-Connectivity of a Spider Tree -- On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks -- Structural Similarity in Graphs -- Flexibility of Steiner Trees in Uniform Orientation Metrics -- Random Access to Advice Strings and Collapsing Results -- Bounding the Payment of Approximate Truthful Mechanisms -- The Polymatroid Steiner Problems -- Geometric Optimization Problems Over Sliding Windows -- On-Line Windows Scheduling of Temporary Items -- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy -- An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem -- On the Range Maximum-Sum Segment Query Problem -- An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs -- Efficient Job Scheduling Algorithms with Multi-type Contentions -- Superimposing Voronoi Complexes for Shape Deformation -- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem -- Guarding Art Galleries by Guarding Witnesses -- On p-Norm Based Locality Measures of Space-Filling Curves -- Composability of Infinite-State Activity Automata -- Error Compensation in Leaf Root Problems -- On Compact and Efficient Routing in Certain Graph Classes -- Randomized Insertion and Deletion in Point Quad Trees -- Diagnosis in the Presence of Intermittent Faults -- Three-Round Adaptive Diagnosis in Binary n-Cubes -- Fast Algorithms for Comparison of Similar Unordered Trees -- GCD of Random Linear Forms -- On the Hardness and Easiness of Random 4-SAT Formulas -- Minimum Common String Partition Problem: Hardness and Approximations -- On the Complexity of Network Synchronization -- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs -- Adaptive Spatial Partitioning for Multidimensional Data Streams -- Paired Pointset Traversal -- Approximated Two Choices in Randomized Load Balancing -- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting -- Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs -- The Maximum Agreement of Two Nested Phylogenetic Networks -- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations -- New Bounds on Map Labeling with Circular Labels -- Optimal Buffer Management via Resource Augmentation -- Oriented Paths in Mixed Graphs -- Polynomial Deterministic Rendezvous in Arbitrary Graphs -- Distributions of Points and Large Quadrangles -- Cutting Out Polygons with Lines and Rays -- Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays -- Inner Rectangular Drawings of Plane Graphs -- Approximating the Minmax Subtree Cover Problem in a Cactus -- Boundary-Optimal Triangulation Flooding -- Exact Computation of Polynomial Zeros Expressible by Square Roots -- Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees -- Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks -- Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search -- Dynamic Tree Cross Products -- Spanners, Weak Spanners, and Power Spanners for Wireless Networks -- Techniques for Indexing and Querying Temporal Observations for a Collection of Objects -- Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices -- The Two-Guard Problem Revisited and Its Generalization -- Canonical Data Structure for Interval Probe Graphs -- Efficient Algorithms for the Longest Path Problem -- Randomized Algorithms for Motif Detection -- Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation -- Sweeping Graphs with Large Clique Number -- A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.
Record Nr. UNINA-9910483967303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings / / edited by Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
Algorithms and Computation [[electronic resource] ] : 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings / / edited by Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Descrizione fisica 1 online resource (XVII, 748 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Algorithms
Computer communication systems
Computers
Computer science—Mathematics
Computer graphics
Programming Techniques
Algorithm Analysis and Problem Complexity
Computer Communication Networks
Computation by Abstract Devices
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 1-280-30660-2
9786610306602
3-540-24587-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Interactive Proofs for Quantum Computation -- Drawing Plane Graphs -- 1A Computational Geometry I -- Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve -- A Dynamic Dictionary for Priced Information with Application -- Voronoi Diagram in the Flow Field -- Polygonal Path Approximation: A Query Based Approach -- 1B Graph and Combinatorial Algorithms I -- A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs -- Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees -- Hotlink Enhancement Algorithms for Web Directories -- Finding a Length-Constrained Maximum-Density Path in a Tree -- 2A Computational Complexity I -- The Intractability of Computing the Hamming Distance -- Infinitely-Often Autoreducible Sets -- Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem -- Computational Complexity Measures of Multipartite Quantum Entanglement -- 2B Graph and Combinatorial Algorithms II -- A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs -- Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem -- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems -- A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem -- 3A Quantum Computation -- The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems -- Non-interactive Quantum Perfect and Statistical Zero-Knowledge -- Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? -- A Faster Lattice Reduction Method Using Quantum Search -- 3B Graph and Combinatorial Algorithms III -- Three Sorting Algorithms Using Priority Queues -- Lower Bounds on Correction Networks -- Approximate Regular Expression Searching with Arbitrary Integer Weights -- Constructing Compressed Suffix Arrays with Large Alphabets -- 4A Computational Geometry II -- On the Geometric Dilation of Finite Point Sets -- On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts -- Optimal Point Set Projections onto Regular Grids -- 4B Combinatorial Optimization I -- An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas -- A Faster Algorithm for Two-Variable Integer Programming -- Efficient Algorithms for Generation of Combinatorial Covering Suites -- 5A Scheduling -- A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags -- On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates -- Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes -- 5B Computational Biology -- Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome -- Settling the Intractability of Multiple Alignment -- Efficient Algorithms for Optimizing Whole Genome Alignment with Noise -- 6A Computational Geometry III -- Segmenting Doughnut-Shaped Objects in Medical Images -- On the Locality Properties of Space-Filling Curves -- Geometric Restrictions on Producible Polygonal Protein Chains -- Symmetric Layout of Disconnected Graphs -- 6B Graph and Combinatorial Algorithms IV -- Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching -- Enumerating Global Roundings of an Outerplanar Graph -- Augmenting Forests to Meet Odd Diameter Requirements -- On the Existence and Determination of Satisfactory Partitions in a Graph -- 7A Distributed and Parallel Algorithms -- A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model -- An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees -- 7B Graph and Combinatorial Algorithms V -- The Student-Project Allocation Problem -- Algorithms for Enumerating Circuits in Matroids -- A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model -- 8A Data Structure -- Succinct Data Structures for Searchable Partial Sums -- Range Mode and Range Median Queries on Lists and Trees -- Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests -- New Ways to Construct Binary Search Trees -- 8B Graph and Combinatorial Algorithms VI -- Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth -- Biconnectivity on Symbolically Represented Graphs: A Linear Solution -- A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs -- Deterministic Algorithm for the t-Threshold Set Problem -- 9A Combinatorial and Network Optimization -- Energy-Efficient Wireless Network Design -- Wavelength Conversion in Shortest-Path All-Optical Networks -- A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact -- Flexible Train Rostering -- 9B Computational Complexity and Cryptography -- Counting Complexity Classes over the Reals I: The Additive Case -- Some Properties of One-Pebble Turing Machines with Sublogarithmic Space -- Hypergraph Decomposition and Secret Sharing -- A Promising Key Agreement Protocol -- 10A Game Theory and Randomized Algorithm -- Rapid Mixing of Several Markov Chains for a Hard-Core Model -- Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution -- Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View — -- Equilibria for Networks with Malicious Users -- 10B Algebraic and Arithmetic Computation -- Quasi-optimal Arithmetic for Quaternion Polynomials -- Upper Bounds on the Complexity of Some Galois Theory Problems -- Unfolded Modular Multiplication -- Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic.
Record Nr. UNISA-996465921803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings / / edited by Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
Algorithms and Computation [[electronic resource] ] : 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings / / edited by Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Descrizione fisica 1 online resource (XVII, 748 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Algorithms
Computer communication systems
Computers
Computer science—Mathematics
Computer graphics
Programming Techniques
Algorithm Analysis and Problem Complexity
Computer Communication Networks
Computation by Abstract Devices
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 1-280-30660-2
9786610306602
3-540-24587-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Interactive Proofs for Quantum Computation -- Drawing Plane Graphs -- 1A Computational Geometry I -- Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve -- A Dynamic Dictionary for Priced Information with Application -- Voronoi Diagram in the Flow Field -- Polygonal Path Approximation: A Query Based Approach -- 1B Graph and Combinatorial Algorithms I -- A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs -- Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees -- Hotlink Enhancement Algorithms for Web Directories -- Finding a Length-Constrained Maximum-Density Path in a Tree -- 2A Computational Complexity I -- The Intractability of Computing the Hamming Distance -- Infinitely-Often Autoreducible Sets -- Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem -- Computational Complexity Measures of Multipartite Quantum Entanglement -- 2B Graph and Combinatorial Algorithms II -- A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs -- Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem -- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems -- A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem -- 3A Quantum Computation -- The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems -- Non-interactive Quantum Perfect and Statistical Zero-Knowledge -- Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? -- A Faster Lattice Reduction Method Using Quantum Search -- 3B Graph and Combinatorial Algorithms III -- Three Sorting Algorithms Using Priority Queues -- Lower Bounds on Correction Networks -- Approximate Regular Expression Searching with Arbitrary Integer Weights -- Constructing Compressed Suffix Arrays with Large Alphabets -- 4A Computational Geometry II -- On the Geometric Dilation of Finite Point Sets -- On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts -- Optimal Point Set Projections onto Regular Grids -- 4B Combinatorial Optimization I -- An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas -- A Faster Algorithm for Two-Variable Integer Programming -- Efficient Algorithms for Generation of Combinatorial Covering Suites -- 5A Scheduling -- A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags -- On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates -- Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes -- 5B Computational Biology -- Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome -- Settling the Intractability of Multiple Alignment -- Efficient Algorithms for Optimizing Whole Genome Alignment with Noise -- 6A Computational Geometry III -- Segmenting Doughnut-Shaped Objects in Medical Images -- On the Locality Properties of Space-Filling Curves -- Geometric Restrictions on Producible Polygonal Protein Chains -- Symmetric Layout of Disconnected Graphs -- 6B Graph and Combinatorial Algorithms IV -- Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching -- Enumerating Global Roundings of an Outerplanar Graph -- Augmenting Forests to Meet Odd Diameter Requirements -- On the Existence and Determination of Satisfactory Partitions in a Graph -- 7A Distributed and Parallel Algorithms -- A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model -- An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees -- 7B Graph and Combinatorial Algorithms V -- The Student-Project Allocation Problem -- Algorithms for Enumerating Circuits in Matroids -- A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model -- 8A Data Structure -- Succinct Data Structures for Searchable Partial Sums -- Range Mode and Range Median Queries on Lists and Trees -- Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests -- New Ways to Construct Binary Search Trees -- 8B Graph and Combinatorial Algorithms VI -- Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth -- Biconnectivity on Symbolically Represented Graphs: A Linear Solution -- A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs -- Deterministic Algorithm for the t-Threshold Set Problem -- 9A Combinatorial and Network Optimization -- Energy-Efficient Wireless Network Design -- Wavelength Conversion in Shortest-Path All-Optical Networks -- A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact -- Flexible Train Rostering -- 9B Computational Complexity and Cryptography -- Counting Complexity Classes over the Reals I: The Additive Case -- Some Properties of One-Pebble Turing Machines with Sublogarithmic Space -- Hypergraph Decomposition and Secret Sharing -- A Promising Key Agreement Protocol -- 10A Game Theory and Randomized Algorithm -- Rapid Mixing of Several Markov Chains for a Hard-Core Model -- Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution -- Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View — -- Equilibria for Networks with Malicious Users -- 10B Algebraic and Arithmetic Computation -- Quasi-optimal Arithmetic for Quaternion Polynomials -- Upper Bounds on the Complexity of Some Galois Theory Problems -- Unfolded Modular Multiplication -- Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic.
Record Nr. UNINA-9910768437603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
Edizione [1st ed. 1996.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Descrizione fisica 1 online resource (X, 458 p.)
Disciplina 004.0151
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Algorithms
Computer communication systems
Computer graphics
Computer mathematics
Theory of Computation
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Computer Communication Networks
Computer Graphics
Computational Mathematics and Numerical Analysis
ISBN 3-540-49633-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Applications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?-DSPACE(log2 n/log log n) -- Finding edge-disjoint paths in partial k-trees -- Optimal augmentation for bipartite componentwise biconnectivity in linear time -- Towards more precise parallel biconnectivity approximation -- The complexity of probabilistic versus deterministic finite automata -- Bounded length UCFG equivalence -- The Steiner Minimal Tree problem in the ?-geometry plane -- A study of the LMT-skeleton -- A new subgraph of minimum weight triangulations -- Dynamic tree routing under the “matching with consumption” model -- Dimension-exchange token distribution on the mesh and the torus -- Directed hamiltonian packing in d-dimensional meshes and its application -- k-pairs non-crossing shortest paths in a simple polygon -- Minimum convex partition of a polygon with holes by cuts in given directions -- Efficient list ranking on the reconfigurable mesh, with applications -- Periodic merging networks -- Minimizing wavelengths in an all-optical ring network -- Competitive analysis of on-line disk scheduling -- Scheduling interval ordered tasks with non-uniform deadlines -- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis -- The multi-variable modular polynomial and its applications to cryptography -- Bounds and algorithms for a practical task allocation model (extended abstract) -- Scheduling algorithms for strict multithreaded computations -- On multi-threaded Paging -- A fast and efficient homophonic coding algorithm -- An improvement of the digital cash protocol of Okamoto and Ohta.
Record Nr. UNISA-996465977303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
Autore Morin Pat
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (732 pages)
Disciplina 005.73
003.54
Altri autori (Persone) SuriSubhash
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Information theory
Algorithms
Computer engineering
Computer networks
Computer science—Mathematics
Discrete mathematics
Computer graphics
Data Structures and Information Theory
Design and Analysis of Algorithms
Computer Engineering and Networks
Symbolic and Algebraic Manipulation
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-031-38906-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.
Record Nr. UNINA-9910736011703321
Morin Pat  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
Autore Morin Pat
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (732 pages)
Disciplina 005.73
003.54
Altri autori (Persone) SuriSubhash
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Information theory
Algorithms
Computer engineering
Computer networks
Computer science—Mathematics
Discrete mathematics
Computer graphics
Data Structures and Information Theory
Design and Analysis of Algorithms
Computer Engineering and Networks
Symbolic and Algebraic Manipulation
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-031-38906-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.
Record Nr. UNISA-996542665403316
Morin Pat  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui