Foto N. Afrati

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2009
73Approximate Rewriting of Queries Using Views. Foto N. Afrati, Manik Chandrachud, Rada Chirkova, Prasenjit Mitra. ADBIS 2009, 164-178. Cited by 1Web SearchBibTeXDownload
72On rewriting XPath queries using views. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv. EDBT 2009, 168-179. Web SearchBibTeXDownload
71Repair checking in inconsistent databases: algorithms and complexity. Foto N. Afrati, Phokion G. Kolaitis. ICDT 2009, 31-41. Cited by 4Web SearchBibTeXDownload
2008
70On Solving Efficiently the View Selection Problem under Bag-semantics. Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis. BIRTE (Informal Proceedings) 2008. Web SearchBibTeXDownload
69Adaptive-sampling algorithms for answering aggregation queries on Web sites. Foto N. Afrati, Paraskevas V. Lekeas, Chen Li. Data Knowl. Eng. (64): 462-490 (2008). Web SearchBibTeXDownload
68Data exchange in the presence of arithmetic comparisons. Foto N. Afrati, Chen Li, Vassia Pavlaki. EDBT 2008, 487-498. Web SearchBibTeXDownload
67Query Answering using Views in the Presence of Dependencies. Foto N. Afrati, Nikos Kiourtis. NTII 2008, 8-11. Cited by 1Web SearchBibTeXDownload
66Answering aggregate queries in data exchange. Foto N. Afrati, Phokion G. Kolaitis. PODS 2008, 129-138. Cited by 10Web SearchBibTeXDownload
2007
65View selection for real conjunctive queries. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki. Acta Inf. (44): 289-321 (2007). Cited by 3Web SearchBibTeXDownload
64Using views to generate efficient evaluation plans for queries. Foto N. Afrati, Chen Li, Jeffrey D. Ullman. J. Comput. Syst. Sci. (73): 703-724 (2007). Cited by 4Web SearchBibTeXDownload
63Rewriting Conjunctive Queries Determined by Views. Foto N. Afrati. MFCS 2007, 78-89. Cited by 2Web SearchBibTeXDownload
2006
62Foreword to special section on SIGMOD/PODS 2005. Foto N. Afrati, Jennifer Widom. ACM Trans. Database Syst. (31): 1417 (2006). Web SearchBibTeXDownload
61Rewriting queries using views with negation. Foto N. Afrati, Vassia Pavlaki. AI Commun. (19): 229-237 (2006). Cited by 7Web SearchBibTeXDownload
60Designing PTASs for MIN-SUM scheduling problems. Foto N. Afrati, Ioannis Milis. Discrete Applied Mathematics (154): 622-639 (2006). Cited by 4Web SearchBibTeXDownload
59Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki. EDBT 2006, 942-960. Cited by 5Web SearchBibTeXDownload
58Rewriting queries using views in the presence of arithmetic comparisons. Foto N. Afrati, Chen Li, Prasenjit Mitra. Theor. Comput. Sci. (368): 88-123 (2006). Cited by 11Web SearchBibTeXDownload
2005
57Datalog programs and their persistency numbers. Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos. ACM Trans. Comput. Log. (6): 481-518 (2005). Cited by 4Web SearchBibTeXDownload
56Answering aggregation queries on hierarchical web sites using adaptive sampling. Foto N. Afrati, Paraskevas V. Lekeas, Chen Li. CIKM 2005, 237-238. Cited by 1Web SearchBibTeXDownload
55On relating CTL to Datalog. Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian. CoRR (abs/cs/0510012) (2005). Web SearchBibTeXDownload
54Designing and Using Views to Improve Performance of Aggregate Queries (Extended Abstract). Foto N. Afrati, Rada Chirkova, Shalu Gupta, Charles Loftis. DASFAA 2005, 548-554. Cited by 5Web SearchBibTeXDownload
53Mining Chains of Relations. Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. ICDM 2005, 553-556. Cited by 4Web SearchBibTeXDownload
52Selecting and Using Views to Compute Aggregate Queries (Extended Abstract). Foto N. Afrati, Rada Chirkova. ICDT 2005, 383-397. Cited by 38Web SearchBibTeXDownload
51Scheduling in Switching Networks with Set-Up Delays. Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis. J. Comb. Optim. (9): 49-57 (2005). Cited by 14Web SearchBibTeXDownload
50Scheduling trees with large communication delays on two identical processors. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. J. Scheduling (8): 179-190 (2005). Cited by 1Web SearchBibTeXDownload
49Designing Views to Efficiently Answer Real SQL Queries. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki. SARA 2005, 332-346. Web SearchBibTeXDownload
48Report on PODS 2005. Foto N. Afrati. SIGACT News (36): 39-40 (2005). Web SearchBibTeXDownload
2004
47On Containment of Conjunctive Queries with Arithmetic Comparisons. Foto N. Afrati, Chen Li, Prasenjit Mitra. EDBT 2004, 459-476. Cited by 20Web SearchBibTeXDownload
46Approximating a collection of frequent sets. Foto N. Afrati, Aristides Gionis, Heikki Mannila. KDD 2004, 12-19. Cited by 61Web SearchBibTeXDownload
2003
45Definability and Compression. Foto N. Afrati, Hans Leiß, Michel de Rougemont. Fundam. Inform. (56): 155-180 (2003). Cited by 5Web SearchBibTeXDownload
44From CTL to Datalog. Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian. PCK50 2003, 72-85. Cited by 1Web SearchBibTeX
43On temporal logic versus datalog. Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati. Theor. Comput. Sci. (1): 103-133 (2003). Cited by 2Web SearchBibTeXDownload
42Linearisability on datalog programs. Foto N. Afrati, Manolis Gergatsoulis, Francesca Toni. Theor. Comput. Sci. (308): 199-226 (2003). Cited by 4Web SearchBibTeXDownload
2002
41Answering Queries Using Views with Arithmetic Comparisons. Foto N. Afrati, Chen Li, Prasenjit Mitra. PODS 2002, 209-220. Cited by 41Web SearchBibTeXDownload
40The expressiveness of DAC. Foto N. Afrati, Irène Guessarian, Michel de Rougemont. Theor. Comput. Sci. (286): 3-32 (2002). Web SearchBibTeXDownload
2001
39Change Management, a Critical Success Factor for e-Government. Agis Papantoniou, Ezz Hattab, Foto N. Afrati, Eleftherios Kayafas, Vassilis Loumos. DEXA Workshop 2001, 402-406. Cited by 10Web SearchBibTeX
38Designing PTASs for MIN-SUM Scheduling Problems. Foto N. Afrati, Ioannis Milis. FCT 2001, 432-444. Web SearchBibTeXDownload
37Generating Efficient Plans for Queries Using Views. Foto N. Afrati, Chen Li, Jeffrey D. Ullman. SIGMOD Conference 2001, 319-330. Cited by 61Web SearchBibTeXDownload
2000
36Scheduling Trees with Large Communication Delays on Two Identical Processors. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. Euro-Par 2000, 288-295. Cited by 2Web SearchBibTeXDownload
35Scheduling to Minimize the Average Completion Time of Dedicated Tasks. Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon. FSTTCS 2000, 454-464. Cited by 24Web SearchBibTeXDownload
34Definability and Compression. Foto N. Afrati, Hans Leiß, Michel de Rougemont. LICS 2000, 63-73. Web SearchBibTeXDownload
33Foreword: Selected Papers from ICDT 1997. Foto N. Afrati, Phokion G. Kolaitis. Theor. Comput. Sci. (239): 187 (2000). Web SearchBibTeXDownload
1999
32Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. FOCS 1999, 32-44. Cited by 119Web SearchBibTeXDownload
31Answering Queries Using Materialized Views with Disjunctions. Foto N. Afrati, Manolis Gergatsoulis, Theodoros G. Kavalieros. ICDT 1999, 435-452. Cited by 51Web SearchBibTeXDownload
30Scheduling on a Constant Number of Machines. Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis. RANDOM-APPROX 1999, 281-287. Web SearchBibTeX
1998
29On Inheritance in Object Oriented Datalog. Foto N. Afrati, Isambo Karali, Theodoros Mitakos. IADT 1998, 280-289. Cited by 2Web SearchBibTeX
1997
28On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties. Foto N. Afrati, Theodore Andronikos, Theodore G. Kavalieros. CDB 1997, 105-115. Cited by 8Web SearchBibTeX
27On the Relationsship Between Chain Queries and Linear Datalog Programs. Foto N. Afrati, Francesca Toni. DDLP 1997. Cited by 1Web SearchBibTeX
26Bounded Arity Datalog (not-)Queries on Graphs. Foto N. Afrati. J. Comput. Syst. Sci. (55): 210-228 (1997). Web SearchBibTeX
25Datalog, units and information hiding. Foto N. Afrati, Isambo Karali, Theodoros Mitakos. LMO 1997, 147-159. Web SearchBibTeX
24The Expressiveness of Datalog Circuits (DAC). Foto N. Afrati, Irène Guessarian, Michel de Rougemont. MFCS 1997, 119-128. Web SearchBibTeXDownload
1996
23On Transformations into Linear Database Logic Programs. Foto N. Afrati, Manolis Gergatsoulis, Maria Katzouraki. Ershov Memorial Conference 1996, 433-444. Cited by 1Web SearchBibTeXDownload
1995
22On the Expressiveness of First-Order Constraint Languages. Foto N. Afrati, Theodoros Andronikos, Theodoros G. Kavalieros. CDB 1995, 22-39. Cited by 18Web SearchBibTeX
21On Datalog vs. Polynomial Time. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. J. Comput. Syst. Sci. (51): 177-196 (1995). Cited by 1Web SearchBibTeX
1994
20The Hamilton Circuit Problem on Grids. Foto N. Afrati. ITA (28): 567-582 (1994). Cited by 2Web SearchBibTeX
19Bounded Arity Datalog (!=) Queries on Graphs. Foto N. Afrati. PODS 1994, 97-106. Cited by 8Web SearchBibTeX
18Linear vs Polynomial Constraints in Database Query Languages. Foto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper. PPCP 1994, 181-192. Cited by 78Web SearchBibTeX
1993
17Performance Considerations on a Random Graph Model for Parallel Processing. Foto N. Afrati, Andreas Stafylopatis. ITA (27): 367-388 (1993). Cited by 1Web SearchBibTeX
16The Parallel Complexity of Simple Logic Programs. Foto N. Afrati, Christos H. Papadimitriou. J. ACM (40): 891-916 (1993). Cited by 13Web SearchBibTeXDownload
1992
15The parallel complexity of single rule logic programs. Foto N. Afrati. CNKBS 1992, 41-43. Web SearchBibTeX
14The Parallel Complexity of Single Rule Logic Programs. Foto N. Afrati. Discrete Applied Mathematics (40): 107-126 (1992). Web SearchBibTeX
1991
13On Datalog vs. Polynomial Time. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. PODS 1991, 13-25. Cited by 65Web SearchBibTeX
1990
12A Hypertext Model Supporting Query Mechanisms. Foto N. Afrati, Constantinos D. Koutras. ECHT 1990, 52-66. Cited by 40Web SearchBibTeX
1989
11Corrigendum: The Complexity of Cubical Graphs. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. Inf. Comput. (82): 350-353 (1989). Web SearchBibTeX
10On the Convergence of Query Evaluation. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman. J. Comput. Syst. Sci. (38): 341-359 (1989). Cited by 9Web SearchBibTeX
9Expressiveness of Restricted Recursive Queries (Extended Abstract). Foto N. Afrati, Stavros S. Cosmadakis. STOC 1989, 113-126. Cited by 50Web SearchBibTeX
1988
8The Synthesis of Communication Protocols. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. Algorithmica (3): 451-472 (1988). Cited by 5Web SearchBibTeX
7Scheduling Dags to Minimize Time and Communication. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. AWOC 1988, 134-138. Cited by 9Web SearchBibTeX
1987
6The Parallel Complexity of Simple Chain Queries. Foto N. Afrati, Christos H. Papadimitriou. PODS 1987, 210-213. Cited by 35Web SearchBibTeX
1986
5The Complexity of the Travelling Repairman Problem. Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou. ITA (20): 79-87 (1986). Cited by 2Web SearchBibTeX
4The Synthesis of Communication Protocols. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. PODC 1986, 263-271. Web SearchBibTeX
3Convergence of Sideways Query Evaluation. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman. PODS 1986, 24-30. Cited by 11Web SearchBibTeX
1985
2The Complexity of Cubical Graphs. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. Information and Control (66): 53-60 (1985). Cited by 12Web SearchBibTeX
1984
1The Complexity of Cubical Graphs (Extended Abstract). Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. ICALP 1984, 51-57. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-21 - details
2. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-22 - details
3. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - PODs Program Committee - Retrieved 2009-11-21 - details
4. ^ KDD 2006 Conference - Organizers - Retrieved 2009-11-21 - details
5. ^ Untitled Document - Retrieved 2009-11-21 - details
6. ^ SIGMOD/PODS 2003 Conference - Retrieved 2009-11-21 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research