Computing and Combinatorics
Editat de Wen-Lian Hsu, Ming-Yang Kaoen Limba Engleză Paperback – 22 iul 1998
Preț: 327.48 lei
Preț vechi: 409.36 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 14-28 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540648246
ISBN-10: 3540648240
Pagini: 404
Ilustrații: XII, 372 p. 62 illus., 3 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540648240
Pagini: 404
Ilustrații: XII, 372 p. 62 illus., 3 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Presentations.- Algorithmic Approaches to Information Retrieval and Data Mining.- Combinatorial Problems Arising in Massive Data Sets.- Estimating Parameters of Monotone Boolean Functions.- De-amortization of Algorithms.- Computational Geometry.- On Computing New Classes of Optimal Triangulations with Angular Constraints.- Maximum Weight Triangulation and Its Application on Graph Drawing.- The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries.- Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space.- Parallel Geometric Algorithms in Coarse-Grain Network Models.- Algorithms and Data Structures.- On the Bahncard Problem.- The Ultimate Strategy to Search on m Rays?.- Better Approximation of Diagonal-Flip Transformation and Rotation Transformation.- A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations.- Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.- Algorithms for Almost-Uniform Generation with an Unbiased Binary Source.- Improved Algorithms for Chemical Threshold Testing Problems.- Min-Max-Boundary Domain Decomposition.- Computational Complexity.- On Boolean Lowness and Boolean Highness.- The Inherent Dimension of Bounded Counting Classes.- An Exact Characterization of Symmetric Functions in q AC 0[2].- Robust Reductions.- Approaches to Effective Semi-continuity of Real Functions.- On the Power of Additive Combinatorial Search Model.- Parallel and Distributed Processing, and Switching Networks.- The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch.- Lower Bounds for Wide-Sense Non-blocking Clos Network.- Multirate Multicast Switching Networks.- Efficient Randomized Routing Algorithms onthe Two-Dimensional Mesh of Buses.- Executing Divisible Jobs on a Network with a Fixed Number of Processors.- Graph Theory.- On the Ádám Conjecture on Circulant Graphs.- Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable.- A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter.- A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree.- A Graph Optimization Problem in Virtual Colonoscopy.- Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.- An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs.- Combinatorics and Cryptography.- Similarity in Two-Dimensional Strings.- On Multi-dimensional Hilbert Indexings.- Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth.- Eulerian Secret Key Exchange.- One-Time Tables for Two-Party Computation.