The Professional Preparation section lists academic qualifications such as degrees and diplomas. Each record stores the degree, major, institution and year. The records can also be hidden from public view by checking the hide checkbox. Please click here for available slides.
California State Polytechnic University at San Luis Obispo
Research and Expertise
The Research and Expertise section describes the areas in which you have expertise or are involved in research. Research Explorer's search engine indexes data in this field for keyword searches. Please click here for available slides.
The Publications section lists any and all publications worked on. Research Explorer's search engine indexes data in this field for keyword searches. The category field is a user defined field where any number of categories can be created by the user to categorize publications. For example, publications can be categorized by the Journal that they appear in. Please click here for available slides.
A quadratic time 2-approximation algorithm for block sorting. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough Theor. Comput. Sci. 01/2009; 410:711-717.
An (18/11)n upper bound for sorting by prefix reversals. Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, C. O. Shields Jr, Ivan Hal Sudborough, Walter Voit Theor. Comput. Sci. 01/2009; 410:3372-3390.
Short Proofs for Cut-and-Paste Sorting of Permutations (with D. Cranston, D. West), Discrete Mathematics, 307 (2007), pp. 2866-2870. Category: Discrete Mathematics
"An (18/11)n Upper Bound for Sorting by Prefix Reversals", (with B. Chitturi, W. Fahle, Z. Meng, L.Morales, C. O. Shields, W. Voit), invited, submitted, and accepted for publication in the special issue of Theoretical Computer Science to appear in honor of Burkhard Monien (2007). Category: Theoretical Computer Science
"The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem". (with Z. Miller, M. Perkel, D. Pritikin) Networks 45 (3), pp. 143-164 (2005). Category: Networks
The Appointments section lists work experience including previous appointments. Research Explorer's search engine indexes data in this field for keyword searches. Please click here for available slides.
Two UT Dallas computer scientists have made progress on a nearly 4-decade-old mathematical puzzle, producing a proof that renowned Stanford computer scientist Don Knuth called “amazing” in his communication back to them.
Created by the mathematician John Conway and known as Topswops, the puzzle starts like this: Begin with a randomly ordered deck of cards numbered 1 to n, with n being however high a number you choose. Now count out the number of cards represented by whatever card is the top card, and turn that block of cards over on top of the remaining cards. Then count out the number of cards represented by the new top card and turn this whole block over on top of the remaining cards. Repeat until the card numbered 1 comes to the top (realizing that we know the card numbered 1 will always eventually come to the top).
The Additional Information section describes any other topics you wish to display on your profile that is not in another section. Research Explorer's search engine indexes data in this field for keyword searches. Please click here for available slides.
One of the finalists for the University of Texas Chancellor's Teaching Excellence Award in 1997
Consistently received top teaching evaluations in Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas (1985-)
One of the finalists for the University of Texas Chancellor's Teaching Excellence Award in 1992
Teaching Extraordinaire Award, awarded by graduate students in Compiler Construction (1988)
Teaching Award (Honorable Mention), Technological Institute, Northwestern University, 1977
Please verify the information in this request and mention any changes or suggestions in the comments section. Email notifications and confirmations regarding this will be sent to you at fromEmail and the profile owner. If you would like to receive it at a different email address, please change the email address listed on your profile.