Average-case analysis of algorithms using Kolmogorov complexity
From MaRDI portal
Publication:1587331
DOI10.1007/BF02950402zbMATH Open0961.68065MaRDI QIDQ1587331FDOQ1587331
Authors: Tao Jiang, Ming Li, Paul M. B. Vitányi 
Publication date: 2000
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variational problem for random Young tableaux
- Title not available (Why is that?)
- Subadditive ergodic theory
- Sorting Using Networks of Queues and Stacks
- A lower bound on the average-case complexity of shellsort
- Title not available (Why is that?)
Cited In (19)
- On the average complexity of the $k$-level
- Title not available (Why is that?)
- Average case complexity under the universal distribution equals worst- case complexity
- Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
- Average-case analysis of some plurality algorithms
- Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm
- Title not available (Why is that?)
- Special issue: Average-case analysis of algorithms
- How robust are average complexity measures? A statistical case study
- Average-case analysis of quicksort and binary insertion tree height using incompressibility
- Average Case Analysis of Marking Algorithms
- Average-case analysis of the double description method and the beneath-beyond algorithm
- Average-case analysis via incompressibility
- Title not available (Why is that?)
- Title not available (Why is that?)
- Average-Case Complexity
- Title not available (Why is that?)
- Preimages under the Queuesort algorithm
- Preimages under the bubblesort operator
This page was built for publication: Average-case analysis of algorithms using Kolmogorov complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587331)
