System created this page on Mon Oct 14 22:04:50 CEST 2013:

Partial List of Publications#

Noga Levy, Adiel Ben-Shalom, Itai Ben-Shalom, Lior Wolf, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, 2013, “Consolidating the Results of Automatic Search in Large Scale Digital Collections”, in Digital Palaeography, Stewart Brookes, Peter Stokes, and Malte Rehbein, eds., Digital Research in the Arts and Humanities Series, Ashgate Publishing, Hampshire, UK.

Nachum Dershowitz and Ephraim Nissan, editors, 2013, Language, Culture, Computation: Essays Dedicated to Yaacov Choueka, Lecture Notes in Computer Science, vols. 8001-8003, Springer-Verlag, Berlin (three volumes).

Nachum Dershowitz and Ephraim Nissan, 2013, “Yaacov Choueka: A Profile”, Language, Culture, Computation: Studies in Honor of Yaacov Choueka, volume I: Computing -- Theory and Technology, Nachum Dershowitz and Ephraim Nissan, eds., Lecture Notes in Computer Science, vol. 8001, Springer-Verlag, Berlin.

Kfir Bar, Yaacov Choueka, and Nachum Dershowitz, 2013, “Matching Phrases for Arabic-to-English Example-Based Translation System”, Language, Culture, Computation: Studies in Honor of Yaacov Choueka, volume III: Computational Linguistics and Linguistics, Nachum Dershowitz and Ephraim Nissan, eds., Lecture Notes in Computer Science, vol. 8003, Springer-Verlag, Berlin.

Yaacov Choueka, Nachum Dershowitz, and Liad Tal, 2013, “Matching with a Hierarchical Ontology”, Language, Culture, Computation: Studies in Honor of Yaacov Choueka, volume I: Computing -- Theory and Technology, Nachum Dershowitz and Ephraim Nissan, eds., Lecture Notes in Computer Science, vol. 8001, Springer-Verlag, Berlin.

Nachum Dershowitz and Andrey Rosenberg, 2013, “Arabic Character Recognition”, Language, Culture, Computation: Studies in Honor of Yaacov Choueka, volume I: Computing -- Theory and Technology, Nachum Dershowitz and Ephraim Nissan, eds., Lecture Notes in Computer Science, vol. 8001, Springer-Verlag, Berlin.

Nachum Dershowitz, September 2013, “Res Publica: The Universal Model of Computation”, Proceedings of the 22nd EACSL Conference on Computer Science Logic (CSL), Torino, Italy, pp 5-10.

Tal Hassner, Lior Wolf, and Nachum Dershowitz, August 2013, “OCR-Free Transcript Alignment”, Proceedings of the 12th International Conference on Document Analysis and Recognition (ICDAR 2013), Washington DC, USA.

Yoram Zarai, Tamar Lavee, Nachum Dershowitz, and Lior Wolf, August 2013, “Integrating Copies Obtained from Old and New Preservation Efforts”, Proceedings of the 12th International Conference on Document Analysis and Recognition (ICDAR 2013), Washington DC, USA.

Nachum Dershowitz and Gilles Dowek, July 2013, “Universality in Two Dimensions”, Journal of Logic and Computation.

Maria Paola Bonacina and Nachum Dershowitz, March 2013, “Canonical Ground Horn Theories”, Programming Logics: Essays in Memory of Harald Ganzinger, Andreas Podelski, Andrei Voronkov, and Reinhard Wilhelm, eds., Lecture Notes in Computer Science, vol. 7797, Springer-Verlag, Berlin, pp. 35-71.

Roni Shweka, Yaacov Choueka, Lior Wolf, and Nachum Dershowitz, February 2013, “Automatic Extraction of Catalog Data from Digital Images of Historical Manuscripts”, Literary and Linguistic Computing, vol. 28, no. 2, pp. 315-330.

Nachum Dershowitz and Edward M. Reingold, 2013, “Jewish Dating Pitfalls and Resources”, Selected Lectures on Genealogy: An Introduction to Scientific Tools, H. Daniel Wagner, ed., ISBN 978-965-281-004-5, printed at the Weizmann Institute of Science, Rehovot, Israel, pp. 21-38.

Kfir Bar and Nachum Dershowitz, December 2012, “Deriving Paraphrases for Highly-Inflected Languages from Comparable Documents”, Proceedings of the 24th International Conference on Computational Linguistics (COLING), Mumbai, India, pp. 185-200.

Nachum Dershowitz, December 2012, “Jumping and Escaping: Modular Termination and the Abstract Path Ordering”, Theoretical Computer Science, Special issue: New Directions in Rewriting (Honoring the 60th Birthday of Yoshihito Toyama), vol. 464, pp. 35-47.

Edward M. Reingold and Nachum Dershowitz, October 2012, “Calendars”, McGraw-Hill Encyclopedia of Science & Technology, 11th ed.

Kfir Bar and Nachum Dershowitz, September 2012, “Semantics for Example-Based Arabic Machine Translation”, Challenges for Arabic Machine Translation, Abdelhadi Soudi, Stephan Vogel, Guenter Neumann, and Ali Farghaly, eds., Natural Language Processing Series, John Benjamins, Amsterdam, pp. 49-72.

Nachum Dershowitz and Edward M. Reingold, September 2012, “Modulo Intervals: A Proposed Notation”, ACM SIGACT News, vol. 43, no. 3, pp. 60-64.

Noga Levy, Lior Wolf, Nachum Dershowitz, and Peter Stokes, July 2012, “Estimating the Distinctiveness of Graphemes and Allographs in Palaeographic Classification”, Proceedings of Digital Humanities (DH 2012), Hamburg, Germany, Hamburg University Press, pp. 264-267.

Nachum Dershowitz and Evgenia Falkovich, July 2012, “Honest Universality”, S. Abramsky, ed., Special issue of the Philosophical Transactions of the Royal Society A, vol. 370, no. 1971, pp. 3340-3348.

Nachum Dershowitz and Evgenia Falkovich, 2012, “Effectiveness”, Hector Zenil, ed., A Computable Universe; Understanding Computation & Exploring Nature As Computation, World Scientific/Imperial College Press, pp. 77-97.

Nachum Dershowitz, ed., June 2012, Proceedings of the ACM/IEEE Symposium on Logic in Computer Science (LICS), Dubrovnik, Croatia.

Andrzej Bulatov, Nachum Dershowitz, and Olivier Laurent, eds., June 2012, Short Papers of the ACM/IEEE Symposium on Logic in Computer Science (LICS), Dubrovnik, Croatia.

Olivier Bournez, Nachum Dershowitz, and Evgenia Falkovich, May 2012, “Towards an Axiomatization of Simple Analog Algorithms”, Proceedings of the Conference on the Theory and Applications of Models of Computation (TAMC), Manindra Agrawal, S. Barry Cooper, and Angsheng Li, eds., Beijing, China, Lecture Notes in Computer Science, vol. 7287, pp. 525-536.

Nachum Dershowitz and Alex Zhicharevich, April 2012, “Language Classification and Segmentation of Noisy Documents in Hebrew Scripts”, LaTeCH 2012: EACL 2012 workshop on: Language Technology for Cultural Heritage, Social Sciences, and Humanities, Avignon, France.

Nachum Dershowitz and Edward M. Reingold, 2011, “Indian Calendrical Calculations”, Ancient Indian Leaps into Mathematics, B. S. Yadav and Man Mohan, eds., Birkhäuser, Boston, pp. 1-32.

Lior Wolf, Nachum Dershowitz, Liza Potikha, Tanya German, Roni Shweka, and Yaacov Choueka, 2011, “Automatic Paleographic Exploration of Genizah Manuscripts”, in Kodikologie und Paläographie im Digitalen Zeitalter 2 - Codicology and Palaeography in the Digital Age 2, Franz Fischer, Christiane Fritze, and Georg Vogeler, eds., with Bernhard Assmann, Malte Rehbein, and Patrick Sahle, Schriften des Instituts für Dokumentologie und Editorik, vol. 3, Norderstedt: Books on Demand, Germany, pp. 157-179.

Lior Wolf, Lior Litwak, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, November 2011, “Active Clustering of Document Fragments using Information Derived from Both Images and Catalogs”, International Conference on Computer Vision (ICCV), Dimitris N. Metaxas, Long Quan, Alberto Sanfeliu, and Luc J. Van Gool, eds., Barcelona, Spain, pp. 1661-1667.

Lior Wolf, Nachum Dershowitz, Liza Potikha, Roni Shweka, and Yaacov Choueka, September 2011, “Computerized Paleography: Tools for Historical Manuscripts”, Proceedings of the 18th IEEE International Conference on Image Processing (ICIP 2011), Benoît Macq and Peter Schelkens, eds., Brussels, Belgium, pp. 3545-3548.

Lior Wolf, Rotem Littman, Naama Mayer, Tanya German, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, August 2011, “Identifying Join Candidates in the Cairo Genizah”, International Journal of Computer Vision, vol. 94, no. 1, pp. 118-135.

Nachum Dershowitz, July 2011, “The Generic Model of Computation”, Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011), Elham Kashefi, Jean Krivine, and Femke van Raamsdonk, eds., Zurich, Switzerland, Electronic Proceedings Theoretical Computer Science (EPTCS), vol. 88, pp. 59-71. Published July 2012.

Nachum Dershowitz and Evgenia Falkovich, July 2011, “A Formalization and Proof of the Extended Church-Turing Thesis (Extended Abstract)”, Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011), Elham Kashefi, Jean Krivine, and Femke van Raamsdonk, eds., Zurich, Switzerland, Electronic Proceedings Theoretical Computer Science (EPTCS), vol. 88, pp. 72-78. Published July 2012.

Andrey Stolyarenko and Nachum Dershowitz, June 2011, “OCR for Arabic using SIFT Descriptors With On-Line Failure Prediction”, Israeli Seminar on Computational Linguistics (ISCOL), Bar-Ilan University.

Moshe Koppel, Navot Akiva, Idan Dershowitz, and Nachum Dershowitz, June 2011, “Unsupervised Decomposition of a Document into Authorial Components”, Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-HLT), Portland, OR, 1356-1364.

Roni Shweka, Yaacov Choueka, Lior Wolf, and Nachum Dershowitz, 2011, “‘Veqarev otam ehad el ehad’: Zihuy ktav yad vetseruf qit'ei hagnizah beemtsa'ut mahshev (Identifying Handwriting and Joining Genizah Fragments by Computer)”, Ginzei Kedem, vol. 7, pp. 171-207. (In Hebrew.)

José Félix Costa and Nachum Dershowitz, eds., 2011, Special Issue on Unconventional Computation, Natural Computing, vol. 10, pp. 1215-1217.

Kfir Bar and Nachum Dershowitz, January 2011, “Using Verb Paraphrases for Arabic-to-English Example-Based Translation” (Extended Abstract), Workshop on Machine Translation and Morphologically-rich Languages, Haifa, Israel.

Kfir Bar and Nachum Dershowitz, December 2010, “Tel Aviv University’s System Description for IWSLT 2010”, International Workshop on Spoken Language Translation (IWSLT 2010), Paris, France.

