James B. Shearer

According to our database1, James B. Shearer authored at least 34 papers between 1977 and 2004.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2004
Symmetric Golomb Squares.
IEEE Trans. Inf. Theory, 2004

1999
Improved LP Lower Bounds for Difference Triangle Sets.
Electron. J. Comb., 1999

1998
Some New Disjoint Golomb Rulers.
IEEE Trans. Inf. Theory, 1998

New Bounds for Union-free Families of Sets.
Electron. J. Comb., 1998

1997
Monotonic subsequences in dimensions higher than one.
Electron. J. Comb., 1997

1996
Random Walks on Regular and Irregular Graphs.
SIAM J. Discret. Math., 1996

A New Construction for Cancellative Families of Sets.
Electron. J. Comb., 1996

1995
On the Independence Number of Sparse Graphs.
Random Struct. Algorithms, 1995

The Independence Number of Dense Graphs with Large Odd Girth.
Electron. J. Comb., 1995

Some New Optimum Golomb Rectangles.
Electron. J. Comb., 1995

1992
A Note on Bipartite Subgraphs of Triangle-Free Graphs.
Random Struct. Algorithms, 1992

1991
A note on the independence number of triangle-free graphs, II.
J. Comb. Theory, Ser. B, 1991

1990
Some new optimum Golomb rulers.
IEEE Trans. Inf. Theory, 1990

A new table of constant weight codes.
IEEE Trans. Inf. Theory, 1990

1987
Counterexamples to two conjectures about distance sequences.
Discret. Math., 1987

Ramsey-Sperner theory.
Discret. Math., 1987

1986
Lower bounds for small diagonal ramsey numbers.
J. Comb. Theory, Ser. A, 1986

<i>k</i>-Color Sperner theorems.
J. Comb. Theory, Ser. A, 1986

Some intersection theorems for ordered sets and graphs.
J. Comb. Theory, Ser. A, 1986

An application of number theory to the organization of raster-graphics memory.
J. ACM, 1986

New Scalar and Vector Elementary Functions for the IBM System/370.
IBM J. Res. Dev., 1986

1985
On a problem of spencer.
Comb., 1985

1983
On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences.
J. Comb. Theory, Ser. A, 1983

On the Tightest Packing of Sums of Vectors.
Eur. J. Comb., 1983

A note on the independence number of triangle-free graphs.
Discret. Math., 1983

1982
On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions.
J. Comb. Theory, Ser. A, 1982

Barring Rectangles from the Plane.
J. Comb. Theory, Ser. A, 1982

1981
Universal caterpillars.
J. Comb. Theory, Ser. B, 1981

Intersections of k-element sets.
Comb., 1981

1980
Reconstruction of a Pair of Graphs from their Concatenations.
SIAM J. Algebraic Discret. Methods, 1980

A note on circular dimension.
Discret. Math., 1980

Further gossip problems.
Discret. Math., 1980

1979
A simple counterexample to a conjecture of Rota.
Discret. Math., 1979

1977
There is no MacWilliams identity for convolutional codes (Corresp.).
IEEE Trans. Inf. Theory, 1977


  Loading...