Efficient encoding for exact symbolic automata-based scheduling. - Steve Haynal; Forrest Brewer (ICCAD, 1998)

A Model for Scheduling Protocol-Constrained Components and Environments. - Steve Haynal; Forrest Brewer (DAC, 1999)

Representing and Scheduling Looping Behavior Symbolically. - Steve Haynal; Forrest Brewer (ICCD, 2000)

Automata-Based Symbolic Scheduling for Looping DFGs. - Steve Haynal; Forrest Brewer (IEEE Trans. Computers, 2001)

Symbolic NFA scheduling of a RISC microprocessor. - Forrest Brewer; Steve Haynal (IEEE Trans. Very Large Scale Integr. Syst., 2002)

A System Verilog Rewriting System for RTL Abstraction with Pentium Case Study. - Steve Haynal; Timothy Kam; Michael Kishinevsky; Emily Shriver; Xinning Wang (MEMOCODE, 2008)

Generating and Searching Families of FFT Algorithms. - Steve Haynal; Heidi Haynal (J. Satisf. Boolean Model. Comput., 2011)

Brute-force search of fast convolution algorithms. - Steve Haynal; Heidi Haynal (ICASSP, 2013)