scientific article; zbMATH DE number 3954271

zbMATH Open0593.68033MaRDI QIDQ3723697FDOQ3723697

Authors: B. B. Pokhodzej 

Publication date: 1984

Full work available at URL: https://eudml.org/doc/67619

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4048803
• Complexity of monotone algorithms for the simulation of discrete distributions
• scientific article; zbMATH DE number 3982480
• A probabilistic analysis of some tree algorithms
• scientific article; zbMATH DE number 3982481

zbMATH Keywords

DG-tree algorithms

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• Efficient approximation of probability distributions with \(k\)-order decomposable models
• On stochastic complexity and nonparametric density estimation
• On the choice of statistical model for one-dimensional \(P\)-algorithms
• An approximate distribution for the maximum order complexity
• On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
• Title not available (Why is that?)
• Complexity of monotone modelling algorithms for discrete distributions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3723697)