| Year |
Citation |
Score |
| 2002 |
Lee PZ, Kedem ZM. Automatic data and computation decomposition on distributed memory parallel computers Acm Transactions On Programming Languages and Systems. 24: 1-50. DOI: 10.1145/509705.509706 |
0.397 |
|
| 2002 |
Lin DI, Kedem ZM. Pincer-search: An efficient algorithm for discovering the maximum frequent set Ieee Transactions On Knowledge and Data Engineering. 14: 553-566. DOI: 10.1109/Tkde.2002.1000342 |
0.401 |
|
| 2000 |
Chang F, Karamcheti V, Kedem Z. Exploiting Application Tunability for Efficient, Predictable Resource Management in Parallel and Distributed Systems Journal of Parallel and Distributed Computing. 60: 1420-1445. DOI: 10.1006/Jpdc.2000.1660 |
0.338 |
|
| 1999 |
Baratloo A, Karaul M, Kedem ZM, Wijckoff P. Charlotte: metacomputing on the web Future Generation Computer Systems. 15: 559-570. DOI: 10.1016/S0167-739X(99)00009-6 |
0.318 |
|
| 1998 |
Baratloo A, Karaul M, Karl H, Kedem ZM. An infrastructure for network computing with Java applets Concurrency Practice and Experience. 10: 1029-1041. DOI: 10.1002/(Sici)1096-9128(199809/11)10:11/13<1029::Aid-Cpe412>3.0.Co;2-U |
0.351 |
|
| 1998 |
Lin DI, Kedem ZM. Pincer-search: A new algorithm for discovering the maximum frequent set Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1377: 105-119. |
0.344 |
|
| 1996 |
Kedem ZM, Landau GM, Palem KV. Parallel suffix-prefix-matching algorithm and applications Siam Journal On Computing. 25: 998-1023. DOI: 10.1137/S0097539792190157 |
0.382 |
|
| 1992 |
Kedem ZM, Palem KV. Optimal parallel algorithms for forest and term matching Theoretical Computer Science. 93: 245-264. DOI: 10.1016/0304-3975(92)90332-A |
0.371 |
|
| 1990 |
Lee P, Kedem ZM. On high-speed computing with a programmable linear array The Journal of Supercomputing. 4: 223-249. DOI: 10.1007/Bf00127833 |
0.436 |
|
| 1988 |
Lee P, Kedem ZM. Synthesizing Linear Array Algorithms from Nested For Loop Algorithms Ieee Transactions On Computers. 37: 1578-1598. DOI: 10.1109/12.9735 |
0.312 |
|
| 1988 |
Buell DA, Carlson DA, Chow YC, Culik K, Deo N, Finkel R, Houstis EN, Jacob Son EM, Kedem ZM, Kowalik JS, Kuekes PJ, Martin JL, Michael GA, Ostlund NS, Potter J, et al. Parallel algorithms and architectures report of a workshop The Journal of Supercomputing. 1: 301-325. DOI: 10.1007/Bf00154341 |
0.361 |
|
| 1985 |
Kedem ZM. Optimal Allocation Of Area For Single-Chip Computations. Siam Journal On Computing. 14: 730-743. DOI: 10.1137/0214053 |
0.356 |
|
| 1985 |
Mohan C, Fussell D, Kedem ZM, Silberschatz A. Lock Conversion in Non-Two-Phase Locking Protocols Ieee Transactions On Software Engineering. 15-22. DOI: 10.1109/Tse.1985.231533 |
0.342 |
|
| 1981 |
Kedem Z, Silberschatz A. A characterization of database graphs admitting a simple locking protocol Acta Informatica. 16: 1-13. DOI: 10.1007/Bf00289586 |
0.329 |
|
| 1980 |
Silberschatz A, Kedem Z. Consistency in Hierarchical Database Systems Journal of the Acm (Jacm). 27: 72-80. DOI: 10.1145/322169.322176 |
0.327 |
|
| 1977 |
Fuchs H, Kedem ZM, Uselton SP. Optimal surface reconstruction from planar contours Communications of the Acm. 20: 693-702. DOI: 10.1145/359842.359846 |
0.342 |
|
| 1975 |
Kirkpatrick DG, Kedem ZM. Addition Requirements for Rational Functions Siam Journal On Computing. 6: 188-199. DOI: 10.1137/0206015 |
0.412 |
|
| Show low-probability matches. |