Kfir Bar and Nachum Dershowitz, October 2010, “Using Synonyms for Arabic-to-English Example-Based Translation”, The Ninth Biennial Conference of the Association for Machine Translation in the Americas, Denver, CO.

Olivier Bournez and Nachum Dershowitz, September 2010, “Foundations of Analog Algorithms”, Proceedings of the Third International Workshop on Physics and Computation (P&C), Nile River, Egypt, pp. 85-94.

Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, eds., August 2010, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin (627xxv pages).

Udi Boker and Nachum Dershowitz, August 2010, “Three Paths to Effectiveness”, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, eds., Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin, pp. 135-146.

Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, August 2010, “Yuri, Logic, and Computer Science”, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, eds., Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin, pp. 1-48.

Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, August 2010, “Exact Exploration and Hanging Algorithms”, Proceedings of the 24th International Workshop on Computer Science Logic (CSL 2010), Anuj Dawar and Helmut Veith, eds., Brno, Czech Republic, Lecture Notes in Computer Science, vol. 6247, Springer-Verlag, Berlin, pp. 140-154.

°°Nachum Dershowitz, Shalom Lappin, and Shuly Wintner, editors, June 2010, Abstracts of the Israeli Seminar on Computational Linguistics (ISCOL), Tel Aviv University, Israel.

Nachum Dershowitz and Iddo Tzameret, May 2010, “Complexity of Propositional Proofs under a Promise”, ACM Transactions on Computational Logic, vol. 11, no. 3, article 18 (29 pp.).

Udi Boker and Nachum Dershowitz, October 2009, “The Influence of the Domain Interpretation on Computational Models”, Applied Mathematics and Computation, vol. 215, no. 4, pp. 1323-1339.

Lior Wolf, Rotem Littman, Naama Mayer, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, October 2009, “Automatically Identifying Join Candidates in the Cairo Genizah” (Extended Abstract), IEEE Workshop on eHeritage and Digital Art Preservation (in conjunction with ICCV 2009), Kyoto, Japan. Best paper award.

Christian S. Calude, José Félix Costa, Nachum Dershowitz, Elisabete Freire, and Grzegorz Rozenberg, editors, September 2009, Proceedings of the Eighth International Conference on Unconventional Computation (UC 2009; Ponta Delgada, Portugal; September 2009), Lecture Notes in Computer Science, vol. 5715, Springer-Verlag, Berlin.

Kfir Bar, Nachum Dershowitz, August 2009, “NIST Open Machine Translation 2009 Evaluation: Tel Aviv University’s System Description”, National Institute of Standards and Technology (NIST) Open MT Evaluation Workshop, Ottawa, Ontario, Canada.

Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, June 2009, “When are Two Algorithms the Same?”, Bulletin of Symbolic Logic, vol. 15, no. 2, pp. 145-168.

Nachum Dershowitz, May 2009, “On Lazy Commutation”, Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday, Orna Grumberg, Michael Kaminski, Shmuel Katz, and Shuly Wintner, eds., Lecture Notes in Computer Science, vol. 5533, Springer-Verlag, Berlin, pp. 59-82.

Nachum Dershowitz and Shmuel Zaks, January 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.

Nachum Dershowitz and Edward M. Reingold, 2008, Calendrical Calculations, third edition, Cambridge University Press (477xxxi pages).

Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, editors, 2008, Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin (682xxi pages).

Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, 2008, “Boris A. Trakhtenbrot: Genealogy and Publications”, Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, eds., Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin, pp. 46-57.

Udi Boker and Nachum Dershowitz, 2008, “The Church-Turing Thesis over Arbitrary Domains”, Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, eds., Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin, pp. 199-229.

Nachum Dershowitz and Yuri Gurevich, September 2008, “A Natural Axiomatization of Computability and Proof of Church’s Thesis”, Bulletin of Symbolic Logic, vol. 14, no. 3, pp. 299-350.

Nachum Dershowitz, August 2008, “Canonicity!”, Proceedings of the Fourth International Joint Conference on Automated Reasoning (IJCAR), Sydney, Australia, Lecture Notes in Computer Science, A. Armando, P. Baumgartner, and G. Dowek, eds., Springer-Verlag, Berlin, pp. 327-331.

Maria Paola Bonacina and Nachum Dershowitz, August 2008, “Canonical Inference for Implicational Systems”, Proceedings of the Fourth International Joint Conference on Automated Reasoning (IJCAR), Sydney, Australia. Lecture Notes in Computer Science, A. Armando, P. Baumgartner, and G. Dowek, eds., Springer-Verlag, Berlin, pp. 380-395.

Nachum Dershowitz, August 2008, “Bit Inference”, Workshop on Practical Aspects of Automated Reasoning, Sydney, Australia, pp. 26-35.

Nachum Dershowitz and Claude Kirchner, July 2008, “SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets”, Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, Pierpaolo Degano, Rocco De Nicola, and José Meseguer, eds., Lecture Notes in Computer Science, vol. 5065, Springer-Verlag, Berlin, pp. 194-208.

Nachum Dershowitz and Andrei Voronkov, editors, October 2007, Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-07); Yerevan, Armenia, Lecture Notes in Computer Science, vol. 4790, Springer-Verlag, Berlin (562xiii pages).

°°Nachum Dershowitz and Andrei Voronkov, editors, October 2007, Short Papers of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-07), Yerevan, Armenia.

