Colin L. Mallows

According to our database1, Colin L. Mallows authored at least 34 papers between 1972 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2012
Capacity Evaluation of Multi-modal Network Notification Service.
Proceedings of the 36th Annual IEEE Computer Software and Applications Conference, 2012

2011
Cp Statistic.
Proceedings of the International Encyclopedia of Statistical Science, 2011

2010
Irreducible Apollonian Configurations and Packings.
Discrete & Computational Geometry, 2010

2008
Optimal Stopping With Exact Confidence on Remaining Defects.
Technometrics, 2008

Editor's Endnotes.
The American Mathematical Monthly, 2008

r3: Resilient Random Regular Graphs.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

A generalization of Apollonian packing of circles.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Statistical Aspects of the Analysis of Data Networks.
Technometrics, 2007

Learning from Experience: 11178.
The American Mathematical Monthly, 2007

2006
Tukey's Paper After 40 Years.
Technometrics, 2006

Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions.
Discrete & Computational Geometry, 2006

Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings.
Discrete & Computational Geometry, 2006

CAPTCHA challenge strings: problems and improvements.
Proceedings of the Document Recognition and Retrieval XIII, 2006

2005
Problem 11178.
The American Mathematical Monthly, 2005

Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group.
Discrete & Computational Geometry, 2005

How Much Assurance Does a PIN Provide?
Proceedings of the Human Interactive Proofs, Second International Workshop, 2005

2004
A System for LEASE: Location Estimation Assisted by Stationary Emitters for Indoor RF Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
Minimizing the expected minimum.
Adv. Appl. Math., 2003

2002
Beyond the Descartes Circle Theorem.
The American Mathematical Monthly, 2002

2000
Some Comments on Cp.
Technometrics, 2000

Bernoulli Component of a Sum: 10699.
The American Mathematical Monthly, 2000

1997
Applying Design of Experiments to Software Testing (Experience Report).
Proceedings of the Pulling Together, 1997

1995
Enumerating Nested and Consecutive Partitions.
J. Comb. Theory, Ser. A, 1995

High-performance OCR preclassification trees.
Proceedings of the Document Recognition II, San Jose, CA, USA, February 5, 1995, 1995

1990
Some Graphical Aids for Deciding When to Stop Testing Software.
IEEE Journal on Selected Areas in Communications, 1990

1989
Embedding nonnegative definite Toeplitz matrices in nonnegative definite circulant matrices, with application to covariance estimation.
IEEE Trans. Information Theory, 1989

Identities Satisfied by Iterated Polynomials and (Q, x)-Binomial Coefficients.
SIAM J. Discrete Math., 1989

1985
Optimal Sequential Selection of Secretaries.
Math. Oper. Res., 1985

Enumerating pairs of permutations with the same up-down form.
Discret. Math., 1985

1979
Baxter Permutations Rise Again.
J. Comb. Theory, Ser. A, 1979

1975
An upper bound for self-dual codes (Corresp.).
IEEE Trans. Information Theory, 1975

1974
Weight enumerators of self-orthogonal codes.
Discret. Math., 1974

1973
An Upper Bound for Self-Dual Codes
Information and Control, March, 1973

1972
Generalizations of Gleason's theorem on weight enumerators of self-dual codes.
IEEE Trans. Information Theory, 1972


  Loading...