Mikhail Atallah

{{short description|Lebanese-American computer scientist}}

{{Infobox scientist

| boxwidth =

| name = Mikhail Atallah

| image =

| image_size =

| alt =

| caption =

| birth_date =

| birth_place =

| residence =

| nationality =

| fields = Computer Science

| workplaces = Purdue University

| alma_mater = Johns Hopkins University

| doctoral_advisor = S. Rao Kosaraju

| academic_advisors =

| doctoral_students =

| notable_students =

| known_for =

| awards =

}}

Mikhail Jibrayil (Mike) Atallah is a Lebanese American computer scientist, a distinguished professor of computer science at Purdue University.

Biography

Atallah received his bachelor's degree from the American University of Beirut in 1975. He then moved to Johns Hopkins University for his graduate studies, earning a master's degree in 1980 and a Ph.D. in 1982 under the supervision of S. Rao Kosaraju. Since that time he has been a member of the Purdue University faculty.[http://www.cs.purdue.edu/people/faculty/mja/ Department faculty profile], Purdue University, retrieved 2011-09-29.{{mathgenealogy|name=Mikhail Jibrayil Atallah|id=47076}}

In 2001, Atallah co-founded Arxan Technologies, Inc., a provider of internet anti-piracy and anti-tampering software, and in 2007, he became its chief technology officer.[http://www.arxan.com/company/press-releases/mikhail-j-atallah-CTO-6-21-07.php Arxan Appoints Dr. Mikhail J. Atallah as Chief Technology Officer] {{webarchive|url=https://web.archive.org/web/20120129115257/http://www.arxan.com/company/press-releases/mikhail-j-atallah-CTO-6-21-07.php |date=2012-01-29 }}, Arxan Technologies, retrieved 2011-09-29.

Research

Atallah has published over 200 papers on topics in algorithms and computer security.[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/a/Atallah:Mikhail_J=.html DBLP listing of Atallah's publications], retrieved 2011-09-29.

Atallah's thesis work was on the subject of parallel algorithms, and he continued working in that area as a faculty member.

Algorithmic research by Atallah includes papers on parallel and dynamic computational geometry,{{citation

| last = Atallah | first = Mikhail J.

| doi = 10.1016/0898-1221(85)90105-1

| issue = 12

| journal = Computers & Mathematics with Applications

| mr = 822083

| pages = 1171–1181

| title = Some dynamic computational geometry problems

| volume = 11

| year = 1985| doi-access =

}}. {{citation

| last1 = Atallah | first1 = Mikhail J.

| last2 = Goodrich | first2 = Michael T. | author2-link = Michael T. Goodrich

| doi = 10.1016/0743-7315(86)90011-0

| issue = 4

| journal = J. Parallel Distrib. Comput.

| pages = 492–507

| title = Efficient parallel solutions to some geometric problems

| volume = 3

| year = 1986| url = https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1424&context=cstech

}}. finding the symmetries of geometric figures,{{citation

| last = Atallah | first = Mikhail J.

| doi = 10.1109/TC.1985.1676605

| issue = 7

| journal = IEEE Transactions on Computers

| mr = 800338

| pages = 663–666

| title = On symmetry detection

| volume = 34

| year = 1985| s2cid = 1341755

}}. divide and conquer algorithms,{{citation

| last1 = Atallah | first1 = Mikhail J.

| last2 = Cole | first2 = Richard

| last3 = Goodrich | first3 = Michael T. | author3-link = Michael T. Goodrich

| doi = 10.1137/0218035

| issue = 3

| journal = SIAM Journal on Computing

| mr = 996833

| pages = 499–532

| title = Cascading divide-and-conquer: a technique for designing parallel algorithms

| volume = 18

| year = 1989| s2cid = 1752195

| url = https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1575&context=cstech

}}. and efficient parallel computations of the Levenshtein distance between pairs of strings.{{citation

| last1 = Apostolico | first1 = Alberto

| last2 = Atallah | first2 = Mikhail J.

| last3 = Larmore | first3 = Lawrence L. | author3-link = Lawrence L. Larmore

| last4 = McFaddin | first4 = Scott

| doi = 10.1137/0219066

| issue = 5

| journal = SIAM Journal on Computing

| mr = 1059665

| pages = 968–988

| title = Efficient parallel algorithms for string editing and related problems

| volume = 19

| year = 1990| citeseerx = 10.1.1.100.9057}}. With his student Marina Blanton, Atallah is the editor of the Algorithms and Theory of Computation Handbook (CRC Press, 2nd ed., 2009, {{ISBN|978-1-58488-818-5}}).

Atallah's more recent research has been in the area of computer security. His work in this area has included techniques for text-based digital watermarking.{{citation|url=http://www.timeshighereducation.co.uk/story.asp?storyCode=159577§ioncode=26|title=Word order may stump hackers|journal=Times Higher Education|date=May 4, 2001}}.{{citation|url=https://www.sciencedaily.com/releases/2001/04/010427071702.htm|title=Purdue Team Develops Watermark To Protect Electronic Documents|journal=ScienceDaily|date=April 27, 2001}} and the addition of multiple guard points within software as an anti-piracy measure.{{citation|title=Multiple "guards" foil hackers|journal=USA Today Magazine|date=June 1, 2003}}.

Awards and honors

In 2006, Atallah was elected as a fellow of the Association for Computing Machinery for his "contributions to parallel and distributed computation".ACM Fellow [http://fellows.acm.org/fellow_citation.cfm?id=1978675&srt=all award citation], retrieved 2011-09-29. He has been a fellow of the IEEE since 1997.[http://www.ieee.org/membership_services/membership/fellows/regional/region_four.html Fellows in Region 4] {{webarchive|url=https://web.archive.org/web/20110805000048/http://www.ieee.org/membership_services/membership/fellows/regional/region_four.html |date=2011-08-05 }}, IEEE, retrieved 2011-09-29. Previously he received a Presidential Young Investigator Award from the National Science Foundation in 1985.{{Cite web |title=NSF Award Search: Award # 8451393 - Presidential Young Investigator Award: (Computer Research) |url=https://www.nsf.gov/awardsearch/showAward?AWD_ID=8451393&HistoricalAwards=false |access-date=2024-09-13 |website=www.nsf.gov}}

References