Show simple item record

dc.contributor.author
Labib, Karim
dc.contributor.supervisor
Widmayer, P.
dc.contributor.supervisor
Uznanski P.
dc.contributor.supervisor
Graf, D.
dc.date.accessioned
2018-03-20T08:52:36Z
dc.date.available
2018-03-16T14:32:19Z
dc.date.available
2018-03-20T08:52:36Z
dc.date.issued
2018
dc.identifier.uri
http://hdl.handle.net/20.500.11850/250668
dc.identifier.doi
10.3929/ethz-b-000250668
dc.format
application/pdf
en_US
dc.language.iso
en
en_US
dc.publisher
ETH Zurich
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.title
Completeness of Hamming Distance for Pattern Matching and All-Pairs Problems
en_US
dc.type
Master Thesis
dc.rights.license
In Copyright - Non-Commercial Use Permitted
ethz.size
72 p.
en_US
ethz.publication.place
Zurich
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
ethz.date.deposited
2018-03-16T14:32:20Z
ethz.source
FORM
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2018-04-01T10:10:21Z
ethz.rosetta.lastUpdated
2021-02-14T22:56:29Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Completeness%20of%20Hamming%20Distance%20for%20Pattern%20Matching%20and%20All-Pairs%20Problems&rft.date=2018&rft.au=Labib,%20Karim&rft.genre=unknown&rft.btitle=Completeness%20of%20Hamming%20Distance%20for%20Pattern%20Matching%20and%20All-Pairs%20Problems
 Search print copy at ETH Library

Files in this item

Thumbnail

Publication type

Show simple item record