You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Royal Holloway, University of London » Outputs » Detail

Output details

11 - Computer Science and Informatics

Royal Holloway, University of London

Return to search Previous output Next output

Output 0 of 0 in the submission

Article title

An algorithm for finding input-output constrained convex sets in an acyclic digraph

Type

D - Journal article

DOI

10.1016/j.jda.2012.02.002

Title of journal

Journal of Discrete Algorithms

Article number

Volume number

Issue number

First page of article

ISSN of journal

1570-8667

Year of publication

2012

URL

http://www.sciencedirect.com/science/article/pii/S1570866712000214

Number of additional authors

Additional information

<08> Asymptotically optimal algorithms do not always yield the fastest practical algorithms on realistic cases. Our 2009 algorithm for enumerating convex subgraphs of acyclic digraphs is optimal but not always practical for real world application, in this case to custom instruction identification in assembly code. This paper presents an input/output constrained version of the algorithm which is faster in practice than the theoretically optimal algorithm, making its application to assembly code generation more practical.

Interdisciplinary

Cross-referral requested

Research group

C - Centre for Software Language Engineering

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract