000			05711nam a22003855i 4500
001			84431
003			ES-MaUEC
005			20230207040422.0
007			cr nn 008mamaa
008			160422s2016 xxu| s |||| 0|eng d
020			_a9781493928644
040			_aES-MaUEC
050		4	_aQA9.58 _bE539 2016 EB
082	0	4	_a004.0151
245	1	0	_aEncyclopedia of Algorithms _cedited by Ming-Yang Kao
260			_aNew York, NY _bSpringer New York _c2016
300			_a1 recurso en línea (379 ilustraciones, 116 ilustraciones en color. eReference
336			_aTexto (visual) _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
505	0		_aFrom the contents: Abelian Hidden Subgroup Problem -- Abstract Voronoi Diagrams -- Active Learning - Modern Learning Theory -- Backdoors to SAT -- Backtracking Based k-SAT Algorithms -- Bargaining Networks -- Cache-Oblivious B-Tree -- Canonical Orders and Schnyder Realizers -- Circuit Placement.-Data Migration -- Decoding Reed�Solomon Codes -- Direct Routing Algorithms -- Edit Distance Under Block Operations -- Engineering Geometric Algorithms -- Enumeration of Non-crossing Geometric Graphs -- Facility Location -- Flow Time Minimization -- Force-Directed Graph Drawing -- Gate Sizing -- General Equilibrium -- Geographic Routing -- Hamilton Cycles in Random Intersection Graphs -- Hardness of Proper Learning -- Huffman Coding -- Implementation Challenge for Shortest Paths -- Incentive Compatible Selection -- Inductive Inference -- Kernelization, Bidimensionality and Kernels -- Kinetic Data Structures -- Knowledge in Distributed Systems -- Large-Treewidth Graph Decompositions -- Layout Decomposition for Multiple Patterning -- Learning Automata -- Majority Equilibrium -- Manifold Reconstruction -- Market Games and Content Distribution -- Nash Equilibria and Dominant Strategies in Routing -- Nearest Neighbor Interchange and Related Distances -- Negative Cycles in Weighted Digraphs -- Oblivious Routing -- Online Interval Coloring -- Online Paging and Caching -- PAC Learning -- Parity Games -- Permutation Enumeration -- Quadtrees and Morton Indexing -- Quantum Algorithm for Factoring -- Quantum Dense Coding -- Radiocoloring in Planar Graphs -- Random Planted 3-SAT -- Randomization in Distributed Computing -- Schedulers for Optimistic Rate Based Flow Control -- Secretary Problems and Online Auctions -- Separators in Graphs -- Table Compression -- Text Indexing -- Triangulation Data Structures -- Unified View of Graph Searching and LDFS-Based Certifying Algorithms -- Universal Sequencing on an Unreliable Machine -- Upward Graph Drawing -- Vector Bin Packing -- Vector Scheduling Problems -- Voltage Scheduling -- Wavelet Trees -- Well Separated Pair Decomposition -- Wire Sizing. .
520			_aThis dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics. This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms. Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code. All entries are peer-reviewed, written by leading experts in the field�and each entry contains links to a summary of the author�s research work. This defining reference is available in both print and online�a dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs. New and Updated entries include: Algorithmic Aspects of Distributed Sensor Networks, Algorithms for Modern Computers Bioinformatics Certified Reconstruction and Mesh Generation Combinatorial Group Testing Compression of Text and Data Structures Computational Counting Computational Economics Computational Geometry Differential Privacy Enumeration Algorithms Exact Exponential Algorithms Game Theory Graph Drawing Group Testing Internet Algorithms Kernels and Compressions Massive Data Algorithms Mathematical Optimization Modern Learning Theory Social Networks Stable Marriage Problems, k-SAT Algorithms Sublinear Algorithms Tile Self-Assembly VLSI CAD Algorithms.
710	2		_aSpringerLink (Online service) _0Local _9106996
942			_2lcc _cLE
988	0	0	_aEBOOK, EBSPRINGER
650	0	7	_aOrdenadores _0LocalX _2embne _9138111
650		7	_aMatemáticas aplicadas _0comprobar BNE19920885281 _2embne _9145503
650	0	7	_aInformática _0LocalX _2embne _9139268
700	1		_aKao, Ming-Yang _eeditor literario _0Local _996597
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://link.springer.com/book/10.1007/978-1-4939-2864-4 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
901			_ai9781493928644
907			_a.b12937095 _b10-10-17 _c21-11-16
998			_am _a_alco _a_vill _b - - _cm _dz _e- _feng _gxxu _h0
945			_aQA9.58 E539 2016 EB _g1 _ieBOOK _j0 _lmae _o- _pEUR0.00 _q- _r- _sb _t15 _u0 _v0 _w0 _x0 _y.i11581955 _z06-04-17
999			_c84431 _d84431 _x1