Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
DLT
/
Paper
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices.
Daniel Prusa
,
Michael Wehar
Venue
C
DLT
Year
2020
Proceedings
DLT
DBLP record
conf/dlt/PrusaW20 ↗
Browse the full
DLT paper archive
.