11 citations · 26 across the 12 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DB2023★ 2 cited
ReAcTable: Enhancing ReAct for Table Question Answering
Yunjia Zhang, Jordan Henkel, Avrilia Floratou +3
Table Question Answering (TQA) presents a substantial challenge at the intersection of natural language processing and data analytics. This task involves answering natural language…
cs.DB2023
Rapidash: Efficient Constraint Discovery via Rapid Verification
Zifan Liu, Shaleen Deep, Anna Fariha +3
Denial Constraint (DC) is a well-established formalism that captures a wide range of integrity constraints commonly encountered, including candidate keys, functional dependencies,…
cs.FL2023
The Fine-Grained Complexity of CFL Reachability
Paraschos Koutris, Shaleen Deep
Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be gene…