Nachum Dershowitz and Iddo Tzameret, July 2007, “Complexity of Propositional Proofs under a Promise”, Proceedings of the Thirty-Fourth International Colloquium on Automata, Languages and Programming (ICALP), Wroclaw, Poland, L. Arge, C. Cachin, T. Jurdzi’nski, and A. Tarlecki, eds., Lecture Notes in Computer Science, vol. 4596, Springer-Verlag, Berlin, pp. 291-302.

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.

Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, May 2007, “Towards a Better Understanding of a Conflict-Driven SAT Solver”, Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT 2007), Lisbon, Portugal, João Marques-Silva and Karem A. Sakallah, eds., Lecture Notes in Computer Science, vol. 4501, Springer-Verlag, Berlin, pp. 287-293.

Nachum Dershowitz and E. Castedo Ellerman, April 2007, “Leanest Quasi-Orderings”, Information and Computation, vol. 205, no. 4, pp. 535-556.

Kfir Bar, Nachum Dershowitz, and Yaacov Choueka, April 2007, “Example-Based Arabic-to-English Translation” (Extended Abstract), Proceedings of a Workshop on Arabic Natural Language Processing, Fez, Morocco, pp. 325/1-4.

Maria Paola Bonacina and Nachum Dershowitz, January 2007, “Abstract Canonical Inference”, ACM Transactions on Computational Logic, vol. 8, no. 1, article 6.

Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, and Daher Kaiss, November 2006, “Boolean Rings for Intersection-Based Satisfiability”, 13th International Conference on Logic for Programming and Artificial Intelligence and Reasoning (LPAR), Phnom Penh, Cambodia, Miki Hermann and Andrei Voronkov, eds., Lecture Notes in Computer Science, vol. 4246, Springer-Verlag, Berlin, pp. 482-496.

Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, editors, October 2006, Special issue on “Logic and Computation: Symposia at Tel Aviv”, Logic Journal of the IGPL, vol. 14, no. 5.

Udi Boker and Nachum Dershowitz, October 2006, “Comparing Computational Power”, Logic Journal of the IGPL, vol. 14, no. 5, pp. 633-648.

Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, August 2006, “A Scalable Algorithm for Minimal Unsatisfiable Core Extraction”, Proceedings of the 9th International Conference Theory and Applications of Satisfiability Testing (SAT 2006), Seattle, WA, Armin Biere and Carla P. Gomes, eds., Lecture Notes in Computer Science, volume 4121, Springer-Verlag, Berlin, pp. 36-41.

Udi Boker and Nachum Dershowitz, July 2006, “A Hypercomputational Alien”, J. of Applied Mathematics & Computation, vol. 178, no. 1, pp. 44-57.

Nachum Dershowitz and Claude Kirchner, July 2006, “Abstract Canonical Presentations”, Theoretical Computer Science, vol. 357, nos. 1-3, pp. 53-69.

Udi Boker and Nachum Dershowitz, February 2006, “Abstract Effective Models”, New Developments in Computational Models: Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005) (Lisbon, Portugal, July 2005), M. Fernández and I. Mackie, eds., Electronic Notes in Theoretical Computer Science, vol. 135, no. 3, pp. 15-23.

Nachum Dershowitz, December 2005, “Primitive Rewriting”, A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. de Vrijer, eds., Processes, Terms and Cycles: Steps on the Road to Infinity. Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday, Lecture Notes in Computer Science, vol. 3838, Springer-Verlag, Berlin, pp. 127-147.

Nachum Dershowitz, December 2005, “The Four Sons of Penrose”, Proceedings of the Eleventh Conference on Logic Programming for Artificial Intelligence and Reasoning (LPAR), Jamaica, G. Sutcliffe and A. Voronkov, eds., Lecture Notes in Computer Science, vol. 3835, Springer-Verlag, Berlin, pp. 125-138.

Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, June 2005, “A Clause-Based Heuristic for SAT Solvers”, F. Bacchus and T. Walsch, eds., Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT 2005), St. Andrews, Scotland, Lecture Notes in Computer Science, vol. 3569, Springer-Verlag, Berlin, pp. 46-60.

Nachum Dershowitz, Ziyad Hanna, and Jacob Katz, June 2005, “Bounded Model Checking with QBF”, F. Bacchus and T. Walsch, eds., Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT 2005; St. Andrews, Scotland), Lecture Notes in Computer Science, vol. 3569, Springer-Verlag, Berlin, pp. 408-414.

Nachum Dershowitz, May 2005, “Term Rewriting Systems by ‘Terese’ (Marc Bezem, Jan Willem Klop, and Roel de Vrijer, eds.): Book review”, Theory and Practice of Logic Programming, vol. 5, no. 3, pp. 391-395.

Nachum Dershowitz, April 2005, “Open. Closed. Open.”, 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. 376-393.

Yulik Feldman, Nachum Dershowitz, and Ziyad Hanna, April 2005, “ Parallel Multithreaded Satisfiability Solver: Design and Implementation”, Proceedings of the 3rd International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2004), September 2004, London, UK; Electronic Notes in Theoretical Computer Science, vol. 128, no. 3, pp. 75-90.

Jacob Katz, Ziyad Hanna, and Nachum Dershowitz, March 2005, “Space-Efficient Bounded Model Checking” (Extended Abstract), Design, Automation and Test in Europe, Munich, Germany, vol. 2, pp. 686-687.

Nachum Dershowitz, September 2004, “Termination by Abstraction”, Proceedings of the Twentieth International Conference on Logic Programming, St. Malo, France, Lecture Notes in Computer Science, vol. 3132, Springer-Verlag, Berlin, pp. 1-18.

Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, and Daher Kaiss, May 2004, “Boolean Ring Satisfiability”, Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, BC, Canada, pp. 281-286.

°°Nachum Dershowitz and Alexander Rabinovich, editors, March 2004, Abstracts of an International Symposium on Models of Computation, School of Computer Science, Tel Aviv University, Ramat Aviv, Israel.

°°Arnon Avron and Nachum Dershowitz, editors, March 2004, Abstracts of an International Symposium on Logic and Computation, School of Computer Science, Tel Aviv University, Ramat Aviv, Israel.

Nachum Dershowitz, editor, December 2003, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin (783xv pages).

Nachum Dershowitz, D. N. Jayasimha, and Seungjoon Park, December 2003, “Bounded Fairness”, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, N. Dershowitz, ed., Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin, pp. 304-317.

Nachum Dershowitz, December 2003, “Pæan to Zohar Manna”, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, N. Dershowitz, ed., Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin, pp. 1-10.

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.

Nachum Dershowitz and Iddo Tzameret, August 2003, “Gap Embedding for Well-Quasi Orderings”, Proceedings of the 10th Workshop on Logic, Language, Information and Computation, Ouro Preto, Minas Gerais, Brazil; Electronic Notes in Computer Science, vol. 84, pp. 80-90, September 2003.

Nachum Dershowitz, May 2003, “Canonicity”, Proceedings of the Fourth International Workshop on First-Order Theorem Proving (FTP’03), Valencia, Spain, I. Dahn and L. Vigneron, eds., pp. 147-158; Electronic Notes in Theoretical Computer Science, vol. 86, no. 1.

Edward M. Reingold and Nachum Dershowitz, 2002, Calendrical Tabulations, Cambridge University Press (606xxx pages).

Nachum Dershowitz and David A. Plaisted, 2001, “Rewriting”, chap. 9 in: Handbook of Automated Reasoning, vol. 1, A. Robinson and A. Voronkov, eds., Elsevier, pp. 535-610.

°°Nachum Dershowitz, editor, June 2001, Abstracts of the Bar-Ilan International Symposium on Artificial Intelligence (BISFAI ’01), Ramat-Gan, Israel.

°°Nachum Dershowitz, editor, May 2001, Extended Abstracts of the Fifth International Workshop on Termination (WST ’01), Utrecht, Logic Group Preprint Series No. 209, Institute of Philosophy, Utrecht University, Utrecht, The Netherlands.

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik, 2001, “A General Framework for Automatic Termination Analysis of Logic Programs”, Applicable Algebra in Engineering, Communication and Computing, vol. 12, no. 1/2, pp. 117-156.

Nachum Dershowitz, 2000, “[Hebrew]] Calendar”, Reader’s Guide to Judaism, M. Terry, ed., Fitzroy Dearborn, Chicago, IL, pp. 97-98.

Nachum Dershowitz, October 2000, “Artificial Intelligence: Retrospective/Prospective”, Annals of Mathematics and Artificial Intelligence, vol. 28, nos. 1-4, pp. 3-5.

Nachum Dershowitz and Claude Kirchner, editors, September 2000, RULE 2000: Proceedings of the First International Workshop on Rule-Based Programming, Montreal, Canada.

Nachum Dershowitz and Edward M. Reingold, “Calendars”, McGraw-Hill Encyclopedia of Science & Technology, 8th ed., 2000. Also available on CD-ROM: McGraw-Hill Multimedia Encyclopedia of Science & Technology, Release 2.0, 2000.

Nachum Dershowitz and Naomi Lindenstrauss, 2000, “Abstract And Parallel Machines”, Computers and Artificial Intelligence, vol. 19, pp. 475-493.

Nachum Dershowitz and Subrata Mitra, July 1999, “Jeopardy”, Proceedings of the Tenth International Conference on Rewriting Techniques and Applications (Trento, Italy), P. Narendran and M. Rusinowitch, eds., Lecture Notes in Computer Science, vol. 1631, Springer-Verlag, Berlin, pp. 16-29.

Schulamith C. Halevy and Nachum Dershowitz, 1999, “Prácticas Ocultas de los ‘Anusim’ del Nuevo Mundo” (in Spanish), Encuentro y Alteridad: Vida y cultura judia en America Latina, J. B. Liwerant and A. G. de Backal, eds., UNAM, Mexico City, pp. 35-46.

Nachum Dershowitz and Edward M. Reingold, 1998, “Implementing Solar Astronomical Calendars”, in: Birashkname, M. Akrami, ed., Shahid Beheshti University, Tehran, Iran, pp. 477-487.

Nachum Dershowitz and Ralf Treinen, March 1998, “An On-line Database of Open Questions”, Proceedings of the Ninth International Conference on Rewriting Techniques and Applications (Japan), T. Nipkow, ed., Lecture Notes in Computer Science, vol. 1379, Springer-Verlag, Berlin, pp. 332-342.

Nachum Dershowitz and Naomi Lindenstrauss, August 1997, “Abstract And-Parallel Machines”, Proceedings of the Third International Euro-Par Conference on Parallel Processing (Passau, Germany), C. Lengauer, M. Griebl, and S. Gorlatch, eds., Lecture Notes in Computer Science, vol. 1300, Springer-Verlag, Berlin, pp. 1221-1225.

Nachum Dershowitz, August 1997, “When are Two Rewrite Systems More than None?”, Proceedings of the Twenty-Second International Symposium on Mathematical Foundations of Computer Science (Bratislava, Slovakia), I. Pr’ivara and P. Ruzicka, eds., Lecture Notes in Computer Science, vol. 1295, Springer-Verlag, Berlin, pp. 37-43.

Nachum Dershowitz, June 1997, “Innocuous Constructor-Sharing Combinations”, Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (Sitges, Spain), H. Comon, ed., Lecture Notes in Computer Science, vol. 1232, Springer-Verlag, Berlin, pp. 202-216.

Nachum Dershowitz, December 1995, “Goal Solving as Operational Semantics”, Proceedings of the International Logic Programming Symposium, Portland, OR, J. Lloyd, ed., MIT Press, Cambridge, MA, pp. 3-17.

