Skip to search formSkip to main contentSkip to account menu

List of algorithms

Known as: List of database algorithms, List of distributed systems algorithms, List of operating systems algorithms 
The following is a list of algorithms along with one-line descriptions for each.
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AKS primality testAdaptive histogram equalizationBasis functionBeam stack search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Adaptive TDMA slot assignment protocol for vehicular ad-hoc networks
2011
2011
Balanced Chain-Based Routing Protocol (BCBRP) for Energy Efficient Wireless Sensor Networks
Energy is a critical issue for maintaining the WSNs. In this paper we propose a distributed chain-based routing scheme for energy… 
Highly Cited
2009
Highly Cited
2009
Network coding-based protection of many-to-one wireless flows
This paper addresses the problem of survivability of many-to-one flows in wireless networks, such as wireless mesh networks (WMNs… 
Highly Cited
2007
Highly Cited
2007
Lossless Data Embedding With High Embedding Capacity Based on Declustering for VQ-Compressed Codes
The purpose of data hiding with reversibility property is to recover the original cover media after extracting the hidden data… 
2006
2006
Performance Analysis of Tag Anti-collision Algorithms for RFID Systems
Lately, the ISO fixed on UHF Gen2 as one of the standard protocols for RFID, called ISO 18000-6 C, along with ISO 18000-6 A/B. It… 
Highly Cited
2004
Highly Cited
2004
Fast wireless anti-collision algorithm in ubiquitous ID system
This paper proposes and analyzes the fast wireless anti-collision algorithms (modified bit-by-bit binary-tree algorithm (MBBT… 
2000
2000
Statistically optimized minislot allocation for initial and collision resolution in hybrid fiber coaxial networks
In a two-way hybrid fiber coaxial (HFC) network, the headend broadcasts in downstream channels, whereas all stations share the… 
Highly Cited
1993
Highly Cited
1993
A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing
Motivated by analysis of distributed RC delay in routing trees, a new tree construction is proposed for performance-driven global… 
Highly Cited
1992
Highly Cited
1992
Algorithms for Identifying Relevant Features
This paper describes eecient methods for exact and approximate implementation of the MIN-FEATURES bias, which prefers consistent… 
Highly Cited
1983
Highly Cited
1983
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints
A popular algorithm to compact VLSI symbolic layout is to use a graph algorithm similar to finding the "longest path" in a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)