Entry Mislove:1995:FPC from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                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{Mislove:1995:FPC,
  author =       "M. W. Mislove and A. W. Roscoe and S. A. Schneider",
  title =        "Fixed points without completeness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "273--314",
  day =          "20",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:51 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1804",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240C (Computational complexity); C4240P
                 (Parallel programming and algorithm theory)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Dept. of Math., Tulane Univ., New Orleans, LA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "communicating sequential processes; complete metric
                 space; computational complexity; CSP operator;
                 deterministic timed processes; dominating space;
                 dominating spaces; FACS 3; fixed point theory; infinite
                 nondeterminism; locally complete partial order; set
                 theory; timed infinite traces model; timed
                 predeterministic processes; timing; unbounded
                 nondeterminism; underlying CSP mode; untimed CSP",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries