Zvi M. Kedem, D.Sc.

Professor of Computer Science
Courant Institute of Mathematical Sciences
New York University

251 Mercer Street, Room 427
New York, NY 10012-1110

Phone: (212) 998-3101
Fax: (212) 504-8023
Cell: (646) 207-3566

Email: zvi.kedem@nyu.edu
Homepage: http://www.cs.nyu.edu/kedem/

vCard

Education

D.Sc. in Mathematics, Technion - Israel Institute of Technology, 1974

M.Sc. in Mathematics, Technion - Israel Institute of Technology, 1970

B.Sc. in Mathematics, Technion - Israel Institute of Technology, 1967

Military Service

Officer, Israel Defense Forces, 1967-1971

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.

Experience

Academic Appointments

Chair of the Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 1991-1994

Professor of Computer Science, Courant Institute of Mathematical Sciences, New York University, 1984-present

Associate Professor and Professor of Computer Science, State University of New York at Stony Brook, 1980-1985

Assistant Professor and Associate Professor of Mathematical Sciences, The University of Texas at Dallas, 1975-1980

Instructor in Applied Mathematics, Massachusetts Institute of Technology, 1973-1975

Lecturer in Mathematical Statistics, Columbia University, 1972-1973

Graduate Assistant in Mathematics, Technion - Israel Institute of Technology, 1971-1972

Extended Invited Academic Visits

Humboldt University, Germany, 2012, 2002, 1998

Nanyang Technological University, Singapore, 2012

Rice University, 2009

Academia Sinica, Republic of China, 1998

National Laboratory for Scientific Computing, Brazil, 1996

University of Paris V, France, 1991

Tata Institute for Fundamental Research, India, 1990

The University of Maryland at College Park, 1990

Beijing University (Peking University), People's Republic of China, 1985

Columbia University, 1982

Summary of Academic Activities

Has conducted research in Computational Complexity (algebraic complexity, VLSI complexity); Computer Graphics (surface reconstruction, BSP tree algorithm); Databases, 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), Low-energy Integrated Circuits, and Internet Traffic Analysis. Research reported in more than 50 peer-reviewed scientific publications.

Has obtained more than $10,000,000 in external 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, Intel, and Microsoft.

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. Most recently served 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, Computational Complexity, Database Systems, Data Mining, Distributed Algorithms and Systems, Mathematical Techniques in Computer Science. Guided more than 15 doctoral dissertations. Has a total of more than 200 doctoral descendants.

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://bit.ly/VvAUq8. They may be downloaded and printed, but not modified.

Summary of Other Professional Activities

Conducted training and consulted for IBM, AT&T Bell Laboratories, and law firms in the Unix Operating System, Databases, Embedded Systems, and Intellectual Property.

Served first as CEO and subsequently as CTO of the startup, Ondotek.

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. Originally assigned to Ondotek and subsequently to Intellectual Ventures.

Peer-Reviewed 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): 795.

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: 228.

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: 851.

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: 86.

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

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

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

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: 105.

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: 69.

Y. Aumann, Z. Kedem, K. Palem, and M. Rabin. Highly efficient asynchronous execution of large-grain parallel programs. In Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science, 1993. Citations: 58.

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: 55.

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: 96.

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: 71.

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: 327.

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: 369.

 

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