![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Foto N. Afrati 39 Foto N. Afrati, Chen Li , Prasenjit Mitra : Answering Queries Using Views with Arithmetic Comparisons. PODS 2002 : 209-220 38 Foto N. Afrati, Irène Guessarian , Michel de Rougemont : The expressiveness of DAC. TCS 286 (1): 3-32 (2002) 37 Agis Papantoniou , Ezz Hattab , Foto N. Afrati, Eleftherios Kayfas , Vassili Loumos : Change Management, a Critical Success Factor for e-Government. DEXA Workshop 2001 : 402-406 36 Foto N. Afrati, Ioannis Milis : Designing PTASs for MIN-SUM Scheduling Problems. FCT 2001 : 432-444 35 Foto N. Afrati, Chen Li , Jeffrey D. Ullman : Generating Efficient Plans for Queries Using Views. SIGMOD Conference 2001 34 Foto N. Afrati, Evripidis Bampis , Lucian Finta , Ioannis Milis : Scheduling Trees with Large Communication Delays on Two Identical Processors. Euro-Par 2000 : 288-2295 33 Foto N. Afrati, Evripidis Bampis , Aleksei V. Fishkin , Klaus Jansen , Claire Kenyon : Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS 2000 : 454-464 32 Foto N. Afrati, Hans Leiß , Michel de Rougemont : Definability and Compression. LICS 2000 : 63-73 31 Foto N. Afrati, Phokion G. Kolaitis : Foreword: Selected Papers from ICDT 1997. TCS 239 (2): 187 (2000) 30 Foto N. Afrati, Evripidis Bampis , Chandra Chekuri , David R. Karger , Claire Kenyon , Sanjeev Khanna , Ioannis Milis , Maurice Queyranne , Martin Skutella , Clifford Stein , Maxim Sviridenko : Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999 : 32-44 29 Foto N. Afrati, Manolis Gergatsoulis , Theodoros G. Kavalieros : Answering Queries Using Materialized Views with Disjunctions. ICDT 1999 : 435-452 28 Foto N. Afrati, Evripidis Bampis , Claire Kenyon , Ioannis Milis : Scheduling on a Constant Number of Machines. RANDOM-APPROX 1999 : 281-287 27 Foto N. Afrati, I. Karali , Theodoros Mitakos : On Inheritance in Object Oriented Datalog. IADT 1998 : 280-289 26 Foto N. Afrati, Phokion Kolaitis : Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings. Springer 1997 25 Foto N. Afrati, Theodore Andronikos , Theodore G. Kavalieros : On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties. CDB 1997 : 105-115 24 Foto N. Afrati, Francesca Toni : On the Relationsship Between Chain Queries and Linear Datalog Programs. DDLP 1997 : 0- 23 Foto N. Afrati, Irène Guessarian , Michel de Rougemont : The Expressiveness of Datalog Circuits (DAC). MFCS 1997 : 119-128 22 Foto N. Afrati: Bounded Arity Datalog (not-)Queries on Graphs. JCSS 55 (2): 210-228 (1997) 21 Foto N. Afrati, Manolis Gergatsoulis , Maria Katzouraki : On Transformations into Linear Database Logic Programs. Ershov Memorial Conference 1996 : 433-444 20 Foto N. Afrati, Theodoros Andronikos , Theodoros G. Kavalieros : On the Expressiveness of First-Order Constraint Languages. CDB 1995 : 22-39 19 Foto N. Afrati, Stavros S. Cosmadakis , Mihalis Yannakakis : On Datalog vs. Polynomial Time. JCSS 51 (2): 177-196 (1995) 18 Foto N. Afrati: Bounded Arity Datalog (!=) Queries on Graphs. PODS 1994 : 97-106 17 Foto N. Afrati, Stavros S. Cosmadakis , Stéphane Grumbach , Gabriel M. Kuper : Linear vs Polynomial Constraints in Database Query Languages. PPCP 1994 : 181-192 16 Foto N. Afrati: The Hamilton Circuit Problem on Grids. ITA 28 (6): 567-582 (1994) 15 Foto N. Afrati, Andreas Stafylopatis : Performance Considerations on a Random Graph Model for Parallel Processing. ITA 27 (4): 367-388 (1993) 14 Foto N. Afrati, Christos H. Papadimitriou : The Parallel Complexity of Simple Logic Programs. JACM 40 (4): 891-916 (1993) 13 Foto N. Afrati: The Parallel Complexity of Single Rule Logic Programs. Discrete Applied Mathematics 40 (2): 107-126 (1992) 12 Foto N. Afrati, Stavros S. Cosmadakis , Mihalis Yannakakis : On Datalog vs. Polynomial Time. PODS 1991 : 13-25 11 Foto N. Afrati, Constantinos D. Koutras : A Hypertext Model Supporting Query Mechanisms. ECHT 1990 : 52-66 10 Foto N. Afrati, Stavros S. Cosmadakis : Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989 : 113-126 9 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : Corrigendum: The Complexity of Cubical Graphs. Information and Computation 82 (3): 350-353 (1989) 8 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou , Athena Roussou , Yehoshua Sagiv , Jeffrey D. Ullman : On the Convergence of Query Evaluation. JCSS 38 (2): 341-359 (1989) 7 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : Scheduling Dags to Minimize Time and Communication. AWOC 1988 : 134-138 6 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : The Synthesis of Communication Protocols. Algorithmica 3 : 451-472 (1988) 5 Foto N. Afrati, Christos H. Papadimitriou : The Parallel Complexity of Simple Chain Queries. PODS 1987 : 210-213 4 Foto N. Afrati, Christos H. Papadimitriou , George Papadimitriou : The Synthesis of Communication Protocols. PODC 1986 : 263-271 3 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou , Athena Roussou , Yehoshua Sagiv , Jeffrey D. Ullman : Convergence of Sideways Query Evaluation. PODS 1986 : 24-30 2 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : The Complexity of Cubical Graphs. Information and Control 66 (1/2): 53-60 (1985) 1 Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : The Complexity of Cubical Graphs (Extended Abstract). ICALP 1984 : 51-57 ![]() DiSC'02 © 2003 Association for Computing Machinery |