Brief announcement: k-shot distributed broadcasting in radio networks. - Paraschos Koutris; Aris Pagourtzis (PODC, 2010)

Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. - Paraschos Koutris; Aris Pagourtzis (CATS, 2011)

Parallel evaluation of conjunctive queries. - Paraschos Koutris; Dan Suciu (PODS, 2011)

Database-as-a-Service for Long-Tail Science. - Bill Howe; Garrett Cole; Emad Soroush; Paraschos Koutris; Alicia Key; Nodira Khoussainova; Leilani Battle (SSDBM, 2011)

Optimizing Large-Scale Semi-Naïve Datalog Evaluation in Hadoop. - Marianne Shaw; Paraschos Koutris; Bill Howe; Dan Suciu (Datalog, 2012)

QueryMarket Demonstration: Pricing for Online Data Markets. - Paraschos Koutris; Prasang Upadhyaya; Magdalena Balazinska; Bill Howe; Dan Suciu (Proc. VLDB Endow., 2012)

A Discussion on Pricing Relational Data. - Magdalena Balazinska; Bill Howe; Paraschos Koutris; Dan Suciu; Prasang Upadhyaya (In Search of Elegance in the Theory and Practice of Computation, 2013)

Toward practical query pricing with QueryMarket. - Paraschos Koutris; Prasang Upadhyaya; Magdalena Balazinska; Bill Howe; Dan Suciu (SIGMOD Conference, 2013)

A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys. - Paraschos Koutris; Dan Suciu (ICDT, 2014)

Skew in parallel query processing. - Paul Beame; Paraschos Koutris; Dan Suciu (PODS, 2014)

Demonstration of the Myria big data management service. - Daniel Halperin; Victor Teixeira de Almeida; Lee Lee Choo; Shumo Chu; Paraschos Koutris; Dominik Moritz; Jennifer Ortiz; Vaspol Ruamviboonsuk; Jingjing Wang 008; Andrew Whitaker; Shengliang Xu; Magdalena Balazinska; et al. (SIGMOD Conference, 2014)

Online Sum-Radii Clustering. - Dimitris Fotakis 001; Paraschos Koutris (Theor. Comput. Sci., 2014)

The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. - Paraschos Koutris; Jef Wijsen (PODS, 2015)

A Trichotomy in the Data Complexity of Certain Query Answering for Conjunctive Queries. - Paraschos Koutris; Jef Wijsen (CoRR, 2015)

Query-Based Data Pricing. - Paraschos Koutris; Prasang Upadhyaya; Magdalena Balazinska; Bill Howe; Dan Suciu (J. ACM, 2015)

Parallel Skyline Queries. - Foto N. Afrati; Paraschos Koutris; Dan Suciu; Jeffrey D. Ullman (Theory Comput. Syst., 2015)

Query Processing for Massively Parallel Systems. - Paraschos Koutris (2015)

Worst-Case Optimal Algorithms for Parallel Query Processing. - Paraschos Koutris; Paul Beame; Dan Suciu (ICDT, 2016)

Deterministic load balancing for parallel joins. - Paraschos Koutris; Nivetha Singara Vadivelu (BeyondMR@SIGMOD, 2016)

Communication Cost in Parallel Query Processing. - Paul Beame; Paraschos Koutris; Dan Suciu (CoRR, 2016)

k-shot Broadcasting in Ad Hoc Radio Networks. - Sushanta Karmakar; Paraschos Koutris; Aris Pagourtzis; Dimitris Sakavalas (CoRR, 2016)

Distributed Data Deduplication. - Xu Chu; Ihab F. Ilyas; Paraschos Koutris (Proc. VLDB Endow., 2016)

A Guide to Formal Analysis of Join Processing in Massively Parallel Systems. - Paraschos Koutris; Dan Suciu (SIGMOD Rec., 2016)

Consistent Query Answering for Primary Keys. - Paraschos Koutris; Jef Wijsen (SIGMOD Rec., 2016)

Constraint-Based Synthesis of Datalog Programs. - Aws Albarghouthi; Paraschos Koutris; Mayur Naik; Calvin Smith (CP, 2017)

The Design of Arbitrage-Free Data Pricing Schemes. - Shaleen Deep; Paraschos Koutris (ICDT, 2017)

m-tables: Representing Missing Data. - Bruhathi Sundarmurthy; Paraschos Koutris; Willis Lang; Jeffrey F. Naughton; Val Tannen (ICDT, 2017)

Model-based Pricing: Do Not Pay for More than What You Learn! - Lingjiao Chen; Paraschos Koutris; Arun Kumar 001 (DEEM@SIGMOD, 2017)

QIRANA: A Framework for Scalable Query Pricing. - Shaleen Deep; Paraschos Koutris (SIGMOD Conference, 2017)

Communication Steps for Parallel Query Processing. - Paul Beame; Paraschos Koutris; Dan Suciu (J. ACM, 2017)

Energy-efficient broadcasting in ad hoc wireless networks. - Sushanta Karmakar; Paraschos Koutris; Aris Pagourtzis; Dimitris Sakavalas (J. Discrete Algorithms, 2017)

Answering Conjunctive Queries with Inequalities. - Paraschos Koutris; Tova Milo; Sudeepa Roy 001; Dan Suciu (Theory Comput. Syst., 2017)

QIRANA Demonstration: Real time Scalable Query Pricing. - Shaleen Deep; Paris Koutris; Yash Bidasaria (Proc. VLDB Endow., 2017)

Report from the Fourth Workshop on Algorithms andSystems for MapReduce and Beyond (BeyondMR '17). - Foto N. Afrati; Jan Hidders; Paraschos Koutris; Jacek Sroka; Jeffrey D. Ullman (SIGMOD Rec., 2017)

Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. - Paraschos Koutris; Jef Wijsen (ACM Trans. Database Syst., 2017)

The Effect of Network Width on the Performance of Large-batch Training. - Lingjiao Chen; Hongyi Wang 001; Jinman Zhao; Dimitris S. Papailiopoulos; Paraschos Koutris (NeurIPS, 2018)

Compressed Representations of Conjunctive Query Results. - Shaleen Deep; Paraschos Koutris (PODS, 2018)

Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms. - Paraschos Koutris; Jef Wijsen (PODS, 2018)

Algorithmic Aspects of Parallel Query Processing. - Paris Koutris; Semih Salihoglu; Dan Suciu (SIGMOD Conference, 2018)

Exploiting Data Partitioning To Provide Approximate Results. - Bruhathi Sundarmurthy; Paraschos Koutris; Jeffrey F. Naughton (BeyondMR@SIGMOD, 2018)

Syntax-guided synthesis of Datalog programs. - Xujie Si; Woosuk Lee; Richard Zhang 004; Aws Albarghouthi; Paraschos Koutris; Mayur Naik (ESEC/SIGSOFT FSE, 2018)

Model-based Pricing for Machine Learning in a Data Marketplace. - Lingjiao Chen; Paraschos Koutris; Arun Kumar 001 (CoRR, 2018)

Streaming dynamic and distributed inference of latent geometric structures. - Mikhail Yurochkin; Zhiwei Fan; Aritra Guha; Paraschos Koutris; XuanLong Nguyen (CoRR, 2018)

Algorithmic Aspects of Parallel Data Processing. - Paraschos Koutris; Semih Salihoglu; Dan Suciu (Found. Trends Databases, 2018)

Consistent Query Answering for Primary Keys in Logspace. - Paraschos Koutris; Jef Wijsen (ICDT, 2019)

Scalable inference of topic evolution via models for latent geometric structures. - Mikhail Yurochkin; Zhiwei Fan; Aritra Guha; Paraschos Koutris; XuanLong Nguyen (NeurIPS, 2019)

Towards Model-based Pricing for Machine Learning in a Data Marketplace. - Lingjiao Chen; Paraschos Koutris; Arun Kumar 001 (SIGMOD Conference, 2019)

Demonstration of Nimbus: Model-based Pricing for Machine Learning in a Data Marketplace. - Lingjiao Chen; Hongyi Wang 001; Leshang Chen; Paraschos Koutris; Arun Kumar 001 (SIGMOD Conference, 2019)

Revenue Maximization for Query Pricing. - Shuchi Chawla 001; Shaleen Deep; Paraschos Koutris; Yifeng Teng (Proc. VLDB Endow., 2019)

Scaling-Up In-Memory Datalog Processing: Observations and Techniques. - Zhiwei Fan; Jianqiao Zhu; Zuyu Zhang; Aws Albarghouthi; Paraschos Koutris; Jignesh M. Patel (Proc. VLDB Endow., 2019)

Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale. - Spyros Blanas; Paraschos Koutris; Anastasios Sidiropoulos (CIDR, 2020)

Manually Detecting Errors for Data Cleaning Using Adaptive Crowdsourcing Strategies. - Haojun Zhang; Chengliang Chai; AnHai Doan; Paris Koutris; Esteban Arcaute (EDBT, 2020)

First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys. - Paraschos Koutris; Jef Wijsen (PODS, 2020)

Fast Join Project Query Evaluation using Matrix Multiplication. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (SIGMOD Conference, 2020)

Automated tuning of query degree of parallelism via machine learning. - Zhiwei Fan; Rathijit Sen; Paraschos Koutris; Aws Albarghouthi (aiDM@SIGMOD, 2020)

Providing Insights for Queries affected by Failures and Stragglers. - Bruhathi Sundarmurthy; Harshad Deshmukh; Paris Koutris; Jeffrey F. Naughton (CoRR, 2020)

A Comparative Exploration of ML Techniques for Tuning Query Degree of Parallelism. - Zhiwei Fan; Rathijit Sen; Paraschos Koutris; Aws Albarghouthi (CoRR, 2020)

Distribution Policies for Datalog. - Bas Ketsman; Aws Albarghouthi; Paraschos Koutris (Theory Comput. Syst., 2020)

Comprehensive and Efficient Workload Compression. - Shaleen Deep; Anja Gruenheid; Paraschos Koutris; Jeffrey F. Naughton; Stratis Viglas (Proc. VLDB Endow., 2020)

Enumeration Algorithms for Conjunctive Queries with Projection. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (ICDT, 2021)

Locality-Aware Distribution Schemes. - Bruhathi Sundarmurthy; Paraschos Koutris; Jeffrey F. Naughton (ICDT, 2021)

Algorithms for a Topology-aware Massively Parallel Computation Model. - Xiao Hu 005; Paraschos Koutris; Spyros Blanas (PODS, 2021)

Consistent Query Answering for Primary Keys on Path Queries. - Paraschos Koutris; Xiating Ouyang; Jef Wijsen (PODS, 2021)

Space-Time Tradeoffs for Answering Boolean Conjunctive Queries. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (CoRR, 2021)

Consistent Query Answering for Primary Keys in Datalog. - Paraschos Koutris; Jef Wijsen (Theory Comput. Syst., 2021)

Towards Better Understanding of the Performance and Design of Datalog Systems. - Zhiwei Fan; Sunil Mallireddy; Paraschos Koutris (Datalog, 2022)

Salvaging failing and straggling queries. - Bruhathi Sundarmurthy; Harshad Deshmukh; Paris Koutris; Jeffrey F. Naughton (ICDE, 2022)

Certifiable Robustness for Nearest Neighbor Classifiers. - Austen Z. Fan; Paraschos Koutris (ICDT, 2022)

Plor: General Transactions with Predictable, Low Tail Latency. - Youmin Chen; Xiangyao Yu; Paraschos Koutris; Andrea C. Arpaci-Dusseau; Remzi H. Arpaci-Dusseau; Jiwu Shu (SIGMOD Conference, 2022)

Modern Datalog Engines. - Bas Ketsman; Paraschos Koutris (Found. Trends Databases, 2022)

Ranked Enumeration of Join Queries with Projections. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (Proc. VLDB Endow., 2022)

Comprehensive and Efficient Workload Summarization. - Shaleen Deep; Anja Gruenheid; Paraschos Koutris; Stratis Viglas; Jeffrey F. Naughton (Datenbank-Spektrum, 2022)

The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. - Austen Z. Fan; Paraschos Koutris; Hangdong Zhao (ICALP, 2023)

General Space-Time Tradeoffs via Relational Queries. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (WADS, 2023)

Certifiable Robustness for Naive Bayes Classifiers. - Song Bian 002; Xiating Ouyang; Zhiwei Fan; Paraschos Koutris (CoRR, 2023)

LinCQA: Faster Consistent Query Answering with Linear Time Guarantees. - Zhiwei Fan; Paraschos Koutris; Xiating Ouyang; Jef Wijsen (Proc. ACM Manag. Data, 2023)

The Fine-Grained Complexity of CFL Reachability. - Paraschos Koutris; Shaleen Deep (Proc. ACM Program. Lang., 2023)

Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries. - Yifei Yang; Hangdong Zhao; Xiangyao Yu; Paraschos Koutris (CIDR, 2024)

Evaluating Datalog via Structure-Aware Rewriting. - Hangdong Zhao; Paraschos Koutris; Shaleen Deep (Datalog, 2024)

Naive Bayes Classifiers over Missing Data: Decision and Poisoning. - Song Bian 002; Xiating Ouyang; Zhiwei Fan; Paraschos Koutris (ICML, 2024)

Topology-aware Parallel Joins. - Xiao Hu 005; Paraschos Koutris (Proc. ACM Manag. Data, 2024)

Tight Bounds of Circuits for Sum-Product Queries. - Austen Z. Fan; Paraschos Koutris; Hangdong Zhao (Proc. ACM Manag. Data, 2024)

Consistent Query Answering for Primary Keys on Rooted Tree Queries. - Paraschos Koutris; Xiating Ouyang; Jef Wijsen (Proc. ACM Manag. Data, 2024)

Evaluating Datalog over Semirings: A Grounding-based Approach. - Hangdong Zhao; Shaleen Deep; Paraschos Koutris; Sudeepa Roy 001; Val Tannen (Proc. ACM Manag. Data, 2024)

Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. - Hangdong Zhao; Austen Z. Fan; Xiating Ouyang; Paraschos Koutris (Proc. ACM Manag. Data, 2024)

Output-sensitive Conjunctive Query Evaluation. - Shaleen Deep; Hangdong Zhao; Austen Z. Fan; Paraschos Koutris (Proc. ACM Manag. Data, 2024)

Parallel Query Processing with Heterogeneous Machines. - Simon Frisk; Paraschos Koutris (ICDT, 2025)

Generalized Covers for Conjunctive Queries. - Paraschos Koutris (ICDT, 2025)

The Quest for Faster Join Algorithms (Invited Talk). - Paraschos Koutris; Shaleen Deep; Austen Z. Fan; Hangdong Zhao (ICDT, 2025)

The Free Termination Property of Queries over Time. - Conor Power; Paraschos Koutris; Joseph M. Hellerstein (ICDT, 2025)

Ranked Enumeration of Conjunctive Query Results. - Shaleen Deep; Paraschos Koutris (Log. Methods Comput. Sci., 2025)

Circuits and Formulas for Datalog over Semirings. - Austen Z. Fan; Paraschos Koutris; Sudeepa Roy 001 (Proc. ACM Manag. Data, 2025)

Circuit Bounds for Conjunctive Queries with Self-joins. - Austen Z. Fan; Paraschos Koutris; Hangdong Zhao (Proc. ACM Manag. Data, 2025)

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics. - Junyi Zhao; Kai Su; Yifei Yang; Xiangyao Yu; Paraschos Koutris; Huanchen Zhang (Proc. ACM Manag. Data, 2025)

Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. - Hangdong Zhao; Shaleen Deep; Paraschos Koutris (ACM Trans. Database Syst., 2025)