Algorithms, random tree models and combinatorial objects
From MaRDI portal
Publication:3082005
Recommendations
- Mini-workshop: Random trees, information and algorithms. Abstracts from the mini-workshop held April 24--30, 2011
- Random binary trees: from the average case analysis to the asymptotics of distributions
- The properties of random trees
- A probabilistic analysis of some tree algorithms
- Analysis of the total costs for variants of the union-find algorithm
Cited in
(8)- 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6--10, 2005.
- Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.
- scientific article; zbMATH DE number 1444332 (Why is no real title available?)
- The combinatorics of discrete time-trees: theory and open problems
- Searching Trees: An Essay
- Analysis of the total costs for variants of the union-find algorithm
- Enumeration and randomized constructions of hypertrees
- scientific article; zbMATH DE number 5560473 (Why is no real title available?)
This page was built for publication: Algorithms, random tree models and combinatorial objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082005)