Relevant bibliographies by topics / AVL Trees / Journal articles
To see the other types of publications on this topic, follow the link: AVL Trees.

Journal articles on the topic 'AVL Trees'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'AVL Trees.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Vaishnavi, Vijay K. "Weighted Leaf AVL-Trees." SIAM Journal on Computing 16, no. 3 (June 1987): 503–37. http://dx.doi.org/10.1137/0216035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tsakalidis, Athanasios K. "AVL-trees for localized search." Information and Control 67, no. 1-3 (October 1985): 173–94. http://dx.doi.org/10.1016/s0019-9958(85)80034-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Medidi, Muralidhar, and Narsingh Deo. "Parallel Dictionaries Using AVL Trees." Journal of Parallel and Distributed Computing 49, no. 1 (February 1998): 146–55. http://dx.doi.org/10.1006/jpdc.1998.1432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vaishnavi, Vijay K. "Erratum: Weighted Leaf AVL-Trees." SIAM Journal on Computing 19, no. 3 (June 1990): 591. http://dx.doi.org/10.1137/0219039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Larsen, Kim S. "AVL Trees with Relaxed Balance." Journal of Computer and System Sciences 61, no. 3 (December 2000): 508–22. http://dx.doi.org/10.1006/jcss.2000.1705.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Liwu. "Ranking and Unranking of AVL-Trees." SIAM Journal on Computing 15, no. 4 (November 1986): 1025–35. http://dx.doi.org/10.1137/0215073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Yin, and Zhuoqun Xu. "Concurrent manipulation of expanded AVL trees." Journal of Computer Science and Technology 13, no. 4 (July 1998): 325–36. http://dx.doi.org/10.1007/bf02946622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Amani, Mahdi, Kevin A. Lai, and Robert E. Tarjan. "Amortized rotation cost in AVL trees." Information Processing Letters 116, no. 5 (May 2016): 327–30. http://dx.doi.org/10.1016/j.ipl.2015.12.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cameron, Helen, and Derick Wood. "Balance in AVL trees and space cost of brother trees." Theoretical Computer Science 127, no. 2 (May 1994): 199–228. http://dx.doi.org/10.1016/0304-3975(94)90040-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Crescenzi, P., P. Penna, and A. Piperno. "Linear area upward drawings of AVL trees." Computational Geometry 9, no. 1-2 (January 1998): 25–42. http://dx.doi.org/10.1016/s0925-7721(97)00013-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Tsakalidis, Athanasios K. "Rebalancing operations for deletions in AVL-trees." RAIRO. Informatique théorique 19, no. 4 (1985): 323–29. http://dx.doi.org/10.1051/ita/1985190403231.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Amani, Mahdi. "New Terminology and Results for AVL Trees." Electronic Notes in Discrete Mathematics 63 (December 2017): 101–8. http://dx.doi.org/10.1016/j.endm.2017.11.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Kim, Ji-Hyun, and Myung Kim. "Efficient Computation of Stream Cubes Using AVL Trees." KIPS Transactions:PartD 14D, no. 6 (October 31, 2007): 597–604. http://dx.doi.org/10.3745/kipstd.2007.14-d.6.597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Nurmi, Otto, Eljas Soislon-Soininen, and Derick Wood. "Relaxed avl trees, main-memory databases and concurrency." International Journal of Computer Mathematics 62, no. 1-2 (January 1996): 23–44. http://dx.doi.org/10.1080/00207169608804523.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Mehlhorn, Kurt, and Athanasios Tsakalidis. "An Amortized Analysis of Insertions into AVL-Trees." SIAM Journal on Computing 15, no. 1 (February 1986): 22–33. http://dx.doi.org/10.1137/0215002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Chen, Lin. "O(1) space complexity deletion for AVL trees." Information Processing Letters 22, no. 3 (March 1986): 147–49. http://dx.doi.org/10.1016/0020-0190(86)90061-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Amani, Mahdi. "Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees." AKCE International Journal of Graphs and Combinatorics 15, no. 1 (April 1, 2018): 14–21. http://dx.doi.org/10.1016/j.akcej.2018.01.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Kim, Sung Kwon. "Logarithmic width, linear area upward drawing of AVL trees." Information Processing Letters 63, no. 6 (September 1997): 303–7. http://dx.doi.org/10.1016/s0020-0190(97)00137-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Baeza-Yates, Ricardo, Gaston H. Gonnet, and Nivio Ziviani. "Improved bounds for the expected behaviour of AVL trees." BIT 32, no. 2 (June 1992): 297–315. http://dx.doi.org/10.1007/bf01994883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Gabarró, Joaquim, and Xavier Messeguer. "Parallel dictionaries with local rules on AVL and brother trees." Information Processing Letters 68, no. 2 (October 1998): 79–85. http://dx.doi.org/10.1016/s0020-0190(98)00142-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Jung, Haejae, and Sartaj Sahni. "Supernode Binary Search Trees." International Journal of Foundations of Computer Science 14, no. 03 (June 2003): 465–90. http://dx.doi.org/10.1142/s0129054103001844.

Full text
Abstract:
Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established. Experiments oonducted by us show that the supernode structures proposed by us use less space than do the corresponding one-element-per-node versions and also take less time for the standard dictionary operations: search, insert and delete.
APA, Harvard, Vancouver, ISO, and other styles
22

Klein, Rolf, and Derick Wood. "A tight upper bound for the path length of AVL trees." Theoretical Computer Science 72, no. 2-3 (May 1990): 251–64. http://dx.doi.org/10.1016/0304-3975(90)90037-i.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

CHO, SEONGHUN, and SARTAJ SAHNI. "A NEW WEIGHT BALANCED BINARY SEARCH TREE." International Journal of Foundations of Computer Science 11, no. 03 (September 2000): 485–513. http://dx.doi.org/10.1142/s0129054100000296.

Full text
Abstract:
We develop a new class of weight balanced binary search trees called β-balanced binary search trees (β-BBSTs). β-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node β-BBST take O( log n) time for [Formula: see text]. Experimental results comparing the performance of β-BBSTs, WB(α) trees, AVL-trees, red/black trees, treaps, deterministic skip lists and skip lists are presented. Two simplified versions of, β-BBSTs are also developed.
APA, Harvard, Vancouver, ISO, and other styles
24

HINZE, RALF. "Purely Functional 1-2 Brother Trees." Journal of Functional Programming 19, no. 6 (May 26, 2009): 633–44. http://dx.doi.org/10.1017/s0956796809007333.

Full text
Abstract:
Enter the computing arboretum and you will find a variety of well-studied trees: AVL trees (Adel'son-Vel'skiĭ & Landis 1962), symmetric binary B-trees (Bayer 1972), Hopcroft's 2-3 trees (Aho et al. 1974), the bushy finger trees (Guibas et al. 1977) and the colourful red-black trees (Guibas & Sedgewick 1978). In this pearl, we look at a more exotic species of balanced search trees, 1-2 brother trees (Ottmann et al. 1979), which deserves to be better known. Brother trees lend themselves well to a functional implementation with deletion (Section 5) as straightforward as insertion (Section 3), both running in logarithmic time. Furthermore, brother trees can be constructed from ordered lists in linear time (Section 4). With some simple optimisations in place, this implementation of search trees is one of the fastest around. So, fasten your seat belts.
APA, Harvard, Vancouver, ISO, and other styles
25

CG, Tsipouridis, Simonis AD, S. Bladenopoulos, Issakidis AM, and Stylianidis DC. "Nutrient element variability of peach trees and tree mortality in relation to cultivars and rootstocks." Horticultural Science 29, No. 2 (January 6, 2012): 51–55. http://dx.doi.org/10.17221/4460-hortsci.

Full text
Abstract:
Leaf samples from 12 peach cultivars (Prunus persica [L.] Batsch.) (Early Crest, May Crest, Flavor Crest,Sun Crest, Fayette, Katherina, Loadel, Andross, Everts, May Grand, Firebrite and Fairlane) grafted on four peach root-stocks were analyzed for their nutrient content. The analysis of variance for leaf nutrient concentrations indicated very significant effects and interactions among cultivars and rootstocks. The rootstock effect on the absorption of nutrient elements was higher for Ca, K, P, Mg, N, and lower for Cu, Zn, Fe, Mn, and B. Generally cultivars grafted on GF 677 had higher N, K, Fe, Cu and lower Zn, Mn, and B, while leaves from cultivars grafted on wild seedlings were found to contain higher Mg and lower P, K, Fe concentrations. Leaf B and Ca were higher for cultivars grafted on Sant Julien GF 655/2, while cultivars on Damas GF 1869 had higher P, Zn, Mn and lower N, B, Ca, Cu concentrations. Leaf N was lower for Fayette on all four rootstocks and significantly different from all other cultivars. Leaf P was lower for Everts and higher for Katherina. Lower concentrations were observed in Early Crest for Fe and Zn, in Andross for Mn, and in Loadel for B, while Flavor Crest had higher concentrations of all these elements. Leaf Zn was the highest for Sun Crest on wild seedling and the lowest for Early Crest on the same rootstock. Similarly leaf N was the highest for Katherina on Damas and the lowest for Fayetteon the same rootstock. Also leaf Mg was the highest for Fayette on Damas and the lowest for Fairlane on Damas. Peach tree mortality was the highest for Damas 1869 and lowest for Sant Julien. Also tree mortality was highest for Early Crest and Sun Crest and lowest for May Grand, Firebrite, and Katherina. The observed trends in the leaf nutrient composition, as regards the cultivars, rootstocks and their interactions, emphasize the importance of these factors on a new peach orchard establishment and macro-microelement fertilization.      
APA, Harvard, Vancouver, ISO, and other styles
26

