default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEncyclopedia of Algorithms 2008
- Ming-Yang Kao:
Encyclopedia of Algorithms - 2008 Edition. Springer 2008, ISBN 978-0-387-30770-1
A
- Michele Mosca:
Abelian Hidden Subgroup Problem. - Ad-Hoc Networks.
- Ping Deng, Weili Wu, Eugene Shragowitz:
Adaptive Partitions. - Adword Auction.
- Tian-Ming Bu:
Adwords Pricing. - Agreement.
- Marek Chrobak:
Algorithm DC-Tree for kServers on Trees. - Tal Mor:
Algorithmic Cooling. - Ron Lavi:
Algorithmic Mechanism Design. - Surender Baswana, Sandeep Sen:
Algorithms for Spanners in Weighted Graphs. - Seth Pettie:
All Pairs Shortest Paths in Sparse Graphs. - Tadao Takaoka:
All Pairs Shortest Paths via Matrix Multiplication. - Esteban Feuerstein:
Alternative Performance Measures in Online Algorithms. - Naila Rahman:
Analyzing Cache Misses. - Joachim Gudmundsson, Giri Narasimhan
, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. - Srinivasan Venkatesh:
Approximate Dictionaries. - Approximate Dictionary Matching.
- Approximate Maximum Flow Construction.
- Approximate Membership.
- Approximate Nash Equilibrium.
- Approximate Periodicities.
- Gonzalo Navarro:
Approximate Regular Expression Matching. - Approximate Repetitions.
- Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. - Approximation Algorithm.
- Approximation Algorithm Design.
- Approximation Algorithms.
- Approximation Algorithms in Planar Graphs.
- Nikhil Bansal:
Approximation Schemes for Bin Packing. - Erik D. Demaine, MohammadTaghi Hajiaghayi:
Approximation Schemes for Planar Graph Problems. - Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Approximations of Bimatrix Nash Equilibria. - Mao-cheng Cai, Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market. - Paul G. Howard, Jeffrey Scott Vitter:
Arithmetic Coding for Data Compression. - Samir Khuller:
Assignment Problem. - Maurice Herlihy:
Asynchronous Consensus Impossibility. - Xavier Défago:
Atomic Broadcast. - Atomic Multicast.
- Atomic Network Congestion Games.
- Atomic Scan.
- Atomic Selfish Flows.
- Atomicity.
- Jyrki Kivinen:
Attribute-Efficient Learning. - Falk Hüffner:
Automated Search Tree Generation.
B
- Jan Vahrenhold:
B-trees. - Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. - Paul G. Spirakis:
Best Response Algorithms for Selfish Routing. - Erik D. Demaine, MohammadTaghi Hajiaghayi:
Bidimensionality. - David S. Johnson:
Bin Packing. - Amit Prakash, Adnan Aziz:
Binary Decision Graph. - Block Edit Distance.
- Block-Sorting Data Compression.
- Boolean Formulas.
- Boolean Satisfiability.
- Paolo Ferragina, Giovanni Manzini:
Boosting Textual Compression. - Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. - Andrzej Pelc:
Broadcasting in Geometric Radio Networks. - Buffering.
- Paolo Ferragina, Giovanni Manzini:
Burrows-Wheeler Transform. - Michael Okun:
Byzantine Agreement.
C
- Rolf Fagerberg:
Cache-Oblivious B-Tree. - Rolf Fagerberg:
Cache-Oblivious Model. - Gerth Stølting Brodal:
Cache-Oblivious Sorting. - Caching.
- Xavier Défago:
Causal Order, Logical Clocks, State Machine Replication. - Lisa Hellerstein:
Certificate Complexity and Exact Learning. - Mansoor Alicherry, Randeep Bhatia, Li (Erran) Li:
Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks. - Hannah Honghua Yang, Martin D. F. Wong:
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach. - Andrew A. Kennings, Igor L. Markov:
Circuit Placement. - Hai Zhou:
Circuit Retiming. - Hai Zhou:
Circuit Retiming: An Incremental Approach. - Boaz Patt-Shamir:
Clock Synchronization. - Lusheng Wang:
Closest String and Substring Problems. - Jens Gramm:
Closest Substring. - Clustering.
- Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. - Ioannis Chatzigiannakis:
Communication in Ad Hoc Mobile Networks Using Random Walks. - Tian-Ming Bu:
Competitive Auction. - Xi Chen, Xiaotie Deng:
Complexity of Bimatrix Nash Equilibria. - Qizhi Fang:
Complexity of Core. - Masayuki Takeda:
Compressed Pattern Matching. - Veli Mäkinen:
Compressed Suffix Array. - Veli Mäkinen, Gonzalo Navarro:
Compressed Text Indexing. - Alistair Moffat:
Compressing Integer Sequences and Sets. - Compression.
- Computational Learning.
- Spyros C. Kontogiannis:
Computing Pure Equilibria in the Game of Parallel Links. - Gadi Taubenfeld:
Concurrent Programming, Mutual Exclusion. - Xiuzhen Cheng, Feng Wang, Ding-Zhu Du:
Connected Dominating Set. - Sotiris E. Nikoletseas:
Connectivity and Fault-Tolerance in Random Regular Graphs. - Bernadette Charron-Bost, André Schiper:
Consensus with Partial Synchrony. - Wing-Kin Sung:
Constructing a Galled Phylogenetic Network. - Coordination Ratio.
- Li-Sha Huang:
CPU Time Pricing. - Chih-Wei Yi:
Critical Range for Wireless Networks. - Adam R. Klivans:
Cryptographic Hardness of Learning. - Rasmus Pagh:
Cuckoo Hashing.
D
- Yoo Ah Kim:
Data Migration. - Rolf Niedermeier:
Data Reduction for Domination in Graphs. - Decoding.
- Venkatesan Guruswami:
Decoding Reed-Solomon Codes. - Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. - Wen-Zhan Song, Xiang-Yang Li, Weizhao Wang:
Degree-Bounded Planar Spanner with Low Weight. - Martin Fürer:
Degree-Bounded Trees. - Leszek Gasieniec:
Deterministic Broadcasting in Radio Networks. - Ricardo Baeza-Yates:
Deterministic Searching on the Line. - Detour.
- Moshe Lewenstein:
Dictionary Matching and Indexing (Exact and with Errors). - Travis Gagie, Giovanni Manzini:
Dictionary-Based Data Compression. - Dilation.
- Rolf Klein:
Dilation of Geometric Networks. - Costas Busch:
Direct Routing Algorithms. - Jesper Jansson:
Directed Perfect Phylogeny (Binary Characters). - Miklós Csürös:
Distance-Based Phylogeny Reconstruction (Fast-Converging). - Richard Desper, Olivier Gascuel:
Distance-Based Phylogeny Reconstruction (Optimal Radius). - Sergio Rajsbaum:
Distributed Algorithms for Minimum Spanning Trees. - Distributed Computing.
- Devdatt P. Dubhashi:
Distributed Vertex Coloring. - Dominating Set.
- Dynamic Problems.
- Renato Fonseca F. Werneck:
Dynamic Trees.
E
- Süleyman Cenk Sahinalp:
Edit Distance Under Block Operations. - Francis Y. L. Chin, Siu-Ming Yiu:
Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds. - David A. Bader:
Engineering Algorithms for Computational Biology. - Christos D. Zaroliagis:
Engineering Algorithms for Large Network Applications. - Dan Halperin:
Engineering Geometric Algorithms. - Rezaul Alam Chowdhury:
Equivalence Between Priority Queues and Sorting. - Error Correction.
- Error-Control Codes, Reed-Muller Code.
- Euclidean Graphs and Trees.
- Artur Czumaj:
Euclidean Traveling Salesperson Problem. - Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni:
Exact Algorithms for Dominating Set. - Edward A. Hirsch:
Exact Algorithms for General CNF SAT. - Andreas Björklund, Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion. - Catherine C. McGeoch:
Experimental Methods for Algorithm Analysis. - External Memory.