Nachum Dershowitz and Charles Hoot, May 1995, “Natural Termination”, Theoretical Computer Science, vol. 142, no. 2, pp. 179-207.

Nachum Dershowitz and Naomi Lindenstrauss, editors, 1995, Proceedings of the International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994), Lecture Notes in Computer Science, vol. 968, Springer-Verlag, Berlin, (375viii pages).

Nachum Dershowitz, 1995, “Hierarchical Termination”, Proceedings of the International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994), N. Dershowitz and N. Lindenstrauss, eds., Lecture Notes in Computer Science, vol. 968, Springer-Verlag, Berlin, pp. 89-105.

Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop, April 1995, “Problems in Rewriting III”, Proceedings of the Sixth International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany), J. Hsiang, ed., Lecture Notes in Computer Science, vol. 914, Springer-Verlag, Berlin, pp. 457-471.

Nachum Dershowitz, 1995, “33 Examples of Termination”, in: French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting (Font Romeaux, France, May 1993), H. Comon and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 909, Springer-Verlag, Berlin, pp. 16-26.

Leo Bachmair and Nachum Dershowitz, March 1994, “Equational Inference, Canonical Proofs, and Proof Orderings”, J. of the Association of Computing Machinery, vol. 41, no. 2, pp. 236-276.

Nachum Dershowitz and Subrata Mitra, December 1993, “Higher-Order and Semantic Unification”, Proceedings of the Thirteenth Conference on Foundations of Software Technology and Theoretical Computer Science (Bombay, India), Lecture Notes in Computer Science, vol. 761, Springer-Verlag, Berlin, pp. 139-150.

Nachum Dershowitz, 1993, “A Taste of Rewrite Systems”, in: Functional Programming, Concurrency, Simulation and Automated Reasoning, P. Lauer and J. Zucker, eds., Springer-Verlag, Berlin, Lecture Notes in Computer Science, vol. 693, pp. 199-228.

Nachum Dershowitz and Charles Hoot, June 1993, “Topics in Termination”, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), C. Kirchner, ed., Lecture Notes in Computer Science, Berlin, Springer-Verlag.

Alan Bundy, Nachum Dershowitz, Martin Golumbic, and Hélène Kirchner, editors, August 1993, Proceedings of the Workshop on Heuristics and Search Guiding in Automated Theorem Proving, 13th International Conference on Artificial Intelligence, Chambery, France.

Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop, June 1993, “More Problems in Rewriting”, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), C. Kirchner, ed., Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 468-487.

Nachum Dershowitz and Uday Reddy, May/June 1993, “Deductive and Inductive Synthesis of Equational Programs”, J. of Symbolic Computation, vol. 15, issue 5-6, pp. 467-494.

Nachum Dershowitz and Yuh-jeng Lee, May/June 1993, “Logical Debugging”, J. of Symbolic Computation, vol. 15, issue 5-6, pp. 745-773.

Nachum Dershowitz, April 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.

Edward M. Reingold, Nachum Dershowitz, and Stewart H. Clamen, April 1993, “Calendrical Calculations II: Three Historical Calendars”, Software—Practice and Experience, vol. 23, no. 4, pp. 383-404.

Nachum Dershowitz and Subrata Mitra, January 1993, “Path Orderings for Termination of Associative-Commutative Rewriting”, 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. 168-174.

Nachum Dershowitz, January 1993, “Semigroups Satisfying x^(m+n)= x^n”, 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.

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.

Nachum Dershowitz, Subrata Mitra, and G. Sivakumar, June 1992, “Decidable Matching for Convergent Systems”, Proceedings of the Eleventh Conference on Automated Deduction (Saratoga Springs, NY), D. Kapur, ed., Lecture Notes in Artificial Intelligence, vol. 607, Springer-Verlag, Berlin, pp. 589-602.

Nachum Dershowitz, 1992, “Rewriting Methods for Word Problems”, in: Words, Languages & Combinatorics (Proceedings of the International Colloquium, Kyoto, Japan, August 1990), M. Ito, ed., World Scientific, Singapore, pp. 104-118.

Nachum Dershowitz, August 1991, “Ordering-Based Strategies for Horn Clauses”, Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pp. 118-124, Sydney, Australia.

Nachum Dershowitz, July 1991, “Canonical Sets of Horn Clauses”, Proceedings of the Eighteenth International Colloquium on Automata, Languages and Programming (ICALP), Madrid, Spain, J. Leach Albert, B. Monien and M. Rodriguez Artalejo, eds., Lecture Notes in Computer Science, vol. 510, Springer-Verlag, Berlin, pp. 267-278.

Nachum Dershowitz, Stéphane Kaplan, and David A. Plaisted, June 1991, “Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...”, Theoretical Computer Science, vol. 83, no. 1, pp. 71-96.

Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop, 1991, “Open Problems in Rewriting”, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), R. Book, ed., Lecture Notes in Computer Science, vol. 488, Springer-Verlag, Berlin, pp. 445-456.

Nachum Dershowitz, 1991, “A Maximal-Literal Unit Strategy for Horn Clauses”, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems (Montreal, Canada, June 1990), S. Kaplan and M. Okada, eds., Lecture Notes in Computer Science, vol. 516, Springer-Verlag, Berlin, pp. 14-25.

Nachum Dershowitz and Jean-Pierre Jouannaud, 1990, “Rewrite Systems”, in: Handbook of Theoretical Computer Science, vol. B: Formal Methods and Semantics, chap. 6, pp. 243-320, J. van Leeuwen, ed., North-Holland, Amsterdam.

Nachum Dershowitz and Naomi Lindenstrauss, October 1990, “An Abstract Concurrent Machine for Rewriting”, Proceedings of the Second Conference on Algebraic and Logic Programming (Nancy, France), H. Kirchner and W. Wechler, eds., pp. 318-331, Lecture Notes in Computer Science, vol. 463, Springer-Verlag, Berlin.

Nachum Dershowitz and Naomi Lindenstrauss, October 1990, “A Parallel Implementation of Equational Programming”, Proceedings of the Fifth Jerusalem Conference on Information Technology, IEEE Computer Society, Jerusalem, Israel, pp. 426-435.

Nachum Dershowitz, Subrata Mitra, and G. Sivakumar, October 1990, “Equation Solving in Conditional AC-Theories”, Proceedings of the Second Conference on Algebraic and Logic Programming (Nancy, France), H. Kirchner and W. Wechler, eds., Lecture Notes in Computer Science, vol. 463, Springer-Verlag, Berlin, pp. 283-297.

Nachum Dershowitz and Edward M. Reingold, September 1990, “Calendrical Calculations”, Software—Practice and Experience, vol. 20, no. 9, pp. 899-928.

Nachum Dershowitz and E. Pinchover, July 1990, “Inductive Synthesis of Equational Programs”, Proceedings of the Eighth National Conference on Artificial Intelligence, AAAI, Boston, MA, pp. 234-239.

Nachum Dershowitz, June 1990, “A Maximal-Literal Unit Strategy for Horn Clauses”, Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems, S. Kaplan and M. Okada, eds., Concordia University, Montreal, Canada, pp. 21-27.

Nachum Dershowitz and Mitsuhiro Okada, 1990, “A Rationale for Conditional Equational Programming”, Theoretical Computer Science, vol. 75, nos. 1-2, pp. 111-138.

Nachum Dershowitz and Shmuel Zaks, January 1990, “The Cycle Lemma and Some Applications”, European J. of Combinatorics, vol. 11, no. 1, pp. 35-40.

Nachum Dershowitz and Shmuel Zaks, November 1989, “Patterns in Trees”, Discrete Applied Mathematics, vol. 25, no. 3, pp. 241-255.

Leo Bachmair and Nachum Dershowitz, October 1989, “Completion for Rewriting Modulo a Congruence”, Theoretical Computer Science, vol. 67, no. 2 & 3.

Leo Bachmair, Nachum Dershowitz and David A. Plaisted, 1989, “Completion Without Failure”, in: Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, H. Ait-Kaci and M. Nivat, eds., chap. 1, Academic Press, New York, pp. 1-30.

Nachum Dershowitz, 1989, “Completion and Its Applications”, in: Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, H. Ait-Kaci and M. Nivat, eds., chap. 2, Academic Press, New York, pp. 31-86.

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.

Nachum Dershowitz and Hon-Wai Leong, June 1989, “Fast Exchange Sorts”, Proceedings of the Third International Conference on Foundations of Data Organization and Algorithms, W. Litwin and H. J. Schek, eds., Lecture Notes in Computer Science, vol. 367, Springer-Verlag, Berlin, pp. 102-113. Accepted for publication in Computer J.

Nachum Dershowitz, editor, April 1989, Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC), Lecture Notes in Computer Science, vol. 355, Springer-Verlag, Berlin (579vii pages).

N. Alan Josephson and Nachum Dershowitz, January/March 1989, “An Implementation of Narrowing”, J. Logic Programming, vol. 6, no. 1&2, pp. 57-77.

Nachum Dershowitz and David A. Plaisted, 1988, “Equational Programming”, in: Machine Intelligence 11: The logic and acquisition of knowledge, J. E. Hayes, D. Michie and J. Richards, eds., chap. 2, Oxford Press, Oxford, pp. 21-56.

Leo Bachmair and Nachum Dershowitz, August 1988, “Critical Pair Criteria for Completion”, J. of Symbolic Computation, vol. 6, no. 1, pp. 1-18.

Nachum Dershowitz, Leo Marcus and Andrzej Tarlecki, August 1988, “Existence, Uniqueness, and Construction of Rewrite Systems”, SIAM J. of Computing, vol. 17, no. 4, pp. 629-639.

Nachum Dershowitz and G. Sivakumar, August 1988, “Goal-Directed Equation Solving”, Proceedings of the Seventh National Conference on Artificial Intelligence, AAAI, St. Paul, MN, pp. 166-170.

Nachum Dershowitz and Mitsuhiro Okada, July 1988, “Proof-Theoretic Techniques and the Theory of Rewriting”, Proceedings of the Third IEEE Symposium on Logic in Computer Science (LICS), Edinburgh, Scotland, pp. 104-111.

Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar, May 1988, “Canonical Conditional Rewrite Systems”, Proceedings of the Ninth Conference on Automated Deduction (Argonne, IL), Lecture Notes in Computer Science, vol. 310, Springer-Verlag, Berlin, pp. 538-549.

Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar, July 1987, “Confluence of Conditional Rewrite Systems”, Proceedings of the First International Workshop on Conditional Term Rewriting Systems (Orsay, France), S. Kaplan and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 308, Springer-Verlag, Berlin, pp. 31-44.

Nachum Dershowitz and G. Sivakumar, July 1987, “Solving Goals in Equational Languages”, Proceedings of the First International Workshop on Conditional Term Rewriting Systems (Orsay, France), S. Kaplan and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 308, Springer-Verlag, Berlin, pp. 45-55..

Leo Bachmair and Nachum Dershowitz, June 1987, “Inference Rules for Rewrite-Based First-Order Theorem Proving”, Proceedings of the Second IEEE Symposium on Logic in Computer Science, Ithaca, NY, pp. 331-337.

