Back to Lab Page
F. Afrati, "Finding Strongly Connected Components in Series Parallel Graphs". Proceedings TENCON'91 , New Dehli, India, 1991.
F. Afrati, "The Parallel Complexity of Single Rule l,ogic Programs". Discrete Applied Mathematics (special issue) 40 (1992) pp 107-126.
F. Afrati, G. Papageorgiou, "Graph Algorithms; Computational Complexity" (in Greek), publication of the NTU of Athens, 1993.
F. Afrati, "Bounded Arity Datalog(=) Queries on Graphs", technical report NTUA, 1993.
S. Paschos, M. Anagnostou, F. Afrati, "Deterministic Access Protocols for Packet Radio Networks", Digital and Analog Communication Systems, in press.
F. Afrati, A. Stafylopatis, "Performance Considerations on a Random Graph Model for Parallel processing", RAIRO Theoretical Informatics and Applications, in press.
F. Afrati, S. Cosmadakis, M. Yannakakis, "Datalog vs. Polynomial Time", Journal of Computer and Systems Sciences (special issue), to appear.
F. Afrati, C.H. Papadimitriou, "The Parallel Complexity of Simple Logic Programs " , J . ACM , in press .
Back to Lab Page