Minimal distance lexicographic codes over an infinite alphabet. - David S. Herscovici (IEEE Trans. Inf. Theory, 1991)

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)

The pebbling number of C5 × C5. - David S. Herscovici; Aparna W. Higgins (Discret. Math., 1998)

A Geometric Proof of the Gap Theorem. - David S. Herscovici (J. Comb. Theory A, 1998)

Graham's pebbling conjecture on products of cycles. - David S. Herscovici (J. Graph Theory, 2003)

Course continuity in the Computer Science curriculum. - Richard H. Connelly; Haldun Hadimioglu; David S. Herscovici; Lubomir Ivanov; Mark Hoffman 001 (J. Comput. Sci. Coll., 2005)

Bridging writing to learn and writing in the discipline in computer science education. - Mark E. Hoffman; Timothy T. Dansdill; David S. Herscovici (SIGCSE, 2006)

Graham's pebbling conjecture on products of many cycles. - David S. Herscovici (Discret. Math., 2008)

Exposing GAPS, exploring legacies: paradoxes of writing use in computing education. - Timothy T. Dansdill; Mark E. Hoffman; David S. Herscovici (J. Comput. Sci. Coll., 2008)

Optimal pebbling in products of graphs. - David S. Herscovici; Benjamin D. Hester; Glenn H. Hurlbert (Australas. J Comb., 2011)

Generalizations of Graham's pebbling conjecture. - David S. Herscovici; Benjamin D. Hester; Glenn H. Hurlbert (Discret. Math., 2012)

t-Pebbling and Extensions. - David S. Herscovici; Benjamin D. Hester; Glenn H. Hurlbert (Graphs Comb., 2013)

Using error-correcting codes to construct solvable pebbling distributions. - David S. Herscovici (Discret. Math., 2016)