Extended retiming: optimal scheduling via a graph-theoretical approach. - Timothy W. O'Neil; Sissades Tongsima; Edwin Hsing-Mean Sha (ICASSP, 1999)

Unfolding probabilistic data-flow graphs under different timing models. - Sissades Tongsima; Timothy W. O'Neil; Edwin Hsing-Mean Sha (ICASSP, 1999)

Optimizing Overall Loop Schedules Using Prefetching and Partitioning. - Fei Chen; Timothy W. O'Neil; Edwin Hsing-Mean Sha (IEEE Trans. Parallel Distributed Syst., 2000)

Properties and Algorithms for Unfolding of Probabilistic Data-Flow Graphs. - Sissades Tongsima; Timothy W. O'Neil; Chantana Chantrapornchai; Edwin Hsing-Mean Sha (J. VLSI Signal Process., 2000)

On Retiming Synchronous Data-Flow Graphs. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (PDCS, 2001)

Retiming synchronous data-flow graphs to reduce execution time. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (IEEE Trans. Signal Process., 2001)

Optimal loop scheduling for hiding memory latency based on two-level partitioning and prefetching. - Zhong Wang 004; Timothy W. O'Neil; Edwin Hsing-Mean Sha (IEEE Trans. Signal Process., 2001)

Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and Prefetching. - Zhong Wang 004; Timothy W. O'Neil; Edwin Hsing-Mean Sha (J. VLSI Signal Process., 2001)

Minimizing resources in a repeating schedule for a split-node data-flow graph. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (ACM Great Lakes Symposium on VLSI, 2002)

Unfolding a Split-node Data-flow Graph. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (IASTED PDCS, 2002)

Optimal Graph Transformation Assuming Alternate Scheduling Models. - Timothy W. O'Neil (PDCS, 2003)

Efficient Polynomial-Time Nested Loop Fusion with Full Parallelism. - Edwin Hsing-Mean Sha; Timothy W. O'Neil; Nelson L. Passos (Int. J. Comput. Their Appl., 2003)

Static Scheduling of Split-Node Data-Flow Graphs. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (IASTED PDCS, 2005)

Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (J. VLSI Signal Process., 2005)

Time-constrained loop scheduling with minimal resources. - Timothy W. O'Neil; Edwin Hsing-Mean Sha (J. Embed. Comput., 2006)

Static Scheduling for Synchronous Data Flow Graphs. - Samer F. Khasawneh; Michael E. Richter; Timothy W. O'Neil (CATA, 2007)

New Heuristics for Rotation Scheduling. - Michael Richter; David Poeschl; Timothy W. O'Neil (PDPTA, 2008)

Minimizing Inter-Iteration Dependencies in Multi-Dimensional Loops. - Krishna Chaithanya Chakilam; Sukumar Reddy Anapalli; Timothy W. O'Neil (PDCCS, 2009)

Static Scheduling for Cyclo Static Data Flow Graphs. - Sukumar Reddy Anapalli; Krishna Chaithanya Chakilam; Timothy W. O'Neil (PDPTA, 2009)

Rotation Scheduling on Synchronous Data Flow Graphs. - Rama Krishna Pullaguntla; Samer F. Khasawneh; Timothy W. O'Neil (PDPTA, 2009)

Transforming Synchronous Data-Flow Graphs to Reduce Execution Time. - Timothy W. O'Neil; Samer F. Khasawneh; Michael E. Richter; Rama Krishna Pullaguntla (Int. J. Comput. Their Appl., 2011)