Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home People Profile

Nathan Friedman


Email: nathan AT cs DOT mcgill DOT ca
Home Page:
Office: MC325
Phone: +1-514-398-7076
Fax: +1-514-398-3883

Research Description

Prof. Friedman's research interests are in the general area of the design and analysis of algorithms and computational complexity. Currently, he is interested in parallel algorithms for non-numeric and semi-numeric problems using models of computation motivated by practical design considerations. A particular problem of interest involves algorithms for sorting and ranking using tournaments which can be implemented by sorting nets. He has also been investigating various string recognition problems.

Many results in concerning the complexity of semi-numeric problems use concepts and results that assume one is working with real numbers. In fact, such numbers do not exist on real computers. Prof. Friedman is interested in the relationship between these results and results which can be established using models of computation which reflect the finitary nature of data represented on actual computers. The orbits of chaotic transformations have many applications in modeling complex phenomena and are often computed numerically in simulating such phenomena. He has been studying relationships between the theoretical and the computer-generated orbits of such transformations to attempt to justify rigorously the use of the computer orbits.

Research Interests

Research Labs


Selected Publications (click link in front of each publication to see bibtex in ASCII format)

Last Update:   2011/07/11 10:15:58.446 GMT-4