default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFoto N. Afrati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[i17]Foto N. Afrati:
Safe Subjoins in Acyclic Joins. CoRR abs/2208.09671 (2022)- 2021
- [c73]Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman:
Meta-X: A Technique for Reducing Communication in Geographically Distributed Computations. CSCML 2021: 467-486 - [c72]Foto N. Afrati, Matthew Damigos
:
Querying Collections of Tree-Structured Records in the Presence of Within-Record Referential Constraints. DEXA (1) 2021: 285-291 - [c71]Foto N. Afrati, Matthew George Damigos, Nikos Stasinopoulos:
SQL-like query language and referential constraints on tree-structured data. IDEAS 2021: 1-10 - [i16]Foto N. Afrati, Matthew Damigos:
Querying collections of tree-structured records in the presence of within-record referential constraints. CoRR abs/2102.06563 (2021) - 2020
- [i15]Foto N. Afrati, Matthew Damigos:
On the complexity of query containment and computing certain answers in the presence of ACs. CoRR abs/2008.10986 (2020)
2010 – 2019
- 2019
- [b2]Foto N. Afrati, Rada Chirkova:
Answering Queries Using Views, Second Edition. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00743-9 - [c70]Foto N. Afrati:
The homomorphism property in query containment and data integration. IDEAS 2019: 2:1-2:12 - 2018
- [j44]Foto N. Afrati, Nikos Stasinopoulos, Jeffrey D. Ullman, Angelos Vasilakopoulos:
SharesSkew: An algorithm to handle skew for joins in MapReduce. Inf. Syst. 77: 129-150 (2018) - [j43]Foto N. Afrati, Shantanu Sharma, Jonathan R. Ullman, Jeffrey D. Ullman:
Computing marginals using MapReduce. J. Comput. Syst. Sci. 94: 98-117 (2018) - [e4]Foto N. Afrati, Jacek Sroka, Ke Yi, Jan Hidders:
Proceedings of the 5th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2018, Houston, TX, USA, June 15, 2018. ACM 2018 [contents] - 2017
- [b1]Foto N. Afrati, Rada Chirkova:
Answering Queries Using Views. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2017, ISBN 978-3-031-01859-6 - [j42]Foto N. Afrati, Jan Hidders, Christopher Ré, Jacek Sroka, Jeffrey D. Ullman:
Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16). SIGMOD Rec. 46(2): 43-48 (2017) - [j41]Foto N. Afrati, Jan Hidders, Paraschos Koutris, Jacek Sroka, Jeffrey D. Ullman:
Report from the Fourth Workshop on Algorithms andSystems for MapReduce and Beyond (BeyondMR '17). SIGMOD Rec. 46(4): 44-48 (2017) - [j40]Foto N. Afrati, Zaid Momani, Nikos Stasinopoulos:
Cross-Checking Multiple Data Sources Using Multiway Join in MapReduce. Sci. Program. 2017: 3072813:1-3072813:9 (2017) - [c69]Foto N. Afrati, Manas R. Joglekar, Christopher Ré, Semih Salihoglu, Jeffrey D. Ullman:
GYM: A Multiround Distributed Join Algorithm. ICDT 2017: 4:1-4:18 - [e3]Foto N. Afrati, Jacek Sroka:
Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2017, Chicago, IL, USA, May 19, 2017. ACM 2017, ISBN 978-1-4503-5019-8 [contents] - 2016
- [j39]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment Problems of Different-Sized Inputs in MapReduce. ACM Trans. Knowl. Discov. Data 11(2): 18:1-18:35 (2016) - [c68]Foto N. Afrati, Claire David, Georg Gottlob:
The ICDT 2016 Test of Time Award Announcement. ICDT 2016: 1:1-1:2 - [c67]Foto N. Afrati, Shantanu Sharma, Jeffrey D. Ullman, Jonathan R. Ullman:
Computing Marginals Using MapReduce: Keynote talk paper. IDEAS 2016: 12-23 - [e2]Foto N. Afrati, Jacek Sroka, Jan Hidders:
Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2016, San Francisco, CA, USA, July 1, 2016. ACM 2016, ISBN 978-1-4503-4311-4 [contents] - 2015
- [j38]Foto N. Afrati, Dimitris Fotakis, Angelos Vasilakopoulos:
Efficient lineage for SUM aggregate queries. AI Commun. 28(4): 655-663 (2015) - [j37]Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman:
Parallel Skyline Queries. Theory Comput. Syst. 57(4): 1008-1037 (2015) - [c66]Foto N. Afrati, Zaid Momani, Nikos Stasinopoulos:
Cross-Checking Data Sources in MapReduce. ADBIS (Short Papers and Workshops) 2015: 165-174 - [c65]Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman:
Bounds for Overlapping Interval Join on MapReduce. EDBT/ICDT Workshops 2015: 3-6 - [c64]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. EDBT/ICDT Workshops 2015: 28-37 - [c63]Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis:
Lower Bounds on the Communication of XPath Queries in MapReduce. EDBT/ICDT Workshops 2015: 38-41 - [c62]Foto N. Afrati, Frank Neven, Dan Suciu:
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015. PODS 2015: 45 - [i14]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. CoRR abs/1501.06758 (2015) - [i13]Foto N. Afrati, Phokion G. Kolaitis, Angelos Vasilakopoulos:
Consistent Answers of Conjunctive Queries on Graphs. CoRR abs/1503.00650 (2015) - [i12]Foto N. Afrati, Jeffrey D. Ullman, Angelos Vasilakopoulos:
Handling Skew in Multiway Joins in Parallel Processing. CoRR abs/1504.03247 (2015) - [i11]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment Problems of Different-Sized Inputs in MapReduce. CoRR abs/1507.04461 (2015) - [i10]Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman:
Meta-MapReduce: A Technique for Reducing Communication in MapReduce Computations. CoRR abs/1508.01171 (2015) - [i9]Foto N. Afrati, Shantanu Sharma, Jeffrey D. Ullman, Jonathan R. Ullman:
Computing Marginals Using MapReduce. CoRR abs/1509.08855 (2015) - [i8]Foto N. Afrati, Nikos Stasinopoulos, Jeffrey D. Ullman, Angelos Vasilakopoulos:
SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce. CoRR abs/1512.03921 (2015) - 2014
- [j36]Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis:
On solving efficiently the view selection problem under bag and bag-set semantics. Inf. Syst. 42: 153-176 (2014) - [j35]Foto N. Afrati, Dan Delorey, Mosha Pasumansky, Jeffrey D. Ullman:
Storing and Querying Tree-Structured Records in Dremel. Proc. VLDB Endow. 7(12): 1131-1142 (2014) - [c61]Foto N. Afrati, Anish Das Sarma, Anand Rajaraman, Pokey Rule, Semih Salihoglu, Jeffrey D. Ullman:
Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce. ICDT 2014: 4-14 - [c60]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. DISC 2014: 536-537 - [i7]Foto N. Afrati, Manas Joglekar, Christopher Ré, Semih Salihoglu, Jeffrey D. Ullman:
GYM: A Multiround Join Algorithm In MapReduce. CoRR abs/1410.4156 (2014) - 2013
- [j34]Foto N. Afrati, Anish Das Sarma, Semih Salihoglu, Jeffrey D. Ullman:
Upper and Lower Bounds on the Cost of a Map-Reduce Computation. Proc. VLDB Endow. 6(4): 277-288 (2013) - [c59]Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman:
Enumerating subgraph instances using map-reduce. ICDE 2013: 62-73 - [c58]Foto N. Afrati, Jeffrey D. Ullman:
Matching bounds for the all-pairs MapReduce problem. IDEAS 2013: 3-4 - [i6]Foto N. Afrati, Dimitris Fotakis, Angelos Vasilakopoulos:
Efficient Lineage for SUM Aggregate Queries. CoRR abs/1312.2990 (2013) - 2012
- [c57]Foto N. Afrati, Magdalena Balazinska, Anish Das Sarma, Bill Howe, Semih Salihoglu, Jeffrey D. Ullman:
Designing good algorithms for MapReduce and beyond. SoCC 2012: 26 - [c56]Foto N. Afrati, Jeffrey D. Ullman:
Transitive closure and recursive Datalog implemented on clusters. EDBT 2012: 132-143 - [c55]Foto N. Afrati, Anish Das Sarma, David Menestrina, Aditya G. Parameswaran, Jeffrey D. Ullman:
Fuzzy Joins Using MapReduce. ICDE 2012: 498-509 - [c54]Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman:
Parallel skyline queries. ICDT 2012: 274-284 - [i5]Foto N. Afrati, Anish Das Sarma, Semih Salihoglu, Jeffrey D. Ullman:
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation. CoRR abs/1204.1754 (2012) - [i4]Foto N. Afrati, Anish Das Sarma, Semih Salihoglu, Jeffrey D. Ullman:
Upper and Lower Bounds on the Cost of a Map-Reduce Computation. CoRR abs/1206.4377 (2012) - [i3]Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman:
Enumerating Subgraph Instances Using Map-Reduce. CoRR abs/1208.0615 (2012) - 2011
- [j33]Foto N. Afrati, Sara Cohen, Gabriel M. Kuper:
On the complexity of tree pattern containment with arithmetic comparisons. Inf. Process. Lett. 111(15): 754-760 (2011) - [j32]Foto N. Afrati, Rada Chirkova:
Selecting and using views to compute aggregate queries. J. Comput. Syst. Sci. 77(6): 1079-1107 (2011) - [j31]Foto N. Afrati:
Determinacy and query rewriting for conjunctive queries and views. Theor. Comput. Sci. 412(11): 1005-1021 (2011) - [j30]Foto N. Afrati, Jeffrey D. Ullman:
Optimizing Multiway Joins in a Map-Reduce Environment. IEEE Trans. Knowl. Data Eng. 23(9): 1282-1298 (2011) - [c53]Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman:
Map-reduce extensions and recursive queries. EDBT 2011: 1-8 - [c52]Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis:
Union rewritings for XPath fragments. IDEAS 2011: 43-51 - 2010
- [j29]Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis:
Query containment under bag and bag-set semantics. Inf. Process. Lett. 110(10): 360-369 (2010) - [j28]Foto N. Afrati, Nikos Kiourtis:
Computing certain answers in the presence of dependencies. Inf. Syst. 35(2): 149-169 (2010) - [c51]Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman:
Cluster Computing, Recursion and Datalog. Datalog 2010: 120-144 - [c50]Foto N. Afrati, Jeffrey D. Ullman:
Optimizing joins in a map-reduce environment. EDBT 2010: 99-110 - [c49]Foto N. Afrati, Angelos Vasilakopoulos:
Query Containment for Databases with Uncertainty and Lineage. MUD 2010: 67-81 - [c48]Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou, Foto N. Afrati:
A New Framework for Join Product Skew. RED 2010: 1-10 - [c47]Foto N. Afrati, Angelos Vasilakopoulos:
Managing Lineage and Uncertainty under a Data Exchange Setting. SUM 2010: 28-41 - [i2]Foto N. Afrati, Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou:
A New Framework for Join Product Skew. CoRR abs/1005.5732 (2010)
2000 – 2009
- 2009
- [c46]Foto N. Afrati, Manik Chandrachud, Rada Chirkova, Prasenjit Mitra:
Approximate Rewriting of Queries Using Views. ADBIS 2009: 164-178 - [c45]Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv:
On rewriting XPath queries using views. EDBT 2009: 168-179 - [c44]Foto N. Afrati, Phokion G. Kolaitis:
Repair checking in inconsistent databases: algorithms and complexity. ICDT 2009: 31-41 - 2008
- [j27]Foto N. Afrati, Paraskevas V. Lekeas, Chen Li:
Adaptive-sampling algorithms for answering aggregation queries on Web sites. Data Knowl. Eng. 64(2): 462-490 (2008) - [c43]Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis:
On Solving Efficiently the View Selection Problem under Bag-Semantics. BIRTE 2008: 12-28 - [c42]Foto N. Afrati, Chen Li, Vassia Pavlaki:
Data exchange in the presence of arithmetic comparisons. EDBT 2008: 487-498 - [c41]Foto N. Afrati, Chen Li, Vassia Pavlaki:
Data exchange: query answering for incomplete data sources. Infoscale 2008: 6 - [c40]Foto N. Afrati, Nikos Kiourtis:
Query Answering using Views in the Presence of Dependencies. NTII 2008: 8-11 - [c39]Foto N. Afrati, Phokion G. Kolaitis:
Answering aggregate queries in data exchange. PODS 2008: 129-138 - 2007
- [j26]Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki:
View selection for real conjunctive queries. Acta Informatica 44(5): 289-321 (2007) - [j25]Foto N. Afrati, Chen Li, Jeffrey D. Ullman:
Using views to generate efficient evaluation plans for queries. J. Comput. Syst. Sci. 73(5): 703-724 (2007) - [c38]Foto N. Afrati:
Rewriting Conjunctive Queries Determined by Views. MFCS 2007: 78-89 - 2006
- [j24]Foto N. Afrati, Vassia Pavlaki:
Rewriting queries using views with negation. AI Commun. 19(3): 229-237 (2006) - [j23]Foto N. Afrati, Ioannis Milis:
Designing PTASs for MIN-SUM scheduling problems. Discret. Appl. Math. 154(4): 622-639 (2006) - [j22]Foto N. Afrati, Chen Li, Prasenjit Mitra:
Rewriting queries using views in the presence of arithmetic comparisons. Theor. Comput. Sci. 368(1-2): 88-123 (2006) - [j21]Foto N. Afrati, Jennifer Widom:
Foreword to special section on SIGMOD/PODS 2005. ACM Trans. Database Syst. 31(4): 1417 (2006) - [c37]Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki:
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons. EDBT 2006: 942-960 - [p1]Foto N. Afrati:
On Approximation Algorithms for Data Mining Applications. Efficient Approximation and Online Algorithms 2006: 1-29 - 2005
- [j20]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) - [j19]Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis:
Scheduling trees with large communication delays on two identical processors. J. Sched. 8(2): 179-190 (2005) - [j18]Foto N. Afrati:
Report on PODS 2005. SIGACT News 36(3): 39-40 (2005) - [j17]Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos:
Datalog programs and their persistency numbers. ACM Trans. Comput. Log. 6(3): 481-518 (2005) - [c36]Foto N. Afrati, Paraskevas V. Lekeas, Chen Li:
Answering aggregation queries on hierarchical web sites using adaptive sampling. CIKM 2005: 237-238 - [c35]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 - [c34]Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas:
Mining Chains of Relations. ICDM 2005: 553-556 - [c33]Foto N. Afrati, Rada Chirkova:
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract). ICDT 2005: 383-397 - [c32]Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki:
Designing Views to Efficiently Answer Real SQL Queries. SARA 2005: 332-346 - [i1]Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian:
On relating CTL to Datalog. CoRR abs/cs/0510012 (2005) - 2004
- [c31]Foto N. Afrati, Chen Li, Prasenjit Mitra:
On Containment of Conjunctive Queries with Arithmetic Comparisons. EDBT 2004: 459-476 - [c30]Foto N. Afrati, Aristides Gionis, Heikki Mannila:
Approximating a collection of frequent sets. KDD 2004: 12-19 - 2003
- [j16]Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression. Fundam. Informaticae 56(1-2): 155-180 (2003) - [j15]Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati:
On temporal logic versus datalog. Theor. Comput. Sci. 303(1): 103-133 (2003) - [j14]Foto N. Afrati, Manolis Gergatsoulis, Francesca Toni:
Linearisability on datalog programs. Theor. Comput. Sci. 308(1-3): 199-226 (2003) - [c29]Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian:
From CTL to Datalog. PCK50 2003: 72-85 - 2002
- [j13]Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
The expressiveness of DAC. Theor. Comput. Sci. 286(1): 3-32 (2002) - [c28]Foto N. Afrati, Chen Li, Prasenjit Mitra:
Answering Queries Using Views with Arithmetic Comparisons. PODS 2002: 209-220 - 2001
- [c27]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 - [c26]Foto N. Afrati, Ioannis Milis:
Designing PTASs for MIN-SUM Scheduling Problems. FCT 2001: 432-444 - [c25]Foto N. Afrati, Chen Li, Jeffrey D. Ullman:
Generating Efficient Plans for Queries Using Views. SIGMOD Conference 2001: 319-330 - 2000
- [j12]Foto N. Afrati, Phokion G. Kolaitis:
Foreword: Selected Papers from ICDT 1997. Theor. Comput. Sci. 239(2): 187 (2000) - [c24]Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis:
Scheduling Trees with Large Communication Delays on Two Identical Processors. Euro-Par 2000: 288-295 - [c23]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 - [c22]Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression. LICS 2000: 63-73
1990 – 1999
- 1999
- [c21]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 - [c20]Foto N. Afrati, Manolis Gergatsoulis, Theodoros G. Kavalieros:
Answering Queries Using Materialized Views with Disjunctions. ICDT 1999: 435-452 - [c19]Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis:
Scheduling on a Constant Number of Machines. RANDOM-APPROX 1999: 281-287 - 1998
- [c18]Foto N. Afrati, Isambo Karali, Theodoros Mitakos:
On Inheritance in Object Oriented Datalog. IADT 1998: 280-289 - 1997
- [j11]Foto N. Afrati:
Bounded Arity Datalog (not-)Queries on Graphs. J. Comput. Syst. Sci. 55(2): 210-228 (1997) - [c17]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 - [c16]Foto N. Afrati, Francesca Toni:
On the Relationship Between Chain Queries and Linear Datalog Programs. DDLP 1997 - [c15]Foto N. Afrati, Isambo Karali, Theodoros Mitakos:
Datalog, units and information hiding. LMO 1997: 147-159 - [c14]Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
The Expressiveness of Datalog Circuits (DAC). MFCS 1997: 119-128 - [e1]Foto N. Afrati, Phokion G. Kolaitis:
Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings. Lecture Notes in Computer Science 1186, Springer 1997, ISBN 3-540-62222-5 [contents] - 1996
- [c13]Foto N. Afrati, Manolis Gergatsoulis, Maria Katzouraki:
On Transformations into Linear Database Logic Programs. Ershov Memorial Conference 1996: 433-444 - 1995
- [j10]Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis:
On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. 51(2): 177-196 (1995) - [c12]Foto N. Afrati, Theodoros Andronikos, Theodoros G. Kavalieros:
On the Expressiveness of First-Order Constraint Languages. CDB 1995: 22-39 - 1994
- [j9]Foto N. Afrati:
The Hamilton Circuit Problem on Grids. RAIRO Theor. Informatics Appl. 28(6): 567-582 (1994) - [c11]Foto N. Afrati:
Bounded Arity Datalog (!=) Queries on Graphs. PODS 1994: 97-106 - [c10]Foto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper:
Linear vs Polynomial Constraints in Database Query Languages. PPCP 1994: 181-192 - 1993
- [j8]Foto N. Afrati, Andreas Stafylopatis:
Performance Considerations on a Random Graph Model for Parallel Processing. RAIRO Theor. Informatics Appl. 27(4): 367-388 (1993) - [j7]Foto N. Afrati, Christos H. Papadimitriou:
The Parallel Complexity of Simple Logic Programs. J. ACM 40(4): 891-916 (1993) - 1992
- [j6]Foto N. Afrati:
The Parallel Complexity of Single Rule Logic Programs. Discret. Appl. Math. 40(2): 107-126 (1992) - [c9]Foto N. Afrati:
The parallel complexity of single rule logic programs. CNKBS 1992: 41-43 - 1991
- [c8]Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis:
On Datalog vs. Polynomial Time. PODS 1991: 13-25 - 1990
- [c7]Foto N. Afrati, Constantinos D. Koutras:
A Hypertext Model Supporting Query Mechanisms. ECHT 1990: 52-66
1980 – 1989
- 1989
- [j5]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
Corrigendum: The Complexity of Cubical Graphs. Inf. Comput. 82(3): 350-353 (1989) - [j4]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) - [c6]Foto N. Afrati, Stavros S. Cosmadakis:
Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989: 113-126 - 1988
- [j3]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Synthesis of Communication Protocols. Algorithmica 3: 451-472 (1988) - [c5]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
Scheduling Dags to Minimize Time and Communication. AWOC 1988: 134-138 - 1987
- [c4]Foto N. Afrati, Christos H. Papadimitriou:
The Parallel Complexity of Simple Chain Queries. PODS 1987: 210-213 - 1986
- [j2]Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou:
The Complexity of the Travelling Repairman Problem. RAIRO Theor. Informatics Appl. 20(1): 79-87 (1986) - [c3]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Synthesis of Communication Protocols. PODC 1986: 263-271 - [c2]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
Convergence of Sideways Query Evaluation. PODS 1986: 24-30 - 1985
- [j1]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Complexity of Cubical Graphs. Inf. Control. 66(1/2): 53-60 (1985) - 1984
- [c1]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Complexity of Cubical Graphs (Extended Abstract). ICALP 1984: 51-57
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
