Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LATIN
/
Paper
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming.
Carles Padr
,
Leonor Vzquez
Venue
B
LATIN
Year
2010
Proceedings
LATIN
DBLP record
conf/latin/PadroV10 ↗
Browse the full
LATIN paper archive
.