From Constraints to Algorithms. A case study of round elimination sequences

Simple item page
dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.advisorSuomela, Jukka
dc.contributor.authorBoström, Carl
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.supervisorAura, Tuomas
dc.date.accessioned2021-04-27T08:10:15Z
dc.date.available2021-04-27T08:10:15Z
dc.date.issued2020-12-11
dc.format.extent28
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/107062
dc.identifier.urnURN:NBN:fi:aalto-202104276351
dc.language.isoenen
dc.programmeTeknistieteellinen kandidaattiohjelmafi
dc.programme.majorTietotekniikkafi
dc.programme.mcodeSCI3027fi
dc.subject.keywordround eliminationen
dc.subject.keyworddistributed algorithmsen
dc.subject.keywordlocalityen
dc.subject.keywordlocally verifiable graph problemsen
dc.titleFrom Constraints to Algorithms. A case study of round elimination sequencesen
dc.typeG1 Kandidaatintyöfi
dc.type.dcmitypetexten
dc.type.ontasotBachelor's thesisen
dc.type.ontasotKandidaatintyöfi

Files

Collections

[kand] Perustieteiden korkeakoulu / SCI