default search action
Noa Lewenstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j12]Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted scaled matching. Theor. Comput. Sci. 638: 27-32 (2016) - [j11]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - 2014
- [j10]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43(4): 1396-1416 (2014) - [j9]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting approximate periodic patterns. Theor. Comput. Sci. 525: 60-67 (2014) - [j8]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest periodic vectors in Lp spaces. Theor. Comput. Sci. 533: 26-36 (2014) - [c15]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Hypertext Searching - A Survey. Language, Culture, Computation (1) 2014: 364-381 - [c14]Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted Scaled Matching. CPM 2014: 70-78 - [c13]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. ICALP (1) 2014: 114-125 - [c12]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE 2014: 45-51 - [i3]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. CoRR abs/1405.0189 (2014) - 2013
- [j7]Ayelet Butman, Peter Clifford, Raphaël Clifford
, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
Pattern Matching under Polynomial Transformation. SIAM J. Comput. 42(2): 611-633 (2013) - [i2]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR abs/1306.0406 (2013) - 2012
- [c11]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12 - 2011
- [j6]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding witnesses by peeling. ACM Trans. Algorithms 7(2): 24:1-24:15 (2011) - [c10]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest Periodic Vectors in L p Spaces. ISAAC 2011: 714-723 - [i1]Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. CoRR abs/1109.1494 (2011)
2000 – 2009
- 2008
- [c9]Michal Armoni, Noa Lewenstein, Mordechai Ben-Ari:
Teaching students to think nondeterministically. SIGCSE 2008: 4-8 - 2007
- [c8]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. CPM 2007: 28-39 - [c7]Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat:
Jump-Matching with Errors. SPIRE 2007: 98-106 - 2005
- [c6]Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78 - 2000
- [j5]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching in Hypertext. J. Algorithms 35(1): 82-99 (2000) - [j4]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000) - [j3]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000)
1990 – 1999
- 1999
- [c5]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Indexing and Dictionary Matching with One Error. WADS 1999: 181-192 - 1998
- [j2]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998) - [c4]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220 - 1997
- [c3]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. FOCS 1997: 144-153 - [c2]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching In Hypertext. WADS 1997: 160-173 - 1996
- [j1]Noa Globerman, David Harel:
Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. Theor. Comput. Sci. 169(2): 161-184 (1996) - 1994
- [c1]Noa Globerman, David Harel:
Complexity Results for Multi-Pebble Automata and their Logics. ICALP 1994: 73-82
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-25 05:53 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: