Skip to main content
SpringerLink
Log in

A Linear Time Algorithm for Ordered Partition

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9130))

Included in the following conference series:

Abstract

We present a deterministic linear time and space algorithm for ordered partition of a set \(T\) of \(n\) integers into \(n^{1/2}\) sets \(T_0 \le T_1 \le \cdots \le T_{n^{1/2}-1}\), where \(|T_i|=\theta (n^{1/2})\) and \(T_i \le T_{i+1}\) means that \(\max T_i \le \min T_{i+1}\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? J. Comput. Syst. Sci. 57, 74–93 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Andersson, A.: Faster deterministic sorting and searching in linear space. In: Proceedings of 1996 IEEE Symposium of Foundations of Computer Science FOCS 1996, pp. 135–141 (1996)

    Google Scholar 

  3. Belazzougui, D., Brodal, G.S., Nielsen, J.S.: Expected linear time sorting for word size \(\Omega \)(log\(^{2}\) n loglogn). In: Ravi, R., Gørtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 26–37. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  4. Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1972)

    Article  MathSciNet  Google Scholar 

  5. Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25, 19–51 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Han, Y.: Deterministic sorting in \(O(n \log \log n)\) time and linear space. J. Algorithms 50, 96–105 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Han, Y.: Optimal randomized integer sorting for integers of word size \(\Omega (\log ^2 n)\). Manuscript

    Google Scholar 

  8. Han, Y.: Construct a perfect hash function in time independent of the size of integers. To appear in FCS 2015

    Google Scholar 

  9. Han, Y., Shen, X.: Conservative algorithms for parallel and sequential integer sorting. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol. 959, pp. 324–333. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  10. Han, Y., Shen, X.: Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. SIAM J. Comput. 31(6), 1852–1878 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Han, Y., Thorup, M.: Integer sorting in \(O(n\sqrt{\log \log n})\) expected time and linear space, In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 135–144 (2002)

    Google Scholar 

  12. Kirkpatrick, D., Reisch, S.: Upper bounds for sorting integers on random access machines. Theor. Comput. Sci. 28, 263–276 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Raman, R.: Priority queues: small, monotone and trans-dichotomous. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 121–137. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Acknowledgement

Reviewers have given us very helpful comments and suggestions which helped us improve the presentation of this paper significantly. We very much appreciate their careful reviewing work.

Author information

Authors and Affiliations

  1. School of Computing and Engineering, University of Missouri at Kansas City, Kansas City, MO, 64110, USA

    Yijie Han

Authors
  1. Yijie Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yijie Han .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Jianxin Wang

  2. Courant Institute, New York University, New York, New York, USA

    Chee Yap

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Han, Y. (2015). A Linear Time Algorithm for Ordered Partition. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19647-3_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19646-6

  • Online ISBN: 978-3-319-19647-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation