Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of algorithms on recursive trees

From MaRDI portal
Publication:914392
Jump to:navigation, search

DOI10.1016/0304-3975(90)90084-UzbMath0701.68051MaRDI QIDQ914392

Jerzy Szymański

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

treescomputational complexity of algorithms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)


Related Items (3)

Limit laws for two distance-based indices in random recursive tree models ⋮ Distances in random plane-oriented recursive trees ⋮ Limiting Distributions for Path Lengths in Recursive Trees




Cites Work

  • Distribution of nodes of a tree by degree
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: On the complexity of algorithms on recursive trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:914392&oldid=12883064"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki