| viXra.org > Data Structures and Algorithms > 2010 |
 |
 |
| viXra.org > Data Structures and Algorithms > 2010 |
|
|
[3] viXra:2010.0244 [pdf] submitted on 2020-10-30 08:56:21
Authors: Chun Lin
Comments: 7 Pages. [Corrections made by viXra Admin to conform with the requirements on the Submission Form]
The problem of LCS (longest common subsequence) and LIS (longest increasing subsequence) are both well-solved; the former was proved to be solvable in $O(nm/log{n})$ \cite{masek} and the later $O(nlog{log{n}})$ \cite{segal}. Recently, the problem LCIS (longest common increasing subsequence) was proposed. While it can be seen as a combination of the two aforementioned problems, it seems difficult to adapt their solutions to the LCIS problem. Most of the approaches to LCIS utilizes dynamic programming and sophisticated data structure to speed up, while we use a simple algorithm to attack the case where the alphabet size is extremely small comparing to the sequence lengths.
Category: Data Structures and Algorithms
[2] viXra:2010.0188 [pdf] submitted on 2020-10-23 10:38:56
Authors: Eliahu Shaikevich
Comments: 10 Pages. [Corrections made to conform with the requirements on the Submission Form]
There is such a historical number of trades N0 of both parities and such a way of placing them on the market that for any N > N0 the following inequality
always holds: M+(i) ≥ M−(i) + V−(i). we call it the Cover Theorem.
Category: Data Structures and Algorithms
[1] viXra:2010.0059 [pdf] submitted on 2020-10-09 20:02:43
Authors: Eren Unlu
Comments: 5 Pages.
A recently proposed temporal correlation based network framework applied on financial markets called Structural Entropy has prompted us to utilize it as a means of analysis for COVID-19 fatalities across countries. Our observation on the resemblance of volatility of fluctuations of daily novel coronavirus related number of deaths to the daily stock exchange returns suggests the applicability of this approach.
Category: Data Structures and Algorithms
| Third-Party Links: |
|