ju.se
EnglishSvenskaNorsk
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
A BDD-based fast heuristic algorithm for disjoint decompos
Jönköping University, School of Engineering, JTH, Computer and Electrical Engineering.
Royal Institute of Technology, Stockholm.
Royal Institute of Technology, Stockholm.
2003 (Swedish)In: Proceedings of the ASP-DAC 2003, Asia and South Pacific Design Automation Conference 2003: January 21 - January 24, 2003, Kitakyushu International Conference Center, Kitakyushu, Japan, 2003, p. 191-196Conference paper, Published paper (Other academic)
Place, publisher, year, edition, pages
2003. p. 191-196
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:hj:diva-6460ISBN: 9780780376595 (print)OAI: oai:DiVA.org:hj-6460DiVA, id: diva2:37280
Available from: 2007-08-02 Created: 2007-08-02 Last updated: 2011-08-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Bengtsson, Tomas

Search in DiVA

By author/editor
Bengtsson, Tomas
By organisation
JTH, Computer and Electrical Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 310 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
v. 2.46.0
|
WCAG
|
Jönköping University
|
Jönköping University Library