M.S. THESES.
Slack Matching
Piyush Prakash, 2005
[CaltechETD]
Single-event-upset-tolerant Quasi-delay-insensitive Circuits
Wonjin Jang, 2004
What is Deterministic CHP, and is Slack Elasticity That Useful?
Karl Spyros Papadantonakis, 2002.
[CaltechETD]
The CAST Parser.
Matthew S. Hanna, 2000.
Efficient Compilation of Handshaking Programs to Production Rules.
Robert Southworth, 2000.
A Graphical Method for Process Decomposition.
Catherine Grace Wong, 2000.
Gretel: An Interactive Router for Magic.
Eitan Eduardo Grinspun, 1999.
The Design of High-performance Asynchronous Circuits for the Caltech
MiniMIPS Processor.
Paul Penzes, 1998.
[CSTR:2002.001]
Pipelined Asynchronous Cache Design.
Mika Nyström, 1997.
[CSTR:2001.009]
On Detection and Generation of Deadlock-free Reshufflings in VLSI Synthesis
Method.
Jiazhao Jessie Xu, 1996.
[CS-TR-96-10]
Pipelined Asynchronous Circuits.
Andrew Matthew Lines, 1995.
[CS-TR-95-21]
Production Rule Verification for Quasi-Delay-Insensitive Circuits.
James N. Cook, 1993.
[CS-TR-93-23]
Designing Asynchronous Circuits in Gallium Arsenide.
Jose A Tierno, 1993.
[CS-TR-92-19].
Communication Behavior of Linear Arrays of Processes.
Tak K. Lee, 1989.
[
| CS-TR-89-13
]
Comparison of Strict and Non-strict Semantics for Lists.
Jerry R. Burch, 1988.
[CS-TR-88-12]
Automated Compilation of Concurrent Programs into Self-timed Circuits.
Steven M. Burns, 1988.
[CS-TR-88-02]
An Approach to Concurrent Semantics Using Complete Traces.
Kevin S. Van Horn, 1986.
[5236:TR:86]