Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
Interspeech
/
Paper
An efficient algorithm for the n-best-strings problem.
Mehryar Mohri
,
Michael Riley
Venue
A
Interspeech
Year
2002
Proceedings
INTERSPEECH
DBLP record
conf/interspeech/MohriR02 ↗
Browse the full
Interspeech paper archive
.