Lower Bounds for Conjunctive Query Evaluation | Paper Citation Record

Observation e98fcda3-c3e0-484f-a4d0-2486854d0e12 · outbound

This paper cites If the Current Clique Algorithms Are Optimal, so Is Valiant’s Parser.

Lower Bounds for Conjunctive Query Evaluation If the Current Clique Algorithms Are Optimal, so Is Valiant’s Parser

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.249633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f032cc6-8ff1-4fdc-ae29-4e3e38504d48 · outbound

This paper cites The time complexity of fully sparse matrix multiplication.

Lower Bounds for Conjunctive Query Evaluation The time complexity of fully sparse matrix multiplication

Reference 2

Resolution: verified exact; doi, observed 2026-08-15T19:17:21.141483Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 8a3b943f-985e-40e4-931e-c448a9a4c502 · outbound

This paper cites Faster combinatorial k-clique algorithms.

Lower Bounds for Conjunctive Query Evaluation Faster combinatorial k-clique algorithms

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.259231Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 762e6ad6-b80a-4287-9bdd-0f3500f73f1e · outbound

This paper cites Popular conjectures imply strong lower bounds for dynamic problems.

Lower Bounds for Conjunctive Query Evaluation Popular conjectures imply strong lower bounds for dynamic problems

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.263982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcbb7deb-ebe7-415c-a70f-74fd68e0afbc · outbound

This paper cites More asymmetry yields faster matrix multiplication.

Lower Bounds for Conjunctive Query Evaluation More asymmetry yields faster matrix multiplication

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.268056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa70a284-3d97-4161-87e1-17ea40de9911 · outbound

This paper cites Finding and counting given length cycles.

Lower Bounds for Conjunctive Query Evaluation Finding and counting given length cycles

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.272626Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8c94a56-688d-4f1a-8dd2-c1a841d14263 · outbound

This paper cites Ranked enumeration for MSO on trees via knowledge compilation.

Lower Bounds for Conjunctive Query Evaluation Ranked enumeration for MSO on trees via knowledge compilation

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.280659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa435db5-746b-4976-a97c-565cef25ce21 · outbound

This paper cites Faster join-projects and sparse matrix multiplications.

Lower Bounds for Conjunctive Query Evaluation Faster join-projects and sparse matrix multiplications

Reference 8

Resolution: verified exact; doi, observed 2026-08-15T19:17:21.088981Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation c449ed77-c34f-461f-960f-81472c58daa0 · outbound

This paper cites Open access at https: //github.com/pdm-book/community, 2022.

Lower Bounds for Conjunctive Query Evaluation Open access at https: //github.com/pdm-book/community, 2022

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.288763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2df55484-bd9b-41ca-9ce7-21255b33af98 · outbound

This paper cites Size bounds and query plans for relational joins.

Lower Bounds for Conjunctive Query Evaluation Size bounds and query plans for relational joins

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.293092Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eea03fc1-73b1-4fcc-820f-31de9fb5c39f · outbound

This paper cites Algorithmes et complexité des problèmes d’énumération pour l’évaluation de requêtes logiques.

Lower Bounds for Conjunctive Query Evaluation Algorithmes et complexité des problèmes d’énumération pour l’évaluation de requêtes logiques

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.296966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6447426-e25f-4077-bc74-fc6cf353ce19 · outbound

This paper cites On acyclic conjunctive queries and constant delay enumeration.

Lower Bounds for Conjunctive Query Evaluation On acyclic conjunctive queries and constant delay enumeration

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.300750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afa753aa-c078-4b31-8119-777d1d0f9039 · outbound

This paper cites On the desirability of acyclic database schemes.

Lower Bounds for Conjunctive Query Evaluation On the desirability of acyclic database schemes

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.304966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9a1a037-fce1-4811-b479-1ee5bdba303a · outbound

This paper cites Constant delay enumeration for conjunctive queries: a tutorial.

Lower Bounds for Conjunctive Query Evaluation Constant delay enumeration for conjunctive queries: a tutorial

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.309214Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f5e8c3d-39e0-4fc2-aaa8-40012f7225fd · outbound

This paper cites Answering conjunctive queries under updates.

Lower Bounds for Conjunctive Query Evaluation Answering conjunctive queries under updates

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.312932Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1961590b-b50f-4f99-b55c-cfa3b6443e2b · outbound

