Yehoshua Perl, PhD, is a professor in the department of computer science at New Jersey Institute of Technology. From 1975 to 1985, he was a lecturer and senior lecturer at the Bar-Ilan University in Israel; from 1982 to 1985, he was a visiting associate professor at Rutgers University in New Brunswick. Perl joined NJIT’s Department of Computer Science in 1985; he was appointed professor in 1987.
Highlights of his research include: the shifting algorithm technique for tree partitioning; analysis of interpolation search; the design of periodic sorting networks; partitioning, abstraction, and auditing of medical terminologies; and enhancing the semantics of object-oriented databases. From 1995 to 1999, Perl was involved in the large Object-Oriented Healthcare Vocabulary Repository project supported by the National Institute of Standards and Technology Advanced Technology Program. Currently, he is working on two National Library of Medicine grants: “Partitioning to Support Auditing and Extending the UMLS” and “Taxonomies Supporting Orientation, Navigation and Auditing of Terminologies” with a combined budget of more than $2 million.
Perl is the author of more than 125 papers in international journals and conferences. In 2008, he received the Excellence in Research Award for the College of Computing Sciences in recognition of a sustained record of contributions that have enhanced the reputation of NJIT. In 1996, he received the NJIT Harlan J. Perlis Research Award.
Bar-Ilan University, B.S., 1969.
The Weizmann Institute of Science, M.S., 1971.
The Weizmann Institute of Science, Ph.D., 1975.
Awards and Honors
Feinberg Graduate School IBM. Award 1973.
IPA Prize for Computer Science 1974 and 1977.
(IPA - Information Processing Association of Israel)
1. A counter example to a conjecture of D.J. Rose on minimum triangulation, J. Math. Anal. and Appl. 42, 3 (1973), 594-595.
2. Efficient generation of optimal prefix code: equiprobable words using unequal cost letters, (with M.R. Garey and S. Even) JACM 22, 2 (1975), 202-214.
3. Constuction in combinatorial games with cycles, (with A.S. Fraenkel), Colloquia Mathematics Societatis Janos Bolvai, 10 Proc. Intern. Colloq. Infinite and Sets, Keszthely, Hungary, (1973), 2, 667-699, North Holland, 1975.
4. Optimal sequential arrangement of evaluation trees for Boolean functions, (with Y. Breitbart), Information Science 11 (1976), 1-12.
5. Interpolation search A log log N search, (with A. Itai and H. Avni), CACM, 21 (1978), 550-553.
6. Understanding the complexity of interpolation search, (with E.M. Reingold), Info.Proc. let. 6 (1977), 219-222.
7. Finding two disjoint paths between two pairs of vertices in a graph, (with Y. Shiloach), JACM 25 (1978), 1-9.
1. Shortest paths in a network with two cost functions, proceedings of the third Jersusalem Conference on Information Technology, J. Meneta Ed. NorthHolland, Amsterdam (1978) 211- 215.
2. A shifting algorithm for MinMax tree partitioning, (with R.I. Becker and S.R Schach), in the Proceedings of the 7th ICALP International Colloquium on Automata, Languages and Programming, Noodwijkerhout, The Netherlands, (J.W. de Bakker and J. Van Leeuwen eds.), SpringerVerlag, Berlin 1980, 64-75.
3. Efficient optimization of monotonic functions on trees, (with Y. Shiloach), in the Proceedings of the 6th Colloquium on trees in algebra and Programming, Genua, 1981, 332-339, in Springer Verlag Lecture Notes in Computer Science.
4. Shifting algorithms for tree partitioning with general weighting functions, (with R.I. Becker), in the Proceedings of the 19th Anual allerton Conference on Communication Control and Computing, 1981, 746-751.
5. Polynomial construction of optimal prefix tables for text compression (with Y. Choueka and A.S. Fraenkel) in the Proceedings of 19th Annual Allerton Conference on Communication Control and Computing, 1981, 762-768.
6. A shifting algorithm for constrained MINMAX partition on trees, (with E. Agasi and R.I. Becker), in the Proceedings of the 16th Annual Conference on Information Science and Systems, Princeton, 1982.
7. Circuit partitioning with size and connection constraints, (with M. Snir), in the proceedings of the 16th Annual Conference on Information Science and Systems, princeton, 1982.
8. Is text compression by prefixes and suffixes practical?, (with A.S. Fraenkel and M. Mor), in the ACM SIGIR conference on Research and Development in Information Retrieval, Berlin 1982.
9. The balanced sorting Network, (with M. Dowd, L. Rudolph and M. Saks), in the Proceedings of the 2nd ACM Symposium on principles of distributed computing, Montreal 1982, 161-172
10. Efficient variants of Huffman Codes in high-level languages, (with Y. Choueka and S.T. Klein), in the proceedings of the ACM SIGIR conference on Research and Development in Information Retrieval, Montreal 1985.