Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
A Pumping-Like Lemma for Languages over Infinite Alphabets.
Yoav Danieli
Venue
A
STACS
Year
2026
Proceedings
STACS
DBLP record
conf/stacs/Danieli26 ↗
Browse the full
STACS paper archive
.