Entry Iyengar:1982:MLC from complngs.bib

Last update: Thu Jun 20 02:00:37 MDT 2019                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Iyengar:1982:MLC,
  author =       "S. Sitharama Iyengar and N. Parameswaran and John
                 Fuller",
  title =        "A measure of logical complexity of programs",
  journal =      j-COMP-LANGS,
  volume =       "7",
  number =       "3-4",
  pages =        "147--160",
  month =        "????",
  year =         "1982",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723",
  corpsource =   "Dept. of Computer Sci., Louisiana State Univ., Baton
                 Rouge, LA, USA",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "complexity measure; computational complexity; computer
                 software; cyclomatic complexity; data structures; graph
                 theory; logical complexity; program complexity; program
                 knots; software effort",
  treatment =    "T Theoretical or Mathematical",
}

Related entries