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