default search action
Naomi Lindenstrauss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j3]Naomi Lindenstrauss, Michel Talagrand:
What is the satisfiability threshold of random balanced Boolean expressions? Random Struct. Algorithms 61(3): 599-615 (2022)
2000 – 2009
- 2004
- [p1]Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. Program Development in Computational Logic 2004: 453-498 - 2001
- [j2]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) - 2000
- [j1]Naomi Lindenstrauss, Nachum Dershowitz:
Abstract and-parallel Machines. Comput. Artif. Intell. 19(5): 475-493 (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
- [c9]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik
Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Verification of Logic Programs@ICLP 1999: 39-58 - 1997
- [c8]Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
TermiLog: A System for Checking Termination of Queries to Logic Programs. CAV 1997: 444-447 - [c7]Nachum Dershowitz, Naomi Lindenstrauss:
Abstract And-Parallel Machines. Euro-Par 1997: 1221-1225 - [c6]Naomi Lindenstrauss, Yehoshua Sagiv:
Automatic Termination Analysis of Logic Programs. ICLP 1997: 63-77 - [c5]Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Unfolding the Mystery of Mergesort. LOPSTR 1997: 206-225 - 1995
- [e1]Nachum Dershowitz, Naomi Lindenstrauss:
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 [contents] - 1990
- [b1]Naomi Lindenstrauss:
Search strategies for solutions to goals of horn clause programs and rewrite programs (אסטרטגיות לחפוש פתרונות למטרות של תכניות משפטי הורן ותכניות שכתוב). Hebrew University of Jerusalem, Israel, 1990 - [c4]Nachum Dershowitz, Naomi Lindenstrauss:
An Abstract Concurrent Machine for Rewriting. ALP 1990: 318-331 - [c3]Nachum Dershowitz, Naomi Lindenstrauss:
A parallel implementation of equational programming. Jerusalem Conference on Information Technology 1990: 426-435
1980 – 1989
- 1989
- [c2]Nachum Dershowitz, Naomi Lindenstrauss:
Average Time Analyses Related to Logic Programming. ICLP 1989: 369-381 - [c1]Naomi Lindenstrauss:
A Parallel Implementation of Rewriting and Narrowing. RTA 1989: 569-573
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: