Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICCSA
/
Paper
Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN).
Vclav Skala
,
Michal Smolik
Venue
C
ICCSA
Year
2019
Proceedings
ICCSA (1)
DBLP record
conf/iccsa/SkalaS19 ↗
Browse the full
ICCSA paper archive
.