Nachum Dershowitz, February/April 1987, “Termination of Rewriting”, J. of Symbolic Computation, vol. 3, no. 1&2, pp. 69-115.

Nachum Dershowitz, 1986, “Program Abstraction and Instantiation”, in: Readings in Artificial Intelligence and Software Engineering, C. Rich and R. Waters, ed., chap. IX, Morgan Kaufmann, Los Altos, CA, pp. 475-490. Reprinted from ACM Transactions on Programming Languages and Systems, vol. 7, no. 3, pp. 446-477 (July 1985).

Nachum Dershowitz and Shmuel Zaks, November 1986, “Ordered Trees and Non-Crossing Partitions (Note)”, Discrete Mathematics, vol. 62, no. 2, pp. 215-218.

Nachum Dershowitz, 1986, “Programming by Analogy”, in: Machine Learning II: An Artificial Intelligence Approach, R. S. Michalski, J. G. Carbonell and T. M. Mitchell, eds., chap. 15, Morgan Kaufmann, Los Altos, CA, pp. 395-423.

Leo Bachmair and Nachum Dershowitz, July 1986, “Commutation, Transformation, and Termination”, Proceedings of the Eighth International Conference on Automated Deduction (Oxford, England), J. H. Siekmann, ed., Lecture Notes in Computer Science, vol. 230, Springer-Verlag, Berlin, pp. 5-20.

Leo Bachmair, Nachum Dershowitz and Jieh Hsiang, June 1986, “Orderings for Equational Proofs”, Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), Cambridge, MA, pp. 346-357.

Nachum Dershowitz, August 1985, “Synthesis by Completion”, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 208-214.

Nachum Dershowitz and David A. Plaisted, July 1985, “Logic Programming cum Applicative Programming”, Proceedings of the IEEE Symposium on Logic Programming, Boston, MA, pp. 54-66.

Nachum Dershowitz, May/June 1985, “Computing with Rewrite Systems”, Information and Control, vol. 64, no. 2/3, pp. 122-157.

Nachum Dershowitz, March 1985, “Synthetic Programming”, Artificial Intelligence, vol. 25, pp. 323-373.

Nachum Dershowitz, May 1984, “Equations as Programming Language”, Proceedings of the Fourth Jerusalem Conference on Information Technology, IEEE Computer Society, Jerusalem, Israel, pp. 114-124.

Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, and David A. Plaisted, August 1983, “Associative-Commutative Rewriting”, Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI), Karlsruhe, West Germany, pp. 940-944.

Jieh Hsiang and Nachum Dershowitz, July 1983, “Rewrite Methods for Clausal and Non-Clausal Theorem Proving”, European Association of Theoretical Computer Science, Proceedings of the Tenth International Colloquium on Automata, Languages and Programming (ICALP), Barcelona, Spain, Lecture Notes in Computer Science, vol. 154, Springer-Verlag, Berlin, pp. 331-346.

Nachum Dershowitz, 1983, The Evolution of Programs, Birkhäuser, Boston, MA (358 pages).

Nachum Dershowitz, March 1982, “Orderings for Term-Rewriting Systems”, Theoretical Computer Science, vol. 17, no. 3, pp. 279-301.

Nachum Dershowitz, July 1981, “Termination of Linear Rewriting Systems”, European Association of Theoretical Computer Science, Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (ICALP), Acre, Israel, Lecture Notes in Computer Science, vol. 115, Springer-Verlag, Berlin, pp. 448-458.

Nachum Dershowitz and Zohar Manna, March 1981, “Inference Rules for Program Annotation”, IEEE Trans. on Software Engineering, vol. SE-7, no. 2, pp. 207-222.

Nachum Dershowitz and Shmuel Zaks, March 1981, “Applied Tree Enumerations”, Proceedings of the Sixth Colloquium on Trees in Algebra and Programming (CAAP), Genoa, Italy, Lecture Notes in Computer Science, vol. 112, Springer-Verlag, Berlin, pp. 180-193.

Nachum Dershowitz, November 1980, “The Schorr-Waite Marking Algorithm Revisited”, Information Processing Letters, vol. 11, no. 3, pp. 141-143.

Nachum Dershowitz and Shmuel Zaks, July 1980, “Enumerations of Ordered Trees”, Discrete Mathematics, vol. 31, no. 1, pp. 9-28.

Nachum Dershowitz, November 1979, “A Note on Simplification Orderings”, Information Processing Letters, vol. 9, no. 5, pp. 212-215.

Nachum Dershowitz and Zohar Manna, August 1979, “Proving Termination With Multiset Orderings”, Communications of the ACM, vol. 22, no. 8, pp. 465-476.

Rony Attar, Yaacov Choueka, Nachum Dershowitz, and Aviezri S. Fraenkel, January 1978, “KEDMA—Linguistic Tools for Retrieval Systems”, J. of the Association of Computing Machinery, vol. 25, no. 1, pp. 52-66.

Nachum Dershowitz and Zohar Manna, November 1977, “The Evolution of Programs: Automatic Program Modification”, IEEE Trans. on Software Engineering, vol. SE-3, no. 6, pp. 377-385.

Nachum Dershowitz and Zohar Manna, July 1975, “On Automating Structured Programming”, Proceedings of the IRIA Symposium on Proving and Improving Programs, G. Huet and G. Kahn, eds., Arc-et-Senans, France, pp. 167-193.

Nachum Dershowitz, June 1975, “A Simplified Loop-Free Algorithm for Generating Permutations”, Nordisk Tidskr. Informationsbehandling (BIT Numerical Mathematics), vol. 15, no. 2, pp. 158-164.