Encyclopedia of Algorithms
This 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 ex...
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
New York, NY :
Springer New York : Imprint: Springer,
2016.
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- From 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. .
