default search action
Robert Cypher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j31]Shailender Chaudhry, Robert Cypher, Magnus Ekman, Martin Karlsson, Anders Landin, Sherman Yip, Håkan Zeffer, Marc Tremblay:
Rock: A High-Performance Sparc CMT Processor. IEEE Micro 29(2): 6-16 (2009) - [c34]Shailender Chaudhry, Robert Cypher, Magnus Ekman, Martin Karlsson, Anders Landin, Sherman Yip, Håkan Zeffer, Marc Tremblay:
Simultaneous speculative threading: a novel pipeline architecture implemented in sun's rock processor. ISCA 2009: 484-495 - 2005
- [c33]Ishwar Parulkar, Robert Cypher:
Trends and Trade-Offs in Designing Highly Robust Throughput Computing Oriented Chips and Systems. IOLTS 2005: 74-77 - 2000
- [j30]Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan:
On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. Theory Comput. Syst. 33(5/6): 393-426 (2000)
1990 – 1999
- 1998
- [c32]Ambrose Kofi Laing, Robert Cypher:
Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method. SPAA 1998: 55-66 - 1997
- [j29]Jehoshua Bruck
, Robert Cypher, Ching-Tien Ho:
Fault-Tolerant Meshes with Small Degree. SIAM J. Comput. 26(6): 1764-1784 (1997) - [c31]Robert Cypher, Ambrose Kofi Laing:
Gracefully Degradable Pipeline Networks. IPPS 1997: 55-64 - 1996
- [j28]Robert Cypher, Smaragda Konstantinidou:
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers. SIAM J. Comput. 25(5): 1082-1104 (1996) - [j27]Robert Cypher, Alex Ho, Smaragda Konstantinidou, Paul Messina:
A quantitative study of parallel scientific applications with explicit communication. J. Supercomput. 10(1): 5-24 (1996) - [c30]Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking:
Universal Algorithms for Store-and-Forward and Wormhole Routing. STOC 1996: 356-365 - 1995
- [j26]Jehoshua Bruck
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks. J. Parallel Distributed Comput. 25(1): 98-106 (1995) - [j25]Jehoshua Bruck
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes. IEEE Trans. Computers 44(1): 150-155 (1995) - [j24]Vasanth Bala, Jehoshua Bruck
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers. IEEE Trans. Parallel Distributed Syst. 6(2): 154-164 (1995) - [c29]Robert Cypher:
The Communication Requirements of Mutual Exclusion. SPAA 1995: 147-156 - [c28]Robert Cypher:
Minimal, deadlock-free routing in hypercubic and arbitrary networks. SPDP 1995: 122-129 - [c27]Robert Cypher, Eric Leu:
Efficient race detection for message-passing programs with nonblocking sends and receives. SPDP 1995: 534-541 - 1994
- [b1]Robert Cypher, Jorge L. C. Sanz:
The SIMD Model of parallel computation. Springer 1994, ISBN 978-0-387-94139-4, pp. I-V, 1-149 - [j23]Vasanth Bala, Jehoshua Bruck
The IBM External User Interface for Scalable Parallel Systems. Parallel Comput. 20(4): 445-462 (1994) - [j22]Robert Cypher, Luis Gravano:
Requirements for Deadlock-Free, Adaptive Packet Routing. SIAM J. Comput. 23(6): 1266-1274 (1994) - [j21]Jehoshua Bruck
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes. IEEE Trans. Computers 43(10): 1210-1220 (1994) - [j20]Robert Cypher, Luis Gravano:
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks. IEEE Trans. Computers 43(12): 1376-1385 (1994) - [j19]Jehoshua Bruck
Tolerating Faults in a Mesh with a Row of Spare Nodes. Theor. Comput. Sci. 128(1&2): 241-252 (1994) - [j18]Jehoshua Bruck
Fault-Tolerant de Bruijn and Shuffle-Exchange Networks. IEEE Trans. Parallel Distributed Syst. 5(5): 548-553 (1994) - [c26]Robert Cypher, Eric Leu:
The Semantics of Blocking and Nonblocking Send and Receive Primitives. IPPS 1994: 729-735 - [c25]Vasanth Bala, Shlomo Kipnis, Marc Snir, Jehoshua Bruck
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers. IPPS 1994: 835-844 - [c24]Robert Cypher, Eric Leu:
Repeatable and Portable Message-Passing Programs. PODC 1994: 22-31 - 1993
- [j17]Robert Cypher, C. Greg Plaxton:
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. J. Comput. Syst. Sci. 47(3): 501-548 (1993) - [j16]Robert Cypher:
A Lower Bound on the Size of Shellsort Sorting Networks. SIAM J. Comput. 22(1): 62-71 (1993) - [j15]Robert Cypher:
Theoretical Aspects of VLSI Pin Limitations. SIAM J. Comput. 22(2): 356-378 (1993) - [j14]Jehoshua Bruck
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares. IEEE Trans. Computers 42(9): 1089-1104 (1993) - [j13]C. Bernard Shung, Horng-Dar Lin, Robert Cypher, Paul H. Siegel, Hemant K. Thapar:
Area-efficient architectures for the Viterbi algorithm. I. Theory. IEEE Trans. Commun. 41(4): 636-644 (1993) - [j12]C. Bernard Shung, Horng-Dar Lin, Robert Cypher, Paul H. Siegel, Hemant K. Thapar:
Area-efficient architectures for the Viterbi algorithm II. Applications. IEEE Trans. Commun. 41(5): 802-807 (1993) - [j11]Robert Cypher, C. Bernard Shung:
Generalized trace-back techniques for survivor memory management in the Viterbi algorithm. J. VLSI Signal Process. 5(1): 85-94 (1993) - [c23]Jehoshua Bruck, Robert Cypher, Ching-Tien Ho:
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hybercubes. FTCS 1993: 260-267 - [c22]Robert Cypher, Alex Ho, Smaragda Konstantinidou, Paul Messina:
Architectural Requirements of Parallel Scientific Applications with Explicit Communication. ISCA 1993: 2-13 - [c21]Jehoshua Bruck
Fault-Tolerant Meshes with Small Degree. SPAA 1993: 1-10 - [c20]Robert Cypher, Smaragda Konstantinidou:
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers. SPAA 1993: 173-181 - 1992
- [j10]Jorge L. C. Sanz, Robert Cypher:
Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers. Algorithmica 7(1): 77-89 (1992) - [j9]Robert Cypher, Jorge L. C. Sanz:
Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters. J. Algorithms 13(2): 211-234 (1992) - [j8]Jehoshua Bruck
Tolerating Faults in Hypercubes Using Subcube Partitioning. IEEE Trans. Computers 41(5): 599-605 (1992) - [c19]Miklós Ajtai, Noga Alon, Jehoshua Bruck
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths. FOCS 1992: 693-702 - [c18]Jehoshua Bruck
Efficient Fault-Tolerant Mesh and Hypercube Architectures. FTCS 1992: 162-169 - [c17]Jehoshua Bruck, Robert Cypher, Ching-Tien Ho:
Fault-Tolerant de Bruijn and Shuffle-Exchange Networks. ICPP (3) 1992: 46-50 - [c16]Robert Cypher, Luis Gravano:
Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage. ICPP (3) 1992: 204-211 - [c15]Robert Cypher, Luis Gravano:
Requirements for Deadlock-Free, Adaptive Packet Routing. PODC 1992: 25-33 - [c14]Jehoshua Bruck, Robert Cypher, Ching-Tien Ho:
Tolerating Faults in a Mesh with a Row of Spare Nodes. SPDP 1992: 12-19 - [c13]Alexander Wang, Robert Cypher:
Fault-Tolerant Embeddings of Rings, Meshes, and Tori in Hypercubes. SPDP 1992: 20-29 - [c12]Jehoshua Bruck
Multiple Message Broadcasting wiht Generalized Fibonacci Trees. SPDP 1992: 424-431 - [c11]Robert Cypher, Jorge L. C. Sanz:
Hierarchical Shuffle-Exchange and de Bruijn Networks. SPDP 1992: 491-496 - 1991
- [j7]Jehoshua Bruck, Robert Cypher, Danny Soroker:
Running algorithms efficiently on faulty hypercubes (extended abstract). SIGARCH Comput. Archit. News 19(1): 89-96 (1991) - [c10]Melanie L. Fulgham, Robert Cypher, Jorge L. C. Sanz:
A Comparison of SIMD Hypercube Routing Strategies. ICPP (3) 1991: 236-243 - [c9]Jehoshua Bruck, Robert Cypher, Ching-Tien Ho:
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks. ICPP (1) 1991: 692-693 - [c8]Alexander Wang, Robert Cypher, Ernst W. Mayr:
Embedding complete binary trees in faulty hypercubes. SPDP 1991: 112-119 - [c7]Jehoshua Bruck
Fault-tolerant meshes with minimal numbers of spares. SPDP 1991: 288-295 - 1990
- [j6]Robert Cypher, Jorge L. C. Sanz, L. Snyder:
The Hough Transform has O(N) Complexity on N x N Mesh Connected Computers. SIAM J. Comput. 19(5): 805-820 (1990) - [j5]Robert Cypher, Jorge L. C. Sanz, L. Snyder:
Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers. IEEE Trans. Computers 39(2): 276-281 (1990) - [c6]Jehoshua Bruck, Robert Cypher, Danny Soroker:
Running Algorithms Efficiently on Faulty Hypercubes. SPAA 1990: 37-44 - [c5]Robert Cypher, C. Greg Plaxton:
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. STOC 1990: 193-203
1980 – 1989
- 1989
- [j4]Robert Cypher, Jorge L. C. Sanz, L. Snyder:
Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling. J. Algorithms 10(1): 140-150 (1989) - [j3]Robert Cypher, Jorge L. C. Sanz, L. Snyder:
An EREW PRAM Algorithm for Image Component Labeling. IEEE Trans. Pattern Anal. Mach. Intell. 11(3): 258-262 (1989) - [j2]Robert Cypher, Jorge L. C. Sanz:
SIMD architectures and algorithms for image processing and computer vision. IEEE Trans. Acoust. Speech Signal Process. 37(12): 2158-2174 (1989) - [j1]Tony DeRose, Mary L. Bailey, Bill Barnard, Robert Cypher, David Dobrikin, Carl Ebeling, Smaragda Konstantinidou, Larry McMurchie, Haim Mizrahi, Bill Yost:
Apex: two architectures for generating parametric curves and surfaces. Vis. Comput. 5(5): 264-276 (1989) - [c4]Robert Cypher:
A Lower Bound on the Size of Shellsort Networks. SPAA 1989: 58-63 - 1988
- [c3]Robert Cypher, Jorge L. C. Sanz:
Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers. AWOC 1988: 456-464 - [c2]Jorge L. C. Sanz, Robert Cypher:
Algorithms for massively parallel image processing architectures. ICPR 1988: 412-419 - 1987
- [c1]Robert Cypher, Jorge L. C. Sanz, L. Snyder:
Practical Algorithms for Image Component Labeling on SIMD Mesh Connected Computers. ICPP 1987: 772-779
Coauthor Index
aka: Ching-Tien Ho
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: