Software Engineering (Software Reuse)Data Structures and DatabasesHeuristic searchMath

(2000) Anestis A. Toptsis, “Heuristic Clustering of Reusable Software Libraries”, Informatica Journal, vol. 24, no. 4, December 2000, pp. 487-496.

(1998) Anestis A. Toptsis, and Lan Jin, "Adaptive Retrieval of Reusable Software Components", Artificial Intelligence and Soft Computing (ASC'98), Cancun, Mexico,  May 1998.

(1996) Anestis A. Toptsis, and Lan Jin, “Relevance Feedback in the Retrieval of Reusable Software Components”, 29-th Hawaiian International Conf. on System Sciences (HICSS-29), Maui, Hawaii, January 1996, pp. 279-288. 

• This paper is the primary reference (among 5 non-patented items) referenced in the US Patent titled “Information sharing system and computer program product for causing computer to support the information sharing system”. United States Patent 6,339,774, Assignee: Kabushiki Kaisha Toshiba (Kawasaki, JP), Filing Date: January 28, 1998, Patent granted Date: January 15, 2002

(1995) Anestis A. Toptsis, “Heuristic Organization and Domain Analysis of Software Repositories”, International Journal of Software Engineering and Knowledge Engineering (IJSEKE), Vol. 5, No. 2, June 1995, pp. 193-210.

(1994) Khuzaima S. Daudjee, and Anestis A. Toptsis, “Automatic Organization of Reusable Software components in a Multidimensional Space”, Proc. 4th Workshop on Information Technologies and Systems (WITS'94), Vancouver, Canada, December 1994, pp. 11-20. ( 'best paper' award in WITS’94.)

(1994) Khuzaima S. Daudjee, and Anestis A. Toptsis, “A Technique for Automatically Organizing Software Libraries for Software Reuse”, Proc. CASCON’94 Conference, Toronto, Canada, October 1994.

(1994) Anestis A. Toptsis, “Parallel Computation of the Restricted Transitive Closure of a Database Relation”, International Federation on Information Processing, Concurrent Systems, IFIP'94, North Holland Publ., Caracas, Venezuela, April 1994, pp. 83-92.

(1994) Anestis A. Toptsis, “Parallel Bidirectional Heuristic Search with Dynamic Process Re-Direction”, Proc. 8-th International Parallel Processing Symposium, IPPS'94, IEEE Computer Society Press, April 1994, pp. 242-247.

(1993) Anestis A. Toptsis, and Peter C. Nelson, “Parallel Bidirectional Heuristic State-Space Search”, Heuristics Journal, Vol. 6, No. 4, Winter 1993, pp. 40-49.

(1993) Anestis A. Toptsis, “B**-tree: A Data Organization Method for High Storage Utilization”, Proc. 5th International Conference on Computing and Information (ICCI '93), IEEE Computer Society Press, Sudbury, Canada, May 1993, pp. 277-281.

• This paper is the primary reference (among 2 non-patented items) referenced in the US Patent titled “Structure for a database”. (http://patft.uspto.gov).   United States Patent 6,249,788, Assignee: Telefonaktiebolaget LM Ericsson (publ) (Stockholm, SE),  Filing Date: 07/15/1998, Patent Granted Date: June 19, 2001.

• This paper is one of the 4 non-patented items referenced in the US Patent titled “Method and apparatus for implementing Q-trees”. (http://patft.uspto.gov), United States Patent 5,664,184, Assignee: Amalgamated Software of North America, Inc. (Big Bear Lake, CA), Filing Date: November 29, 1995, Publication Date: September 2, 1997.

• This paper is one of 4 non-patented items referenced in the US Patent titled “Method and apparatus for implementing Q-trees”. (http://patft.uspto.gov), United States Patent 5,497,485, Assignee: Amalgamated Software of North America, Inc. (Big Bear Lake, CA), Filing Date: May 21, 1993, Patent Granted Date: March 5, 1996.

• This paper is referenced in the ‘B*-tree’ entry of Wikipedia: http://en.wikipedia.org/wiki/B*-tree (entry not made by author).

(1992) Anestis A. Toptsis, “Load Balancing in Parallel Hash Join with Data Skew”, Proc. First International Conference on Information and Knowledge Management - CIKM'92, Baltimore, Maryland, November 1992, pp. 248-256.

(1992) Peter C. Nelson, and Anestis A. Toptsis, “Unidirectional and Bidirectional Search Algorithms”, IEEE Software,Volume 9, Number 2, March 1992, pp. 77-83.

 (1991) Peter C. Nelson, and Anestis A. Toptsis, “Wave-Shaping in Multiprocessor Bidirectional Heuristic State-Space Search”, Lecture Notes in Artificial Intelligence Series, Springer-Verlag , No. 541, 1991,  pp. 92-104.

(1991) Peter C. Nelson, and Anestis A. Toptsis, “Superlinear Speedup Using Bidirectionalism and Islands”, Proc. International Joint Conference on Artificial Intelligence (IJCAI) - Workshop on Parallel Processing in AI, Sydney, Australia, August 1991, pp. 129-134.

(1991) Anestis A. Toptsis, “Parallel Computation of the Transitive Closure in Highly Scalable Multiprocessors”, Lecture Notes in Computer Science Series, Springer-Verlag, No. 497 (1991), pp. 197-206.

(1990) Anestis A. Toptsis, Clement T. Yu, and Peter C. Nelson, “Computing the Transitive Closure of Symmetric Matrices”, Lecture Notes in Computer Science Series, Springer-Verlag, No. 468 (1990), pp. 174-183.

(1990) Anestis A. Toptsis, Clement T. Yu, and Peter C. Nelson, “Benchmarking Two Types of Restricted Transitive Closure Algorithms”, Proc. of the 14th Annual Inter. Computer Software and Applications Conference (IEEE COMPSAC '90), Chicago, Illinois, October 1990, pp. 375-381.

(1988) Anestis A. Toptsis, “New Two Element Generating Sets for M22, M23, M24”, Computers in Algebra, Lecture Notes in Pure and Applied Mathematics Series/111, Marcel Dekker, Inc., New York, 1988, pp. 155-159.