| More
NYU, Courant, Zvi M. Kedem, also link to about

Brief CV

Professional Recognition

Fellow of the IEEE (Institute of Electrical and Electronics Engineers). Only 0.1% of the total voting membership of IEEE can be elevated to this rank in any year.

Fellow of the ACM (Association for Computing Machinery). Only 1% of the total membership of ACM can be elevated to this rank.

Fellow of the European Academy of Sciences, by invitation. Total of fewer than 600 members, among them 50 Nobel Prize winners.

Outstanding Contribution to ACM Award. The only recipient for 2012.

Education

1974
D.Sc. in Mathematics, Dissertation Research Advisor: Shmuel Winograd
Technion – Israel Institute of Technology, Israel
1970
M.Sc. in Mathematics, Thesis Research Advisor: Meir Reichaw
Technion – Israel Institute of Technology, Israel
1967
B.Sc. in Mathematics
Technion – Israel Institute of Technology, Israel

Military Service

1967 – 1971
Officer, Israel Defense Forces, Israel

Regular Positions

1984 –
Professor
Department of Computer Science
Courant Institute of Mathematical Sciences
New York University, USA
1991 – 1994
Chair
Department of Computer Science
Courant Institute of Mathematical Sciences
New York University, USA
1980 – 1985
Associate Professor and Professor
Department of Computer Science
State University of New York at Stony Brook, USA
1975 – 1980
Assistant Professor and Associate Professor
Programs in Mathematical Sciences
The University of Texas at Dallas, USA
1973 – 1975
Instructor in Applied Mathematics
Department of Mathematics
Massachusetts Institute of Technology, USA
1972 – 1973
Lecturer
Department of Mathematical Statistics
Columbia University, USA
1971 – 1972
Graduate Assistant
Department of Mathematics
Technion – Israel Institute of Technology, Israel

Extended Invited Academic Visits

2012
Humboldt University, Germany
2012
Nanyang Technological University, Singapore
2009
Rice University, USA
2002
Humboldt University, Germany
1998
Humboldt University, Germany
1998
Academia Sinica, Republic of China
1996
National Laboratory for Scientific Computing, Brazil
1991
University of Paris V, France
1990
Tata Institute for Fundamental Research, India
1990
University of Maryland, USA
1985
Beijing University (Peking University), PRC
1982
Columbia University, USA

Summary of Professional Activities

Has conducted research in Computational Complexity (algebraic complexity, VLSI complexity); Computer Graphics (surface reconstruction, BSP tree algorithm); Database, Knowledge-based Systems, and Data Mining (concurrency control, relational discrete event systems, Pincer-Search algorithm); Parallel and Distributed Systems (parallel algorithms, compilation for special-purpose parallel machines, reliable parallel computations on LANs and the WWW, metacomputing, Calypso, MILAN, and Charlotte systems, routing in mobile ad-hoc networks); and Internet Traffic Analysis. Research reported in more than 50 scientific publications.

Has obtained more than $10,000,000 in research funding, as a Principal or Co-principal Investigator, from: Air Force Research Laboratory (AFRL), Defense Advanced Research Projects Agency (DARPA), National Security Agency (NSA), National Science Foundation (NSF), Office of Naval Research (ONR), Intel, Microsoft, and Sun Microsystems.

Has served on research funding and review panels for Defense Advanced Research Projects Agency (DARPA), National Aeronautics and Space Agency (NASA), and National Science Foundation (NSF). Has served on program committees of scientific conferences and on editorial boards of scientific journals. Currently serving as Editor in Chief of the ACM Computing Classification System Update Project.

Has taught a variety of undergraduate and graduate courses in Computer Science spanning theory and practice, including Analysis and Design of Algorithms, Applied Cryptography and Network Security, Discrete Structures, Combinatorics, Computational Complexity, Database Systems, Data Mining, Distributed Algorithms and Systems, and Mathematical Techniques in Computer Science. Guided more than 15 doctoral dissertations. Has a total of more than 200 doctoral descendants.

A complete set of PowerPoint presentations for an introductory Database Management Systems class is available at http://dr.tl/e37f75. They may be downloaded and printed, but not modified or material extracted from them or incorporated elsewhere.

Publications Cited More Than 50 Times

H. Fuchs, Z. Kedem, and S. Uselton. Optimal surface reconstruction from planar contours. Communications of the ACM, 1977. Citations (including those in more than 100 distinct journals; majority not in Computer Science): 988.

A. Silberschatz and Z. Kedem. Consistency in hierarchical data base systems. Journal of the ACM , 1980. (With preliminary version as: Z. Kedem and A. Silberschatz. Controlling concurrency using locking protocols. In Proceedings of the 20th IEEE Symposium on Foundations of Computing, 1979). Citations: 240.

H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a-priori tree structures. In Proceedings of the 7th SIGGRAPH Conference, 1980. Citations: 962.

Z. Kedem and A. Silberschatz. Locking protocols: From exclusive to shared locks. Journal of the ACM, 1983. (With preliminary version as: Z. Kedem and A. Silberschatz. Non-two-phase locking protocols with shared and exclusive locks. In Proceedings of the 6th International Conference on Very Large Databases, 1980). Citations: 91.

P.-Z. Lee and Z. Kedem. Synthesizing linear-array algorithms from nested for loop algorithms. IEEE Transactions on Computers, 1988. Citations: 117.

P.-Z. Lee and Z. Kedem. Mapping nested loop algorithms into multi-dimensional systolic arrays. IEEE Transactions on Parallel and Distributed Systems, 1989. Citations: 91.

Z. Kedem, K. Palem, and P. Spirakis. Efficient robust parallel computations. In Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990. Citations: 145.

Z. Kedem, K. Palem, A. Raghunathan, and P. Spirakis. Combining tentative and definite executions for very fast dependable parallel computing. In Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991. Citations: 113.

Z. Kedem, K. Palem, M. Rabin, and A. Raghunathan. Efficient program transformations for resilient parallel computation via randomization. In Proceedings of the 24th ACM Symposium on Theory of Computing, 1992. Citations: 73.

P. Dasgupta, Z. Kedem, and M. Rabin. Parallel processing on networks of workstations: A fault-tolerant high performance approach. In Proceedings of the 15th IEEE International Conference on Distributed Computing Systems, 1995. Citations: 62.

Z Kedem, G. Landau, and K. Palem. Parallel suffix-prefix-matching algorithm and applications. SIAM J. on Computing, 1995. (With preliminary version as: Z Kedem, G. Landau, and K. Palem. Parallel suffix-prefix-matching algorithm and applications. In Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures, 1989). Citations: 59.

A. Baratloo, P. Dasgupta, and Z. Kedem. Calypso: A novel software system for fault-tolerant parallel processing on distributed platforms. In Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing, 1995. Citations: 99.

A. Baratloo, M. Karaul, H. Karl and Z. Kedem. An infrastructure for network computing with Java applets. Concurrency: Practice and Experience, 1998. (With preliminary version as: A. Baratloo, M. Karaul, H. Karl, and Z. Kedem. KnittingFactory: An infrastructure for distributed web applications. NYU CS TR 1997-748, 1997). Citations: 77.

A. Baratloo, M. Karaul, Z. Kedem, and P. Wyckoff. Charlotte: Metacomputing on the Web. Future Generation Computer Systems, 1999. (With preliminary version as: A. Baratloo, M. Karaul, Z. Kedem, and P. Wyckoff. Charlotte: Metacomputing on the Web. In Proceedings of the 9th Conference on Parallel and Distributed Computing Systems, 1996). Citations: 345.

D.-I Lin and Z. Kedem. Pincer Search: An efficient algorithm for discovering the maximum frequent set. IEEE Transactions on Database and Knowledge Engineering, 2002. (With preliminary version as: D.-I Lin and Z. Kedem. Pincer Search: An efficient algorithm for discovering the maximum frequent set. In Proceedings of the 6th International Conference on Extending Database Technology, 1998). Citations: 473.

Patent

Z. Kedem, D. Geiger, S. Paxia, A. Baratloo, and P. Wyckoff. Data image management via emulation of non-volatile storage device. US Patent numbers: 6477624 and 6598131. Citations: 59.

 

Link to XHTML validation     Link to CSS validation     Link to accessability validation