NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions  
   By Ville Laurikari, Helsinki University of Technology. [PDF]
   http://kouli.iki.fi/~vlaurika/spire2000-tnfa.pdf

Regular Expression Searching on Compressed Text  
   By Gonzalo Navarro of the University of Chile. [PostScript]
   http://www.dcc.uchile.cl/~gnavarro/ps/jda02.2.ps.gz

Regular Expressions to DFA's using Compressed NFA's  
   By Chia-Hsiang Chang. [PDF]
   http://www.cs.nyu.edu/csweb/Research/Theses/chang_chia-hsiang.pdf

SWYN: A Visual Representation for Regular Expressions  
   By Alan F. Blackwell of the University of Cambridge. [PDF]
   http://www.cl.cam.ac.uk/users/afb21/publications/yourwish.pdf

RE-Tree: An Efficient Index Structure for Regular Expressions  
   By Chee-Yong Chan, Minos Garofalakis, and Rajeev Rastogi. [PDF]
   http://www.vldb.org/conf/2002/S08P02.pdf

Efficient Submatch Addressing for Regular Expressions  
   Master's thesis of Ville Laurikari, Helsinki University of Technology. [PDF]
   http://kouli.iki.fi/~vlaurika/regex-submatch.pdf

Fast Regular Expression Search  
   By Gonzalo Navarro and Mathieu Raffinot. [PostScript]
   http://www.dcc.uchile.cl/~gnavarro/ps/wae99.ps.gz

Fast Regular Expression Matching using FPGAs  
   By Reetinder Sidhu and Viktor K. Prasanna.
   http://citeseer.nj.nec.com/474327.html

Regular Expressions - A Graphical User Interface  
   By Dr. Stefan Kahrs, University of Kent, UK. [PostScript]
   http://www.cs.kent.ac.uk/people/staff/smk/regexp.ps

Regular Expressions for Language Engineering  
   By Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. [PostScript]
   http://citeseer.ist.psu.edu/rd/0%2C440642%2C1%2C0.25%2CDownload/http://citeseer.ist.psu.edu/cache/papers/cs/22092/http:zSzzSzwww.xrce.xerox.comzSzpubliszSzmlttzSzmltt-96-15.pdf/karttunen96regular.pdf