Anestis A. Toptsis Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis, Alexander Dubitski: Affective Space Calibration in Action-rich Media Affective Systems. JCIT 3(4): 3-14 (2008)
2000
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: Heurestic Clustering of Reusable Software Libraries. Informatica (Slovenia) 24(4): (2000)
1996
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis, Lan Jin: Relevance Feedback in the Retrieval of Reusable Software Components. HICSS (2) 1996: 279-
1995
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCyril U. Orji, Hong Shen, Anestis A. Toptsis: The Redundant PB-tree. Parallel and Distributed Computing and Systems 1995: 344-351
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: Heuristic Organization and Domain Analysis of Software Repositories. International Journal of Software Engineering and Knowledge Engineering 5(2): 193-210 (1995)
1994
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: Parallel Computation of the Restricted Transitive Closure of a Database Relation. Applications in Parallel and Distributed Computing 1994: 83-92
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhuzaima S. Daudjee, Anestis A. Toptsis: A technique for automatically organizing software libraries for software reuse. CASCON 1994: 12
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: Parallel Bidirectional Heuristic Search with Dynamic Process Re-Direction. IPPS 1994: 242-247
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: Parallel Algorithms for the Complete and Restricted Transitive Closure of a Database Relation. Informatica (Slovenia) 18(1): (1994)
1993
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: B**-Tree: A Data Organization Method for High Storage Utilization. ICCI 1993: 277-281
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: B***-Tree: A Family of Efficient Data Packaging Multiway Trees. ICCI 1993: 282-286
1992
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWaldemar W. Koczkodaj, Peter E. Lauer, Anestis A. Toptsis: Computing and Information - ICCI'92, Fourth International Conference on Computing and Information, Toronto, Ontario, Canada, May 28-30, 1992, Proceedings IEEE Computer Society 1992
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter C. Nelson, Anestis A. Toptsis: Unidirectional and Bidirectional Search Algorithms. IEEE Software 9(2): 77-83 (1992)
1991
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter C. Nelson, Anestis A. Toptsis: Wave-shaping in Multiprocessor Bidirectional Heuristic State Space Search. EPIA 1991: 92-104
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis: Parallel Transitive Closure Computation in Highly Scalable Multiprocessors. ICCI 1991: 197-206
1990
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnestis A. Toptsis, Clement T. Yu, Peter C. Nelson: Computing the Transitive Closure of Symmetric Matrices. ICCI 1990: 174-183

Coauthor Index

1Khuzaima S. Daudjee [10]
2Alexander Dubitski [16]
3Lan Jin [14]
4Waldemar W. Koczkodaj [5]
5Peter E. Lauer [5]
6Peter C. Nelson [1] [3] [4]
7Cyril U. Orji [13]
8Hong Shen [13]
9Clement T. Yu [1]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)