This paper cites Answering ucqs under updates and in the presence of integrity constraints.

Lower Bounds for Conjunctive Query Evaluation Answering ucqs under updates and in the presence of integrity constraints

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.316836Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e163ffa8-94cd-4b7e-8708-3fc47cd71045 · outbound

This paper cites On the complexity of the multiplication of matrices of small formats.

Lower Bounds for Conjunctive Query Evaluation On the complexity of the multiplication of matrices of small formats

Reference 17

Resolution: verified exact; doi, observed 2026-08-15T19:17:21.050446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation a8a1acec-159a-4bb2-9fb1-f403c0ecbfab · outbound

This paper cites A negative conjunctive query is easy if and only if it is beta-acyclic.

Lower Bounds for Conjunctive Query Evaluation A negative conjunctive query is easy if and only if it is beta-acyclic

Reference 18

Resolution: verified exact; doi, observed 2026-08-15T19:17:21.037147Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 9ef4651f-1059-4cc7-b67a-9770ee95e3a8 · outbound

This paper cites De la pertinence de l’énumération : complexité en logiques propositionnelle et du premier ordre.

Lower Bounds for Conjunctive Query Evaluation De la pertinence de l’énumération : complexité en logiques propositionnelle et du premier ordre

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.329894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dec7f184-569a-4d73-84a9-f623a6c18368 · outbound

This paper cites Hypergraph acyclicity revisited.

Lower Bounds for Conjunctive Query Evaluation Hypergraph acyclicity revisited

Reference 20

Resolution: malformed identifier; no resolver link, observed 2026-08-15T19:17:20.333905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0926174c-2e0e-471a-8e2c-6e99efbb1c4d · outbound

This paper cites Unbalanced triangle detection and enumeration hardness for unions of conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Unbalanced triangle detection and enumeration hardness for unions of conjunctive queries

Reference 21

Resolution: verified exact; doi, observed 2026-08-15T19:17:21.024674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation c28fcbb1-d93a-4675-913c-a5bb5a0f6e99 · outbound

This paper cites Tight fine-grained bounds for direct access on join queries.

Lower Bounds for Conjunctive Query Evaluation Tight fine-grained bounds for direct access on join queries

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.341799Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6619e549-3dd8-4b45-beae-cf825a4fcb9a · outbound

This paper cites Dynamic dynamic time warping.

Lower Bounds for Conjunctive Query Evaluation Dynamic dynamic time warping

Reference 23

Resolution: verified exact; doi, observed 2026-08-15T19:17:21.013009Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation e53b917e-2e96-4f8a-979c-6f1daab2b665 · outbound

This paper cites Direct access for conjunctive queries with negation.

Lower Bounds for Conjunctive Query Evaluation Direct access for conjunctive queries with negation

Reference 24

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.998606Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 31491fe9-aaa3-428d-84c3-0629e2774960 · outbound

This paper cites On the enumeration complexity of unions of conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation On the enumeration complexity of unions of conjunctive queries

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.353529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79baef83-7315-4067-be5c-669ec575ff04 · outbound

This paper cites Tractable orders for direct access to ranked answers of conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Tractable orders for direct access to ranked answers of conjunctive queries

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.361924Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df263c48-65f9-46e6-882b-2c1cdf10e568 · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 28

Resolution: unresolved; raw_fallback, observed 2026-08-15T19:17:22.879903Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 787143f7-3883-49ff-a961-f13d2db3b5be · outbound

This paper cites Chandra and Philip M.

Lower Bounds for Conjunctive Query Evaluation Chandra and Philip M

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.374312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8aeedf0-d95b-43c2-b957-2919107c420d · outbound

This paper cites A trichotomy in the complexity of counting answers to conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation A trichotomy in the complexity of counting answers to conjunctive queries

Reference 30

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.889982Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1c4c4c15-0d3d-44f8-8bbd-ce64ae832303 · outbound

This paper cites On the asymptotic complexity of matrix multiplication.

Lower Bounds for Conjunctive Query Evaluation On the asymptotic complexity of matrix multiplication

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.381878Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b14c97f-7fce-4256-bae3-5dc79f057313 · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.

Lower Bounds for Conjunctive Query Evaluation Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.385961Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87e002af-5973-49e5-b215-8c0343d8f4c6 · outbound

This paper cites Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication.

