Zvi M. Kedem

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
57An approach to energy-error tradeoffs in approximate ripple carry adders. Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna Muntimadugu, Krishna V. Palem. ISLPED 2011, 211-216. Web SearchBibTeXDownload
2010
56Optimizing energy to minimize errors in dataflow graphs using approximate adders. Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna Muntimadugu, Krishna V. Palem, Avani Devarasetty, Phani Deepak Parasuramuni. CASES 2010, 177-186. Web SearchBibTeXDownload
2009
55Sustaining moore's law in embedded computing through probabilistic and approximate design: retrospects and prospects. Krishna V. Palem, Lakshmi N. Chakrapani, Zvi M. Kedem, Lingamneni Avinash, Kirthi Krishna Muntimadugu. CASES 2009, 1-10. Web SearchBibTeXDownload
2005
54A distributed adaptive cache update algorithm for the dynamic source routing protocol. Xin Yu, Zvi M. Kedem. INFOCOM 2005, 730-739. Web SearchBibTeXDownload
53Detecting malicious network traffic using inverse distributions of packet contents. Vijay Karamcheti, Davi Geiger, Zvi M. Kedem, S. Muthukrishnan. MineNet 2005, 165-170. Cited by 17Web SearchBibTeXDownload
2004
52Reducing the effect of mobility on TCP by making route caches quickly adapt to topology changes. Xin Yu, Zvi M. Kedem. ICC 2004, 4103-4110. Web SearchBibTeXDownload
2002
51Automatic data and computation decomposition on distributed memory parallel computers. PeiZong Lee, Zvi M. Kedem. ACM Trans. Program. Lang. Syst. (24): 1-50 (2002). Web SearchBibTeXDownload
50Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set. Dao-I Lin, Zvi M. Kedem. IEEE Trans. Knowl. Data Eng. (14): 553-566 (2002). Web SearchBibTeXDownload
2000
49Exploiting Application Tunability for Efficient, Predictable Resource Management in Parallel and Distributed Systems. Fangzhe Chang, Vijay Karamcheti, Zvi M. Kedem. J. Parallel Distrib. Comput. (60): 1420-1445 (2000). Web SearchBibTeXDownload
1999
48Charlotte: Metacomputing on the Web. Arash Baratloo, Mehmet Karaul, Zvi M. Kedem, P. Wijckoff. Future Generation Comp. Syst. (15): 559-570 (1999). Web SearchBibTeXDownload
47Metacomputing with MILAN. Arash Baratloo, Partha Dasgupta, Vijay Karamcheti, Zvi M. Kedem. Heterogeneous Computing Workshop 1999, 169-183. Web SearchBibTeXDownload
46Exploiting Application Tunability for Efficient, Predictable Parallel Resource Management. Fangzhe Chang, Vijay Karamcheti, Zvi M. Kedem. IPPS/SPDP 1999, 749. Web SearchBibTeXDownload
45Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs. Arash Baratloo, Ayal Itzkovitz, Zvi M. Kedem, Yuanyuan Zhao. IPPS/SPDP 1999, 506-512. Web SearchBibTeXDownload
44Transparent Distribution Middleware for General Purpose Computations. Partha Dasgupta, Vijay Karamcheti, Zvi M. Kedem. PDPTA 1999, 417-423. Web SearchBibTeX
1998
43An infrastructure for network computing with Java applets. Arash Baratloo, Mehmet Karaul, Holger Karl, Zvi M. Kedem. Concurrency - Practice and Experience (10): 1029-1041 (1998). Web SearchBibTeXDownload
42Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set. Dao-I Lin, Zvi M. Kedem. EDBT 1998, 105-119. Web SearchBibTeXDownload
1996
41Modeling Data-Intensive Reactive Systems with Relational Transition Systems. Alexander Tuzhilin, Zvi M. Kedem. Acta Inf. (33): 203-231 (1996). Web SearchBibTeXDownload
40Supporting a Flexible Parallel Programming Model on a Network of Workstations. Shih-Chen Huang, Zvi M. Kedem. ICDCS 1996, 75-82. Web SearchBibTeX
39Parallel Suffix-Prefix-Matching Algorithm and Applications. Zvi M. Kedem, Gad M. Landau, Krishna V. Palem. SIAM J. Comput. (25): 998-1023 (1996). Web SearchBibTeXDownload
1995
38CALYPSO: A Novel Software System for Fault-Tolerant Parallel Processing on Distributed Platforms. Arash Baratloo, Partha Dasgupta, Zvi M. Kedem. HPDC 1995, 122-129. Web SearchBibTeXDownload
37Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach. Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin. ICDCS 1995, 467-474. Web SearchBibTeX
1993
36Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs. Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin. FOCS 1993, 271-280. Web SearchBibTeXDownload
1992
35Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version). Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan. STOC 1992, 306-317. Web SearchBibTeXDownload
34Optimal Parallel Algorithms for Forest and Term Matching. Zvi M. Kedem, Krishna V. Palem. Theor. Comput. Sci. (93): 245-264 (1992). Web SearchBibTeXDownload
1991
33Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract). Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis. STOC 1991, 381-390. Web SearchBibTeXDownload
32Fast Parallel Algorithms for Coloring Random Graphs. Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. WG 1991, 135-147. Web SearchBibTeXDownload
1990
31The Five Color Concurrency Control Protocol: Non-Two-Phase Locking in General Databases. Partha Dasgupta, Zvi M. Kedem. ACM Trans. Database Syst. (15): 281-307 (1990). Web SearchBibTeXDownload
30Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays. PeiZong Lee, Zvi M. Kedem. IEEE Trans. Parallel Distrib. Syst. (1): 64-76 (1990). Web SearchBibTeXDownload
29Efficient Robust Parallel Computations (Extended Abstract). Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis. STOC 1990, 138-148. Web SearchBibTeXDownload
28On high-speed computing with a programmable linear array. PeiZong Lee, Zvi M. Kedem. The Journal of Supercomputing (4): 223-249 (1990). Web SearchBibTeXDownload
1989
27Querying and Controlling the Future Behaviour of Complex Objects. Alexander Tuzhilin, Zvi M. Kedem. ICDE 1989, 434-442. Web SearchBibTeXDownload
26Mapping Nested Loop Algorithms into Multi-Dimensional Systolic Arrays. PeiZong Lee, Zvi M. Kedem. ICPP (3) 1989, 206-210. Web SearchBibTeX
25Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models. Zvi M. Kedem, Alexander Tuzhilin. PODS 1989, 336-346. Web SearchBibTeXDownload
24Optimal Parallel Suffix-Prefix Matching Algorithm and Applications. Zvi M. Kedem, Gad M. Landau, Krishna V. Palem. SPAA 1989, 388-398. Web SearchBibTeXDownload
1988
23Synthesizing Linear Array Algorithms from Nested For Loop Algorithms. PeiZong Lee, Zvi M. Kedem. IEEE Trans. Computers (37): 1578-1598 (1988). Web SearchBibTeXDownload
22On high-speed computing with a programmable linear array. PeiZong Lee, Zvi M. Kedem. SC 1988, 425-432. Web SearchBibTeXDownload
21Parallel algorithms and architectures report of a workshop. Duncan A. Buell, David A. Carlson, Yuan-Chieh Chow, Karel Culík, Narsingh Deo, Raphael A. Finkel, Elias N. Houstis, Elaine M. Jacob Son, Zvi M. Kedem, Janusz S. Kowalik, Philip Kuekes, Joanne L. Martin, George A. Michael, Neil s. Ostlund, Jerry Potter, D. K. Pradhan, Michael J. Quinn, G. W. Stewart, Quentin F. Stout, Layne Watson, Jon Webb. The Journal of Supercomputing (1): 301-325 (1988). Web SearchBibTeXDownload
1985
20Lock Conversion in Non-Two-Phase Locking Protocols. C. Mohan, Donald S. Fussell, Zvi M. Kedem, Abraham Silberschatz. IEEE Trans. Software Eng. (11): 15-22 (1985). Cited by 12Web SearchBibTeXDownload
19Optimal Allocation of Area for Single-Chip Computations. Zvi M. Kedem. SIAM J. Comput. (14): 730-743 (1985). Web SearchBibTeXDownload
1983
18Locking Protocols: From Exclusive to Shared Locks. Zvi M. Kedem, Abraham Silberschatz. J. ACM (30): 787-804 (1983). Web SearchBibTeXDownload
17A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases. Partha Dasgupta, Zvi M. Kedem. VLDB 1983, 92-94. Web SearchBibTeXDownload
1982
16Optimal Allocation of Computational Resources in VLSI. Zvi M. Kedem. FOCS 1982, 379-385. Web SearchBibTeXDownload
15A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs. Abraham Silberschatz, Zvi M. Kedem. IEEE Trans. Software Eng. (8): 558-562 (1982). Web SearchBibTeXDownload
14An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols. Zvi M. Kedem, C. Mohan, Abraham Silberschatz. VLDB 1982, 91-97. Cited by 6Web SearchBibTeXDownload
1981
13A Characterization of Database Graphs Admitting a Simple Locking Protocol. Zvi M. Kedem, Abraham Silberschatz. Acta Inf. (16): 1-13 (1981). Web SearchBibTeXDownload
12On Relations Between Input and Communication/Computation in VLSI (Preliminary Report). Zvi M. Kedem, Alessandro Zorat. FOCS 1981, 37-44. Web SearchBibTeXDownload
11Deadlock Removal Using Partial Rollback in Database Systems. Donald S. Fussell, Zvi M. Kedem, Abraham Silberschatz. SIGMOD Conference 1981, 65-73. Web SearchBibTeXDownload
10A Theory of Correct Locking Protocols for Database Systems. Donald S. Fussell, Zvi M. Kedem, Abraham Silberschatz. VLDB 1981, 112-124. Web SearchBibTeX
1980
9Consistency in Hierarchical Database Systems. Abraham Silberschatz, Zvi M. Kedem. J. ACM (27): 72-80 (1980). Web SearchBibTeXDownload
8Non-Two-Phase Locking Protocols with Shared and Exclusive Locks. Zvi M. Kedem, Abraham Silberschatz. VLDB 1980, 309-317. Web SearchBibTeX
1979
7Controlling Concurrency Using Locking Protocols (Preliminary Report). Zvi M. Kedem, Abraham Silberschatz. FOCS 1979, 274-285. Web SearchBibTeXDownload
6Comments on the All Nearest-Neighbor Problem for Convex Polygons. Alain Fournier, Zvi M. Kedem. Inf. Process. Lett. (9): 105-107 (1979). Web SearchBibTeX
5Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications and Divisions. Zvi M. Kedem. J. ACM (26): 582-601 (1979). Web SearchBibTeXDownload
1978
4The "highly intelligent" tablet as an efficient pointing device for interactive graphics (Preliminary Report). Henry Fuchs, Zvi M. Kedem. ACM Annual Conference (2) 1978, 765-769. Web SearchBibTeXDownload
1977
3Optimal Surface Reconstruction from Planar Contours. Henry Fuchs, Zvi M. Kedem, Samuel P. Uselton. Commun. ACM (20): 693-702 (1977). Web SearchBibTeXDownload
2Adequate Requirements for Rational Functions. David G. Kirkpatrick, Zvi M. Kedem. SIAM J. Comput. (6): 188-199 (1977). Web SearchBibTeXDownload
1974
1Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications. Zvi M. Kedem. STOC 1974, 334-341. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ Scheduled Talks: Fall 2007 - NYU Computer Science Department - Retrieved 2011-04-23 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research