Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Foto N. Afrati

Papers on DiSC'04


On Containment of Conjunctive Queries with Arithmatic Comparisons

Publications


Note: Links lead to the DBLP on the Web.

Foto N. Afrati

Foto N. Afrati, Rada Chirkova , Shalu Gupta , Charles Loftis : Designing and Using Views to Improve Performance of Aggregate Queries (Extended Abstract). DASFAA 2005 : 548-554

Foto N. Afrati, Rada Chirkova : Selecting and Using Views to Compute Aggregate Queries (Extended Abstract). ICDT 2005 : 383-397

Foto N. Afrati, Timos Aslanidis , Evripidis Bampis , Ioannis Milis : Scheduling in Switching Networks with Set-Up Delays. J. Comb. Optim. 9 (1): 49-57 (2005)

Foto N. Afrati, Evripidis Bampis , Lucian Finta , Ioannis Milis : Scheduling trees with large communication delays on two identical processors. J. Scheduling 8 (2): 179-190 (2005)

Foto N. Afrati, Chen Li , Prasenjit Mitra : On Containment of Conjunctive Queries with Arithmetic Comparisons. EDBT 2004 : 459-476

Foto N. Afrati, Aristides Gionis , Heikki Mannila : Approximating a collection of frequent sets. KDD 2004 : 12-19

Foto N. Afrati, Theodore Andronikos , V. Pavlaki , E. Foustoukos , Irène Guessarian : From CTL to Datalog. PCK50 2003 : 72-85

Foto N. Afrati, Hans Leiß , Michel de Rougemont : Definability and Compression. Fundam. Inform. 56 (1-2): 155-180 (2003)

Irène Guessarian , Eugénie Foustoucos , Theodore Andronikos , Foto N. Afrati: On temporal logic versus datalog. Theor. Comput. Sci. 1 (303): 103-133 (2003)

Foto N. Afrati, Manolis Gergatsoulis , Francesca Toni : Linearisability on datalog programs. Theor. Comput. Sci. 308 (1-3): 199-226 (2003)

Foto N. Afrati, Chen Li , Prasenjit Mitra : Answering Queries Using Views with Arithmetic Comparisons. PODS 2002 : 209-220

Foto N. Afrati, Irène Guessarian , Michel de Rougemont : The expressiveness of DAC. Theor. Comput. Sci. 286 (1): 3-32 (2002)

Agis Papantoniou , Ezz Hattab , Foto N. Afrati, Eleftherios Kayafas , Vassilis Loumos : Change Management, a Critical Success Factor for e-Government. DEXA Workshop 2001 : 402-406

Foto N. Afrati, Ioannis Milis : Designing PTASs for MIN-SUM Scheduling Problems. FCT 2001 : 432-444

Foto N. Afrati, Chen Li , Jeffrey D. Ullman : Generating Efficient Plans for Queries Using Views. SIGMOD Conference 2001

Foto N. Afrati, Evripidis Bampis , Lucian Finta , Ioannis Milis : Scheduling Trees with Large Communication Delays on Two Identical Processors. Euro-Par 2000 : 288-2295

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

Foto N. Afrati, Hans Leiß , Michel de Rougemont : Definability and Compression. LICS 2000 : 63-73

Foto N. Afrati, Phokion G. Kolaitis : Foreword: Selected Papers from ICDT 1997. Theor. Comput. Sci. 239 (2): 187 (2000)

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

Foto N. Afrati, Manolis Gergatsoulis , Theodoros G. Kavalieros : Answering Queries Using Materialized Views with Disjunctions. ICDT 1999 : 435-452

Foto N. Afrati, Evripidis Bampis , Claire Kenyon , Ioannis Milis : Scheduling on a Constant Number of Machines. RANDOM-APPROX 1999 : 281-287

Foto N. Afrati, I. Karali , Theodoros Mitakos : On Inheritance in Object Oriented Datalog. IADT 1998 : 280-289

Foto N. Afrati, Phokion G. Kolaitis : Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings Springer 1997

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

Foto N. Afrati, Francesca Toni : On the Relationsship Between Chain Queries and Linear Datalog Programs. DDLP 1997 : 0-

Foto N. Afrati, Irène Guessarian , Michel de Rougemont : The Expressiveness of Datalog Circuits (DAC). MFCS 1997 : 119-128

Foto N. Afrati: Bounded Arity Datalog (not-)Queries on Graphs. J. Comput. Syst. Sci. 55 (2): 210-228 (1997)

Foto N. Afrati, Manolis Gergatsoulis , Maria Katzouraki : On Transformations into Linear Database Logic Programs. Ershov Memorial Conference 1996 : 433-444

Foto N. Afrati, Theodoros Andronikos , Theodoros G. Kavalieros : On the Expressiveness of First-Order Constraint Languages. CDB 1995 : 22-39

Foto N. Afrati, Stavros S. Cosmadakis , Mihalis Yannakakis : On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. 51 (2): 177-196 (1995)

Foto N. Afrati: Bounded Arity Datalog (!=) Queries on Graphs. PODS 1994 : 97-106

Foto N. Afrati, Stavros S. Cosmadakis , Stéphane Grumbach , Gabriel M. Kuper : Linear vs Polynomial Constraints in Database Query Languages. PPCP 1994 : 181-192

Foto N. Afrati: The Hamilton Circuit Problem on Grids. ITA 28 (6): 567-582 (1994)

Foto N. Afrati, Andreas Stafylopatis : Performance Considerations on a Random Graph Model for Parallel Processing. ITA 27 (4): 367-388 (1993)

Foto N. Afrati, Christos H. Papadimitriou : The Parallel Complexity of Simple Logic Programs. J. ACM 40 (4): 891-916 (1993)

Foto N. Afrati: The Parallel Complexity of Single Rule Logic Programs. Discrete Applied Mathematics 40 (2): 107-126 (1992)

Foto N. Afrati, Stavros S. Cosmadakis , Mihalis Yannakakis : On Datalog vs. Polynomial Time. PODS 1991 : 13-25

Foto N. Afrati, Constantinos D. Koutras : A Hypertext Model Supporting Query Mechanisms. ECHT 1990 : 52-66

Foto N. Afrati, Stavros S. Cosmadakis : Expressiveness of Restricted Recursive Queries (Extended Abstract) STOC 1989 : 113-126

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : Corrigendum: The Complexity of Cubical Graphs Inf. Comput. 82 (3): 350-353 (1989)

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou , Athena Roussou , Yehoshua Sagiv , Jeffrey D. Ullman : On the Convergence of Query Evaluation. J. Comput. Syst. Sci. 38 (2): 341-359 (1989)

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : Scheduling Dags to Minimize Time and Communication. AWOC 1988 : 134-138

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : The Synthesis of Communication Protocols. Algorithmica 3 : 451-472 (1988)

Foto N. Afrati, Christos H. Papadimitriou : The Parallel Complexity of Simple Chain Queries. PODS 1987 : 210-213

Foto N. Afrati, Christos H. Papadimitriou , Georgios I. Papadimitriou : The Synthesis of Communication Protocols. PODC 1986 : 263-271

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou , Athena Roussou , Yehoshua Sagiv , Jeffrey D. Ullman : Convergence of Sideways Query Evaluation. PODS 1986 : 24-30

Foto N. Afrati, Stavros S. Cosmadakis , Christos H. Papadimitriou , George Papageorgiou , Nadia Papakostantinou : The Complexity of the Travelling Repairman Problem. ITA 20 (1): 79-87 (1986)

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : The Complexity of Cubical Graphs Information and Control 66 (1/2): 53-60 (1985)

Foto N. Afrati, Christos H. Papadimitriou , George Papageorgiou : The Complexity of Cubical Graphs (Extended Abstract). ICALP 1984 : 51-57

1 [ 26 ] [ 42 ] [ 44 ]

2 [ 21 ]

3 [ 48 ]

4 [ 29 ] [ 31 ] [ 34 ] [ 35 ] [ 47 ] [ 48 ]

5 [ 31 ]

6 [ 49 ] [ 50 ]

7 [ 3 ] [ 11 ] [ 13 ] [ 18 ] [ 20 ]

8 [ 35 ] [ 47 ]

9 [ 34 ]

10 [ 42 ]

11 [ 44 ]

12 [ 22 ] [ 30 ] [ 41 ]

13 [ 45 ]

14 [ 18 ]

15 [ 24 ] [ 39 ] [ 42 ] [ 44 ]

16 [ 50 ]

17 [ 38 ]

18 [ 34 ]

19 [ 28 ]

20 [ 31 ]

21 [ 22 ]

22 [ 26 ]

23 [ 21 ] [ 30 ]

24 [ 38 ]

25 [ 29 ] [ 31 ] [ 34 ]

26 [ 31 ]

27 [ 27 ] [ 32 ]

28 [ 12 ]

29 [ 18 ]

30 [ 33 ] [ 43 ]

31 [ 36 ] [ 40 ] [ 46 ]

32 [ 50 ]

33 [ 38 ]

34 [ 45 ]

35 [ 29 ] [ 31 ] [ 35 ] [ 37 ] [ 47 ] [ 48 ]

36 [ 28 ]

37 [ 40 ] [ 46 ]

38 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 15 ]

39 [ 5 ]

40 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ]

41 [ 3 ]

42 [ 38 ]

43 [ 44 ]

44 [ 31 ]

45 [ 24 ] [ 33 ] [ 39 ] [ 43 ]

46 [ 4 ] [ 9 ]

47 [ 4 ] [ 9 ]

48 [ 31 ]

49 [ 16 ]

50 [ 31 ]

51 [ 31 ]

52 [ 25 ] [ 41 ]

53 [ 4 ] [ 9 ] [ 36 ]

54 [ 13 ] [ 20 ]




©2005 Association for Computing Machinery