Javascript must be enabled to use this form.

UTDallas Research Explorer
 View Profile
    Faculty Profile — Is this you? Login to edit.Last Modified Time: 02:47:45 PM Mon, 1 Jul 2013 
Image of  Ivan Hal Sudborough
 Contact InformationHelpHelp  
Ivan Hal Sudborough
Founders Professor-Computer Science
Office MailstopMail Box: EC31, Room No.: ECSS 4.223 
Email Address  hal@utdallas.edu    Primary Phone Number 972-883-2184    Fax Number 972-883-2349    URL Faculty Homepage    Media Contact
 Professional Preparation
HelpHelp  
 DegreeMajorInstitutionYear
 Ph.D.Computer SciencePennsylvania State University1971
 M.S.MathematicsCalifornia State University at Hayward1967
 B.S.MathematicsCalifornia State Polytechnic University at San Luis Obispo1966
Collapse Section Expand Section Research and Expertise
HelpHelp  
Research Interests
  • Telecommunication networks
  • Parallel computation networks
  • Algorithms
  • Complexity classes
  • Picture processing
  • Automata theory
  • Graph/network algorithms
  • Combinatorial problems
  • Computational biology
  • Information security
Collapse Section Expand Section Publications
HelpHelp  
 1  2 3  
  YearPublication  Type
2009
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.
Peer reviewed
2009
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.
Peer reviewed
2007
Short Proofs for Cut-and-Paste Sorting of Permutations (with D. Cranston, D. West), Discrete Mathematics, 307 (2007), pp. 2866-2870.
Category: Discrete Mathematics
Magazine/newsletter articles
2007
"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
Magazine/newsletter articles
2005
"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
Magazine/newsletter articles
Collapse Section Expand Section Appointments
HelpHelp  
DurationRankDepartment / SchoolCollege / OfficeUniversity / Company
1998-1999Distinguished Visiting ProfessorMathematics/Statistics Miami University of Ohio
1991-1991Distinguished Visiting ProfessorMathematics/Statistics Miami University of Ohio
1988-1988Distinguished Visiting ProfessorDepartment of Computer Science The University of Victoria
1985-PresentFounders ProfessorDepartment of Computer Science The University of Texas at Dallas
1982-1983Fullbright Senior Research Professor  National Technical University of Greece
1979-1980Visiting ProfessorMathematics/Computer Science University of Paderborn
1971-1985ProfessorDepartment of Electrical Engineering and Computer Science Northwestern University
 News Articles
Computer Scientists Make Progress on Math Puzzle
UT Dallas News Center
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).

       Teaching HelpHelp  
 Additional Information
HelpHelp  
Teaching Honors
  • 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.
From:
Comments:
© 2014-2015 The University of Texas at Dallas About Explorer | Accessibility | Contact Explorer Team