University of Hertfordshire

• A scalable approach to computing representative lowest common ancestor in directed acyclic graphs

  Dash, S., Scholz, S-B., Herhut, S. & Christianson, B., Nov 2013, In: Theoretical Computer Science. 513, p. 25-37

  Research output: Contribution to journal › Article › peer-review

• CSP duality and trees of bounded pathwidth

  Carvalho, C., Dalmau, V. & Krokhin, A., 2010, In: Theoretical Computer Science. 411 , 34-36, p. 3188-3208

  Research output: Contribution to journal › Article › peer-review

• An assertion concerning functionally complete algebras and NP-completeness

  Horvath, G., Nehaniv, C. L. & Czabo, C., 2008, In: Theoretical Computer Science. 407, 1-3, p. 591-595

  Research output: Contribution to journal › Article › peer-review

View all »