liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
New Algorithms for the Maximum Hamming Distance Problem
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Applied Mathematics.
2004 (English)In: Joint Annual Workshop of ERCIMCoLogNet on Constraint Solving and Constraint Logic Programming,2004, 2004, 271-285 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2004. 271-285 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-22135Local ID: 1241OAI: oai:DiVA.org:liu-22135DiVA: diva2:242448
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2009-12-21

Open Access in DiVA

No full text

Authority records BETA

Angelsmark, OlaThapper, Johan

Search in DiVA

By author/editor
Angelsmark, OlaThapper, Johan
By organisation
The Institute of TechnologyTCSLAB - Theoretical Computer Science LaboratoryApplied Mathematics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 359 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf