Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 84, 2007 - Issue 7
Submit an article Journal homepage
53
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Distribution of distinguishable objects to bins: generating all distributions

Muhammad Abdullah Adnan Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka-1000, BangladeshCorrespondence[email protected]
&
Md. Saidur Rahman Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka-1000, BangladeshView further author information
Pages 953-965 | Received 04 Oct 2006, Accepted 07 Feb 2007, Published online: 01 Aug 2007

References

  • Adnan , M. A. and Rahman , M. S. Distribution of objects to bins: generating all distributions . Proceedings of the 9th International Conference on Computer and Information Technology (ICCIT , (to appear)
  • Aho , A. V. and Ullman , J. D. 1995 . Foundations of Computer Science , New York : Computer Science Press .
  • Rosen , K. H. 2000 . Discrete Mathematics and Its Applications , Singapore : WCB/McGraw-Hill .
  • Tanenbaum , A. S. 2002 . Computer Networks , Upper Saddle River, NJ : Prentice Hall .
  • Tanenbaum , A. S. 2004 . Modern Operating Systems , Upper Saddle River, NJ : Prentice Hall .
  • Knuth , D. E. 2006 . The Art of Computer Programming , 4 Available online at: www.cs.utsa.edu/wagner/knuth/
  • Belbaraka , M. and Stojmenovic , I. 1994 . On generating B-trees with constant average delay and in lexicographic order . Information Processing Letters , 49 : 27 – 32 .
  • Fenner , T. I. and Loizou , G. 1979 . A binary tree representation and related algorithms for generating integer partitions . The Computer Journal , 23 : 332 – 337 .
  • Kawano , S. and Nakano , S. 2005 . Constant time generation of set partition . IEICE Transactions Fundamentals , E88-A ( 4 ) : 930 – 934 .
  • Nakano , S. and Uno , T. 2003 . Efficient generation of rooted trees . July NII Technical Report, NII-2003-005E
  • Nakano , S. and Uno , T. 2004 . Constant time generation of trees with specified diameter . Proceedings of the 30th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004) , : 33 – 45 . LNCS 3353
  • Nakano , S. and Uno , T. 2005 . Generating colored trees . Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) , : 249 – 260 . LNCS 3787
  • Savage , C. 1997 . A survey of combinatorial gray codes . SIAM Review , 39 : 605 – 629 .
  • Yamanaka , K. and Nakano , S. 2004 . Generating all realizers . IEICE Transactions on Information and Systems , J87-DI ( 12 ) : 1043 – 1050 .
  • Zoghbi , A. and Stojmenovic , I. 1998 . Fast algorithm for generating integer partitions . International Journal of Computer Mathematics , 70 : 319 – 332 .
  • Klingsberg , P. 1982 . A gray code for compositions . Journal of Algorithms , 3 : 41 – 44 .
  • Kawano , S. and Nakano , S. 2006 . Generating multiset partitions . Private communication

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.