Skip To Main Content
Paraschos Koutris on Muck Rack

Paraschos Koutris

As seen in: arXiv
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Paraschos

Contact Paraschos, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

[2406.07847] Output-sensitive Conjunctive Query Evaluation

|
By Hangdong Zhao, Paraschos Koutris, Austen Fan
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (503) Issue with article?

Evaluating Datalog over Semirings: A Grounding-based Approach

|
By Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (603) Issue with article?

[2304.14557] The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems

|
By Paraschos Koutris, Hangdong Zhao
| arXiv
[Submitted on 27 Apr 2023 ( v1 ), last revised 10 May 2023 (this version, v2)] Title:The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems Download a PDF of the paper titled The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems, by Austen Z.
Open in Who Shared Issue with article?
See all 6 articles