Correction to ‘producing good code for the case statement’

Sampath Kannan; Todd A. Proebsting

doi:10.1002/spe.4380240206

Correction to ‘producing good code for the case statement’

Sampath Kannan, Todd A. Proebsting

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

An O(n²) algorithm for splitting a case statement's jump table into the minimum number of subtables (of a given density) is presented. Previously, the problem was thought to be NP‐complete.

Original language	English (US)
Pages (from-to)	233
Number of pages	1
Journal	Software: Practice and Experience
Volume	24
Issue number	2
DOIs	https://doi.org/10.1002/spe.4380240206
State	Published - Feb 1994
Externally published	Yes

Keywords

Case statement
Code generation
NP‐complete

ASJC Scopus subject areas

Software

Access to Document

10.1002/spe.4380240206

Cite this

@article{338dee95329d4cdbb4aa0c3b657770ab,

title = "Correction to {\textquoteleft}producing good code for the case statement{\textquoteright}",

abstract = "An O(n2) algorithm for splitting a case statement's jump table into the minimum number of subtables (of a given density) is presented. Previously, the problem was thought to be NP‐complete.",

keywords = "Case statement, Code generation, NP‐complete",

author = "Sampath Kannan and Proebsting, \{Todd A.\}",

year = "1994",

month = feb,

doi = "10.1002/spe.4380240206",

language = "English (US)",

volume = "24",

pages = "233",

journal = "Software: Practice and Experience",

issn = "0038-0644",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

TY - JOUR

T1 - Correction to ‘producing good code for the case statement’

AU - Kannan, Sampath

AU - Proebsting, Todd A.

PY - 1994/2

Y1 - 1994/2

N2 - An O(n2) algorithm for splitting a case statement's jump table into the minimum number of subtables (of a given density) is presented. Previously, the problem was thought to be NP‐complete.

AB - An O(n2) algorithm for splitting a case statement's jump table into the minimum number of subtables (of a given density) is presented. Previously, the problem was thought to be NP‐complete.

KW - Case statement

KW - Code generation

KW - NP‐complete

UR - https://www.scopus.com/pages/publications/84987231371

UR - https://www.scopus.com/inward/citedby.url?scp=84987231371&partnerID=8YFLogxK

U2 - 10.1002/spe.4380240206

DO - 10.1002/spe.4380240206

M3 - Article

AN - SCOPUS:84987231371

SN - 0038-0644

VL - 24

SP - 233

JO - Software: Practice and Experience

JF - Software: Practice and Experience

IS - 2

ER -

Correction to ‘producing good code for the case statement’

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this