Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
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.
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Corey Liam Lammie, Yotam Perlitz, et al.
VLDB 2026
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019