📄 http:^^www.cs.jhu.edu^~cypher^pubs^pubs.html
字号:
Date: Wed, 15 Jan 1997 00:16:22 GMT
Server: NCSA/1.5.1
Last-modified: Wed, 25 Sep 1996 20:05:26 GMT
Content-type: text/html
Content-length: 17040
<head><title>Robert Cypher - Publications</title></head><body><h1>Robert Cypher - Publications</h1><HR><h3>Papers in Journals:</h3><p><ul><li><cite> Bounds on the Efficiency of Message-Passing Protocols for ParallelComputers</cite>. R. Cypher, S. Konstantinidou, SIAM Journal on Computing (to appear).<UL><!WA0><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA1><a href="http://www.cs.jhu.edu/~cypher/pubs/protocol.html">Abstract</a><!WA2><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA3><a href="http://www.cs.jhu.edu/~cypher/pubs/protocol.ps">Postscript</a></UL><p><li><cite> Fault-Tolerant Meshes with Small Degree</cite>. J. Bruck, R. Cypher, C.T. Ho, SIAM Journal on Computing (to appear).<UL><!WA4><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA5><a href="http://www.cs.jhu.edu/~cypher/pubs/meshsub.html">Abstract</a><!WA6><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA7><a href="http://www.cs.jhu.edu/~cypher/pubs/meshsub.ps">Postscript</a></UL><p><li><cite> A Quantitative Study of Parallel Scientific Applications withExplicit Communication</cite>. R. Cypher, S. Konstantinidou, A. Ho, P. Messina, The Journal of Supercomputing,vol. 10, no. 1, pp. 5-24 (1996).<UL><!WA8><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA9><a href="http://www.cs.jhu.edu/~cypher/pubs/quant.html">Abstract</a><!WA10><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA11><a href="http://www.cs.jhu.edu/~cypher/pubs/quant.ps">Postscript</a></UL><p><li><cite> On the Construction of Fault-Tolerant Cube-Connected Cycles Networks</cite>.J. Bruck, R. Cypher, C.T. Ho, Journal of Parallel and Distributed Computing,vol. 25, pp. 98-106 (1995).<p><li><cite> CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers</cite>. V. Bala, J. Bruck, R. Cypher, P. Elustando, A. Ho, C.T. Ho, S. Kipnis, M. Snir, IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 154-164 (1995).<UL><!WA12><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA13><a href="http://www.cs.jhu.edu/~cypher/pubs/ccl.html">Abstract</a><!WA14><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA15><a href="http://www.cs.jhu.edu/~cypher/pubs/ccl.ps">Postscript</a></UL><p><li><cite> Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes</cite>. J. Bruck, R. Cypher, C.T. Ho, IEEE Transactions on Computers, vol. 44, no. 1, pp. 150-155 (1995).<UL><!WA16><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA17><a href="http://www.cs.jhu.edu/~cypher/pubs/meshwc.html">Abstract</a><!WA18><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA19><a href="http://www.cs.jhu.edu/~cypher/pubs/meshwc.ps">Postscript</a></UL><p><li><cite> The IBM External User Interface for Scalable Parallel Systems</cite>.V. Bala, J. Bruck, R. Bryant, R. Cypher, P. de Jong, P. Elustando, D. Frye,A. Ho, C.T. Ho, G. Irwin, S. Kipnis, R. Lawrence, M. Snir,Parallel Computing, vol. 20, pp. 445-462 (1994).<UL><!WA20><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA21><a href="http://www.cs.jhu.edu/~cypher/pubs/eui.html">Abstract</a><!WA22><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA23><a href="http://www.cs.jhu.edu/~cypher/pubs/eui.ps">Postscript</a></UL><p><li><cite> Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks</cite>. R. Cypher, L. Gravano, IEEE Transactions on Computers, vol. 43, no. 12, pp. 1376-1385 (1994).<UL><!WA24><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA25><a href="http://www.cs.jhu.edu/~cypher/pubs/torus.html">Abstract</a><!WA26><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA27><a href="http://www.cs.jhu.edu/~cypher/pubs/torus.ps">Postscript</a></UL><p><li><cite> Requirements for Deadlock-Free, Adaptive Packet Routing</cite>. R. Cypher, L. Gravano, SIAM Journal on Computing, vol. 23, no. 6, pp. 1266-1274 (1994).<UL><!WA28><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA29><a href="http://www.cs.jhu.edu/~cypher/pubs/require.html">Abstract</a><!WA30><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA31><a href="http://www.cs.jhu.edu/~cypher/pubs/require.ps">Postscript</a></UL><p><li><cite> Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes</cite>.J. Bruck, R. Cypher, D. Soroker, IEEE Transactions on Computers, vol. 43, no. 10, pp. 1210-1220 (1994).<p><li><cite> Tolerating Faults in a Mesh with a Row of Spare Nodes</cite>.J. Bruck, R. Cypher, C.T. Ho, Theoretical Computer Science, vol. 128, pp. 241-252 (1994).<p><li><cite> Fault-Tolerant de Bruijn and Shuffle-Exchange Networks</cite>. J. Bruck, R. Cypher, C.T. Ho, IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 5, pp. 548-553 (1994).<p><li><cite> Deterministic Sorting in Nearly Logarithmic Time on the Hypercube andRelated Computers</cite>. R. Cypher, G. Plaxton, Journal of Computer and System Sciences, Special Issue for STOC 1990, vol. 47, pp. 501-548 (1993).<UL><!WA32><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA33><a href="http://www.cs.jhu.edu/~cypher/pubs/sharesort.html">Abstract</a><!WA34><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA35><a href="http://www.cs.jhu.edu/~cypher/pubs/sharesort.ps">Postscript</a></UL><p><li><cite> Theoretical Aspects of VLSI Pin Limitations</cite>.R. Cypher, SIAM Journal on Computing, vol. 22, no. 2, pp. 356-378 (1993).<p><li><cite> A Lower Bound on the Size of Shellsort Sorting Networks</cite>.R. Cypher, SIAM Journal on Computing, vol. 22, no. 1, pp. 62-71 (1993).<p><li><cite> Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares</cite>.J. Bruck, R. Cypher, C.T. Ho, IEEE Transactions on Computers, vol. 42,no. 9, pp. 1089-1104 (1993).<p><li><cite> Area-Efficient Architectures for the Viterbi Algorithm - Part II: Applications</cite>.B. Shung, H. Lin, R. Cypher, P. Siegel, H. Thapar, IEEE Transactions on Communications, vol. 41, no. 5, pp. 802-807 (1993).<p><li><cite> Area-Efficient Architectures for the Viterbi Algorithm - Part I: Theory</cite>. B. Shung, H. Lin, R. Cypher, P. Siegel, H. Thapar, IEEE Transactions on Communications, vol. 41, no. 4, pp. 636-644 (1993).<p><li><cite> Generalized Trace-Back Techniques for Survivor Memory Management in the Viterbi Algorithm</cite>. R. Cypher, B. Shung, Journal of VLSI Signal Processing, vol. 5, no. 1, pp. 85-94 (1993).<p><li><cite> Tolerating Faults in Hypercubes Using Subcube Partitioning</cite>.J. Bruck, R. Cypher, D. Soroker, IEEE Transactions on Computers, Special Issue on Fault-Tolerant Computing, vol. 41, no. 5, pp. 599-605 (1992).<UL><!WA36><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA37><a href="http://www.cs.jhu.edu/~cypher/pubs/hcnodes.html">Abstract</a><!WA38><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA39><a href="http://www.cs.jhu.edu/~cypher/pubs/hcnodes.ps">Postscript</a></UL><p><li><cite> Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters</cite>.R. Cypher, J. Sanz, Journal of Algorithms, vol. 13, pp. 211-234 (1992).<p><li><cite> Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers</cite>. J. Sanz, R. Cypher, Algorithmica, vol. 7, pp. 77-89 (1992).<p><li><cite> The Hough Transform Has O(N) Complexity on N x N Mesh Connected Computers</cite>. R. Cypher, J. Sanz, L. Snyder, SIAM Journal on Computing, vol. 19, no. 5, pp. 805-820 (1990).<p><li><cite> Algorithms for Image Component Labeling on SIMD Mesh Connected Computers</cite>. R. Cypher, J. Sanz, L. Snyder, IEEE Transactions on Computers, vol. 39,no. 2, pp. 276-281 (1990).<p><li><cite> SIMD Architectures and Algorithms for Image Processing and Computer Vision</cite>. R. Cypher, J. Sanz, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 12, pp. 2158-2174 (1989).<p><li><cite> Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling</cite>. R. Cypher, J. Sanz, L. Snyder, Journal of Algorithms, vol. 10, pp. 140-150 (1989).<p><li><cite> An EREW PRAM Algorithm for Image Component Labeling</cite>. R. Cypher, J. Sanz, L. Snyder, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 258-261 (1989).<p><li><cite> Apex: Two Architectures for Generating Parametric Curves and Surfaces</cite>. T. DeRose, M. Bailey, B. Barnard, R. Cypher, D. Dobrikin, C. Ebeling, S. Konstantinidou, L. McMurchie, H. Mizrahi, B. Yost, The Visual Computer, vol. 5, no. 5, pp. 264-276 (1989).</ul><p><HR><h3>Papers in Refereed Conferences:</h3><p><ul><li><cite> The Communication Requirements of Mutual Exclusion</cite>.R. Cypher, Proceedings 1995 ACM Symposium on Parallel Algorithms and Architectures, pp. 147-156.<UL><!WA40><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA41><a href="http://www.cs.jhu.edu/~cypher/pubs/mutex.html">Abstract</a><!WA42><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA43><a href="http://www.cs.jhu.edu/~cypher/pubs/mutex.ps">Postscript</a></UL><p><li><cite> Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary Networks</cite>.R. Cypher, Proceedings 1995 IEEE Symposium on Parallel and DistributedProcessing, pp. 122-129.<UL><!WA44><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA45><a href="http://www.cs.jhu.edu/~cypher/pubs/db.html">Abstract</a><!WA46><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm"><!WA47><a href="http://www.cs.jhu.edu/~cypher/pubs/db.ps">Postscript</a></UL><p><li><cite> Efficient Race Detection for Message-Passing Programs with NonblockingSends and Receives</cite>. R. Cypher, E. Leu, Proceedings 1995 IEEE Symposium on Parallel and DistributedProcessing, pp. 534-541.<UL><!WA48><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm"><!WA49><a href="http://www.cs.jhu.edu/~cypher/pubs/race.html">⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -