Table of Contents Author Guidelines Submit a Manuscript
International Journal of Analysis
Volume 2014 (2014), Article ID 840432, 10 pages
http://dx.doi.org/10.1155/2014/840432
Research Article

A New Look at Worst Case Complexity: A Statistical Approach

1Department of Computer Science & Engineering, B.I.T. Mesra, Ranchi 835215, India
2Department of Applied Mathematics, B.I.T. Mesra, Ranchi 835215, India

Received 5 June 2014; Revised 17 September 2014; Accepted 18 September 2014; Published 29 December 2014

Academic Editor: Baruch Cahlon

Copyright © 2014 Niraj Kumar Singh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. S. Johnson, A Theoretician’s Guide to the Experimental Analysis of Algorithms, 2001, http://www.researchatt.com/~dsj/.
  2. R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer, New York, NY, USA, 1999.
  3. H. M. Mahmoud, Sorting: A Distribution Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  4. C. A. Hoare, “Quicksort,” The Computer Journal, vol. 5, pp. 10–15, 1962. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. R. Sedgewick, “Quicksort with equal keys,” SIAM Journal on Computing, vol. 6, no. 2, pp. 240–267, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. N. K. Singh, S. Chakraborty, and D. K. Mallick, “A statistical peek into average case complexity,” International Journal of Experimental Design and Process Optimisation. In press.
  7. S. Chakraborty and S. K. Sourabh, “On why an algorithmic time complexity measure can be system invariant rather than system independent,” Applied Mathematics and Computation, vol. 190, no. 1, pp. 195–204, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. S. Chakraborty, D. N. Modi, and S. K. Panigrahi, “Will the weight-based statistical bounds revolutionize the IT,” International Journal of Computational Cognition, vol. 7, no. 3, pp. 16–22, 2009. View at Google Scholar
  9. K.-T. Fang, R. Li, and A. Sudjianto, Design and Modeling for Computer Experiments, Chapman & Hall, New York, NY, USA, 2006. View at MathSciNet
  10. J. Sacks, W. Weltch, T. Mitchel, and H. Wynn, “Design and analysis of experiments,” Statistical Science, vol. 4, no. 4, pp. 409–423, 1989. View at Google Scholar
  11. S. Chakraborty and S. K. Sourabh, A Computer Experiment Oriented Approach to Algorithmic Complexity, Lambert Academic, 2010.
  12. N. K. Singh and S. Chakraborty, “Partition sort and its empirical analysis,” in Proceedings of the International Conference on Computational Intelligence and Information Technology (CIIT '11), vol. 250 of Communications in Computer and Information Science, pp. 340–346, 2011.
  13. P. Mathews, Design of Experiments with MINITAB, New Age International, New Delhi, India, 2010.
  14. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, New York, NY, USA, 8th edition, 2013.