David S. Herscovici

According to our database, David S. Herscovici authored at least 11 papers between 1991 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

Using error-correcting codes to construct solvable pebbling distributions.

David S. Herscovici

Discret. Math., 2016

2013

t-Pebbling and Extensions.

David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert

Graphs Comb., 2013

2012

Generalizations of Graham's pebbling conjecture.

David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert

Discret. Math., 2012

2011

Optimal pebbling in products of graphs.

David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert

Australas. J Comb., 2011

2008

Graham's pebbling conjecture on products of many cycles.

David S. Herscovici

Discret. Math., 2008

2006

Bridging writing to learn and writing in the discipline in computer science education.

Mark E. Hoffman, Timothy Dansdill, David S. Herscovici

Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, 2006

2003

Graham's pebbling conjecture on products of cycles.

David S. Herscovici

J. Graph Theory, 2003

1998

A Geometric Proof of the Gap Theorem.

David S. Herscovici

J. Comb. Theory, Ser. A, 1998

The pebbling number of C₅ × C₅.

David S. Herscovici, Aparna W. Higgins

Discret. Math., 1998

1997

Average an Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions.

Jon T. Butler, David S. Herscovici, Tsutomu Sasao, Robert J. Barton III

IEEE Trans. Computers, 1997

1991

Minimal distance lexicographic codes over an infinite alphabet.

David S. Herscovici

IEEE Trans. Inf. Theory, 1991