Cite
Space-Efficient Parallel Algorithms for Combinatorial Search Problems
MLA
Pietracaprina, Andrea, et al. Space-Efficient Parallel Algorithms for Combinatorial Search Problems. 2013. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1106188212&authtype=sso&custid=ns315887.
APA
Pietracaprina, A., Pucci, G., Silvestri, F., & Vandin, F. (2013). Space-Efficient Parallel Algorithms for Combinatorial Search Problems.
Chicago
Pietracaprina, Andrea, Geppino Pucci, Francesco Silvestri, and Fabio Vandin. 2013. “Space-Efficient Parallel Algorithms for Combinatorial Search Problems.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1106188212&authtype=sso&custid=ns315887.