David K. Garnick

According to our database, David K. Garnick authored at least 8 papers between 1987 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1996

Holey factorizations.

Jeffrey H. Dinitz, David K. Garnick

Ars Comb., 1996

1995

Total domination of the m×n chessboard by kings, crosses and knights.

David K. Garnick, N. A. Nieuwejaar

Ars Comb., 1995

The irregularity Strength of m \times n grids for m, n>= 18.

David K. Garnick

Ars Comb., 1995

1993

Extremal graphs without three-cycles or four-cycles.

David K. Garnick, Y. H. Harris Kwong, Felix Lazebnik

J. Graph Theory, 1993

1992

On the irregularity strength of the <i>m</i> × <i>n</i> grid.

Jeffrey H. Dinitz, David K. Garnick, András Gyárfás

J. Graph Theory, 1992

1991

A Breadth-First Introductory Curriculum in Computing.

Allen B. Tucker, David K. Garnick

Comput. Sci. Educ., 1991

1988

Locality in distributed computations.

David K. Garnick, A. Toni Cohen

Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987

Timestamping in Virtual Time Systems.

David K. Garnick, A. Toni Cohen, H. A. Sowizrai

Proceedings of the Temporal Aspects in Information Systems, 1987