Lower Bounds for Conjunctive Query Evaluation Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.390566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a8ee7a5-6f3e-4c62-b03a-3499749f235e · outbound

This paper cites Graph pattern detection: Hardness for all induced patterns and faster noninduced cycles.

Lower Bounds for Conjunctive Query Evaluation Graph pattern detection: Hardness for all induced patterns and faster noninduced cycles

Reference 34

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.853649Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 0e0abecf-924a-4c4d-9ec3-e4e375ce9f85 · outbound

This paper cites The complexity of counting homomorphisms seen from the other side.Theor.

Lower Bounds for Conjunctive Query Evaluation The complexity of counting homomorphisms seen from the other side.Theor

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.398929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f518b353-9f80-4976-8089-a92a0c615dfb · outbound

This paper cites Ranked enumeration of join queries with projections.Proc.

Lower Bounds for Conjunctive Query Evaluation Ranked enumeration of join queries with projections.Proc

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.404242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a96f34af-38d3-4b04-9e61-52ab07b35125 · outbound

This paper cites Counting answers to existential questions.

Lower Bounds for Conjunctive Query Evaluation Counting answers to existential questions

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.408214Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 163db625-9045-4882-83ab-211af6077f16 · outbound

This paper cites Structural tractability of counting of solutions to conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Structural tractability of counting of solutions to conjunctive queries

Reference 38

Resolution: metadata mismatch; raw_fallback, observed 2026-08-15T19:17:22.233503Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 691d5b57-a45d-4216-9047-3672c35a2bdc · outbound

This paper cites The complexity of weighted counting for acyclic conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation The complexity of weighted counting for acyclic conjunctive queries

Reference 39

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.824800Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ff105773-31b6-4dee-9a7c-ed2c5979a5b6 · outbound

This paper cites On the complexity of fixed parameter clique and dominating set.

Lower Bounds for Conjunctive Query Evaluation On the complexity of fixed parameter clique and dominating set

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.422367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99db5108-5192-4bbb-b7b8-d6f19cb68e22 · outbound

This paper cites Fan, Paraschos Koutris, and Hangdong Zhao.

Lower Bounds for Conjunctive Query Evaluation Fan, Paraschos Koutris, and Hangdong Zhao

Reference 41

Resolution: malformed identifier; no resolver link, observed 2026-08-15T19:17:20.427240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e66cda58-4629-4d81-953c-06be4e7ff33b · outbound

This paper cites Logic and algorithms in database theory and ai boot camp.

Lower Bounds for Conjunctive Query Evaluation Logic and algorithms in database theory and ai boot camp

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.866354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation b5fd43a2-7e73-499d-8f49-5c26a1bf8a82 · outbound

This paper cites Overmars.

Lower Bounds for Conjunctive Query Evaluation Overmars

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.436085Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76a71a60-3cbc-4ea0-b1c5-58f9273875ae · outbound

This paper cites Faster algorithms for rectangular matrix multiplication.

Lower Bounds for Conjunctive Query Evaluation Faster algorithms for rectangular matrix multiplication

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.440696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5cec9e46-69e9-4325-aad6-700d5becfb22 · outbound

This paper cites Which arithmetic operations can be performed in constant time in the RAM model with addition?.

Lower Bounds for Conjunctive Query Evaluation Which arithmetic operations can be performed in constant time in the RAM model with addition?

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.445106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5687b4c-6dc9-4079-8662-5506d82d00a4 · outbound

This paper cites Counting solutions to conjunctive queries: structural and hybrid tractability.

Lower Bounds for Conjunctive Query Evaluation Counting solutions to conjunctive queries: structural and hybrid tractability

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.449371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9726fca-5c13-456c-9e9c-9429f2aceaf8 · outbound

This paper cites Parameterized complexity for the database theorist.

Lower Bounds for Conjunctive Query Evaluation Parameterized complexity for the database theorist

Reference 47

Resolution: malformed identifier; raw_fallback, observed 2026-08-15T19:17:22.087662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 05c86b8c-1059-45ab-8eb8-a08627e98b97 · outbound

This paper cites The complexity of homomorphism and constraint satisfaction problems seen from the other side.

Lower Bounds for Conjunctive Query Evaluation The complexity of homomorphism and constraint satisfaction problems seen from the other side

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.455928Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58d6483a-8b43-4f4b-a762-6ef475da8d2a · outbound

This paper cites When is the evaluation of conjunctive queries tractable? In Jeffrey Scott Vitter, Paul G.

Lower Bounds for Conjunctive Query Evaluation When is the evaluation of conjunctive queries tractable? In Jeffrey Scott Vitter, Paul G

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.459510Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54745be9-4fe1-4dce-85dc-c5514c0b068b · outbound

This paper cites Fast matrix multiplication for query processing.Proc.

Lower Bounds for Conjunctive Query Evaluation Fast matrix multiplication for query processing.Proc

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.462743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61585989-dce6-41b5-834b-90fc2919932a · outbound

This paper cites On the complexity of k-sat.

Lower Bounds for Conjunctive Query Evaluation On the complexity of k-sat

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.466001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0914f92-2392-412e-977d-87b4c83dcba6 · outbound

This paper cites Which problems have strongly exponential complexity? J.

Lower Bounds for Conjunctive Query Evaluation Which problems have strongly exponential complexity? J

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.469966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8428ba4a-5037-4a93-a67d-58ec8a0a22a7 · outbound

This paper cites Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang.

Lower Bounds for Conjunctive Query Evaluation Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.473648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f916dcb-cdfd-43d5-bd81-58b61b596628 · outbound

This paper cites Trade-offs in static and dynamic evaluation of hierarchical queries.

Lower Bounds for Conjunctive Query Evaluation Trade-offs in static and dynamic evaluation of hierarchical queries

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.850331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 7d3c282b-5e28-442a-b4fe-4a99a7aecc72 · outbound

This paper cites Conjunctive queries with free access patterns under updates.

Lower Bounds for Conjunctive Query Evaluation Conjunctive queries with free access patterns under updates

Reference 55

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.757447Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 8611869a-713a-4c2f-9132-56d315870944 · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.489133Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ae9fdd1-2630-493b-a504-d19c205656d3 · outbound

This paper cites Curtin, Benjamin Moseley, Hung Q.

Lower Bounds for Conjunctive Query Evaluation Curtin, Benjamin Moseley, Hung Q

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.492977Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 838fae22-7d05-4de7-bf91-ae453d006935 · outbound

This paper cites Fast Matrix Multiplication meets the Submodular Width.

Lower Bounds for Conjunctive Query Evaluation Fast Matrix Multiplication meets the Submodular Width

Reference 58

Resolution: verified exact; local_arxiv, observed 2026-08-15T19:17:20.730611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 5f1dea20-2373-4ecf-88d9-c424a858f8d8 · outbound

This paper cites Ngo, and Atri Rudra.

Lower Bounds for Conjunctive Query Evaluation Ngo, and Atri Rudra

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.500807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 653b6b8f-66ac-46b0-b42b-a816eff81312 · outbound

This paper cites Ngo, and Dan Suciu.

Lower Bounds for Conjunctive Query Evaluation Ngo, and Dan Suciu

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.504522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56a00c59-7db2-4606-ade8-76bdbb063660 · outbound

This paper cites Ryan Williams.

Lower Bounds for Conjunctive Query Evaluation Ryan Williams

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.508387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c1fbb0e9-500f-4bf3-aa04-7dcca370752b · outbound

This paper cites Tractable hypergraph properties for constraint satisfaction and conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.511802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17841352-78cd-4c0d-b113-a9ad56c03350 · outbound

This paper cites A short note on the counting complexity of conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation A short note on the counting complexity of conjunctive queries

Reference 63

Resolution: verified exact; local_arxiv, observed 2026-08-15T19:17:21.516254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 80d1be0e-843f-4b8e-ba5f-a124393aa2fa · outbound

This paper cites On the complexity of the subgraph problem.

Lower Bounds for Conjunctive Query Evaluation On the complexity of the subgraph problem

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.837063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation b41d5581-4323-49ec-bd46-4db5b74ee5ce · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.523844Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d663721f-9c5a-4be7-84be-0583d6b510be · outbound

This paper cites Ngo, Ely Porat, Christopher Ré, and Atri Rudra.

Lower Bounds for Conjunctive Query Evaluation Ngo, Ely Porat, Christopher Ré, and Atri Rudra

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.823102Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 47d4183e-87dc-4391-9064-3b253f3b0c2c · outbound

This paper cites Size bounds for factorised representations of query results.

