The following pages link to Liviu P. Dinu (Q1405583):
Displayed 24 items.
- An approach to syllables via some extensions of Marcus contextual grammars (Q1405584) (← links)
- Algorithms for closest and farthest string problems via rank distance (Q2327465) (← links)
- An efficient approach for the rank aggregation problem (Q2503315) (← links)
- The Minimum Entropy Submodular Set Cover Problem (Q2798728) (← links)
- Maximally Parallel Contextual String Rewriting (Q2827840) (← links)
- Spearman Permutation Distances and Shannon's Distinguishability (Q2898471) (← links)
- On the Closest String via Rank Distance (Q2904514) (← links)
- (Q3022291) (← links)
- (Q3145333) (← links)
- Coding Theory: A General Framework and Two Inverse Problems (Q3187047) (← links)
- From rankings’ collinearity to counting SDR's via chromatic list expression (Q3396413) (← links)
- On Insertion Grammars with Maximum Parallel Derivation (Q3398964) (← links)
- (Q3413364) (← links)
- (Q4454843) (← links)
- POSSIBILISTIC ENTROPIES AND THE COMPRESSION OF POSSIBILISTIC DATA (Q4809734) (← links)
- (Q4900317) (← links)
- (Q4905124) (← links)
- (Q5301985) (← links)
- Syllabic Languages and Go-through Automata (Q5415289) (← links)
- (Q5444816) (← links)
- (Q5506338) (← links)
- Cardinality of Balls in Permutation Spaces (Q6239990) (← links)
- Random Steinhaus Distances for Robust Syntax-Based Classification of Partially Inconsistent Linguistic Data (Q6485131) (← links)
- Steinhaus Transforms of Fuzzy String Distances in Computational Linguistics (Q6485349) (← links)