Edizione	[1st ed. 2017.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica	1 online resource (XX, 594 p. 129 illus.)
Disciplina	005.73
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks
ISBN	3-319-62127-0
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Combinatorics -- Computational geometry -- Databases -- Graphics -- Parallel and distributed computing.
Record Nr.	UNINA-9910484338303321

Edizione	[1st ed. 2013.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica	1 online resource (XIV, 538 p. 132 illus.)
Disciplina	005.73
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks
ISBN	3-642-40104-X
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Algorithms and data structures in bioinformatics -- Algorithms and data structures in combinatorics -- Algorithms and data structures in computational geometry -- Algorithms and data structures in databases -- Algorithms and data structures in graphics -- Parallel and distributed computing.
Record Nr.	UNISA-996466025003316

Edizione	[1st ed. 2007.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica	1 online resource (XVI, 664 p.)
Disciplina	005.73
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Computer programming Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Programming Techniques Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis
ISBN	3-540-73951-3
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Session 1 -- Finding Small Holes -- Session 2A -- Approximate Range Searching: The Absolute Model -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- Session 2B -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Approximating the Maximum Sharing Problem -- The Stackelberg Minimum Spanning Tree Game -- Session 3A -- Edges and Switches, Tunnels and Bridges -- How to Draw a Clustered Tree -- Drawing Colored Graphs on Colored Points -- Session 3B -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Priority Queues Resilient to Memory Faults -- Simple and Space-Efficient Minimal Perfect Hash Functions -- Session 4A -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems -- Optimization for First Order Delaunay Triangulations -- Session 4B -- Constant Factor Approximations for the Hotlink Assignment Problem -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- A Stab at Approximating Minimum Subadditive Join -- Session 5 -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Session 6A -- Flooding Countries and Destroying Dams -- I/O-Efficient Flow Modeling on Fat Terrains -- Computing the Visibility Map of Fat Objects -- Session 6B -- Independent Sets in Bounded-Degree Hypergraphs -- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time -- Session 7A -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Spanners for Geometric Intersection Graphs -- On Generalized Diamond Spanners -- Session 7B -- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- On the Robustness of Graham’s Algorithm for Online Scheduling -- Improved Results for a Memory Allocation Problem -- Session 8A -- Computational and Structural Advantages of Circular Boundary Representation -- Alpha-Beta Witness Complexes -- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra -- Session 8B -- Fixed-Parameter Tractability for Non-Crossing Spanning Trees -- Improved Algorithms for the Feedback Vertex Set Problems -- Kernelization Algorithms for d-Hitting Set Problems -- Session 9A -- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points -- Maximizing Maximal Angles for Plane Straight-Line Graphs -- Cuttings for Disks and Axis-Aligned Rectangles -- Session 9B -- Kernelization and Complexity Results for Connectivity Augmentation Problems -- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem -- Branch and Recharge: Exact Algorithms for Generalized Domination -- Session 10A -- On Computing the Centroid of the Vertices of an Arrangement and Related Problems -- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p -- Session 10B -- Faster Approximation of Distances in Graphs -- Approximate Shortest Paths Guided by a Small Index -- Session 11A -- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model -- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field -- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality -- On Euclidean Vehicle Routing with Allocation -- Session 11B -- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets -- Range Non-overlapping Indexing and Successive List Indexing -- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters -- Dynamic TCP Acknowledgment with Sliding Window.
Record Nr.	UNISA-996466340203316

Edizione	[1st ed. 1989.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989
Descrizione fisica	1 online resource (VI, 244 p.)
Disciplina	005.73
Collana	Lecture Notes in Computer Science
Soggetto topico	Data structures (Computer science) Algorithms Computers Combinatorics Probabilities Statistics Data Structures Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general
ISBN	3-540-48237-7
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Efficient text searching of regular expressions -- Efficient spatial point location -- Constructing the Voronoi diagram of a set of line segments in parallel -- Analysis of kdt-trees: Kd-trees improved by local reorganisations -- Optimal algorithms for List Indexing and Subset Rank -- The Delaunay triangulation closely approximates the complete Euclidean graph -- Computing the furthest site voronoi diagram for a set of discs -- Fully persistent arrays -- String searching algorithms revisited -- Optimal channel placement for multi-terminal nets -- Computing the minimum visible vertex distance between two polygons -- Computing the kernel of a point set in a polygon -- Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs -- Linear time algorithms for computing reachability regions from polygonal figures -- Computing the center of area of a polygon -- Weighted orthogonal linear L ?-approximation and applications -- Discs and other related data structures -- Digital data structures and order statistics -- On the performance of orthogonal range queries in multiattribute and doubly chained trees -- Probabilistic analysis of algorithms and data structures -- Stabbing parallel segments with a convex polygon -- Selecting the Kth largest-area convex polygon -- Finding All Shortest Path Edge Sequences on a convex polyhedron -- Linear algorithms for parity path and two path problems on circular-arc graph -- NC algorithms for circular-arc graphs -- Parallel algorithms for the subgraph homeomorphism problem -- Galleries, light matchings and visibility graphs -- Weighted visibility graphs of bars and related flow problems -- Parallel algorithms for cographs recognition and applications -- Dynamic data structures for series parallel digraphs -- Motion planning in the CL-environment -- Self-adjusting k-ary search trees -- Improving partial rebuilding by using simple balance criteria -- An efficient all-parses systolic algorithm for general context-free parsing -- A polynomial time algorithm for the local testability problem of deterministic finite automata -- Skip lists: A probabilistic alternative to balanced trees -- A fast algorithm for melding splay trees -- An efficient algorithm for finding all maximal square blocks in a matrix -- Complexity issues in tree-based version control -- Structured NC -- Heapsort—Adapted for presorted files -- The distribution of keys in a binary heap -- Optimal hypercube algorithms for labeled images -- On the complexity of single row routing problems -- A new search time update time tradeoff for the implicit dictionary -- Sorting with minimum data movement (preliminary draft) -- Augmentation problems on hierarchically defined graphs -- On linear time minor tests and depth first search -- Combinatorial and computational results for line arrangements in space.
Record Nr.	UNISA-996465726803316

Autore	Gusfield, Dan
Edizione	[Reprinted with corrections]
Pubbl/distr/stampa	Cambridge, : Cambridge University press, 1999
Descrizione fisica	XVIII, 534 p. ; 26 cm
Disciplina	005.7 005.73
Soggetto topico	Algoritmi Biologia molecolare
ISBN	0521585198
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNISANNIO-NAP0492175