2003-2004 Department of Computer Science and Engineering

CSE 2004Charles J. ColbournProfessorE-mail: charles.colbourn@asu.eduPhone: 480-727-6631Office: BY 444Ph.D.: University of Toronto, 1980Charlie Colbourn joined ASU in 2001. He hasauthored more than 250 refereed journalpapers and is funded by NSERC Canada,NSF and ARO. Colbourn has written threebooks and supervised 15 Ph.D. students.Principal Areas of Teaching and Research:Colbourn’s research employs combinatorialmathematics and combinatorial algorithms toaddress problems in diverse areas includingcomputational molecular biology, opticalcommunications (optical, wireless, wireline),secondary storage systems, software testing,and experimental design. He develops deepcombinatorial results with real applications.Honors and Distinctions:■ Euler Medal for Lifetime Achievement inResearch, Institute for Combinatorics andIts Applications, 2004■ Outstanding Teaching Award, University ofWaterloo, 1995■ Keynote/invited speaker in China, Japan,Korea, Australia, New Zealand, Chile,Brazil, Mexico, England, Italy, United States,Germany, Czech Republic, Finland, Greece,Israel, Iran, and Canada■ Editor of Networks; Journal of CombinatorialDesigns; Journal of Combinatorial Theory (A);Designs, Codes and Cryptography; andDiscrete MathematicsSelected Publications:C. Colbourn, The Combinatorics of NetworkReliability, Oxford, 1987.C. Colbourn and A. Rosa, Triple Systems,Oxford, 1999.C. Colbourn and J.H. Dinitz, CRC Handbookof Combinatorial Designs, CRC, 1996.C.J. Colbourn, A.C.H. Ling, and V.R. Syrotiuk,“Cover-free families and topology-transparentscheduling in MANETs,” to appear in Designs,Codes, and Cryptography.C.J. Colbourn, T. Klove, and A.C.H. Ling,“Permutation arrays for powerlinecommunication and mutually orthogonal Latinsquares,” to appear in IEEE Transactions onInformation Theory.M.B. Cohen and C.J. Colbourn, “Optimal andpessimal orderings of Steiner triple systems indisk arrays,” Theoretical Computer Science,vol. 297, 2003, pp. 103-117.James S. CollofelloProfessor and Associate Chair forUndergraduate ProgramsE-mail: james.collofello@asu.eduPhone: 480-965-3733Office: BY 552Ph.D. Northwestern University, 1978James Collofello joined ASU in 1979 and wasinstrumental in the start of the computerscience degree program. For his entire careerhe has maintained a close relationship withsoftware development firms in the stateworking on joint research projects, developingindustry training programs and serving as asoftware engineering consultant.Principal Areas of Teaching and Research:Professor Collofelloís research interests lie inthe software engineering area. Withinsoftware engineering, his primary emphasis issoftware process modeling, software qualityassurance and software project management.He is also very active in software engineeringeducation projects and outreach projects tolocal high schools.Selected Publications:C. Colbourn, J. Collofello, M. Cohen, P.Gibbons, and W. Mugridge, “Variable StrengthInteraction Testing of Components,” Proc. 27thInt’l. Computer Software and ApplicationsConf. (COMPSAC 2003).J. Collofello, J. Urban, M. Anderson-Rowland,F. Navabi, and D. Roman, “Cool (ComputerOutreach Opportunities for Learning)Development and Assessment,” Proc.Frontiers in Eng. Education (2003).D. Houston, J. Collofello, and G. Mackulack,"Simulating Risk Factors for SoftwareDevelopment Risk Management,” Journal ofSystems and Software, vol. 59, no. 3, Dec.2001, pp. 247-257.D. Houston, J. Collofello, et al., "Finding theInfluential Factors in Software ProcessSimulation Models," Journal of Systems andSoftware, vol. 59, no. 3, Dec. 2001, pp. 259-270.I. Rus and J. Collofello, "Integrating ProcessSimulation and Reliability Models," CrossTalk:The Journal of Defense Software Engineering,vol. 14, no. 1, Jan. 2001, pp. 15-18.J. Collofello and C. Ng, "Assessing the ProcessMaturity Utilized in Software Engineering TeamProject Courses," Journal of EngineeringEducation, vol. 90, no. 1, Jan. 2001.Partha DasguptaAssociate ProfessorE-mail: partha.dasgupta@asu.eduPhone: 480-965-5583Office: BY 428Ph.D. State University of New York at StonyBrook, 1984Partha Dasgupta joined ASU in 1991. Prior tothen he had an appointment with GeorgiaTech. He held visiting faculty positions at NewYork University in 1993-1994 and 1998-1999.NSF, DARPA and other sources haveconsistently funded Dasgupta’s research.Principal Areas of Teaching and Research:Dasgupta’s work focuses on distributedoperating systems, security, networking anddistributed computing.Honors and Distinctions:■ Department of Computer Science andEngineering Outstanding Teaching Award,1998■ Outstanding Paper Award, Int’l Conf. onDistributed Computing Systems, 1995■ IEEE Computer Society Certificates ofAppreciation, 1999, 1994, 1993Selected Publications:A. Godber and P. Dasgupta, “CounteringRogues in Wireless Networks,” 1st Int’lWorkshop on Wireless Security and Privacy(in conjunction with ICPP 2003), IEEE.S. Zhang and P. Dasgupta, “Denying Denial ofService Attacks: A Router Based Solution,”2003 Int’l Conf. on Internet Computing,IASTED.M. Khambatti, K. Ryu, and P. Dasgupta,“Efficient Discovery of Implicitly formed Peerto-PeerCommunities,” International Journal ofParallel and Distributed Systems andNetworks, vol. 5, no. 4, 2002, pp. 155-164.A.E. Motter, A.P.S. de Moura, Y.-C. Lai, and P.Dasgupta, “Topology of the ConceptualNetwork of Language,” Physical Review E,vol. 65, 065102(R), American Physical Society.T. Boyd and P. Dasgupta, “Process Migration:A Generalized Approach using a VirtualizingOperating System,” 22nd Int’l Conf. onDistributed Computing Systems (ICDCS-2002), IEEE.32 COMPUTER SCIENCE & ENGINEERING