default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames B. Shearer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j34]James B. Shearer:
Symmetric Golomb Squares. IEEE Trans. Inf. Theory 50(8): 1846-1847 (2004)
1990 – 1999
- 1999
- [j33]James B. Shearer:
Improved LP Lower Bounds for Difference Triangle Sets. Electron. J. Comb. 6 (1999) - 1998
- [j32]Don Coppersmith, James B. Shearer:
New Bounds for Union-free Families of Sets. Electron. J. Comb. 5 (1998) - [j31]James B. Shearer:
Some New Disjoint Golomb Rulers. IEEE Trans. Inf. Theory 44(7): 3151-3153 (1998) - 1997
- [j30]Andrew M. Odlyzko, James B. Shearer, Ryan C. Siders:
Monotonic subsequences in dimensions higher than one. Electron. J. Comb. 4(2) (1997) - 1996
- [j29]James B. Shearer:
A New Construction for Cancellative Families of Sets. Electron. J. Comb. 3(1) (1996) - [j28]Don Coppersmith, Uriel Feige, James B. Shearer:
Random Walks on Regular and Irregular Graphs. SIAM J. Discret. Math. 9(2): 301-308 (1996) - 1995
- [j27]James B. Shearer:
Some New Optimum Golomb Rectangles. Electron. J. Comb. 2 (1995) - [j26]James B. Shearer:
The Independence Number of Dense Graphs with Large Odd Girth. Electron. J. Comb. 2 (1995) - [j25]James B. Shearer:
On the Independence Number of Sparse Graphs. Random Struct. Algorithms 7(3): 269-272 (1995) - 1992
- [j24]James B. Shearer:
A Note on Bipartite Subgraphs of Triangle-Free Graphs. Random Struct. Algorithms 3(2): 223-226 (1992) - 1991
- [j23]James B. Shearer:
A note on the independence number of triangle-free graphs, II. J. Comb. Theory B 53(2): 300-307 (1991) - 1990
- [j22]James B. Shearer:
Some new optimum Golomb rulers. IEEE Trans. Inf. Theory 36(1): 183-184 (1990) - [j21]Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith:
A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6): 1334-1380 (1990)
1980 – 1989
- 1987
- [j20]Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
Ramsey-Sperner theory. Discret. Math. 63(2-3): 143-152 (1987) - [j19]Mark E. Watkins, James B. Shearer:
Counterexamples to two conjectures about distance sequences. Discret. Math. 66(3): 289-298 (1987) - 1986
- [j18]Ramesh C. Agarwal, James W. Cooley, Fred G. Gustavson, James B. Shearer, Gordon Slishman, Bryant Tuckerman:
New Scalar and Vector Elementary Functions for the IBM System/370. IBM J. Res. Dev. 30(2): 126-144 (1986) - [j17]Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer:
An application of number theory to the organization of raster-graphics memory. J. ACM 33(1): 86-104 (1986) - [j16]Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
k-Color Sperner theorems. J. Comb. Theory A 42(1): 31-54 (1986) - [j15]James B. Shearer:
Lower bounds for small diagonal ramsey numbers. J. Comb. Theory A 42(2): 302-304 (1986) - [j14]Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer:
Some intersection theorems for ordered sets and graphs. J. Comb. Theory A 43(1): 23-37 (1986) - 1985
- [j13]James B. Shearer:
On a problem of spencer. Comb. 5(3): 241-245 (1985) - 1983
- [j12]James B. Shearer:
A note on the independence number of triangle-free graphs. Discret. Math. 46(1): 83-87 (1983) - [j11]Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Tightest Packing of Sums of Vectors. Eur. J. Comb. 4(3): 231-236 (1983) - [j10]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. J. Comb. Theory A 34(2): 123-139 (1983) - 1982
- [j9]Frank W. Barnes, James B. Shearer:
Barring Rectangles from the Plane. J. Comb. Theory A 33(1): 9-29 (1982) - [j8]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions. J. Comb. Theory A 33(2): 167-185 (1982) - 1981
- [j7]Daniel J. Kleitman, James B. Shearer, Dean Sturtevant:
Intersections of k-element sets. Comb. 1(4): 381-384 (1981) - [j6]Fan R. K. Chung, Ronald L. Graham, James B. Shearer:
Universal caterpillars. J. Comb. Theory B 31(3): 348-355 (1981) - 1980
- [j5]James B. Shearer:
A note on circular dimension. Discret. Math. 29(1): 103 (1980) - [j4]Daniel J. Kleitman, James B. Shearer:
Further gossip problems. Discret. Math. 30(2): 151-156 (1980) - [j3]Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant:
Reconstruction of a Pair of Graphs from their Concatenations. SIAM J. Algebraic Discret. Methods 1(2): 228-231 (1980)
1970 – 1979
- 1979
- [j2]James B. Shearer:
A simple counterexample to a conjecture of Rota. Discret. Math. 28(3): 327-330 (1979) - 1977
- [j1]James B. Shearer, Robert J. McEliece:
There is no MacWilliams identity for convolutional codes (Corresp.). IEEE Trans. Inf. Theory 23(6): 775-776 (1977)
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: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
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:
