Mikhail Atallah

Mikhail Atallah

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

Contents

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 masters 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.[1][2]

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.[3]

Research

Atallah has published over 200 papers on topics in algorithms and computer security.[4]

Atallah's thesis work was on the subject of parallel algorithms,[2] and he continued working in that area as a faculty member. Highly-cited algorithmic research by Atallah includes papers on parallel and dynamic computational geometry,[5] finding the symmetries of geometric figures,[6] divide and conquer algorithms,[7] and efficient parallel computations of the Levenshtein distance between pairs of strings.[8] With his student Marina Blanton, Atallah is the editor of the Algorithms and Theory of Computation Handbook (CRC Press, 2nd ed., 2009, ISBN 9781584888185).

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.[9][10] and the addition of multiple guard points within software as an anti-piracy measure.[11]

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".[12] He has also been a fellow of the IEEE since 1997.[1][13]

References

  1. ^ a b Department faculty profile, Purdue University, retrieved 2011-09-29.
  2. ^ a b Mikhail Jibrayil Atallah at the Mathematics Genealogy Project.
  3. ^ Arxan Appoints Dr. Mikhail J. Atallah as Chief Technology Officer, Arxan Technologies, retrieved 2011-09-29.
  4. ^ DBLP listing of Atallah's publications, retrieved 2011-09-29.
  5. ^ Atallah, Mikhail J. (1985), "Some dynamic computational geometry problems", Computers & Mathematics with Applications 11 (12): 1171–1181, doi:10.1016/0898-1221(85)90105-1, MR822083 . Atallah, Mikhail J.; Goodrich, Michael T. (1986), "Efficient parallel solutions to some geometric problems", J. Parallel Distrib. Comput. 3 (4): 492–507, doi:10.1016/0743-7315(86)90011-0 .
  6. ^ Atallah, Mikhail J. (1985), "On symmetry detection", IEEE Transactions on Computers 34 (7): 663–666, doi:10.1109/TC.1985.1676605, MR800338 .
  7. ^ Atallah, Mikhail J.; Cole, Richard; Goodrich, Michael T. (1989), "Cascading divide-and-conquer: a technique for designing parallel algorithms", SIAM Journal on Computing 18 (3): 499–532, doi:10.1137/0218035, MR996833 .
  8. ^ Apostolico, Alberto; Atallah, Mikhail J.; Larmore, Lawrence L.; McFaddin, Scott (1990), "Efficient parallel algorithms for string editing and related problems", SIAM Journal on Computing 19 (5): 968–988, doi:10.1137/0219066, MR1059665 .
  9. ^ "Word order may stump hackers", Times Higher Education, May 4, 2001, http://www.timeshighereducation.co.uk/story.asp?storyCode=159577&sectioncode=26 .
  10. ^ "Purdue Team Develops Watermark To Protect Electronic Documents", ScienceDaily, April 27, 2001, http://www.sciencedaily.com/releases/2001/04/010427071702.htm 
  11. ^ "Multiple "guards" foil hackers", USA Today Magazine, June 1, 2003 .
  12. ^ ACM Fellow award citation, retrieved 2011-09-29.
  13. ^ Fellows in Region 4, IEEE, retrieved 2011-09-29.

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Victor Raskin — Victor Raskin, (April 17 1944 ndash; ), is a distinguished professor of linguistics at Purdue University and a member of the advisory board of hakia. He is the author of Semantic Mechanisms for Humor and Ontological Semantics and founding editor… …   Wikipedia

  • Internet addiction disorder — Wikipedia addiction redirects here. For the tongue in cheek Wikipedia essay, see Wikipedia:Wikipediholic. See also: Computer addiction and Video game addiction Internet addiction disorder (IAD), or, more broadly, Internet overuse,… …   Wikipedia

  • Michael T. Goodrich — is a mathematician and computer scientist. Contents 1 University career 2 Fellowships 3 Editorships 4 Awards …   Wikipedia

  • Star Academy (version arabe) — Pour les articles homonymes, voir Star Academy. Star Academy LBC Présentation Hilda Khalife Pays  Liban …   Wikipédia en Français

  • Saison 1 de Star Academy Moyen-Orient — Saison 1 de Star Academy Vainqueur Mohammed Attiah Diffusion Date de première diffusion …   Wikipédia en Français

  • List of Copts — Infobox Religious group group = Copts AqbaUnicode|ṭ أقباط Coptic|ⲛⲓⲣⲉⲙ ⲛⲭⲏⲙⲓ ⲛ Ⲭⲣⲏⲥⲧⲓ ⲁⲛⲟⲥ ni.Remenkīmi en Ekhristianos image caption = Top row (left to right) Saint Mary of Egypt • Boutros Boutros Ghali • Ester Fanous • Saint Maurice Bottom row… …   Wikipedia

  • Davenport–Schinzel sequence — In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of… …   Wikipedia

  • Star Academy Arab World — Star Academy title card Format Interactive talent show Reality Created by John de Mol …   Wikipedia

  • Suite de Davenport-Schinzel — En combinatoire, une suite de Davenport Schinzel est une suite de symboles dans laquelle le nombre de fois où deux symboles peuvent apparaître en alternance est limité. La longueur d une suite de Davenport Schinzel est limitée par le nombre de… …   Wikipédia en Français

  • Israël Shamir — est le pseudonyme de Adam Ermash nom changé légalement en Jöran Jermas , d un écrivain journaliste très controversé, connu pour son militantisme anti sioniste et pro palestinien. Il régulièrement accusé d antisémite et de négationnisme …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”