Output details
11 - Computer Science and Informatics
University of Hertfordshire
Article title
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Type
D - Journal article
Title of journal
Theoretical Computer Science
Article number
-
Volume number
513
Issue number
-
First page of article
25
ISSN of journal
0304-3975
Year of publication
2013
URL
-
Number of additional authors
3
Additional information
<19> Language-based security enforcement frequently queries a security lattice for meet and join operations. This work describes an adaptive approach to answering these queries in constant time through a partial closure of the lattice. This is in sharp contrast to existing methods that deploy a full closure (at quadratic cost) to achieve the same result.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
