↓ Skip to main content
What is this page? Embed badge

Advances in Algorithms, Languages, and Complexity

Overview of attention for book
Cover of 'Advances in Algorithms, Languages, and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Theorem Proving in Hierarchical Clausal Specifications
  3. Altmetric Badge
    Chapter 2 Algorithms for Learning Finite Automata from Queries: A Unified View
  4. Altmetric Badge
    Chapter 3 Coding Complexity: The Computational Complexity of Succinct Descriptions
  5. Altmetric Badge
    Chapter 4 Homomorphic Representations of Certain Classes of Languages
  6. Altmetric Badge
    Chapter 5 Block-Synchronization Context-Free Grammars
  7. Altmetric Badge
    Chapter 6 High Sets for NP
  8. Altmetric Badge
    Chapter 7 Average-Case Analysis Using Kolmogorov Complexity
  9. Altmetric Badge
    Chapter 8 Genericity and Randomness over Feasible Probability Measures
  10. Altmetric Badge
    Chapter 9 Book’s Impact on the Theory of Thue Systems — Abstract
  11. Altmetric Badge
    Chapter 10 Sparse Hard Sets for P
  12. Altmetric Badge
    Chapter 11 A Survey of Continuous-Time Computation Theory
  13. Altmetric Badge
    Chapter 12 Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey
  14. Altmetric Badge
    Chapter 13 Relaxed Balancing in Search Trees
  15. Altmetric Badge
    Chapter 14 Measure One Results in Computational Complexity Theory
  16. Altmetric Badge
    Chapter 15 Average-Case Intractable NP Problems
  17. Altmetric Badge
    Chapter 16 Multichannel Lightwave Networks
Attention for Chapter 13: Relaxed Balancing in Search Trees
Altmetric Badge

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Relaxed Balancing in Search Trees
Chapter number 13
Book title
Advances in Algorithms, Languages, and Complexity
Published in
Advances in Algorithms, Languages, and Complexity, January 1997
DOI 10.1007/978-1-4613-3394-4_13
Book ISBNs
978-1-4613-3396-8, 978-1-4613-3394-4
Authors

Eljas Soisalon-Soininen, Peter Widmayer, Soisalon-Soininen, Eljas, Widmayer, Peter

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 50%
Researcher 1 50%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.