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)
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Pubbl/distr/stampa [Place of publication not identified], : IEEE, 2009
Descrizione fisica 1 online resource
Disciplina 004.015118
Soggetto topico Computer algorithms
Computer architecture
ISBN 9781424454044
1424454042
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910138762303321
[Place of publication not identified], : IEEE, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
2018 II National Interdisciplinary Scientific Conference, TechSpo '18 : Power of Algorithms / / Institute of Electrical and Electronics Engineers
2018 II National Interdisciplinary Scientific Conference, TechSpo '18 : Power of Algorithms / / Institute of Electrical and Electronics Engineers
Pubbl/distr/stampa Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Descrizione fisica 1 online resource (622 pages)
Disciplina 004.015118
Soggetto topico Computer algorithms
User-centered system design
ISBN 1-5386-8466-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910304154403321
Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
2018 II National Interdisciplinary Scientific Conference, TechSpo '18 : Power of Algorithms / / Institute of Electrical and Electronics Engineers
2018 II National Interdisciplinary Scientific Conference, TechSpo '18 : Power of Algorithms / / Institute of Electrical and Electronics Engineers
Pubbl/distr/stampa Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Descrizione fisica 1 online resource (622 pages)
Disciplina 004.015118
Soggetto topico Computer algorithms
User-centered system design
ISBN 1-5386-8466-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996575290703316
Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
31st ACM Symposium on Parallelism in Algorithms and Architectures / / Christian Scheideler, Petra Berenbrink, editors
31st ACM Symposium on Parallelism in Algorithms and Architectures / / Christian Scheideler, Petra Berenbrink, editors
Pubbl/distr/stampa New York, NY : , : Association for Computing Machinery, , 2019
Descrizione fisica 1 online resource (410 pages) : illustrations
Disciplina 004.015118
Collana ACM international conference proceedings series
Soggetto topico Computer algorithms
Computer architecture
Parallel processing (Electronic computers)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910510500803321
New York, NY : , : Association for Computing Machinery, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms - ESA 2000 [[electronic resource] ] : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Mike Paterson
Algorithms - ESA 2000 [[electronic resource] ] : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Mike Paterson
Edizione [1st ed. 2000.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Descrizione fisica 1 online resource (X, 450 p.)
Disciplina 004.015118
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Data structures (Computer science)
Application software
Algorithms
Computer graphics
Programming Techniques
Data Structures and Information Theory
Computer Applications
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
ISBN 3-540-45253-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology — Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps.
Record Nr. UNISA-996465408103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Mike Paterson
Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Mike Paterson
Edizione [1st ed. 2000.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Descrizione fisica 1 online resource (X, 450 p.)
Disciplina 004.015118
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Data structures (Computer science)
Application software
Algorithms
Computer graphics
Programming Techniques
Data Structures and Information Theory
Computer Applications
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
ISBN 3-540-45253-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology — Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps.
Record Nr. UNINA-9910143623603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [1998]
Descrizione fisica 1 online resource (D, 486 p.)
Disciplina 004.015118
Collana Lecture notes in computer science
Soggetto topico Computer algorithms
ISBN 3-540-49381-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Presentation -- The Discrepancy Method -- Implementing Algorithms and Data Structures: An Educational and Research Perspective -- Geometry I -- L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing -- Facility Location on Terrains -- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles -- Complexity I -- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words -- Disjunctions of Horn Theories and Their Cores -- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It -- Graph Drawing -- Two-Layer Planarization in Graph Drawing -- Computing Orthogonal Drawings in a Variable Embedding Setting -- Dynamic Grid Embedding with Few Bends and Changes -- On-Line Algorithm and Scheduling -- Two New Families of List Update Algorithms -- An Optimal Algorithm for On-Line Palletizing at Delivery Industry -- On-Line Scheduling of Parallel Jobs with Runtime Restrictions -- CAD/CAM and Graphics -- Testing the Quality of Manufactured Disks and Cylinders -- Casting with Skewed Ejection Direction -- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image -- Graph Algorithm I -- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph -- Polyhedral Structure of Submodular and Posi-modular Systems -- Maximizing the number of Connections in Optical Tree Networks -- Best Paper Presentation -- Selecting the k Largest Elements with Parity Tests -- Randomized Algorithm -- Randomized K-Dimensional Binary Search Trees -- Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks -- Random Regular Graphs with Edge Faults: Expansion through Cores -- Complexity II -- A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem -- Generalized Graph Colorability and Compressibility of Boolean Formulae -- On the Complexity of Free Monoid Morphisms -- Graph Algorithm II -- Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs -- Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs -- Finding Planar Geometric Automorphisms in Planar Graphs -- Combinatorial Problem -- New Approach for Speeding Up Enumeration Algorithms -- Hamiltonian Decomposition of Recursive Circulants -- Convertibility among Grid Filling Curves -- Geometry II -- Generalized Self-Approaching Curves -- The Steiner Tree Problem in ?4-geometry Plane -- Computational Biology -- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages -- On the Multiple Gene Duplication Problem -- Geometry III -- Visibility Queries in Simple Polygons and Applications -- Quadtree Decomposition, Steiner Triangulation, and Ray Shooting -- Optimality and Integer Programming Formulations of Triangulations in General Dimension -- Approximation Algorithm -- Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs -- A Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Some Optimum Communication Spanning Tree Problems -- Complexity III -- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees -- Inapproximability Results for Guarding Polygons without Holes -- The Inapproximability of Non NP-hard Optimization Problems -- Parallel and Distributed Algorithm -- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate -- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution -- Optimal Approximate Agreement with Omission Faults.
Record Nr. UNINA-9910143464603321
Berlin, Germany ; ; New York, New York : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [1998]
Descrizione fisica 1 online resource (D, 486 p.)
Disciplina 004.015118
Collana Lecture notes in computer science
Soggetto topico Computer algorithms
ISBN 3-540-49381-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Presentation -- The Discrepancy Method -- Implementing Algorithms and Data Structures: An Educational and Research Perspective -- Geometry I -- L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing -- Facility Location on Terrains -- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles -- Complexity I -- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words -- Disjunctions of Horn Theories and Their Cores -- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It -- Graph Drawing -- Two-Layer Planarization in Graph Drawing -- Computing Orthogonal Drawings in a Variable Embedding Setting -- Dynamic Grid Embedding with Few Bends and Changes -- On-Line Algorithm and Scheduling -- Two New Families of List Update Algorithms -- An Optimal Algorithm for On-Line Palletizing at Delivery Industry -- On-Line Scheduling of Parallel Jobs with Runtime Restrictions -- CAD/CAM and Graphics -- Testing the Quality of Manufactured Disks and Cylinders -- Casting with Skewed Ejection Direction -- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image -- Graph Algorithm I -- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph -- Polyhedral Structure of Submodular and Posi-modular Systems -- Maximizing the number of Connections in Optical Tree Networks -- Best Paper Presentation -- Selecting the k Largest Elements with Parity Tests -- Randomized Algorithm -- Randomized K-Dimensional Binary Search Trees -- Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks -- Random Regular Graphs with Edge Faults: Expansion through Cores -- Complexity II -- A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem -- Generalized Graph Colorability and Compressibility of Boolean Formulae -- On the Complexity of Free Monoid Morphisms -- Graph Algorithm II -- Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs -- Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs -- Finding Planar Geometric Automorphisms in Planar Graphs -- Combinatorial Problem -- New Approach for Speeding Up Enumeration Algorithms -- Hamiltonian Decomposition of Recursive Circulants -- Convertibility among Grid Filling Curves -- Geometry II -- Generalized Self-Approaching Curves -- The Steiner Tree Problem in ?4-geometry Plane -- Computational Biology -- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages -- On the Multiple Gene Duplication Problem -- Geometry III -- Visibility Queries in Simple Polygons and Applications -- Quadtree Decomposition, Steiner Triangulation, and Ray Shooting -- Optimality and Integer Programming Formulations of Triangulations in General Dimension -- Approximation Algorithm -- Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs -- A Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Some Optimum Communication Spanning Tree Problems -- Complexity III -- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees -- Inapproximability Results for Guarding Polygons without Holes -- The Inapproximability of Non NP-hard Optimization Problems -- Parallel and Distributed Algorithm -- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate -- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution -- Optimal Approximate Agreement with Omission Faults.
Record Nr. UNISA-996465892203316
Berlin, Germany ; ; New York, New York : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings / / Edited by Gianfranco Bilardi [and three others]
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings / / Edited by Gianfranco Bilardi [and three others]
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [1998]
Descrizione fisica 1 online resource (XII, 524 p.)
Disciplina 004.015118
Collana Lecture Notes in Computer Science
Soggetto topico Computer algorithms
ISBN 3-540-68530-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- External Memory Algorithms -- Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper) -- Data Structures -- Car-Pooling as a Data Structuring Device: The Soft Heap -- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property -- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures -- Strings and Biology -- Augmenting Suffix Trees, with Applications -- Longest Common Subsequence from Fragments via Sparse Dynamic Programming -- Computing the Edit-Distance Between Unrooted Ordered Trees -- Analogs and Duals of the MAST Problem for Sequences and Trees -- Numerical Algorithms -- Complexity Estimates Depending on Condition and Round-Off Error -- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting -- Fast Algorithms for Linear Algebra Modulo N -- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers -- Geometry -- Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time -- A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract) -- Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result -- Two-Center Problems for a Convex Polygon (Extended Abstract) -- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice -- Randomized and On-Line Algorithms -- A Fast Random Greedy Algorithm for the Component Commonality Problem -- Maximizing Job Completions Online -- A Randomized Algorithm for Two Servers on the Line (Extended Abstract) -- Parallel and Distributed Algorithms I -- On Nonblocking Properties of the Beneš Network -- Adaptability and the Usefulness of Hints (Extended Abstract) -- Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract) -- New Bounds for Oblivious Mesh Routing -- Evaluating Server-Assisted Cache Replacement in the Web -- Graph Algorithms -- Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights -- A Functional Approach to External Graph Algorithms -- Minimal Triangulations for Graphs with “Few” Minimal Separators -- Finding an Optimal Path without Growing the Tree -- An Experimental Study of Dynamic Algorithms for Directed Graphs -- Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme -- Parallel and Distributed Algorithms II -- ?-Stepping : A Parallel Single Source Shortest Path Algorithm -- Improved Deterministic Parallel Padded Sorting -- Analyzing an Infinite Parallel Job Allocation Process -- Nearest Neighbor Load Balancing on Graphs -- Optimization -- 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves -- Moving-Target TSP and Related Problems -- Fitting Points on the Real Line and Its Application to RH Mapping -- Approximate Coloring of Uniform Hypergraphs (Extended Abstract) -- Techniques for Scheduling with Rejection -- Computer-Aided Way to Prove Theorems in Scheduling.
Record Nr. UNISA-996466137603316
Berlin, Germany : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings / / Edited by Gianfranco Bilardi [and three others]
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings / / Edited by Gianfranco Bilardi [and three others]
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [1998]
Descrizione fisica 1 online resource (XII, 524 p.)
Disciplina 004.015118
Collana Lecture Notes in Computer Science
Soggetto topico Computer algorithms
ISBN 3-540-68530-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- External Memory Algorithms -- Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper) -- Data Structures -- Car-Pooling as a Data Structuring Device: The Soft Heap -- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property -- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures -- Strings and Biology -- Augmenting Suffix Trees, with Applications -- Longest Common Subsequence from Fragments via Sparse Dynamic Programming -- Computing the Edit-Distance Between Unrooted Ordered Trees -- Analogs and Duals of the MAST Problem for Sequences and Trees -- Numerical Algorithms -- Complexity Estimates Depending on Condition and Round-Off Error -- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting -- Fast Algorithms for Linear Algebra Modulo N -- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers -- Geometry -- Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time -- A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract) -- Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result -- Two-Center Problems for a Convex Polygon (Extended Abstract) -- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice -- Randomized and On-Line Algorithms -- A Fast Random Greedy Algorithm for the Component Commonality Problem -- Maximizing Job Completions Online -- A Randomized Algorithm for Two Servers on the Line (Extended Abstract) -- Parallel and Distributed Algorithms I -- On Nonblocking Properties of the Beneš Network -- Adaptability and the Usefulness of Hints (Extended Abstract) -- Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract) -- New Bounds for Oblivious Mesh Routing -- Evaluating Server-Assisted Cache Replacement in the Web -- Graph Algorithms -- Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights -- A Functional Approach to External Graph Algorithms -- Minimal Triangulations for Graphs with “Few” Minimal Separators -- Finding an Optimal Path without Growing the Tree -- An Experimental Study of Dynamic Algorithms for Directed Graphs -- Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme -- Parallel and Distributed Algorithms II -- ?-Stepping : A Parallel Single Source Shortest Path Algorithm -- Improved Deterministic Parallel Padded Sorting -- Analyzing an Infinite Parallel Job Allocation Process -- Nearest Neighbor Load Balancing on Graphs -- Optimization -- 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves -- Moving-Target TSP and Related Problems -- Fitting Points on the Real Line and Its Application to RH Mapping -- Approximate Coloring of Uniform Hypergraphs (Extended Abstract) -- Techniques for Scheduling with Rejection -- Computer-Aided Way to Prove Theorems in Scheduling.
Record Nr. UNINA-9910767584003321
Berlin, Germany : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui