| 2000 | ||
|---|---|---|
| j12 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics 100(1-2): 1-15 (2000) | |
| 1997 | ||
| j11 | Amotz Bar-Noy, Shlomo Kipnis: Multiple message broadcasting in the postal model. Networks 29(1): 1-10 (1997) | |
| j10 | Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby: Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems. IEEE Trans. Parallel Distrib. Syst. 8(11): 1143-1156 (1997) | |
| 1995 | ||
| j9 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: optimal Computation of Census Functions in the Postal Model. Discrete Applied Mathematics 58(3): 213-222 (1995) | |
| j8 | Vasanth Bala, Jehoshua Bruck, Robert Cypher, Pablo Elustondo, Alex Ho, Ching-Tien Ho, Shlomo Kipnis, Marc Snir: CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers. IEEE Trans. Parallel Distrib. Syst. 6(2): 154-164 (1995) | |
| j7 | Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber: Computing Global Combine Operations in the Multiport Postal Model. IEEE Trans. Parallel Distrib. Syst. 6(8): 896-900 (1995) | |
| 1994 | ||
| j6 | Amotz Bar-Noy, Shlomo Kipnis: Broadcasting Multiple Messages in Simultaneous Send/receive Systems. Discrete Applied Mathematics 55(2): 95-105 (1994) | |
| j5 | Amotz Bar-Noy, Shlomo Kipnis: Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. Mathematical Systems Theory 27(5): 431-452 (1994) | |
| j4 | Vasanth Bala, Jehoshua Bruck, Raymond Bryant, Robert Cypher, Peter de Jong, Pablo Elustondo, Daniel D. Frye, Alex Ho, Ching-Tien Ho, Gail Irwin, Shlomo Kipnis, Richard D. Lawrence, Marc Snir: The IBM External User Interface for Scalable Parallel Systems. Parallel Computing 20(4): 445-462 (1994) | |
| j3 | Shlomo Kipnis: Analysis of Asynchronous Binary Arbitration on Digital Transmission-Line Busses. IEEE Trans. Computers 43(4): 484-489 (1994) | |
| c10 | Vasanth Bala, Shlomo Kipnis, Marc Snir, Jehoshua Bruck, Robert Cypher, Pablo Elustondo, Alex Ho, Ching-Tien Ho: CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers. IPPS 1994: 835-844 | |
| c9 | Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby: Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems. SPAA 1994: 298-309 | |
| 1993 | ||
| j2 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: An Optimal Algorithm for computing Census Functions in Message-Passing Systems. Parallel Processing Letters 3: 19-23 (1993) | |
| c8 | ||
| c7 | Vasanth Bala, Shlomo Kipnis: Process Groups: A Mechanism for the Coordination of and Communication Among Processes in the Venus Collective Communication Library. IPPS 1993: 614-620 | |
| c6 | Vasanth Bala, Shlomo Kipnis, Larry Rudolph, Marc Snir: Designing Efficient, Scalable, and Portable Collective Communication Libraries. PPSC 1993: 862-872 | |
| c5 | Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber: Computing Global Combine Operations in the Multi-Port Postal Model. SPDP 1993: 336-343 | |
| c4 | Amotz Bar-Noy, Shlomo Kipnis: Broadcasting Multiple Messages in Simultaneous Send/Receive Systems. SPDP 1993: 344-347 | |
| 1992 | ||
| c3 | Shlomo Kipnis: Analysis of Asynchronous Binary Arbitration on Digital-Transmission-Line Busses. ICCD 1992: 401-406 | |
| c2 | Amotz Bar-Noy, Shlomo Kipnis: Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. SPAA 1992: 13-22 | |
| 1990 | ||
| j1 | Joe Kilian, Shlomo Kipnis, Charles E. Leiserson: The Organization of Permutation Architectures with Bused Interconnections. IEEE Trans. Computers 39(11): 1346-1358 (1990) | |
| 1987 | ||
| c1 | Joe Kilian, Shlomo Kipnis, Charles E. Leiserson: The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract). FOCS 1987: 305-315 | |
Colors in the list of coauthors
Last update Tue May 21 19:38:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page