Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISIT
/
Paper
(Quasi-)Linear-Time Algorithms for the Closest Vector Problem in (Semi-)Equiangular Lattices.
Kenta Takahashi
,
Wanaru Nakamura
Venue
B
ISIT
Year
2025
Proceedings
ISIT
DBLP record
conf/isit/TakahashiN25 ↗
Browse the full
ISIT paper archive
.