✦ LIBER ✦

Variations on the Common Subexpression Problem

✍ Scribed by Downey, Peter J.; Sethi, Ravi; Tarjan, Robert Endre

Book ID: 111888307
Publisher: Association for Computing Machinery
Year: 1980
Tongue: English
Weight: 946 KB
Volume: 27
Category: Article
ISSN: 0004-5411
DOI: 10.1145/322217.322228

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variations on the Kepler problem

✍ Johndale C. Solem 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 729 KB

Variations on the Ising problem

✍ Frank Harary 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Cyclotomic FFTs With Reduced Additive Co

Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm

✍ Ning Chen; Zhiyuan Yan 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 428 KB

On the implementation of efficient chann

On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods

✍ Vinod, A.P.; Lai, E.M.-K. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 387 KB

On “A New Common Subexpression Eliminati

On “A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters”

✍ Chip-Hong Chang; Faust, M. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 104 KB

On the Common Substring Alignment Proble

On the Common Substring Alignment Problem

✍ Gad M Landau; Michal Ziv-Ukelson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 164 KB

The Common Substring Alignment Problem is defined as follows: Given a set of one or more strings S 1 S 2 S c and a target string T , Y is a common substring of all strings S i , that is, S i = B i YF i . The goal is to compute the similarity of all strings S i with T , without computing the part of