Penny, David. "Evolutionary trees for all." Trends in Ecology & Evolution 19, no. 6 (June 2004): 273. http://dx.doi.org/10.1016/j.tree.2004.04.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Skomorokhov, Alexander, and Vladimir Kutinsky. "Classification trees in APL." ACM SIGAPL APL Quote Quad 31, no. 2 (December 2000): 101–13. http://dx.doi.org/10.1145/570406.570419.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Navarro, Gonzalo. "Wavelet trees for all." Journal of Discrete Algorithms 25 (March 2014): 2–20. http://dx.doi.org/10.1016/j.jda.2013.07.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

VUKICEVIC, Damir, and Ivan GUTMAN. "Almost All Trees and Chemical Trees Have Equiseparable Mates." Journal of Computer Chemistry, Japan 3, no. 3 (2004): 109–12. http://dx.doi.org/10.2477/jccj.3.109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Yuan, Jiaxin, and Weigang Wang. "Dimensions of Random Trees in Random Environments." Advanced Science Letters 7, no. 1 (March 30, 2012): 144–47. http://dx.doi.org/10.1166/asl.2012.2110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Driscoll, Keith, Elliot Krop, and Michelle Nguyen. "All trees are six-cordial." Electronic Journal of Graph Theory and Applications 5, no. 1 (April 2017): 21–35. http://dx.doi.org/10.5614/ejgta.2017.5.1.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Elf, Shannon Elisabeth. "“All Our Wisdom is Stored in the Trees” - Degrading BCR-ABL with Berberis Vulgaris." Clinical Cancer Research 26, no. 15 (May 12, 2020): 3899–900. http://dx.doi.org/10.1158/1078-0432.ccr-20-0829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Hua, Wei, Feng Liu, Ruijian Yang, and Hujun Bao. "Animating and Rendering One Million Trees in Real Time." Advanced Science Letters 10, no. 1 (May 15, 2012): 459–64. http://dx.doi.org/10.1166/asl.2012.3326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Kala, Duran. "Epidemiology and Ecological Distribution of Tree Tumors in the Territory of Landscape Reserve “Teply stan”." International Journal of Biology 8, no. 1 (November 11, 2015): 42. http://dx.doi.org/10.5539/ijb.v8n1p42.

Full text
Abstract:
<p class="1Body">This study focuses tumors of woody trees in the territory of landscape reserve “Teply stan” in Moscow. Abnormal swellings on the trunk of woody trees are called Tumor. Formation of a swell is an evidence of an infringement of metabolism in a tree's body, is a disease of a tree and is a cause of a tree's premature death. Tumor prevents transportation of water and minerals from roots towards the leaves of a tree and transportation of organic matters from the leaves towards roots. The purpose of this study is to find out some appropriatenesses of spreading of tumors of trees in the landscape reserve “Teply stan”.</p><p class="1Body">In this study, landscape reserve divided into 9 study sections according to ecological conditions. Surveillance of all trees and statistical analysis of tumor trees in studied section of landscape reserve have done. The results showed that 57 of the counted 25 thousands trees have tumors. 50 of the tumors trees are belong to birch<em> (Betula pendula)</em>.Trees with tumors are distributed non-uniformly, generally in central and east parts of landscape reserve that had ecologic pollution. Mainly birch <em>(Betula pendula)</em><em>,</em> oak <em>(Quercus rubor)</em><em> </em>and linden <em>(Tilia cordata)</em> are damaged by tumors in the studied territory. The most effected trees with tumors are birch <em>(Betula pendula)</em><em> </em>tree population. The direct proportion between ecological situation and the number of tumors have found.</p>
APA, Harvard, Vancouver, ISO, and other styles
35

Trachtenberg, Joshua T. "Parvalbumin Interneurons: All Forest, No Trees." Neuron 87, no. 2 (July 2015): 247–48. http://dx.doi.org/10.1016/j.neuron.2015.06.041.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Carr, Hamish, Jack Snoeyink, and Ulrike Axen. "Computing contour trees in all dimensions." Computational Geometry 24, no. 2 (February 2003): 75–94. http://dx.doi.org/10.1016/s0925-7721(02)00093-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Adamaszek, Anna, Peter Allen, Codruţ Grosu, and Jan Hladký. "Almost all trees are almost graceful." Random Structures & Algorithms 56, no. 4 (February 19, 2020): 948–87. http://dx.doi.org/10.1002/rsa.20906.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Larsson, Jonas. "Barcodes show family trees in ALL." Blood 129, no. 24 (June 15, 2017): 3139–40. http://dx.doi.org/10.1182/blood-2017-05-780023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Junk, Luca, Simon Schmidt, and Moritz Weber. "Almost all trees have quantum symmetry." Archiv der Mathematik 115, no. 4 (May 30, 2020): 367–78. http://dx.doi.org/10.1007/s00013-020-01476-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Andersen, Lars Døvling, and Preben Dahl Vestergaard. "Graphs with all spanning trees nonisomorphic." Discrete Mathematics 155, no. 1-3 (August 1996): 3–12. http://dx.doi.org/10.1016/0012-365x(94)00363-n.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Merris, Russell. "Almost all trees are co-immanantal." Linear Algebra and its Applications 150 (May 1991): 61–66. http://dx.doi.org/10.1016/0024-3795(91)90159-t.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Friedman, Joel, and Nicholas Pippenger. "Expanding graphs contain all small trees." Combinatorica 7, no. 1 (March 1987): 71–76. http://dx.doi.org/10.1007/bf02579202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Chung, Chung-Yi, and Pei-Ling Chung. "The Purifying Efficiency of Trees to High Concentration Sulfur Dioxide." Advanced Science Letters 19, no. 10 (October 1, 2013): 3103–6. http://dx.doi.org/10.1166/asl.2013.5084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Conner, Patrick J., and Ray E. Worley. "Alternate Bearing Intensity of Pecan Cultivars." HortScience 35, no. 6 (October 2000): 1067–69. http://dx.doi.org/10.21273/hortsci.35.6.1067.

Full text
Abstract:
The Coastal Plain Experiment Station has been evaluating pecan [Carya illinoinensis (Wangenh.) K. Koch] cultivars for over 75 years. Using annual yield data from this program, the alternate bearing intensities (I) of 66 pecan cultivars and numbered U.S. Dept. of Agriculture (USDA) selections were determined. Values ranged from 0.19 to 0.93 in young trees, and from 0.27 to 0.91 in mature trees under high-input production practices. The adoption of fungicides, insecticides, and irrigation during the last 30 years has reduced the average I value from 0.70 to 0.55. I was negatively correlated with both nut yield and nut weight. All but one cultivar recommended for commercial production in Georgia have I values lower than the average of 0.57 for all cultivars in this test. Values calculated early in a tree's productive life cycle were highly correlated with those of mature trees.
APA, Harvard, Vancouver, ISO, and other styles
45

Jung, Paul, Jiho Lee, Sam Staton, and Hongseok Yang. "A generalization of hierarchical exchangeability on trees to directed acyclic graphs." Annales Henri Lebesgue 4 (January 18, 2021): 325–68. http://dx.doi.org/10.5802/ahl.74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

ISHIKAWA, Masanobu, Katsuhisa YAMANAKA, Yota OTACHI, and Shin-ichi NAKANO. "Enumerating All Rooted Trees Including k Leaves." IEICE Transactions on Information and Systems E95-D, no. 3 (2012): 763–68. http://dx.doi.org/10.1587/transinf.e95.d.763.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Milius, Susan. "Mistletoe, of All Things, Helps Juniper Trees." Science News 161, no. 1 (January 5, 2002): 6. http://dx.doi.org/10.2307/4013039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Akçay, Mehmet Berkehan, Hüseyin Akcan, and Cem Evrendilek. "All Colors Shortest Path problem on trees." Journal of Heuristics 24, no. 4 (March 30, 2018): 617–44. http://dx.doi.org/10.1007/s10732-018-9370-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Hrnčiar, Pavel, and Alfonz Haviar. "All trees of diameter five are graceful." Discrete Mathematics 233, no. 1-3 (April 2001): 133–50. http://dx.doi.org/10.1016/s0012-365x(00)00233-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

ZHAO, SHI-LIN. "All Trees of Diameter Four Are Graceful." Annals of the New York Academy of Sciences 576, no. 1 Graph Theory (December 1989): 700–706. http://dx.doi.org/10.1111/j.1749-6632.1989.tb16451.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'AVL Trees' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography