Nachum Dershowitz

PUBLICATIONS ON COMBINATORICS

  1. Nachum Dershowitz, December 2016, “Touchard's Drunkard”, Journal of Integer Sequences, vol. 20, art. 17.1.5; December 2016, “Touchard's Drunkard”, informal arXiv publication, arXiv:1612.04076 [cs.DM].
  2. Arnon Avron and Nachum Dershowitz, August-September 2016, “Cayley's Formula: A Page from The Book” (Note), American Mathematical Monthly (AMM), vol. 123, no. 7, pp. 699-700.
  3. Nachum Dershowitz, August 2016, “1700 Forests”, informal arXiv publication, arXiv:1608.08740 [cs.LO].
  4. Nachum Dershowitz and Christian Rinderknecht, June 2015, “The Average Height of Catalan Trees by Counting Lattice Paths”, Mathematics Magazine, vol. 88, no. 3, pp. 187-195; 2015, Preprint”, The On-Line Encyclopedia of Integer Sequences; “A Purely Combinatorial Derivation of the Average Height of Catalan Trees”, Mathematics Magazine, online supplement.
  5. Nachum Dershowitz and Shmuel Zaks, Jan. 2009, “More Patterns in Trees: Up and Down, Young and Old, Odd and Even”, SIAM J. on Discrete Mathematics, vol. 23, no. 1, pp. 447-465. Previous version: May 2007, Abstract, 1st Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), Banff, Alberta, Canada.
  6. Nachum Dershowitz and E. Castedo Ellerman, Apr. 2007, “Leanest Quasi-Orderings”, Information and Computation, vol. 205, no. 4, pp. 535-556; online 23 January 2007; April 2005, Preliminary version, Proceedings of the Sixteenth International Conference on Rewriting Techniques and Applications (Nara, Japan), J. Giesl, ed., Lecture Notes in Computer Science, vol. 3467, Springer-Verlag, Berlin, pp. 32-45.
  7. Nachum Dershowitz and Georg Moser, “The Hydra Battle Revisited”, June 2007, Rewriting, Computation and Proof -- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, Lecture Notes in Computer Science, vol. 4600, Springer-Verlag, Berlin, pp. 1-27.
  8. Nachum Dershowitz, Guan-Shieng Huang, and Mitchell A. Harris, Oct. 2006, “Enumeration Problems Related to Ground Horn Theories”, informal publication, arXiv:cs/0610054v2 [cs.LO].
  9. Nachum Dershowitz, E. Castedo Ellerman, and Edward M. Reingold, July 2005, “Well-Quasi-Orderings on Binary Trees”.
  10. Nachum Dershowitz and Iddo Tzameret, August 2003, “Gap Embedding for Well-Quasi Orderings”, Proceedings of the 10th Workshop on Logic, Language, Information and Computation (WoLLIC), Ouro Preto, Minas Gerais, Brazil; Electronic Notes in Computer Science, vol. 84, pp. 80-90, September 2003; June 2005, “A Gap Tree Theorem for Quasi-ordered Labels”.
  11. Nachum Dershowitz and Mitchell A. Harris, September 2003, “Enumerating Satisfiable Propositional Formulae”, Abstracts of EuroComb'03 (European Conference on Combinatorics, Graph Theory and Applications), J. Fiala, ed., Report 2003-145, Institute for Theoretical Computer Science, Charles University, Prague, Czech Republic, pp. 87-90; October 2003, longer draft.
  12. Mitchell A. Harris and Nachum Dershowitz, 1998, “Ordered Construction of Combinatorial Objects”, draft.
  13. Nachum Dershowitz, Apr. 1993, “Trees, Ordinals, and Termination”, Proceedings of the Fourth International Joint Conference on Theory and Practice of Software Development (Orsay, France), M.-C. Gaudel and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 668, Springer-Verlag, Berlin, pp. 243-250; May 1996, Abstract, Proceedings of the 3rd Workshop on Logic, Language, Information and Computation, Salvador, Brazil.
  14. Nachum Dershowitz, Jan. 1993, “Semigroups Satisfying xm+n= xn”, Proceedings of the Third International Workshop on Conditional Rewriting Systems (Pont-a-Mousson, France, July 1992), M. Rusinowitch, ed., Lecture Notes in Computer Science, vol. 656, Springer-Verlag, Berlin, pp. 307-314.
  15. Nachum Dershowitz and Edward M. Reingold, July 1992, “Ordinal Arithmetic with List Expressions”, Proceedings of the Symposium on Logical Foundations of Computer Science (Tver, Russia), A. Nerode and M. Taitslin, eds., Lecture Notes in Computer Science, vol. 620, Springer-Verlag, Berlin, pp. 117-126.
  16. Nachum Dershowitz and Shmuel Zaks, 1990, “The Cycle Lemma and Some Applications”, European J. of Combinatorics, vol. 11, no. 1, pp. 35-40; reviewed in Math. Reviews 91c:05011; Apr. 1982, Technical Report 238, Department of Computer Science, Technion, Haifa, Israel.
  17. Nachum Dershowitz and Naomi Lindenstrauss, June 1989, “Average Time Analyses Related to Logic Programming”, Proceedings of the Sixth International Conference on Logic Programming (Lisbon, Portugal), G. Levi and M. Martelli, eds., pp. 369-381, MIT Press, Cambridge, MA.
  18. Nachum Dershowitz and Shmuel Zaks, 1989, “Patterns in Trees”, Discrete Applied Mathematics, vol. 25, no. 3, pp. 241-255; reviewed in Math. Reviews 91a:05033; Jan. 1985, Report LCS/TM-271, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA; Mar. 1984, Ninth Colloquium on Trees in Algebra and Programming, B. Courcelle, ed., Cambridge University Press, Bordeaux, France, pp. 93-102.
  19. Nachum Dershowitz and Shmuel Zaks, Nov. 1986, “Ordered Trees and Non-Crossing Partitions (Note)”, Discrete Mathematics, vol. 62, no. 2, pp. 215-218; reviewed in Math. Reviews 88c:05008.
  20. Nachum Dershowitz, May 1983, “Well-Founded Orderings”, Technical Report ATR-83(8478)-3, Office of Information Sciences Research, The Aerospace Corporation, El Segundo, CA.
  21. Nachum Dershowitz and Shmuel Zaks, Mar. 1981, “Applied Tree Enumerations”, Proceedings of the Sixth Colloquium on Trees in Algebra and Programming (Genoa, Italy), Lecture Notes in Computer Science, vol. 112, Springer-Verlag, Berlin, pp. 180-193; reviewed in Math. Reviews 83d:68060.
  22. Nachum Dershowitz, 1980, “On the Representation of Ordinals up to Γ0”, Unpublished, Department of Computer Science, University of Illinois, Urbana, IL.
  23. Nachum Dershowitz and Shmuel Zaks, July 1980, “Enumerations of Ordered Trees”, Discrete Mathematics, vol. 31, no. 1, pp. 9-28; reviewed in Math. Reviews 81g:05069 and Zbl 443.05049. June 1979, “Enumerations of Ordered Trees”, Report DCS-R-79-970, Department of Computer Science, University of Illinois, Urbana, IL.
  24. Nachum Dershowitz and Zohar Manna, Aug. 1979, “Proving Termination With Multiset Orderings”, Communications of the ACM, vol. 22, no. 8, pp. 465-476. July 1979, “Proving Termination with Multiset Orderings”, Proceedings of the Sixth International EATCS Colloquium on Automata, Languages and Programming (Graz, Austria), Lecture Notes in Computer Science, vol. 71, Springer-Verlag, Berlin, pp. 188-202; Mar. 1978, Memo AIM-310, STAN-CS-78-651, Stanford Artificial Intelligence Laboratory, Stanford University, Stanford, CA.
  25. Nachum Dershowitz, Aug. 1979, “Orderings for Term-Rewriting Systems”, Report DCS-R-79-987, Department of Computer Science, University of Illinois, Urbana, Il. Oct. 1979, “Orderings for Term-Rewriting Systems”, Proceedings of the Twentieth IEEE Symposium on Foundations of Computer Science, San Juan, PR, pp. 123-131.
  26. Nachum Dershowitz, Nov. 1979, “A Note on Simplification Orderings”, Information Processing Letters, vol. 9, no. 5, pp. 212-215; reviewed in Math. Reviews 81f:68021. Apr. 1979, “A Note on Simplification Orderings”, Report DCS-4-79-986, Department of Computer Science, University of Illinois, Urbana, IL.
  27. Nachum Dershowitz, 1975, “A Simplified Loop-Free Algorithm for Generating Permutations”, BIT, vol. 15, no. 2, pp. 158-164; reviewed in Zbl 0317.05006.