Correction to ‘producing good code for the case statement’

Sampath Kannan, Todd A. Proebsting

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)233
Number of pages1
JournalSoftware: Practice and Experience
Issue number2
StatePublished - Feb 1994


  • Case statement
  • Code generation
  • NP‐complete

ASJC Scopus subject areas

  • Software

Cite this