default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin L. Mallows
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c8]J. Jenny Li, Colin L. Mallows, Jim Landwehr:
Capacity Evaluation of Multi-modal Network Notification Service. COMPSAC 2012: 62-71- 2011
- [r1]Colin L. Mallows:
Cp Statistic. International Encyclopedia of Statistical Science 2011: 321 - 2010
- [j25]Steve Butler, Ronald L. Graham, Gerhard Guettler, Colin L. Mallows:
Irreducible Apollonian Configurations and Packings. Discret. Comput. Geom. 44(3): 487-507 (2010)
2000 – 2009
- 2008
- [j24]Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Daniel J. Velleman:
Editor's Endnotes. Am. Math. Mon. 115(8): 769-770 (2008) - [j23]Siddhartha R. Dalal, Colin L. Mallows:
Optimal Stopping With Exact Confidence on Remaining Defects. Technometrics 50(3): 397-406 (2008) - [c7]Gerhard Guettler, Colin L. Mallows:
A generalization of Apollonian packing of circles. CCCG 2008 - [c6]Stanko Dimitrov
, Parameshwaran Krishnan, Colin L. Mallows, Jean Meloche, Shalini Yajnik:
r3: Resilient Random Regular Graphs. DISC 2008: 137-151 - 2007
- [j22]Jon Louis Bentley, Colin L. Mallows, Richard Stong:
Learning from Experience: 11178. Am. Math. Mon. 114(6): 549-550 (2007) - [j21]Lorraine Denby, Jim Landwehr, Colin L. Mallows, Jean Meloche, John Tuck, Bowei Xi, George Michailidis, Vijayan N. Nair:
Statistical Aspects of the Analysis of Data Networks. Technometrics 49(3): 318-334 (2007) - 2006
- [j20]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings. Discret. Comput. Geom. 35(1): 1-36 (2006) - [j19]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions. Discret. Comput. Geom. 35(1): 37-72 (2006) - [j18]Colin L. Mallows:
Tukey's Paper After 40 Years. Technometrics 48(3): 319-325 (2006) - [c5]Jon Louis Bentley, Colin L. Mallows:
CAPTCHA challenge strings: problems and improvements. DRR 2006: 60670H - 2005
- [j17]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group. Discret. Comput. Geom. 34(4): 547-585 (2005) - [j16]Jon Louis Bentley, Colin L. Mallows:
Problem 11178. Am. Math. Mon. 112(8): 750 (2005) - [c4]Jon Louis Bentley, Colin L. Mallows:
How Much Assurance Does a PIN Provide? HIP 2005: 111-126 - 2004
- [c3]Parameshwaran Krishnan, A. S. Krishnakumar, Wen-Hua Ju, Colin L. Mallows, Sachin Ganu:
A System for LEASE: Location Estimation Assisted by Stationary Emitters for Indoor RF Wireless Networks. INFOCOM 2004: 1001-1011 - 2003
- [j15]Colin L. Mallows:
Minimizing the expected minimum. Adv. Appl. Math. 31(1): 180-192 (2003) - 2002
- [j14]Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks:
Beyond the Descartes Circle Theorem. Am. Math. Mon. 109(4): 338-361 (2002) - 2000
- [j13]Abram Kagan, Colin L. Mallows, Larry A. Shepp, John H. Lindsey II:
Bernoulli Component of a Sum: 10699. Am. Math. Mon. 107(3): 284 (2000) - [j12]Colin L. Mallows:
Some Comments on Cp. Technometrics 42(1): 87-94 (2000)
1990 – 1999
- 1997
- [c2]I. S. Dunietz, Willa K. Ehrlich, B. D. Szablak, Colin L. Mallows, Anthony Iannino:
Applying Design of Experiments to Software Testing (Experience Report). ICSE 1997: 205-215 - 1995
- [j11]Frank K. Hwang, Colin L. Mallows:
Enumerating Nested and Consecutive Partitions. J. Comb. Theory A 70(2): 323-333 (1995) - [c1]Henry S. Baird, Colin L. Mallows:
High-performance OCR preclassification trees. Document Recognition 1995: 47-53 - 1990
- [j10]Siddhartha R. Dalal, Colin L. Mallows:
Some Graphical Aids for Deciding When to Stop Testing Software. IEEE J. Sel. Areas Commun. 8(2): 169-175 (1990)
1980 – 1989
- 1989
- [j9]Colin L. Mallows:
Identities Satisfied by Iterated Polynomials and (Q, x)-Binomial Coefficients. SIAM J. Discret. Math. 2(3): 366-370 (1989) - [j8]Amir Dembo, Colin L. Mallows, Lawrence A. Shepp:
Embedding nonnegative definite Toeplitz matrices in nonnegative definite circulant matrices, with application to covariance estimation. IEEE Trans. Inf. Theory 35(6): 1206-1212 (1989) - 1985
- [j7]Colin L. Mallows, Larry A. Shepp:
Enumerating pairs of permutations with the same up-down form. Discret. Math. 54(3): 301-311 (1985) - [j6]Colin L. Mallows, Vijayan N. Nair, Larry A. Shepp, Yehuda Vardi:
Optimal Sequential Selection of Secretaries. Math. Oper. Res. 10(4): 709-715 (1985)
1970 – 1979
- 1979
- [j5]Colin L. Mallows:
Baxter Permutations Rise Again. J. Comb. Theory A 27(3): 394-396 (1979) - 1975
- [j4]Colin L. Mallows, Andrew M. Odlyzko, Neil J. A. Sloane:
An upper bound for self-dual codes (Corresp.). IEEE Trans. Inf. Theory 21(1): 115 (1975) - 1974
- [j3]Colin L. Mallows, Neil J. A. Sloane:
Weight enumerators of self-orthogonal codes. Discret. Math. 9(4): 391-400 (1974) - 1973
- [j2]Colin L. Mallows, Neil J. A. Sloane:
An Upper Bound for Self-Dual Codes. Inf. Control. 22(2): 188-200 (1973) - 1972
- [j1]F. Jessie MacWilliams, Colin L. Mallows, Neil J. A. Sloane:
Generalizations of Gleason's theorem on weight enumerators of self-dual codes. IEEE Trans. Inf. Theory 18(6): 794-805 (1972)
Coauthor Index
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-06-10 21:23 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:
