default search action

combined dblp search
author search
venue search
publication search

ask others

R. K. Mueller

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

1970
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/bstj/MuellerF70
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bstj/MuellerF70
R. K. Mueller, Gerard J. Foschini:
The capacity of linear channels with additive Gaussian noise. Bell Syst. Tech. J. 49(1): 81-94 (1970)
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/Mueller70
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/Mueller70
R. K. Mueller:
Recoverability of signals transmitted over a channel with interference due to independent samples of the input (Corresp.). IEEE Trans. Inf. Theory 16(4): 503-504 (1970)
1965
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/cacm/MuellerC65
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/MuellerC65
R. K. Mueller, Leon Cooper:
A comparison of the primal-simplex and primal-dual algorithms for linear programming. Commun. ACM 8(11): 682-686 (1965)
1956
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/UrbanoM56
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/UrbanoM56
Rocco H. Urbano, R. K. Mueller:
A Topological Method for the Determination of the Minimal Forms of a Boolean Function. IRE Trans. Electron. Comput. 5(3): 126-132 (1956)

Coauthor Index

see FAQ

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.