Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Brian Gluss
1960 – 1969
- 1965
[j8]Brian Gluss: A Note on the Solution of a Communication Jamming Problem of Root. Information and Control 8(2): 233-235 (1965)- 1964
[j7]Brian Gluss: An Alternative Method for Continuous Line Segment Curve-Fitting. Information and Control 7(2): 200-206 (1964)- 1963
[j6]Brian Gluss: Least squares fitting of planes to surfaces using dynamic programming. Commun. ACM 6(4): 172-175 (1963)
[j5]Brian Gluss: A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory. J. ACM 10(1): 89-96 (1963)- 1962
[j4]Brian Gluss: Further remarks on line segment curve-fitting using dynamic programming. Commun. ACM 5(8): 441-443 (1962)
[j3]Brian Gluss: A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information. Information and Control 5(3): 261-267 (1962)
[j2]Brian Gluss: A Note on a Computational Approximation to the Two-Machine Problem. Information and Control 5(3): 268-275 (1962)- 1961
[j1]Richard Bellman, Brian Gluss: On Various Versions of the Defective Coin Problem. Information and Control 4(2-3): 118-131 (1961)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:40 CET by the dblp team



