Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
TAMC
/
Paper
Algorithms for Closest and Farthest String Problems via Rank Distance.
Liviu P. Dinu
,
Bogdan Dumitru
,
Alexandru Popa
Venue
C
TAMC
Year
2019
Proceedings
TAMC
DBLP record
conf/tamc/DinuDP19 ↗
Browse the full
TAMC paper archive
.