Author of the publication

Relation-aware Bidirectional Path Reasoning for Commonsense Question Answering.

, , , , and . CoNLL, page 445-453. Association for Computational Linguistics, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

When Can the Maximin Share Guarantee Be Guaranteed?, , and . AAAI, page 523-529. AAAI Press, (2016)Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm., , , , , and . FOCS, page 101-112. IEEE Computer Society, (2018)Relation-aware Bidirectional Path Reasoning for Commonsense Question Answering., , , , and . CoNLL, page 445-453. Association for Computational Linguistics, (2021)Flowless: Extracting Densest Subgraphs Without Flow Computations., , , , , , and . WWW, page 573-583. ACM / IW3C2, (2020)Thresholds modification strategy of wayside supercapacitor storage considering DC substation characteristics., , , , , , and . IECON, page 2076-2081. IEEE, (2015)Fair enough: guaranteeing approximate maximin shares., and . EC, page 675-692. ACM, (2014)A Lower Bound for Equitable Cake Cutting., and . EC, page 479-495. ACM, (2017)Near-optimal fully dynamic densest subgraph., and . STOC, page 181-193. ACM, (2020)Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions., , , , , and . FOCS, page 361-372. IEEE Computer Society, (2018)The Unreasonable Fairness of Maximum Nash Welfare., , , , , and . EC, page 305-322. ACM, (2016)