Lower Bounds for Conjunctive Query Evaluation Size bounds for factorised representations of query results

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.530712Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb5666d0-56fa-4c9a-95ef-11ecf8b75272 · outbound

This paper cites On the possibility of faster SAT algorithms.

Lower Bounds for Conjunctive Query Evaluation On the possibility of faster SAT algorithms

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.533980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5ebcd1c-db7c-45ba-828d-354211ad7d7d · outbound

This paper cites Tractable counting of the answers to conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Tractable counting of the answers to conjunctive queries

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.537695Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6288dfc-0be4-46d8-8074-c238bdfd8dd2 · outbound

This paper cites A glimpse on constant delay enumeration (invited talk).

Lower Bounds for Conjunctive Query Evaluation A glimpse on constant delay enumeration (invited talk)

Reference 70

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.672320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation a5e1825e-0e22-4ec2-bf53-ebebaeecd4d7 · outbound

This paper cites Constant delay enumeration for conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Constant delay enumeration for conjunctive queries

Reference 71

Resolution: malformed identifier; raw_fallback, observed 2026-08-15T19:17:21.418732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation cc7132ff-4c4d-4dd1-9381-4959fca275b9 · outbound

This paper cites Gaussian elimination is not optimal.

Lower Bounds for Conjunctive Query Evaluation Gaussian elimination is not optimal

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.810535Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 5f8e9a34-1bdd-44a2-98b6-b99c0602c4b6 · outbound

This paper cites Optimal algorithms for ranked enumeration of answers to full conjunctive queries.

Lower Bounds for Conjunctive Query Evaluation Optimal algorithms for ranked enumeration of answers to full conjunctive queries

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.552379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a61f317b-c5f8-4de8-b18f-ad0b0f66ed04 · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 74

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.659527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1bf5bc73-fb1d-41b2-814b-653d4e6bb4f2 · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.560180Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a9f4515d-7558-4b5b-940e-9e7346beb2e0 · outbound

This paper cites Ryan Williams.

Lower Bounds for Conjunctive Query Evaluation Ryan Williams

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.563902Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70545372-a9e6-4a1c-b839-53e272e1c614 · outbound

This paper cites Finding, minimizing, and counting weighted subgraphs.

Lower Bounds for Conjunctive Query Evaluation Finding, minimizing, and counting weighted subgraphs

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.567519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8364e769-c3be-4601-bbec-bf4626e55dc9 · outbound

This paper cites On some fine-grained questions in algorithms and complexity.

Lower Bounds for Conjunctive Query Evaluation On some fine-grained questions in algorithms and complexity

Reference 78

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.798387Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation a6a2f4fc-198f-4320-8532-4b6d4dac4f4a · outbound

This paper cites Algorithms for acyclic database schemes.

Lower Bounds for Conjunctive Query Evaluation Algorithms for acyclic database schemes

Reference 79

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.784581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 4cd5019c-ce73-4920-abc8-d4afaeae9a62 · outbound

This paper cites Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.

Lower Bounds for Conjunctive Query Evaluation Detecting short directed cycles using rectangular matrix multiplication and dynamic programming

Reference 80

Resolution: metadata mismatch; raw_fallback, observed 2026-08-15T19:17:21.219265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation f96cbda0-489a-4735-b392-cbbd6dfd46e0 · outbound

This paper cites Space-time tradeoffs for conjunctive queries with access patterns.

Lower Bounds for Conjunctive Query Evaluation Space-time tradeoffs for conjunctive queries with access patterns

Reference 81

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T19:17:22.772845Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 9d09ee33-a339-45c9-989c-1f12e88c7af3 · outbound

This paper cites Fan, Xiating Ouyang, and Paraschos Koutris.

Lower Bounds for Conjunctive Query Evaluation Fan, Xiating Ouyang, and Paraschos Koutris

Reference 82

Resolution: verified exact; doi, observed 2026-08-15T19:17:20.629132Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1b45003f-ab62-495f-a870-72c2983f01f1 · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.588300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de4e2978-a71c-4d41-9223-c6469217c79a · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 1997

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.276811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e94b1f75-cd4b-46bf-a389-f459a4c53bfd · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.481208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f461ac6-f892-473a-b509-31602e54e9a8 · outbound

This paper cites an unresolved cited work.

Lower Bounds for Conjunctive Query Evaluation Unresolved cited work

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-15T19:17:20.370302Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers