default search action
Encyclopedia of Algorithms 2016
- Ming-Yang Kao:
Encyclopedia of Algorithms - 2016 Edition. Springer 2016, ISBN 978-1-4939-2863-7
A
- Michele Mosca:
Abelian Hidden Subgroup Problem. 1-5 - Rolf Klein:
Abstract Voronoi Diagrams. 5-8 - Maria-Florina Balcan, Ruth Urner:
Active Learning - Modern Learning Theory. 8-13 - Damien Woods:
Active Self-Assembly and Molecular Robotics with Nubots. 13-18 - Ping Deng, Weili Wu, Eugene Shragowitz, Ding-Zhu Du:
Adaptive Partitions. 18-22 - Shiri Chechik:
Additive Spanners. 22-24 - Tian-Ming Bu:
Adwords Pricing. 24-27 - Marek Chrobak:
Algorithm DC-Tree for k-Servers on Trees. 27-30 - Tal Mor:
Algorithmic Cooling. 30-37 - Ron Lavi:
Algorithmic Mechanism Design. 37-48 - Jesper Jansson, Wing-Kin Sung:
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. 48-52 - Seth Pettie:
All Pairs Shortest Paths in Sparse Graphs. 52-55 - Tadao Takaoka:
All Pairs Shortest Paths via Matrix Multiplication. 55-59 - Edith Cohen:
All-Distances Sketches. 59-64 - Neeldhara Misra:
Alternate Parameterizations. 64-67 - Alejandro López-Ortiz:
Alternative Performance Measures in Online Algorithms. 67-72 - Takeaki Uno:
Amortized Analysis on Enumeration Algorithms. 72-76 - Graham Cormode:
AMS Sketch. 76-78 - Alejandro López-Ortiz, Alejandro Salinger:
Analyzing Cache Behaviour in Multicore Architectures. 78-82 - Naila Rahman:
Analyzing Cache Misses. 82-86 - Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. 86-90 - Venkatesh Srinivasan:
Approximate Dictionaries. 90-94 - Christian Wulff-Nilsen:
Approximate Distance Oracles with Improved Query Time. 94-97 - Ran Duan:
Approximate Matching. 97-99 - Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. 106-109 - George B. Mertzios:
Approximating Fixation Probabilities in the Generalized Moran Process. 109-113 - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. 113-116 - Liam Roditty:
Approximating the Diameter. 116-117 - Pinyan Lu, Yitong Yin:
Approximating the Partition Function of Two-Spin Systems. 117-123 - Nikhil Bansal:
Approximation Schemes for Bin Packing. 123-126 - Joseph S. B. Mitchell:
Approximation Schemes for Geometric Network Optimization Problems. 126-130 - Asaf Levin:
Approximation Schemes for Makespan Minimization. 131-133 - Mohammad Taghi Hajiaghayi, Erik D. Demaine:
Approximation Schemes for Planar Graph Problems. 133-137 - Paul (Pavlos) Spirakis:
Approximations of Bimatrix Nash Equilibria. 137-141 - Mao-cheng Cai, Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market. 141-145 - Paul G. Howard, Jeffrey Scott Vitter:
Arithmetic Coding for Data Compression. 145-150 - Samir Khuller:
Assignment Problem. 150-152 - Maurice Herlihy:
Asynchronous Consensus Impossibility. 152-155 - Xavier Défago:
Atomic Broadcast. 155-160 - Jyrki Kivinen:
Attribute-Efficient Learning. 160-162 - Falk Hüffner:
Automated Search Tree Generation. 162-165
B
- Serge Gaspers:
Backdoors to SAT. 167-170 - Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. 170-174 - Mohammad Taghi Hajiaghayi, Hamid Mahini:
Bargaining Networks. 174-177 - Maurizio Patrignani:
Bend Minimization for Orthogonal Drawings of Plane Graphs. 177-181 - Paul (Pavlos) Spirakis:
Best Response Algorithms for Selfish Routing. 181-183 - Riccardo Dondi, Yuri Pirola:
Beyond Evolutionary Trees. 183-189 - Lhouari Nourine, Jean-Marc Petit:
Beyond Hypergraph Dualization. 189-192 - Abhradeep Thakurta:
Beyond Worst Case Sensitivity in Private Data Analysis. 192-199 - Matthieu Roy:
BG Distributed Simulation Algorithm. 199-203 - Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensionality. 203-207 - David S. Johnson:
Bin Packing. 207-211 - Hiroshi Fujiwara, Koji M. Kobayashi:
Bin Packing with Cardinality Constraints. 211-214 - Leah Epstein:
Bin Packing, Variants. 214-216 - Adnan Aziz, Amit Prakash:
Binary Decision Graph. 216-220 - Adrian Dumitrescu, Csaba D. Tóth:
Binary Space Partitions. 220-223 - Chris Chu:
Block Shaping in Floorplan. 223-227 - Paolo Ferragina, Giovanni Manzini:
Boosting Textual Compression. 228-232 - Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. 232-237 - Ravishankar Krishnaswamy:
Broadcast Scheduling - Minimizing Average Response Time. 237-240 - Andrzej Pelc:
Broadcasting in Geometric Radio Networks. 241-244 - Jan Vahrenhold:
B-trees. 244-250 - Paolo Ferragina, Giovanni Manzini:
Burrows-Wheeler Transform. 250-255 - Michael Okun:
Byzantine Agreement. 255-259
C
- Rolf Fagerberg:
Cache-Oblivious B-Tree. 261-264 - Rolf Fagerberg:
Cache-Oblivious Model. 264-269 - Gerth Stølting Brodal:
Cache-Oblivious Sorting. 269-273 - Michael Bader, Tobias Weinzierl:
Cache-Oblivious Spacetree Traversals. 273-277 - Stephen G. Kobourov:
Canonical Orders and Schnyder Realizers. 277-283 - Xavier Défago:
Causal Order, Logical Clocks, State Machine Replication. 283-286 - Lisa Hellerstein:
Certificate Complexity and Exact Learning. 286-290 - Mansoor Alicherry, Randeep Bhatia, Li (Erran) Li:
Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks. 290-295 - Martin D. F. Wong, Hannah Honghua Yang:
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach. 295-301 - Andrew A. Kennings, Igor L. Markov:
Circuit Placement. 301-306 - Hai Zhou:
Circuit Retiming. 306-309 - Hai Zhou:
Circuit Retiming: An Incremental Approach. 309-313 - Etsuji Tomita:
Clique Enumeration. 313-317 - Boaz Patt-Shamir:
Clock Synchronization. 317-321 - Lusheng Wang, Ming Li, Bin Ma:
Closest String and Substring Problems. 321-324 - Jens Gramm:
Closest Substring. 324-326 - Fabrizio Frati:
Clustered Graph Drawing. 326-331 - Pranjal Awasthi:
Clustering Under Stability Assumptions. 331-335 - Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. 335-338 - Christoforos L. Raptopoulos:
Colouring Non-sparse Random Intersection Graphs. 338-342 - Frank Ruskey:
Combinatorial Gray Code. 342-347 - Robert T. Schweller:
Combinatorial Optimization and Verification in Self-Assembly. 347-349 - Amit Chakrabarti:
Communication Complexity. 349-357 - Ioannis Chatzigiannakis:
Communication in Ad Hoc Mobile Networks Using Random Walks. 357-362 - Shiri Chechik:
Compact Routing Schemes. 362-364 - Tian-Ming Bu:
Competitive Auction. 364-366 - Jin-Yi Cai, Xi Chen, Pinyan Lu:
Complexity Dichotomies for Counting Graph Homomorphisms. 366-369 - Xi Chen:
Complexity of Bimatrix Nash Equilibria. 369-372 - Qizhi Fang:
Complexity of Core. 372-375 - Sharma V. Thankachan:
Compressed Document Retrieval on String Collections. 375-379 - Johannes Fischer:
Compressed Range Minimum Queries. 379-382 - J. Ian Munro, Patrick K. Nicholson:
Compressed Representations of Graphs. 382-386 - Djamal Belazzougui, Veli Mäkinen, Daniel Valenzuela:
Compressed Suffix Array. 386-390 - Luís M. S. Russo:
Compressed Suffix Trees. 390-394 - Veli Mäkinen, Gonzalo Navarro:
Compressed Text Indexing. 394-397 - Paolo Ferragina, Srinivasa Rao Satti:
Compressing and Indexing Structured Text. 401-407 - Alistair Moffat:
Compressing Integer Sequences. 407-412 - Michal Pilipczuk:
Computing Cutwidth and Pathwidth of Semi-complete Digraphs. 412-415 - Spyros C. Kontogiannis:
Computing Pure Equilibria in the Game of Parallel Links. 415-421 - Gadi Taubenfeld:
Concurrent Programming, Mutual Exclusion. 421-425 - Feng Wang, Ding-Zhu Du, Xiuzhen Cheng:
Connected Dominating Set. 425-430 - Lidong Wu, Huijuan Wang, Weili Wu:
Connected Set-Cover and Group Steiner Tree. 430-432 - Sotiris E. Nikoletseas:
Connectivity and Fault Tolerance in Random Regular Graphs. 432-436 - Bernadette Charron-Bost, André Schiper:
Consensus with Partial Synchrony. 436-441 - Md. Saidur Rahman:
Convex Graph Drawing. 441-446 - Michael Hemmer, Christiane Schmidt:
Convex Hulls. 446-449 - Edith Cohen:
Coordinated Sampling. 449-454 - Shin-ichi Minato:
Counting by ZDD. 454-458 - Madhav Jha:
Counting Triangles in Graph Streams. 458-464 - Graham Cormode:
Count-Min Sketch. 464-468 - Li-Sha Huang:
CPU Time Pricing. 468-470 - Chih-Wei Yi:
Critical Range for Wireless Networks. 471-475 - Adam R. Klivans:
Cryptographic Hardness of Learning. 475-477 - Rasmus Pagh:
Cuckoo Hashing. 478-481 - Rob van Stee:
Current Champion for Online Bin Packing. 481-482 - Stefan Funke:
Curve Reconstruction. 482-485
D
- Yoo-Ah Kim:
Data Migration. 487-491 - Rolf Niedermeier:
Data Reduction for Domination in Graphs. 491-494 - Justin Thaler:
Data Stream Verification. 494-499 - Siu-Wing Cheng:
3D Conforming Delaunay Triangulation. 499-502 - Venkatesan Guruswami:
Decoding Reed-Solomon Codes. 502-506 - Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. 506-509 - Aaron Bernstein:
Decremental Approximate-APSP in Directed Graphs. 509-512 - Wen-Zhan Song, Xiang-Yang Li, Weizhao Wang:
Degree-Bounded Planar Spanner with Low Weight. 512-516 - Martin Fürer:
Degree-Bounded Trees. 516-519 - Olivier Devillers:
Delaunay Triangulation and Randomized Constructions. 519-524