Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
Segev Shlomov, Avi Yaeli
CHI 2024
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999