![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Bruce W. Arden
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
- [j23]K. Wendy Tang, Bruce W. Arden:
Class-Congruence Property and Two-Phase Routing of Borel Cayley Graphs. IEEE Trans. Computers 44(12): 1462-1468 (1995) - 1993
- [j22]K. Wendy Tang, Bruce W. Arden:
Representations of Borel Cayley Graphs. SIAM J. Discret. Math. 6(4): 655-676 (1993) - [j21]Abdou Youssef, Bruce W. Arden:
Functional and Topological Relations Among Banyan Multistage Networks of Differing Switch Sizes. IEEE Trans. Parallel Distributed Syst. 4(2): 235-240 (1993) - 1992
- [j20]Abdou Youssef, Bruce W. Arden:
Topology of efficiently controllable Banyan multistage networks. Microprocess. Microsystems 16(1): 3-13 (1992) - [c13]K. Wendy Tang, Bruce W. Arden:
Vertex-transitivity and routing for Cayley graphs in GCR representations. SAC 1992: 1180-1187 - 1991
- [j19]Bruce W. Arden, K. Wendy Tang:
Representations and routing for Cayley graphs [computer networks]. IEEE Trans. Commun. 39(11): 1533-1537 (1991) - 1990
- [j18]Abdou Youssef, Bruce W. Arden:
Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks. IEEE Trans. Computers 39(6): 829-832 (1990) - [c12]Bruce W. Arden, Kit-Ming W. Tang:
Routing for Generalized Chordal Rings. ACM Conference on Computer Science 1990: 271-275 - [c11]Abdou Youssef, Bruce W. Arden:
Structure of Digit Permutation Networks. ICPP (1) 1990: 581-582 - [c10]Abdou Youssef, Bruce W. Arden:
A New Approach to Fast Control of r2 x r2 3-Stage Benes Networks of r x r Crossbar Switches. ISCA 1990: 50-59 - [c9]Abdou Youssef, Bruce W. Arden:
Topology of Efficiently Controllable Banyan Multistage Networks. SPDP 1990: 79-86
1980 – 1989
- 1989
- [j17]Toshio Nakatani, Shing-Tsaan Huang, Bruce W. Arden, Satish K. Tripathi:
K-Way Bitonic Sort. IEEE Trans. Computers 38(2): 283-288 (1989) - 1986
- [j16]Bruce W. Arden:
GAT: An Early Compiler and Operating System. IEEE Ann. Hist. Comput. 8(1): 56-58 (1986) - 1985
- [j15]John Tartar, Bruce W. Arden, Taylor L. Booth, Peter J. Denning, Raymond E. Miller, Andries van Dam:
1984 Snowbird Report: Future Issues in Computer Science. Computer 18(5): 101-105 (1985) - 1983
- [c8]Bruce W. Arden, Ran Ginosar:
Performance evaluation of the MP/C. AFIPS National Computer Conference 1983: 539-555 - 1982
- [j14]Bruce W. Arden, Hikyu Lee:
A Regular Network for Multicomputer Systems. IEEE Trans. Computers 31(1): 60-69 (1982) - [j13]Bruce W. Arden, Ran Ginosar:
MP/C: A Multiprocessor/Computer Architecture. IEEE Trans. Computers 31(5): 455-473 (1982) - 1981
- [j12]Bruce W. Arden, Hikyu Lee:
Analysis of Chordal Ring Network. IEEE Trans. Computers 30(4): 291-295 (1981) - [c7]Bruce W. Arden, Ran Ginosar:
MP/C: A Multiprocessor/Computer Architecture. ISCA 1981: 3-20 - [c6]Bruce W. Arden, Ran Ginosar:
A Single-Relation Module for a Data Base Machine. ISCA 1981: 227-238
1970 – 1979
- 1979
- [c5]Bruce W. Arden, Hikyu Lee:
Modeling regular, process - structured networks. MARK 1979: 95-102 - 1976
- [j11]Bruce W. Arden:
The Computer Science and Engineering Research Study (COSERS). Commun. ACM 19(12): 670-673 (1976) - 1975
- [c4]Bruce W. Arden, Alan D. Berenbaum:
A Multi-Microprocessor Computer System Architecture. SOSP 1975: 114-121 - 1971
- [c3]Bruce W. Arden, Larry K. Flanigan, Bernard A. Galler:
An Advanced System Programming Course. IFIP Congress (2) 1971: 1510-1514
1960 – 1969
- 1969
- [j10]Bruce W. Arden:
The role of programming in a Ph.D. computer science program. Commun. ACM 12(1): 31-38 (1969) - [j9]Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
The MAD definition facility. Commun. ACM 12(8): 432-439 (1969) - [c2]Bruce W. Arden, Donald W. Boettner:
Measurement and performance of a multiprogramming system. SOSP 1969: 130-146 - 1966
- [j8]Bruce W. Arden, Bernard A. Galler, T. C. O'Brien, F. H. Westervelt:
Program and Addressing Structure in a Time-Sharing Environment. J. ACM 13(1): 1-16 (1966) - 1964
- [j7]Bruce W. Arden:
On introducing digital computing. Commun. ACM 7(4): 212-214 (1964) - 1962
- [j6]Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
An Algorithm for Translating Boolean Expressions. J. ACM 9(2): 222-239 (1962) - 1961
- [j5]Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
The internal organization of the MAD translator. Commun. ACM 4(1): 28-31 (1961) - [j4]Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
Letter to the editor: criticisms of ALGOL 60. Commun. ACM 4(7): 309 (1961) - [j3]Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
An algorithm for equivalence declarations. Commun. ACM 4(7): 310-314 (1961) - 1960
- [j2]Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
Letters. Commun. ACM 3(6): 13 (1960)
1950 – 1959
- 1959
- [j1]Bruce W. Arden, Robert M. Graham:
On GAT and the Construction of Translators. Commun. ACM 2(7): 24-26 (1959) - [c1]Bruce W. Arden:
On the construction of algorithm translators. ACM National Meeting 1959: 1:1-1:4
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint