| An (18/11) n upper bound for sorting by prefix reversals B Chitturi, W Fahle, Z Meng, L Morales, CO Shields, IH Sudborough, ... Theoretical Computer Science 410 (36), 3372-3390, 2009 | 93 | 2009 |
| ISIP reading versus STAAR reading: The predictability study C Patarapichayatham, W Fahle, TR Roden Dallas, TX: Istation, 2013 | 23 | 2013 |
| Predictability study of ISIP reading and STAAR reading: Prediction bands C Patarapichayatham, W Fahle, TR Roden Dallas, TX: Istation, 2014 | 13 | 2014 |
| System and method for automated identification, remediation, and verification of computer program code fragments with variable confidence factors SH Travis, JD Clignett, WA Fahle Jr, LP Johnston, TC Waldron III US Patent 6,269,367, 2001 | 13 | 2001 |
| Method and apparatus for information distribution and retrieval G Grayson, W Lowery, D Kuenster, R Rubin, W Fahle, J Schnurrenberger US Patent App. 10/634,609, 2005 | 7 | 2005 |
| Multiply Transitive Permutation Sets WA Fahle University of Texas at Dallas, 2012 | 1 | 2012 |
| Review of" Graphs, Networks, and Algorithms by Dieter Jungnickel", Springer-Verlag 2005 W Fahle ACM SIGACT News 36 (4), 12-14, 2005 | | 2005 |
| Review of" Introduction to the Design and Analysis of Algorithms by Ananay Levitin", Addison-Wesley W Fahle ACM SIGACT News 35 (4), 18-19, 2004 | | 2004 |
Walter VoitUniversity of Texas at DallasVerified email at utdallas.edu
