| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Eljas Soisalon-Soininen, Peter Widmayer |
Amortized Complexity of Bulk Updates in AVL-Trees.  |
SWAT  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Jennie C. Hansen, Eric Schmutz |
Near-Optimal Bounded-Degree Spanning Trees.  |
Algorithmica  |
2001 |
DBLP DOI BibTeX RDF |
Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis |
| 2 | Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer |
Relaxed Balance Using Standard Rotations.  |
Algorithmica  |
2001 |
DBLP DOI BibTeX RDF |
Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis |
| 2 | Joaquim Gabarró, Xavier Messeguer |
A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures (Invited Paper). (PDF / PS)  |
SCCC  |
1997 |
DBLP DOI BibTeX RDF |
unified approach, balanced data structures, local rules, insertion algorithms, parallel insertion algorithms, percolation phase, rebalancing phase, parallel algorithms, parallel algorithms, dictionaries, sequential algorithm, AVL trees, concurrent algorithms |
| 2 | Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel |
Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).  |
Euro-Par  |
1997 |
DBLP DOI BibTeX RDF |
Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms |
| 2 | Helen Cameron, Derick Wood |
Balance in AVL Trees.  |
ICCI  |
1991 |
DBLP DOI BibTeX RDF |
|
| 2 | Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani |
Expected Behaviour Analysis of AVL Trees.  |
SWAT  |
1990 |
DBLP DOI BibTeX RDF |
|
| 2 | Rolf Klein, Derick Wood |
On the Maximum Path Length of AVL Trees.  |
CAAP  |
1988 |
DBLP DOI BibTeX RDF |
brother trees, comparison cost, node visit cost, AVL trees, path length |
| 2 | Athanasios K. Tsakalidis |
AVL-Trees for Localized Search.  |
ICALP  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan |
Rank-Balanced Trees.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jihyun Kim, Myung Kim |
Efficient Multiple Aggregations of Stream Data.  |
IMSCCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Habermehl, Radu Iosif, Tomás Vojnar |
Automata-Based Verification of Programs with Tree Updates.  |
TACAS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Nipkow, Cornelia Pusch |
AVL Trees.  |
Archive of Formal Proofs  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Amr Elmasry |
Adaptive Sorting with AVL Trees.  |
IFIP TCS  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Martha J. Kosa, Mark A. Boshart |
Treemap visualizations for CS2.  |
ITiCSE  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Achim D. Brucker, Burkhart Wolff |
Symbolic Test Case Generation for Primitive Recursive Functions.  |
FATES  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ohad Rodeh, Kenneth P. Birman, Danny Dolev |
Using AVL trees for fault-tolerant group key management.  |
Int. J. Inf. Sec.  |
2002 |
DBLP DOI BibTeX RDF |
Logical key hierarchy, Security, Group communication |
| 1 | Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha |
Biased dictionaries with fast insert/deletes.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim S. Larsen |
AVL Trees with Relaxed Balance.  |
J. Comput. Syst. Sci.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sabine Hanke |
The Performance of Concurrent Red-Black Tree Algorithms.  |
Algorithm Engineering  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Muralidhar Medidi, Narsingh Deo |
Parallel Dictionaries Using AVL Trees.  |
J. Parallel Distrib. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno |
Linear area upward drawings of AVL trees.  |
Comput. Geom.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yin Zhang, Zhuoqun Xu |
Concurrent manipulation of expanded AVL trees.  |
J. Comput. Sci. Technol.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung Kwon Kim |
Logarithmic Width, Linear Area Upward Drawing of AVL Trees.  |
Inf. Process. Lett.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Hettler, Dieter Nazareth, Franz Regensburger, Oscar Slotosch |
AVL Trees Revisited: A Case Study in SPECTRUM.  |
KORSO Book  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Helen Cameron, Derick Wood |
Balance in AVL Trees and Space Cost of Brother Trees.  |
Theor. Comput. Sci.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim S. Larsen |
AVL Trees with Relaxed Balance.  |
IPPS  |
1994 |
DBLP BibTeX RDF |
|
| 1 | Muralidhar Medidi, Narsingh Deo |
Parallel Dictionaries on AVL Trees.  |
IPPS  |
1994 |
DBLP BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Adolfo Piperno |
Optimal-Area Upward Drawings of AVL Trees.  |
Graph Drawing  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hidetoshi Yokoo |
Application of AVL Trees to the Adaptive Compression of Numerical Data.  |
Data Compression Conference  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani |
Improved Bounds for the Expected Behaviour of AVL Trees.  |
BIT  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Rolf Klein, Derick Wood |
A Tight Upper Bound for the Path Length of AVL Trees.  |
Theor. Comput. Sci.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay K. Vaishnavi |
Erratum: Weighted Leaf AVL-Trees.  |
SIAM J. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | François Bergeron, Gilbert Labelle, Pierre Leroux |
Functional Equations for Data Structures.  |
STACS  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Derick Wood |
Extremal Cost Tree Data Structures.  |
SWAT  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay K. Vaishnavi |
Weighted Leaf AVL-Trees.  |
SIAM J. Comput.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood |
Concurrency Control in Database Structures with Relaxed Balance.  |
PODS  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher W. Fraser, Eugene W. Myers |
An Editor for Revision Control.  |
ACM Trans. Program. Lang. Syst.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Lin Chen |
O(1) Space Complexity Deletion for AVL Trees.  |
Inf. Process. Lett.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Athanasios K. Tsakalidis |
An Amortized Analysis of Insertions into AVL-Trees.  |
SIAM J. Comput.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Liwu Li |
Ranking and Unranking of AVL-Trees.  |
SIAM J. Comput.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Athanasios K. Tsakalidis |
Rebalancing Operations for Deletions in AVL-Trees.  |
ITA  |
1985 |
DBLP BibTeX RDF |
|
| 1 | Athanasios K. Tsakalidis |
AVL-Trees for Localized Search  |
Information and Control  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed S. Zaki |
A comparative study of 2-3 trees and AVL trees.  |
International Journal of Parallel Programming  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Gottlieb |
Comments on ``Concurrent Search and Insertion in AVL Trees''.  |
IEEE Trans. Computers  |
1981 |
DBLP DOI BibTeX RDF |
linked allocation, parallel processing, search trees, Concurrent access |
| 1 | Carla Schlatter Ellis |
Concurrent Search and Insertion in AVL Trees.  |
IEEE Trans. Computers  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Luccio, Linda Pagli |
Comment on Generalized AVL Trees.  |
Commun. ACM  |
1980 |
DBLP BibTeX RDF |
|
| 1 | Thomas Ottmann, Derick Wood |
1-2 Brother Trees or AVL Trees Revisited.  |
Comput. J.  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | William E. Wright |
Dynamic Binary Search Trees.  |
ACM Annual Conference  |
1978 |
DBLP DOI BibTeX RDF |
BB trees, Dynamic trees, Optimal trees, Weighted path length, Weighted trees, Binary search trees, AVL trees |
| 1 | Hermann A. Maurer, Thomas Ottmann |
Tree-Structures for Set Manipulation Problems.  |
MFCS  |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Caxton C. Foster |
A Generalization of AVL Trees.  |
Commun. ACM  |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | K. C. Tan |
On Foster's Information Storage and Retrieval Using AVL Trees.  |
Commun. ACM  |
1972 |
DBLP DOI BibTeX RDF |
|