Skip to search formSkip to main contentSkip to account menu

AVL tree

Known as: Adelson-Velskii Landis tree, AVL, AVL-tree 
In computer science, an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Understanding the quality and usage of public transportation resources is important for schedule optimization and resource… 
2013
2013
In this paper we are presenting a Half-Subtractor using Adaptive Voltage Level (AVL) technique consuming less power than the… 
2012
2012
Diesel engine emissions of oxides of nitrogen and particulate matter can be reduced simultaneously through the use of high levels… 
2012
2012
The benefits of bus automatic vehicle location (AVL) data are well documented (see e.g., Furth et al. (2006)), ranging from… 
2011
2011
FROM CHANDRAYAAN-1 M3 IMAGERY. S. Loncaric 1 , G. Salamuniccar 1,2 , A. Grumpe 3 , C. Wohler 3 . 1 Faculty of Electrical… 
2011
2011
Transit agencies have traditionally used manual data to measure performance and plan service, but many transit agencies now… 
2007
2007
Traditional transit service quality measures separate waiting time from service reliability, thereby underestimating the real… 
Review
2001
Review
2001
In recent years CFD has been successfully established for three dimensional simulation of fluid flow, mixture formation… 
1996
1996
Abstract.We propose a new rebalancing method for binary search trees that allows rebalancing and updating to be uncoupled. In… 
Review
1994
Review
1994
This paper discusses the use of mobile cellular radio networks for providing vehicle location information to intelligent vehicle…