Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nachum Dershowitz
2010 – today
- 2013
[j51]Roni Shweka, Yaacov Choueka, Lior Wolf, Nachum Dershowitz: Automatic extraction of catalog data from digital images of historical manuscripts. LLC 28(2): 315-330 (2013)- 2012
- [j50]Nachum Dershowitz, Edward M. Reingold: Modulo intervals: a proposed notation. SIGACT News 43(3): 60-64 (2012)
- [j49]Nachum Dershowitz: Jumping and escaping: Modular termination and the abstract path ordering. Theor. Comput. Sci. 464: 35-47 (2012)
- [c95]Kfir Bar, Nachum Dershowitz: Deriving Paraphrases for Highly Inflected Languages from Comparable Documents. COLING 2012: 185-200
- [c94]Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich: Towards an Axiomatization of Simple Analog Algorithms. TAMC 2012: 525-536
- 2011
- [j48]Lior Wolf, Rotem Littman, Naama Mayer, Tanya German, Nachum Dershowitz, Roni Shweka, Yaacov Choueka: Identifying Join Candidates in the Cairo Genizah. International Journal of Computer Vision 94(1): 118-135 (2011)
- [j47]
- [c93]Moshe Koppel, Navot Akiva, Idan Dershowitz, Nachum Dershowitz: Unsupervised Decomposition of a Document into Authorial Components. ACL 2011: 1356-1364
- [c92]Lior Wolf, Lior Litwak, Nachum Dershowitz, Roni Shweka, Yaacov Choueka: Active clustering of document fragments using information derived from both images and catalogs. ICCV 2011: 1661-1667
- [c91]Lior Wolf, Liza Potikha, Nachum Dershowitz, Roni Shweka, Yaacov Choueka: Computerized paleography: Tools for historical manuscripts. ICIP 2011: 3545-3548
- [c90]
- [c89]Nachum Dershowitz, Evgenia Falkovich: A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-. DCM 2011: 72-78
- [i11]Nachum Dershowitz, Alexander Nadel: From Total Assignment Enumeration to Modern SAT Solver. CoRR abs/1110.5867 (2011)
- 2010
- [j46]Nachum Dershowitz, Iddo Tzameret: Complexity of propositional proofs under a promise. ACM Trans. Comput. Log. 11(3) (2010)
- [c88]Andreas Blass, Nachum Dershowitz, Wolfgang Reisig: Yuri, Logic, and Computer Science. Fields of Logic and Computation 2010: 1-48
- [c87]Udi Boker, Nachum Dershowitz: Three Paths to Effectiveness. Fields of Logic and Computation 2010: 135-146
- [c86]Andreas Blass, Nachum Dershowitz, Yuri Gurevich: Exact Exploration and Hanging Algorithms. CSL 2010: 140-154
- [e7]Andreas Blass, Nachum Dershowitz, Wolfgang Reisig (Eds.): Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6300, Springer 2010, ISBN 978-3-642-15024-1
2000 – 2009
- 2009
- [j45]Udi Boker, Nachum Dershowitz: The influence of domain interpretations on computational models. Applied Mathematics and Computation 215(4): 1323-1339 (2009)
- [j44]Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? Bulletin of Symbolic Logic 15(2): 145-168 (2009)
- [j43]Nachum Dershowitz, Shmuel Zaks: More Patterns in Trees: Up and Down, Young and Old, Odd and Even. SIAM J. Discrete Math. 23(1): 447-465 (2009)
- [c85]
- [e6]Cristian S. Calude, José Félix Costa, Nachum Dershowitz, Elisabete Freire, Grzegorz Rozenberg (Eds.): Unconventional Computation, 8th International Conference, UC 2009, Ponta Delgada, Azores, Portugal, September 7-11, 2009. Proceedings. Lecture Notes in Computer Science 5715, Springer 2009, ISBN 978-3-642-03744-3
- 2008
- [b2]Nachum Dershowitz, Edward M. Reingold: Calendrical calculations (3. ed.). Cambridge University Press 2008, ISBN 978-0-521-88540-9, pp. I-XXIX, 1-479
- [j42]Nachum Dershowitz, Yuri Gurevich: A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14(3): 299-350 (2008)
- [c84]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich: Boris A. Trakhtenbrot: Academic Genealogy and Publications. Pillars of Computer Science 2008: 46-57
- [c83]Nachum Dershowitz, Claude Kirchner: SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets. Concurrency, Graphs and Models 2008: 194-208
- [c82]Udi Boker, Nachum Dershowitz: The Church-Turing Thesis over Arbitrary Domains. Pillars of Computer Science 2008: 199-229
- [c81]
- [c80]Maria Paola Bonacina, Nachum Dershowitz: Canonical Inference for Implicational Systems. IJCAR 2008: 380-395
- [c79]
- [e5]Arnon Avron, Nachum Dershowitz, 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 4800, Springer 2008, ISBN 978-3-540-78126-4
- [i10]Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? CoRR abs/0811.0811 (2008)
- 2007
- [j41]Nachum Dershowitz, E. Castedo Ellerman: Leanest quasi-orderings. Inf. Comput. 205(4): 535-556 (2007)
- [j40]Maria Paola Bonacina, Nachum Dershowitz: Abstract canonical inference. ACM Trans. Comput. Log. 8(1) (2007)
- [c78]Nachum Dershowitz, Georg Moser: The Hydra Battle Revisited. Rewriting, Computation and Proof 2007: 1-27
- [c77]Nachum Dershowitz, Iddo Tzameret: Complexity of Propositional Proofs Under a Promise. ICALP 2007: 291-302
- [c76]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. SAT 2007: 287-293
- [e4]Nachum Dershowitz, Andrei Voronkov (Eds.): Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings. Lecture Notes in Computer Science 4790, Springer 2007, ISBN 978-3-540-75558-6
- [i9]Nachum Dershowitz, Iddo Tzameret: Complexity of Propositional Proofs under a Promise. CoRR abs/0707.4255 (2007)
- [i8]Jacob Katz, Ziyad Hanna, Nachum Dershowitz: Space-Efficient Bounded Model Checking. CoRR abs/0710.4629 (2007)
- 2006
- [j39]Udi Boker, Nachum Dershowitz: A hypercomputational alien. Applied Mathematics and Computation 178(1): 44-57 (2006)
- [j38]Udi Boker, Nachum Dershowitz: Abstract Effective Models. Electr. Notes Theor. Comput. Sci. 135(3): 15-23 (2006)
- [j37]Udi Boker, Nachum Dershowitz: Comparing Computational Power. Logic Journal of the IGPL 14(5): 633-647 (2006)
- [j36]Nachum Dershowitz, Claude Kirchner: Abstract canonical presentations. Theor. Comput. Sci. 357(1-3): 53-69 (2006)
- [c75]Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss: Boolean Rings for Intersection-Based Satisfiability. LPAR 2006: 482-496
- [c74]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. SAT 2006: 36-41
- [i7]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. CoRR abs/cs/0605085 (2006)
- [i6]Nachum Dershowitz, Mitchell A. Harris, Guan-Shieng Huang: Enumeration Problems Related to Ground Horn Theories. CoRR abs/cs/0610054 (2006)
- 2005
- [j35]Yulik Feldman, Nachum Dershowitz, Ziyad Hanna: Parallel Multithreaded Satisfiability Solver: Design and Implementation. Electr. Notes Theor. Comput. Sci. 128(3): 75-90 (2005)
- [j34]Nachum Dershowitz: Book review: Term Rewriting Systems by "Terese" (Marc Bezem, Jan Willem Klop, and Roel de Vrijer, eds.), Cambridge University Press, Cambridge Tracts in Theoretical Computer Science 55, 2003, hard cover: ISBN 0-521-39115-6. TPLP 5(3): 395-399 (2005)
- [c73]
- [c72]
- [c71]Jacob Katz, Ziyad Hanna, Nachum Dershowitz: Space-Efficient Bounded Model Checking. DATE 2005: 686-687
- [c70]
- [c69]
- [c68]
- [c67]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Clause-Based Heuristic for SAT Solvers. SAT 2005: 46-60
- [c66]
- [i5]
- 2004
- [c65]
- [c64]Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss: Boolean Ring Satisfiability. SAT 2004
- [i4]
- 2003
- [j33]Nachum Dershowitz, Iddo Tzameret: Gap Embedding for Well-Quasi-Orderings. Electr. Notes Theor. Comput. Sci. 84: 80-90 (2003)
- [j32]
- [c63]
- [c62]Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park: Bounded Fairness. Verification: Theory and Practice 2003: 304-317
- [c61]
- [e3]Nachum Dershowitz (Ed.): Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday. Lecture Notes in Computer Science 2772, Springer 2003, ISBN 3-540-21002-4
- [i3]
- 2002
- [b1]Edward M. Reingold, Nachum Dershowitz: Calendrical calcuations - the millenium edition. Cambridge University Press 2002, ISBN 978-0-521-77752-0, pp. I-XXXII, 1-422
- 2001
- [j31]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 117-156 (2001)
- [p2]
- 2000
- [j30]Nachum Dershowitz: Artificial intelligence: Retrospective/prospective. Ann. Math. Artif. Intell. 28(1-4): 3-5 (2000)
- [j29]Naomi Lindenstrauss, Nachum Dershowitz: Abstract and-parallel Machines. Computers and Artificial Intelligence 19(5) (2000)
- [i2]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. CoRR cs.PL/0011036 (2000)
- [i1]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. CoRR cs.PL/0012008 (2000)
1990 – 1999
- 1999
- [j28]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Electr. Notes Theor. Comput. Sci. 30(1): 39-58 (1999)
- [c60]
- 1998
- [c59]
- 1997
- [c58]
- [c57]
- [c56]
- 1995
- [j27]
- [c55]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Problems in Rewriting III. RTA 1995: 457-471
- [c54]
- [e2]Nachum Dershowitz, Naomi Lindenstrauss (Eds.): Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings. Lecture Notes in Computer Science 968, Springer 1995, ISBN 3-540-60381-6
- 1994
- [j26]Leo Bachmair, Nachum Dershowitz: Equational Inference, Canonical Proofs, and Proof Orderings. J. ACM 41(2): 236-276 (1994)
- [c53]Nachum Dershowitz: From Specifications to Programs: Induction in the Service of Synthesis (Abstract). AII/ALT 1994: 6-7
- [c52]
- 1993
- [j25]Nachum Dershowitz, Uday S. Reddy: Deductive and Inductive Synthesis of Equational Programs. J. Symb. Comput. 15(5/6): 467-494 (1993)
- [j24]
- [j23]Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen: Calendrical Calculations, II: Three Historical Calendars. Softw., Pract. Exper. 23(4): 383-404 (1993)
- [c51]
- [c50]
- [c49]
- [c48]Nachum Dershowitz: A Taste of Rewrite Systems. Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 199-228
- [c47]
- [c46]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: More Problems in Rewriting. RTA 1993: 468-487
- [c45]
- 1992
- [c44]Nachum Dershowitz, Subrata Mitra, G. Sivakumar: Decidable Matching for Convergent Systems (Preliminary Version). CADE 1992: 589-602
- [c43]Nachum Dershowitz, Subrata Mitra: Path Orderings for Termination of Associative-Commutative Rewriting. CTRS 1992: 168-174
- [c42]
- [c41]
- 1991
- [j22]Nachum Dershowitz, Jean-Pierre Jouannaud: Notations for Rewting. Bulletin of the EATCS 43: 162-174 (1991)
- [j21]Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . . Theor. Comput. Sci. 83(1): 71-96 (1991)
- [c40]
- [c39]
- [c38]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Open Problems in Rewriting. RTA 1991: 445-456
- 1990
- [j20]Nachum Dershowitz, Edward M. Reingold: Calendrical Calculations. Softw., Pract. Exper. 20(9): 899-928 (1990)
- [j19]Nachum Dershowitz, Mitsuhiro Okada: A Rationale for Conditional Equational Programming. Theor. Comput. Sci. 75(1&2): 111-138 (1990)
- [p1]Nachum Dershowitz, Jean-Pierre Jouannaud: Rewrite Systems. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 243-320
- [c37]
- [c36]Nachum Dershowitz, Subrata Mitra, G. Sivakumar: Equation Solving in Conditional AC-Theories. ALP 1990: 283-297
- [c35]Nachum Dershowitz, Naomi Lindenstrauss: An Abstract Concurrent Machine for Rewriting. ALP 1990: 318-331
- [c34]
1980 – 1989
- 1989
- [j18]Nachum Dershowitz, Shmuel Zaks: Patterns in trees. Discrete Applied Mathematics 25(3): 241-255 (1989)
- [j17]N. Alan Josephson, Nachum Dershowitz: An Implementation of Narrowing. J. Log. Program. 6(1&2): 57-77 (1989)
- [j16]Leo Bachmair, Nachum Dershowitz: Completion for Rewriting Modulo a Congruence. Theor. Comput. Sci. 67(2&3): 173-201 (1989)
- [c33]
- [c32]Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted: Infinite Normal Forms (Preliminary Version). ICALP 1989: 249-262
- [c31]Nachum Dershowitz, Naomi Lindenstrauss: Average Time Analyses Related to Logic Programming. ICLP 1989: 369-381
- [c30]
- [e1]Nachum Dershowitz (Ed.): Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Lecture Notes in Computer Science 355, Springer 1989, ISBN 3-540-51081-8
- 1988
- [j15]Leo Bachmair, Nachum Dershowitz: Critical Pair Criteria for Completion. J. Symb. Comput. 6(1): 1-18 (1988)
- [j14]Nachum Dershowitz, Leo Marcus, Andrzej Tarlecki: Existence, Uniqueness, and Construction of Rewrite Systems. SIAM J. Comput. 17(4): 629-639 (1988)
- [c29]
- [c28]Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar: Canonical Conditional Rewrite Systems. CADE 1988: 538-549
- [c27]Nachum Dershowitz, Mitsuhiro Okada: Conditional Equational Programming and the Theory of Conditional Term Rewriting. FGCS 1988: 337-346
- [c26]Nachum Dershowitz, Mitsuhiro Okada: Proof-Theoretic Techniques for Term Rewriting Theory. LICS 1988: 104-111
- 1987
- [j13]
- [c25]Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar: Confluence of Conditional Rewrite Systems. CTRS 1987: 31-44
- [c24]
- [c23]Leo Bachmair, Nachum Dershowitz: A critical pair criterion for completion modulo a congruence. EUROCAL 1987: 452-453
- [c22]Leo Bachmair, Nachum Dershowitz: Inference Rules for Rewrite-Based First-Order Theorem Proving. LICS 1987: 331-337
- [c21]
- [c20]
- 1986
- [j12]Nachum Dershowitz, Shmuel Zaks: Ordered trees and non-crossing partitions. Discrete Mathematics 62(2): 215-218 (1986)
- [c19]
- [c18]Leo Bachmair, Nachum Dershowitz: Critical-pair criteria for the Knuth-Bendix completion procedure. SYMSAC 1986: 215-217
- [c17]
- [c16]N. Alan Josephson, Nachum Dershowitz: An Implementation of Narrowing: The RITE Way. SLP 1986: 187-197
- 1985
- [j11]
- [j10]
- [j9]Nachum Dershowitz: Program Abstraction and Instantiation. ACM Trans. Program. Lang. Syst. 7(3): 446-477 (1985)
- [c15]
- [c14]
- [c13]Nachum Dershowitz, David A. Plaisted: Logic Programming cum Applicative Programming. SLP 1985: 54-66
- 1984
- [c12]
- [c11]
- 1983
- [c10]Jieh Hsiang, Nachum Dershowitz: Rewrite Methods for Clausal and Non-Clausal Theorem Proving. ICALP 1983: 331-346
- [c9]Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, David A. Plaisted: Associative-Commutative Rewriting. IJCAI 1983: 940-944
- 1982
- [j8]
- 1981
- [j7]Nachum Dershowitz, Zohar Manna: Inference Rules for Program Annotation. IEEE Trans. Software Eng. 7(2): 207-222 (1981)
- [c8]
- [c7]Nachum Dershowitz: Termination of Linear Rewriting Systems (Preliminary Version). ICALP 1981: 448-458
- [c6]Nachum Dershowitz: The Evolution of Programs: Program Abstraction and Instantiation. ICSE 1981: 79-89
- 1980
- [j6]Nachum Dershowitz, Shmuel Zaks: Enumerations of ordered trees. Discrete Mathematics 31(1): 9-28 (1980)
- [j5]Nachum Dershowitz: The Schorr-Waite Marking Algorithm Revisited. Inf. Process. Lett. 11(3): 141-143 (1980)
1970 – 1979
- 1979
- [j4]Nachum Dershowitz, Zohar Manna: Proving Termination with Multiset Orderings. Commun. ACM 22(8): 465-476 (1979)
- [j3]
- [c5]
- [c4]
- 1978
- [j2]R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel: KEDMA - Linguistic Tools for Retrieval Systems. J. ACM 25(1): 52-66 (1978)
- [c3]
- 1977
- [j1]Nachum Dershowitz, Zohar Manna: The Evolution of Programs: Automatic Program Modification. IEEE Trans. Software Eng. 3(6): 377-385 (1977)
- [c2]
- [c1]Nachum Dershowitz, Zohar Manna: The Evolution of Programs: A System for Automatic Program Modification. POPL 1977: 144-154
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-28 21:36 CEST by the dblp team