Entry Durand:1999:DCC from lncs1999a.bib

Last update: Sun Jun 12 03:08:01 2016                Valid HTML 3.2!

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{Durand:1999:DCC,
  author =       "Bruno Durand and Alexander Shen and Nikolai
                 Vereshagin",
  title =        "Descriptive Complexity of Computable Sequences",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1563",
  pages =        "153--162",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:53:44 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1563.htm;
                 http://www.math.utah.edu/pub/tex/bib/lncs1999a.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1563/15630153.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1563/15630153.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "computer science; GI; MIMD; STACS",
}

Related entries