%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.22",
%%%     date            = "16 August 2014",
%%%     time            = "09:14:11 MDT",
%%%     filename        = "tcs1995.bib",
%%%                        University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "11797 43569 170849 2032406",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography, BibTeX, Theoretical Computer
%%%                        Science",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of publications in
%%%                        the journal Theoretical Computer Science
%%%                        (CODEN TCSCDI, ISSN 0304-3975 (print),
%%%                        1879-2294 (electronic)), which began
%%%                        publishing in 1975.
%%%
%%%                        This file covers the years 1995--1999;
%%%                        companion files tcs19xx.bib and tcs20xx.bib
%%%                        each cover other pentads.
%%%
%%%                        The journal has World-Wide Web home sites
%%%                        at several locations:
%%%
%%%                        Title pages:
%%%                            http://www.elsevier.nl/locate/issn/03043975 (Europe)
%%%                            http://www.elsevier.com/locate/issn/03043975 (North America)
%%%                            http://www.elsevier.co.jp/locate/issn/03043975 (Japan)
%%%                            http://www.sciencedirect.com/science/journal/03043975
%%%
%%%                        Tables of contents:
%%%                            http://www.elsevier.nl/locate/tcs
%%%                            http://www.elsevier.nl/locate/estoc/03043975 (Europe)
%%%                            http://www.elsevier.com/locate/estoc/03043975 (North America)
%%%                            http://www.elsevier.co.jp/locate/estoc/03043975 (Japan)
%%%
%%%                        Elsevier Science alert page:
%%%                            http://www.elsevier.nl/mcs/tcs/Menu.html (Europe)
%%%
%%%                        The tables of contents sites begin coverage
%%%                        with Volume 91, Number 1, 1992, and have full
%%%                        text of articles from Volume 190, Number 1,
%%%                        1998.
%%%
%%%                        At version 1.22, the year coverage looked
%%%                        like this:
%%%
%%%                             1994 (   3)    2001 (   2)    2008 (   0)
%%%                             1995 ( 239)    2002 (   0)    2009 (   0)
%%%                             1996 ( 288)    2003 (   0)    2010 (   1)
%%%                             1997 ( 301)    2004 (   0)    2011 (   0)
%%%                             1998 ( 333)    2005 (   0)    2012 (   0)
%%%                             1999 ( 258)    2006 (   0)    2013 (   0)
%%%                             2000 (   2)    2007 (   0)    2014 (   1)
%%%
%%%                             Article:       1428
%%%
%%%                             Total entries: 1428
%%%
%%%                        This bibliography was prepared by merging
%%%                        data from the TeX Users Group bibliography
%%%                        archive, the BibNet Project archive, the OCLC
%%%                        Contents1st database, the Compendex database,
%%%                        the IEEE INSPEC database, and the journal Web
%%%                        pages.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.   Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order within each journal,
%%%                        using bibsort -byvolume.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{"\hyphenation{
        Bai-er
        He-ma-chan-dra
        Ko-ba-ya-shi
        Kri-zanc
        Lett-mann
        Mal-u-szyn-ski
        Mar-chet-ti
        Mar-u-o-ka
        Och-man-ski
        Pal-a-mi-des-si
        Piet-rzy-kow-ski
        Pros-ku-row-ski
        Pu-ru-sho-tha-man
        Ros-en-krantz
        Spor-tel-li
        Sturt-i-vant
        Ta-ka-da
        Vau-zeilles
        Win-kow-ski
        Win-skel
        to-po-log-ique
        }" #
    "\ifx \k \undefined
        \let \k = \c
        \immediate\write16{Ogonek accent unavailable: replaced by cedilla}
    \fi" #
    "\ifx \undefined \ocirc \def \ocirc #1{{\accent'27#1}}\fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-THEOR-COMP-SCI        = "Theoretical Computer Science"}

%%% ====================================================================
%%% Bibliography entries, sorted in publication order:

@Article{Matos:1994:PSI,
  author =       "Armando B. Matos",
  title =        "Periodic sets of integers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "127",
  number =       "2",
  pages =        "287--312",
  day =          "23",
  month =        may,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  note =         "See remark \cite{Petersen:1995:RPB}.",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=127&issue=2&aid=1479",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4220 (Automata theory)",
  corpsource =   "Centro de Inf., Porto Univ., Portugal",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "concatenation; context-free language; context-free
                 languages; directed graph; directed graphs; finite
                 automata; Kleene closure; periodic sets of integers;
                 regular expressions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Botelho:1994:BNN,
  author =       "Fernando Botelho and Max Garzon",
  title =        "{Boolean} neural nets are observable",
  journal =      j-THEOR-COMP-SCI,
  volume =       "134",
  number =       "1",
  pages =        "51--61",
  day =          "07",
  month =        nov,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  note =         "See erratum \cite{Botelho:1997:EBN}.",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=1&aid=1731",
  acknowledgement = ack-nhfb,
  classification = "C1230D (Neural nets); C4210 (Formal logic); C4220
                 (Automata theory)",
  conflocation = "Kyoto, Japan; 25-28 Aug. 1992",
  conftitle =    "Second International Colloquium on Words, Languages
                 and Combinatorics",
  corpsource =   "Dept. of Math. Sci., Memphis State Univ., TN, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximation errors; arbitrary cellular automata;
                 arbitrary locally finite discrete neural networks;
                 Boolean algebra; Boolean neural nets; cellular
                 automata; computer simulations; discretizations; linear
                 maps; neural nets; one dimensional grid; qualitative
                 behavior; shadowing property",
  pubcountry =   "Netherlands",
  sponsororg =   "Kyoto Sangyo Univ",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Galmiche:1994:PNL,
  author =       "Didier Galmiche and Guy Perrier",
  title =        "On proof normalization in linear logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "135",
  number =       "1",
  pages =        "67--110",
  day =          "05",
  month =        dec,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:36 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=135&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  note =         "See corrigendum \cite{Perrier:1998:CGP}.",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=135&issue=1&aid=1746",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C6110L (Logic programming); C6140D (High level
                 languages)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "CRIN-CNRS, Vandoeuvre les Nancy, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automated deduction; automatic proof construction;
                 formal logic; inference mechanisms; inference rules;
                 linear logic; logic programming; logic programming
                 languages; permutability properties; proof
                 normalization; proof-theoretic foundation; redundancy
                 reduction",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hagiya:1995:TCP,
  author =       "Masami Hagiya",
  title =        "A typed $\lambda$-calculus for proving-by-example and
                 bottom-up generalization procedure",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "3--23",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1786",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Dept. of Inf. Sci., Tokyo Univ., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bottom-up generalization; bounded quantification;
                 inference mechanisms; inferences; lambda calculus;
                 linear arithmetical terms; logical framework;
                 mathematical inductions; nested inductions;
                 proving-by-example; typed lambda calculus",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jantke:1995:CBR,
  author =       "Klaus P. Jantke and Steffen Lange",
  title =        "Case-based representation and learning of pattern
                 languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "25--51",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1787",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210L (Formal
                 languages and computational linguistics)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Fachbereich Inf., Math. und Naturwissenschaften,
                 Hochschule f{\"u}r Tech. Wirtschaft und Kultur Leipzig
                 (FH), Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "case-based reasoning; formal languages; inductively
                 learning; learnability; monotonic language learning;
                 pattern languages; representability problems;
                 semantics",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mukouchi:1995:TMT,
  author =       "Yasuhito Mukouchi and Setsuo Arikawa",
  title =        "Towards a mathematical theory of machine discovery
                 from facts",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "53--84",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1788",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1240 (Adaptive
                 system theory); C4210L (Formal languages and
                 computational linguistics)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ.,
                 Fukuoka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "context-sensitive grammars; discovery from facts;
                 inductive inference; inductive inference machines;
                 inference mechanisms; learning (artificial
                 intelligence); length-bounded elementary formal
                 systems; logic programs; machine discovery;
                 mathematical theory; refutability",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jain:1995:ATL,
  author =       "Sanjay Jain and Arun Sharma",
  title =        "On aggregating teams of learning machines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "85--108",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1789",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1240 (Adaptive
                 system theory); C4210L (Formal languages and
                 computational linguistics); C4220 (Automata theory)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "grammars; learning automata; learning machines;
                 learning power; success; success ratios; teams;
                 vacillatory identification",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sakurai:1995:VDD,
  author =       "Akito Sakurai",
  title =        "On the {VC-dimension} of depth four threshold circuits
                 and the complexity of {Boolean-valued} functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "109--127",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1790",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory);
                 C4240C (Computational complexity)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Adv. Res. Lab., Hitachi Ltd., Saitama, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; Boolean-valued functions;
                 complexity; computational complexity; depth four
                 threshold circuits; threshold circuits; threshold
                 elements; VC-dimension",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shinohara:1995:CCV,
  author =       "Ayumi Shinohara",
  title =        "Complexity of computing {Vapnik--Chervonenkis}
                 dimension and some generalized dimensions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "129--144",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1791",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ.,
                 Fukuoka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computability; computational complexity;
                 conjunctive normal form; learnability; learning
                 (artificial intelligence); NP-complete; PAC-learning;
                 polynomial-time reducible; satisfiability;
                 Vapnik--Chervonenkis dimension; VC-dimension",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hasegawa:1995:ALS,
  author =       "Susumu Hasegawa and Hiroshi Imai and Masaki Ishiguro",
  title =        "$\varepsilon$-approximations of $k$-label spaces",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "145--157",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1792",
  acknowledgement = ack-nhfb,
  classification = "C1240 (Adaptive system theory); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Dept. of Inf. Sci., Tokyo Univ., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-label spaces; computational complexity;
                 computational geometry; epsilon-approximation; learning
                 by example; learning from examples; negative examples;
                 positive examples; randomized algorithm; sample
                 complexity; Voronoi diagram",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nakamura:1995:ELL,
  author =       "Atsuyoshi Nakamura and Naoki Abe",
  title =        "Exact learning of linear combinations of monotone
                 terms from function value queries",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "159--176",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
                 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=137&issue=1&aid=1793",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "C and C Res. Labs., NEC Corp., Kawasaki, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; function value queries; learning
                 (artificial intelligence); learning algorithm; monotone
                 terms; time; worst case",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fernau:1995:VLA,
  author =       "Henning Fernau",
  title =        "Valuations of languages, with applications to fractal
                 geometry",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "177--217",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=137&issue=2&aid=1690",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4260 (Computational geometry); C6130B
                 (Graphics techniques)",
  corpsource =   "Lehrstuhl Inf. f{\"u}r Ingenieure und
                 Naturwissenschaftler, Karlsruhe Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Bernoulli morphisms; computational geometry;
                 context-free grammars; context-free languages;
                 Euclidean spaces; formal languages; fractal geometry;
                 fractals; Hausdorff dimension; morphisms; valuations of
                 languages",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fabre:1995:SSN,
  author =       "St{\'e}phane Fabre",
  title =        "Substitutions et syst{\`e}mes de num{\'e}ration.
                 ({French}) [{Substitutions} and beta numbering
                 systems]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "219--236",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=137&issue=2&aid=1692",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Dept. de Math., Univ. de Paris-Nord, Villetaneuse,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-automata; automata theory; beta numbering systems;
                 substitutions",
  language =     "English; French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Esik:1995:EPK,
  author =       "Z. {\'E}sik and L. Bern{\'a}tsky",
  title =        "Equational properties of {Kleene} algebras of
                 relations with conversion",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "237--251",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=137&issue=2&aid=1682",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Comput. Sci., A. Jozsef Univ., Szeged,
                 Hungary",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary relations; Boolean algebra; composition;
                 conversion; equational axioms; equational properties;
                 formal languages; Kleene algebras; reflexive-transitive
                 closure; relations with conversion; union",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Takahashi:1995:MSP,
  author =       "Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani",
  title =        "Mixed searching and proper-path-width",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "253--268",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=137&issue=2&aid=1813",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electr. and Electron. Eng., Tokyo Inst. of
                 Technol., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity results; computational complexity; game
                 theory; mixed search game; mixed-search number;
                 proper-path-width; search problems; searching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Breslauer:1995:FPS,
  author =       "Dany Breslauer",
  title =        "Fast parallel string prefix-matching",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "269--278",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=137&issue=2&aid=1811",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "CRCW-PRAM algorithm; KMP failure function; parallel
                 algorithms; parallel string prefix-matching; string
                 matching",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Arvind:1995:INP,
  author =       "Vikraman Arvind and Johannes K{\"o}bler and Uwe
                 Sch{\"o}ning and Rainer Schuler",
  title =        "If {NP} has polynomial-size circuits, then {MA$=$AM}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "279--282",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=137&issue=2&aid=1783",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Inst. of Math. Sci., Madras,
                 India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Arthur--Merlin hierarchy; computational complexity;
                 polynomial-size circuits; polynomial-time hierarchy",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Alur:1995:AAH,
  author =       "R. Alur and C. Courcoubetis and N. Halbwachs and T. A.
                 Henzinger and P.-H. Ho and X. Nicollin and A. Olivero
                 and J. Sifakis and S. Yovine",
  title =        "The algorithmic analysis of hybrid systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "3--34",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1836",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4220 (Automata
                 theory); C6110F (Formal methods)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic analysis; analog environment;
                 approximation techniques; convex polyhedra;
                 decidability; discrete program; finite automata; formal
                 specification; hybrid systems; infinite state space;
                 minimisation; minimization procedures; multidimensional
                 real space; piecewise-linear trajectories;
                 program-analysis techniques; reachability analysis;
                 symbolic model-checking",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Asarin:1995:RAD,
  author =       "Eugene Asarin and Oded Maler and Amir Pnueli",
  title =        "Reachability analysis of dynamical systems having
                 piecewise-constant derivatives",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "35--65",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1862",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1310 (Control
                 system analysis and synthesis methods); C4290 (Other
                 computer theory); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Inst. of Inf. Transmission Problems, Acad. of Sci.,
                 Moscow, Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computation theory; constant vector field; decision
                 procedure; discrete transitions; dynamical systems;
                 embedded systems; Euclidean space partitioning; hybrid
                 systems; PCD systems; piecewise-constant derivatives;
                 polyhedral sets; reachability analysis; real-time
                 systems; region boundaries; set theory; state-space
                 methods; state-space subsets; system description;
                 trajectory directions; two-dimensional systems;
                 undecidability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Branicky:1995:UCO,
  author =       "Michael S. Branicky",
  title =        "Universal computation and other capabilities of hybrid
                 and continuous dynamical systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "67--100",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1797",
  acknowledgement = ack-nhfb,
  classification = "C4170 (Differential equations); C4220 (Automata
                 theory); C4290 (Other computer theory)",
  corpsource =   "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asynchronous arbiter problem; clocks; closed subsets;
                 continuous dynamical systems; differential equations;
                 exact clock; finite automata; hybrid systems; Lipschitz
                 ODEs; ordinary differential equations; precise binary
                 timing pulse; reversible discrete dynamical systems;
                 simulation; Turing machines; universal computation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grossman:1995:AAH,
  author =       "R. L. Grossman and R. G. Larson",
  title =        "An algebraic approach to hybrid systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "101--112",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1796",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C1340K (Nonlinear control systems);
                 C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Dept. of Math. Stat. and Comput. Sci., Illinois Univ.,
                 Chicago, IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebra; algebraic model; continuous nonlinear control
                 systems; control theory; discrete finite state
                 automaton; discrete input symbols; finite automata;
                 hybrid systems; nonlinear control systems; realization
                 theory; switching; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hansen:1995:FD,
  author =       "Michael R. Hansen and Paritosh K. Pandya and Zhou
                 Chaochen",
  title =        "Finite divergence",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "113--139",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1795",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci., Tech. Univ. Denmark, Lyngby,
                 Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "accumulative divergence; axioms; dense divergence;
                 discrete divergence; duration calculus; finite
                 automata; finite divergence; hybrid systems; induction
                 rules; infinitely variable system state; nonlinear
                 systems; occurrence patterns; pathological behaviour;
                 proof rules; real-time systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kohn:1995:VHS,
  author =       "Wolf Kohn and Anil Nerode and Jeffrey B. Remmel and
                 Alexander Yakhnis",
  title =        "Viability in hybrid systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "141--168",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1800",
  acknowledgement = ack-nhfb,
  classification = "C1310 (Control system analysis and synthesis
                 methods); C4220 (Automata theory)",
  corpsource =   "Intermetrics Corp., Washington, DC, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closed viability set; compact control space; compact
                 state space; continuous plants; control theory; digital
                 automata; disturbances; enforcing viability; finite
                 automata; finite-state control automata; fixpoints;
                 graph operators; hybrid systems; interacting systems;
                 local viability graphs; nonempty closed subset;
                 performance specification; plant state trajectories;
                 state-space methods; sturdiness property; viable
                 trajectories",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lakhneche:1995:MTL,
  author =       "Yassine Lakhneche and Jozef Hooman",
  title =        "Metric temporal logic with durations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "169--199",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1801",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110F (Formal methods)",
  corpsource =   "Inst. f{\"u}r Inf. und Praktische Math., Kiel Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "axioms; continuous environment; duration calculus;
                 duration property proving; expressiveness; formal
                 specification; formal verification; integral formula;
                 metric temporal logic; real-time systems; sound rule;
                 specification; system state durations; temporal logic;
                 timed transition systems; verification",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lemmon:1995:IIV,
  author =       "Michael Lemmon and Panos J. Antsaklis",
  title =        "Inductively inferring valid logical models of
                 continuous-state dynamical systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "201--210",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1798",
  acknowledgement = ack-nhfb,
  classification = "C1310 (Control system analysis and synthesis
                 methods); C1320 (Stability in control theory); C1340D
                 (Discrete control systems)",
  corpsource =   "Dept. of Electr. Eng., Notre Dame Univ., IN, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "affine control policies; continuous time systems;
                 continuous-state dynamical systems; continuous-state
                 plant; control systems; control theory; control vector
                 space; controller synthesis; discrete event controller;
                 discrete event systems; ellipsoid method; equivalent
                 discrete-event system representation; hybrid control
                 systems; inductive inference; inductively determined
                 feasible points; initial plant state variations;
                 invariance; linear inequalities; logical invariance;
                 method-of-centers algorithm; plant transitions;
                 stability; stable transitions; state-space methods;
                 sufficient conditions; supervisory control; temporal
                 reasoning; valid logical models; vectors",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1995:CNS,
  author =       "Ying Zhang and Alan K. Mackworth",
  title =        "Constraint nets: a semantic model for hybrid dynamic
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "1",
  pages =        "211--239",
  day =          "06",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:49 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1;
                 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=1&aid=1799",
  acknowledgement = ack-nhfb,
  classification = "C1310 (Control system analysis and synthesis
                 methods); C1340D (Discrete control systems); C4240
                 (Programming and algorithm theory); C6110F (Formal
                 methods); C7420 (Control engineering computing)",
  corpsource =   "Dept. of Comput. Sci., British Columbia Univ.,
                 Vancouver, BC, Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract algebra; abstract topology; aggregation
                 operators; algebraic specification; asynchronous event
                 structures; constraint nets; constraint theory;
                 continuous components; continuous time systems; control
                 system synthesis; controller dynamics; discrete
                 components; discrete systems; environment dynamics;
                 event-controlled components; hierarchical modelling;
                 hybrid dynamic systems; hybrid real-time embedded
                 systems; multiple abstraction levels; plant dynamics;
                 programming theory; real-time systems; rigorous formal
                 programming semantics; robotic system; semantic model;
                 synchronous event structures; topology; unitary
                 framework",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Davies:1995:BHT,
  author =       "Jim Davies and Steve Schneider",
  title =        "A brief history of {Timed CSP}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "243--271",
  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=1803",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Dept. of Comput. Sci., Reading Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "communicating sequential processes; compositional
                 proof system; theorem proving; timed CSP; timed models;
                 timed process algebras; timed refinement; untimed
                 models",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@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",
}

@Article{Lowe:1995:PPM,
  author =       "Gavin Lowe",
  title =        "Probabilistic and prioritized models of timed {CSP}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "315--352",
  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=1805",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C4210L (Formal
                 languages and computational linguistics); C4240P
                 (Parallel programming and algorithm theory)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic laws; communicating sequential processes;
                 communications protocol; formal languages; fully
                 deterministic language; message transmission;
                 prioritized models; prioritized operators;
                 probabilistic choice operator; probabilistic language;
                 probabilistic models; probability; semantic model;
                 syntax; timed CSP; timing",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hennessy:1995:SB,
  author =       "M. Hennessy and H. Lin",
  title =        "Symbolic bisimulations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "353--389",
  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=1806",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Sch. of Cognitive and Comput. Sci., Sussex Univ.,
                 Brighton, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary finite symbolic trees; bisimulation
                 equivalence; Boolean algebra; Boolean expressions;
                 finite symbolic transition graphs; formal languages;
                 graph theory; infinite value set; labelled transition
                 graph; labelled transitions graph; operational
                 semantics; process algebra; symbolic actions; symbolic
                 bisimulations; symbolic transition graph; symbolic
                 transition graphs; value passing process languages",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DeNicola:1995:PAV,
  author =       "Rocco {De Nicola} and Roberto Segala",
  title =        "A process algebraic view of input\slash output
                 automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "391--423",
  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=1807",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Dipartimento di Sci. dell'Inf., Rome Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic characterization; automata theory; complete
                 axiomatization; concurrent algorithms; external trace
                 preorder relation; finitely branching transition
                 relation; finitely branching transition systems; I/O
                 automata; input enabling; input/output automata; local
                 control; many-sorted algebra; process algebra; process
                 algebraic view; recursion free processes;
                 specification; verification",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pinna:1995:NEA,
  author =       "G. Michele Pinna and Axel Poign{\'e}",
  title =        "On the nature of events: another perspective in
                 concurrency",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "425--454",
  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=1808",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240P (Parallel
                 programming and algorithm theory)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Gesellschaft f{\"u}r Math. und Datenverarbeitung mbH,
                 St. Augustin, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstraction; asymmetric conflict; automata theory;
                 concurrency; event automata; event based formalism;
                 geometric automata; parallel algorithms; partially
                 synchronous products; possible events; quiescent
                 states; reachable states; refinement; state change;
                 synchronization operators",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hodkinson:1995:GTF,
  author =       "Ian Hodkinson",
  title =        "On {Gabbay}'s temporal fixed point operator",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "1--25",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1725",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory)",
  corpsource =   "Dept. of Comput., Imperial Coll. of Sci., Technol. and
                 Med., London, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; decidable; executable temporal logic
                 system; monadic second-order logic; PSPACE-complete
                 satisfiability problem; temporal fixed point operator;
                 temporal logic; USF",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pappinghaus:1995:LU,
  author =       "Peter P{\"a}ppinghaus",
  title =        "On the logic of {UNITY}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "27--67",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1684",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C6110F (Formal methods); C6110P (Parallel
                 programming)",
  corpsource =   "Corp. Res. and Dev., Siemens AG, Munich, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; computational
                 power; decidability; fair execution sequences; formal
                 specification; halting set; infinitary closure
                 conditions; nondeterministic numerical function;
                 parallel programming; parallel programs; program
                 verification; programming logic; semantic completeness;
                 specification; transfinite induction; UNITY approach;
                 verification",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Cockett:1995:SCD,
  author =       "J. Robin B. Cockett and Dwight Spencer",
  title =        "Strong categorical datatypes. {II.} {A} term logic for
                 categorical programming",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "69--113",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1740",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; abstract language; categorical
                 programming; charity programming system; combinator
                 reduction system; complexity; computational complexity;
                 constructors; distributive categorical setting;
                 expressive computing environment; fold; Hagino-Wraith
                 style; program equivalences; programming theory; state
                 transformations; strong categorical datatypes; strong
                 type-forming functor; term logic; uniqueness
                 properties",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Barr:1995:NAC,
  author =       "Michael Barr",
  title =        "Nonsymmetric $*$-autonomous categories",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "115--130",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1730",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math. and Stat., McGill Univ., Montreal,
                 Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "equivalent forms; formal logic; linear logic;
                 nonsymmetric *-autonomous categories; nonsymmetric
                 linear logic; symmetric monoidal categories; temporal
                 dependencies",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ghelli:1995:DTC,
  author =       "Giorgio Ghelli",
  title =        "Divergence of {$F_<$} type checking",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "131--162",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1678",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C4250 (Database theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bounded second-order lambda abstraction; functional
                 languages; inheritance; lambda calculus; second-order
                 typed lambda calculus; subtype hierarchy; subtypes;
                 type checking; type theory; typed functional languages;
                 undecidability",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Divergence of {$F_&les;$} type checking",
  xxtitle =      "Divergence of {$F_\le$} type checking",
}

@Article{Bergeron:1995:SCD,
  author =       "Anne Bergeron",
  title =        "Sharing out control in distributed processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "163--186",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1773",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1340D (Discrete
                 control systems)",
  corpsource =   "LACIM, Montreal Univ., Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "controllable events; discrete event systems; discrete
                 processes; distributed control; distributed processes;
                 global specification; partial information; partial
                 observation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Malacaria:1995:SET,
  author =       "Pasquale Malacaria",
  title =        "Studying equivalences of transition systems with
                 algebraic tools",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "187--205",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1688",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "LIENS-DMI, Ecole Normale Superieure, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic framework; algebraic tools; bisimulation;
                 Boolean completion; equality of languages; equivalence
                 classes; equivalences; formal logic; minimal transition
                 system; monad; observational equivalences; skeleton
                 equivalence; subalgebras isomorphisms; trace
                 equivalence; transition systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dougherty:1995:CLA,
  author =       "Daniel J. Dougherty and Patricia Johann",
  title =        "A combinatory logic approach to higher-order
                 {E}-unification",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "207--242",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1844",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Wesleyan Univ., Middletown, CT, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatory logic approach; combinatory logic
                 framework; convergent term rewriting system;
                 first-order equational theory; formal logic;
                 higher-order E-unification; ordinary narrowing;
                 rewriting systems; type variables",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moschovakis:1995:CCP,
  author =       "Yiannis N. Moschovakis",
  title =        "Computable concurrent processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "243--273",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1758",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., California Univ., Los Angeles, CA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "classical set-functions; computability; concurrent
                 processes; fair merge constructs; normal form theorem;
                 process transformations; relative computability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bernot:1995:OSI,
  author =       "Gilles Bernot and Michel Bidoit and Teodor Knapik",
  title =        "Observational specifications and the
                 indistinguishability assumption",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "275--314",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1658",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110F (Formal methods); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "LIENS, Ecole Normale Superieure, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic specification; data type specifications;
                 equational axiom; formal specification;
                 indistinguishability assumption; observational
                 equality; observational satisfaction relation;
                 observational specifications; program verification;
                 semantics; software correctness; term observation",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Inverardi:1995:DOC,
  author =       "P. Inverardi and M. Nesi",
  title =        "Deciding observational congruence of finite-state
                 {CCS} expressions by rewriting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "315--354",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1715",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "axiomatization; calculus of communicating systems;
                 finite representation; finite-state CCS expressions;
                 guarded recursive CCS expressions; infinite
                 derivations; non terminating rewriting relation; normal
                 forms; normal process graph; observational congruence;
                 rewriting strategy; rewriting systems; structured fair
                 derivations; term rewriting approach",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weiermann:1995:TPT,
  author =       "Andreas Weiermann",
  title =        "Termination proofs for term rewriting systems by
                 lexicographic path orderings imply multiply recursive
                 derivation lengths",
  journal =      j-THEOR-COMP-SCI,
  volume =       "139",
  number =       "1--2",
  pages =        "355--362",
  day =          "06",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-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=139&issue=1-2&aid=1776",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Math. Logik und Grundlagenforschung,
                 Munster Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "lexicographic path orderings; multiply recursive
                 bound; multiply recursive derivation lengths; rewriting
                 systems; set theory; term rewriting systems;
                 termination proof; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pigozzi:1995:LAA,
  author =       "Don Pigozzi and Antonino Salibra",
  title =        "Lambda abstraction algebras: representation theorems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "1",
  pages =        "5--52",
  day =          "20",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1;
                 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=140&issue=1&aid=1837",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C4210 (Formal logic)",
  conflocation = "Enschede, Netherlands; 21-25 June 1993",
  conftitle =    "Third International Conference on Algebraic
                 Methodology and Software Technology, AMAST",
  corpsource =   "Dept. of Math., Iowa State Univ., Ames, IA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebra; combinatory algebras; lambda abstraction
                 algebras; lambda calculus; natural intrinsic
                 characterization; representation theorems; true
                 identities; universal algebra; untyped lambda
                 calculus",
  pubcountry =   "Netherlands",
  sponsororg =   "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
                 Univ. Stirling; INRIA; et al",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Laroussinie:1995:TBM,
  author =       "F. Laroussinie and S. Pinchinat and Ph. Schnoebelen",
  title =        "Translations between modal logics of reactive
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "1",
  pages =        "53--71",
  day =          "20",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1;
                 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=140&issue=1&aid=1838",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  conflocation = "Enschede, Netherlands; 21-25 June 1993",
  conftitle =    "Third International Conference on Algebraic
                 Methodology and Software Technology, AMAST",
  corpsource =   "Lifia, IMAG, Grenoble, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "backward modalities; branching bisimulation;
                 branching-time framework; expressivity; formal logic;
                 forward modalities; meaning-preserving translations;
                 modal logics; reactive systems; separation theorem",
  pubcountry =   "Netherlands",
  sponsororg =   "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
                 Univ. Stirling; INRIA; et al",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gorrieri:1995:TPD,
  author =       "Roberto Gorrieri and Marco Roccetti and Enrico
                 Stancampiano",
  title =        "A theory of processes with durational {Actions}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "1",
  pages =        "73--94",
  day =          "20",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1;
                 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=140&issue=1&aid=1839",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory); C6110F (Formal methods)",
  conflocation = "Enschede, Netherlands; 21-25 June 1993",
  conftitle =    "Third International Conference on Algebraic
                 Methodology and Software Technology, AMAST",
  corpsource =   "Dipartimento di Matematica, Bologna Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bisimulation based semantics; calculus of
                 communicating systems; durational actions; formal
                 specification; parallel programming; partial ordering
                 bisimulation equivalence; performance equivalence;
                 performance evaluation; process algebras; step
                 bisimulation equivalence; temporal logic",
  pubcountry =   "Netherlands",
  sponsororg =   "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
                 Univ. Stirling; INRIA; et al",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mokkedem:1995:UTL,
  author =       "Abdelillah Mokkedem and Dominique M{\'e}ry",
  title =        "On using temporal logic for refinement and
                 compositional verification of concurrent systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "1",
  pages =        "95--138",
  day =          "20",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1;
                 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=140&issue=1&aid=1840",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory); C6110F (Formal methods); C6110P
                 (Parallel programming)",
  conflocation = "Enschede, Netherlands; 21-25 June 1993",
  conftitle =    "Third International Conference on Algebraic
                 Methodology and Software Technology, AMAST",
  corpsource =   "CNRS, CRIN, Vandoeuvre les Nancy, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract semantics; coarser-grained program;
                 compositional proof systems; compositional
                 verification; concurrent program design; concurrent
                 systems; observation level; parallel programming;
                 parallel programs; program verification; refined
                 temporal language; refinement; temporal logic; temporal
                 logic semantics; temporal semantics; w-stuttering",
  pubcountry =   "Netherlands",
  sponsororg =   "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
                 Univ. Stirling; INRIA; et al",
  treatment =    "P Practical",
}

@Article{Navarro:1995:CMS,
  author =       "Marisa Navarro and Fernando Orejas and Ana
                 S{\'a}nchez",
  title =        "On the correctness of modular systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "1",
  pages =        "139--177",
  day =          "20",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1;
                 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=140&issue=1&aid=1841",
  acknowledgement = ack-nhfb,
  classification = "C6110B (Software engineering techniques)",
  conflocation = "Enschede, Netherlands; 21-25 June 1993",
  conftitle =    "Third International Conference on Algebraic
                 Methodology and Software Technology, AMAST",
  corpsource =   "Dept. Leng. y Syst. Inf., Pais Vasco Univ., San
                 Sebastian, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract framework; behavioural equivalence relation;
                 modular software design; modular systems correctness;
                 programming language levels; semantic constructs;
                 software engineering; specification; systems analysis",
  pubcountry =   "Netherlands",
  sponsororg =   "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
                 Univ. Stirling; INRIA; et al",
  treatment =    "P Practical",
}

@Article{Wagner:1995:RMO,
  author =       "E. G. Wagner",
  title =        "On the role of memory in object-based and
                 object-oriented languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "1",
  pages =        "179--199",
  day =          "20",
  month =        mar,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1;
                 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=140&issue=1&aid=1842",
  acknowledgement = ack-nhfb,
  classification = "C6110F (Formal methods); C6110J (Object-oriented
                 programming); C6120 (File organisation); C6140D (High
                 level languages)",
  conflocation = "Enschede, Netherlands; 21-25 June 1993",
  conftitle =    "Third International Conference on Algebraic
                 Methodology and Software Technology, AMAST",
  corpsource =   "Wagner Math., Garrison, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "class specification; formal specification;
                 inheritance; mathematical memory model; object-based
                 programming languages; object-oriented languages;
                 object-oriented programming languages; programming
                 constructs",
  pubcountry =   "Netherlands",
  sponsororg =   "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
                 Univ. Stirling; INRIA; et al",
  treatment =    "P Practical",
}

@Article{Dattasharma:1995:AVR,
  author =       "Abhi Dattasharma and S. Sathiya Keerthi",
  title =        "An augmented {Voronoi} roadmap for {$3$D}
                 translational motion planning for a convex polyhedron
                 moving amidst convex polyhedral obstacles",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "205--230",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1825",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C3390 (Robotics); C4240C (Computational
                 complexity); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci. and Autom., Indian Inst. of
                 Sci., Bangalore, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3D translational motion planning; augmented Voronoi
                 roadmap; computational complexity; computational
                 geometry; convex polyhedral obstacles; convex
                 polyhedron; disjoint components; geometric structure;
                 path planning; robot dynamics",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sarrafzadeh:1995:DWP,
  author =       "Majid Sarrafzadeh and Sanjeev R. Maddila",
  title =        "Discrete warehouse problem",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "231--247",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1826",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C3120C (Spatial
                 variables control); C3320 (Control applications to
                 materials handling); C3390 (Robotics)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Northwestern
                 Univ., Evanston, IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "discrete warehouse problem; feasible motions; motion
                 planning problems; movable obstacles; necessary and
                 sufficient conditions; obstacle manipulations;
                 obstacles; path planning; position control; robot;
                 robots; two-dimensional unit-square objects",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Prasad:1995:NCS,
  author =       "L. Prasad and S. S. Iyengar",
  title =        "A note on the combinatorial structure of the
                 visibility graph in simple polygons",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "249--263",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1827",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C3120C (Spatial variables control);
                 C3390 (Robotics); C4240C (Computational complexity);
                 C4260 (Computational geometry); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Louisiana State Univ., Baton
                 Rouge, LA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatorial structure; complexity; computational
                 complexity; computational geometry; computer science;
                 data structure; data structures; engineering;
                 hierarchical relationships; mathematical tool; motion
                 planning; necessary and sufficient conditions; path
                 planning; polyhedral objects; position control; robotic
                 navigation problems; shortest-path planning; simple
                 polygons; unknown-terrain learning; visibility graph",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1995:FPS,
  author =       "Nageswara S. V. Rao",
  title =        "On fast planning of suboptimal paths amidst polygonal
                 obstacles in plane",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "265--289",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1828",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Center for Eng. Syst. Adv. Res., Oak Ridge Nat. Lab.,
                 TN, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry;
                 destination point; hierarchical implementation;
                 navigational algorithms; obstacle vertices; path
                 planning; point robot; polygonal obstacles; shortest
                 path problem; source point; suboptimal paths planning;
                 time complexity; trapezoidal decomposition;
                 triangulation; upper bounds; Voronoi diagrams",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sridhar:1995:EAS,
  author =       "R. Sridhar and K. Han and N. Chandrasekharan",
  title =        "Efficient algorithms for shortest distance queries on
                 special classes of polygons",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "291--300",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1829",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C3390 (Robotics); C4240C (Computational
                 complexity); C4260 (Computational geometry)",
  corpsource =   "Sch. of Comput. Sci., Oklahoma Univ., Norman, OK,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "chordal graph; computational complexity; computational
                 geometry; CREW-PRAM model; K-chordal graph; motion
                 planning; parallel implementation; path planning;
                 polygons; query version; rectilinear minimum bend path;
                 rectilinear polygon; robotics; sequential preprocessing
                 algorithm; shortest distance queries; visibility
                 graphs",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{deBerg:1995:RGD,
  author =       "Mark de Berg and Leonidas Guibas and Dan Halperin and
                 Mark Overmars and Otfried Schwarzkopf and Micha Sharir
                 and Monique Teillaud",
  title =        "Reaching a goal with directional uncertainty",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "301--317",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1871",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C3120C (Spatial variables control)C4240C
                 (Computational complexity); C3355 (Control applications
                 in manufacturing processes); C3390 (Robotics); C4260
                 (Computational geometry)",
  corpsource =   "Vakgroep Inf., Utrecht Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry;
                 directional uncertainty; imperfect control; line
                 segments; lower bounds; maximum complexity; path
                 planning; planar motion planning for robots; polygonal
                 obstacles; position control; robots",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Seetharaman:1995:SDS,
  author =       "Guna Seetharaman",
  title =        "A simplified design strategy for mapping image
                 processing algorithms on a {SIMD} torus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "319--331",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1830",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C5260B (Computer vision and image
                 processing techniques); C5440 (Multiprocessing
                 systems)",
  corpsource =   "Comput. Vision and Pattern Recognition Lab., Univ. of
                 Southwestern Louisiana, Lafayette, LA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-D perception; computer vision; computer vision
                 paradigm; concurrent communication; dedicated
                 communication registers; design strategy; dynamic
                 behavior; histogram; Hough transform; mapping image
                 processing algorithms; matrix transpose algorithm;
                 median filters; multiprocessor interconnection
                 networks; multiview image-sequence analysis; parallel
                 algorithms; programming; SIMD algorithm; SIMD meshes;
                 SIMD torus; unstructured dynamic scenes",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Bettayeb:1995:AH,
  author =       "Sa{\"\i}d Bettayeb",
  title =        "On the $k$-ary hypercube",
  journal =      j-THEOR-COMP-SCI,
  volume =       "140",
  number =       "2",
  pages =        "333--339",
  day =          "03",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&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=140&issue=2&aid=1831",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci., Louisiana State Univ., Baton
                 Rouge, LA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-ary hypercube; equivalent binary hypercube;
                 equivalent mesh of processors; hamiltonicity; hypercube
                 networks; mesh network",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Gruau:1995:FSN,
  author =       "Fr{\'e}d{\'e}ric Gruau and Jean-Yves Ratajszczak and
                 Gilles Wiber",
  title =        "Fundamental study: a neural compiler",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "1--52",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1834",
  acknowledgement = ack-nhfb,
  classification = "C5290 (Neural computing techniques); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Lab. de l'Inf., du Parallelisme, Ecole Normale
                 Superieure de Lyon, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cellular code; compilation method; data flow graphs;
                 data flow machines; dataflow graph; graph grammars;
                 graph rewriting; intermediate code generation; neural
                 compilation; neural compiler; neural nets; neural
                 network; Pascal; PASCAL program; program compilers",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "A neural compiler",
}

@Article{Johansen:1995:LSM,
  author =       "Peter Johansen",
  title =        "On-line string matching with feedback",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "53--67",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1852",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Copenhagen Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "feedback; one-character buffer; online operation;
                 online string matching; pattern matching; stable
                 behaviour; string matching; string pattern matcher;
                 unstable behaviour",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Muller:1995:SAT,
  author =       "David E. Muller and Paul E. Schupp",
  title =        "Simulating alternating tree automata by
                 nondeterministic automata: {New} results and new proofs
                 of the theorems of {Rabin}, {McNaughton} and {Safra}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "69--107",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1848",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4220 (Automata
                 theory); C4240C (Computational complexity)",
  corpsource =   "Dept. of Math., Illinois Univ., Urbana, IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alternating tree automata; automata theory; complexity
                 results; computational complexity; nondeterministic
                 automata; simulation; theorem proving; trees
                 (mathematics); uniformizing strategies",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Downey:1995:FPT,
  author =       "Rod G. Downey and Michael R. Fellows",
  title =        "Fixed-parameter tractability and completeness {II}:
                 {On} completeness for {$W[1]$}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "109--131",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1738",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Math., Victoria Univ., Wellington, New
                 Zealand",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness; computational complexity;
                 fixed-parameter problems; fixed-parameter tractability;
                 parameterized problems; polynomial-time,;
                 tractability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yao:1995:ADT,
  author =       "Andrew Chi-Chih Yao",
  title =        "Algebraic decision trees and {Euler} characteristics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "133--150",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1723",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0250 (Combinatorial
                 mathematics); C1140E (Game theory); C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic decision trees; closed polyhedron; compact
                 semi-algebraic set; computational complexity; decision
                 theory; Euler characteristics; fixed-degree algebraic
                 decision tree; membership question; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kapur:1995:LLO,
  author =       "Shyam Kapur and Gianfranco Bilardi",
  title =        "Language learning without overgeneralization",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "151--162",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1716",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1240 (Adaptive
                 system theory); C6170K (Knowledge engineering
                 techniques)",
  corpsource =   "Inst. for Res. in Cognitive Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "conservative; consistency; consistent; Gold paradigm;
                 inductive inference; inference mechanisms; language
                 learning; learning (artificial intelligence); natural
                 constraints; overgeneralization; prudence; recursive
                 languages; responsive; responsiveness",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Apostolico:1995:PDA,
  author =       "Alberto Apostolico and Dany Breslauer and Zvi Galil",
  title =        "Parallel detection of all palindromes in a string",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "163--173",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1724",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "auxiliary space; concurrent-read concurrent-write
                 parallel algorithms; general alphabets; n-processor
                 algorithm; optimal-speedup; parallel algorithms;
                 parallel detection of palindromes",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jenner:1995:CFP,
  author =       "Birgit Jenner and Jacobo Tor{\'a}n",
  title =        "Computing functions with parallel queries to {NP}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "175--193",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1721",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Fakultat f{\"u}r Inf., Tech. Univ. Munchen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "function classes; functional versions;
                 nondeterministic bits; parallel algorithms; parallel
                 queries; polylogarithmic factor; polynomial-time
                 truth-table languages; subexponential time bound",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gorrieri:1995:ICC,
  author =       "Roberto Gorrieri and Ugo Montanari",
  title =        "On the implementation of concurrent calculi in net
                 calculi: two case studies",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "195--252",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1714",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dipartimento di Matematica, Bologna Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "calculus of communicating systems; CCS; concurrent
                 calculi; implementation mapping; labelled transition
                 system; net calculi; permutation-of-transitions;
                 place/transition Petri net; RCCS; relabelling; SCONE;
                 truly concurrent semantics",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kari:1995:MPL,
  author =       "Lila Kari and Alexandru Mateescu and Gheorghe
                 P{\u{a}}un and Arto Salomaa",
  title =        "Multi-pattern languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "253--268",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1728",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Math., Turku Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; finitely many patterns; formal
                 languages; hierarchies; inductive inference; inference
                 mechanisms; multi-pattern languages; term rewriting;
                 theory of learning",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Haastad:1995:SER,
  author =       "Johan H{\aa}stad and Alexander Razborov and Andrew
                 Yao",
  title =        "On the shrinkage exponent for read-once formulae",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "269--282",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1722",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., R. Inst. of Technol., Stockholm,
                 Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; input variables; polylogarithmic
                 factor; read-once de Morgan formula; read-once
                 formulae; shrinkage exponent",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sieling:1995:GDB,
  author =       "Detlef Sieling and Ingo Wegener",
  title =        "Graph driven {BDDs} --- a new data structure for
                 {Boolean} functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "283--310",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1719",
  acknowledgement = ack-nhfb,
  classification = "B1265B (Logic circuits); C4210 (Formal logic);
                 C5210B (Computer-aided logic design)C6120 (File
                 organisation)",
  corpsource =   "Fachbereich Inf., Dortmund Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; CAD tools; data structure; data
                 structures; graph driven binary decision diagrams;
                 hidden weighted bit function; indirect storage access
                 function; logic CAD; logic verification; logical
                 synthesis process; polynomial size; test pattern
                 generation",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Mizoguchi:1995:RGR,
  author =       "Yoshihiro Mizoguchi and Yasuo Kawahara",
  title =        "Relational graph rewritings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "311--328",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1717",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4250 (Database theory)",
  corpsource =   "Dept. of Control Eng. and Sci., Kyushu Inst. of
                 Technol., Iizuka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary relations; critical pairs; graph grammars;
                 relational algebra; relational calculus; relational
                 graph rewritings; rewriting systems; sufficient
                 condition",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Petersen:1995:RPB,
  author =       "H. Petersen",
  title =        "A remark on a paper by {A. B. Matos}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "329--330",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  note =         "See \cite{Matos:1994:PSI}.",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=141&issue=1-2&aid=1851",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "context sensitive languages; context-sensitive
                 languages; word-lengths",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Terrier:1995:RTO,
  author =       "V{\'e}ronique Terrier",
  title =        "On real time one-way cellular array",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "331--335",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1846",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Lab. d'Inf., Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cellular arrays; cellular logic; context free
                 languages; context-free languages; real time one-way
                 cellular array",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Dessmark:1995:MLL,
  author =       "Anders Dessmark and Andrzej Lingas and Anil
                 Maheshwari",
  title =        "Multi-list layering: {Complexity} and applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "337--350",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1847",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "almost complete problem; combinatorial generalization;
                 complexity; computational complexity; computational
                 geometry; convex layer problem; logspace-hard;
                 multilist layering; NC algorithms; P-complete;
                 polynomial time",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Justin:1995:QAF,
  author =       "J. Justin and G. Pirillo",
  title =        "On a question about factorization forests",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "351--355",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-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=141&issue=1-2&aid=1843",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. Blaise Pascal, LITP, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "factorization forests; number theory; strongly
                 Ramseyan functions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maluszynski:1995:P,
  author =       "J. Maluszynski and M. Wirsing",
  title =        "Preface",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "1",
  pages =        "1--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Aasa:1995:PSI,
  author =       "Annika Aasa",
  title =        "Precedences in specifications and implementations of
                 programming languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "1",
  pages =        "3--26",
  day =          "01",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&issue=1;
                 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=142&issue=1&aid=1860",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C6110F
                 (Formal methods); C6140 (Programming languages)",
  conflocation = "Passau, Germany; 26-28 Aug. 1991",
  conftitle =    "Programming Language Implementation and Logic
                 Programming. 3rd Int. Symposium",
  corpsource =   "Dept. of Comput. Sci., Chalmers Univ. of Technol.,
                 Goteborg, Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational linguistics; context-free grammars;
                 formal specification; infix operator; operator
                 precedence parser; postfix operator; precedence rules;
                 prefix operator; programming languages; specifications;
                 syntax tree; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alpuente:1995:ICS,
  author =       "Mar{\'\i}a Alpuente and Moreno Falaschi and Giorgio
                 Levi",
  title =        "Incremental constraint satisfaction for equational
                 logic programming",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "1",
  pages =        "27--57",
  day =          "01",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&issue=1;
                 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=142&issue=1&aid=1858",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4210L (Formal languages and
                 computational linguistics); C6110L (Logic
                 programming)",
  conflocation = "Passau, Germany; 26-28 Aug. 1991",
  conftitle =    "Programming Language Implementation and Logic
                 Programming. 3rd Int. Symposium",
  corpsource =   "Dept. de Sistemas Inf. y Comput., Univ. Politecnica de
                 Valencia, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computability; computational linguistics; constraint
                 logic programming; equational logic programming;
                 Herbrand universe; Horn clauses; Horn equational
                 theory; incremental constraint satisfaction; logic
                 programming; operational semantics; optimization;
                 semantic unification; solvability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Loogen:1995:DDD,
  author =       "Rita Loogen and Stephan Winkler",
  title =        "Dynamic detection of determinism in functional logic
                 languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "1",
  pages =        "59--87",
  day =          "01",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&issue=1;
                 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=142&issue=1&aid=1859",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110L (Logic programming); C6140D (High
                 level languages)",
  conflocation = "Passau, Germany; 26-28 Aug. 1991",
  conftitle =    "Programming Language Implementation and Logic
                 Programming. 3rd Int. Symposium",
  corpsource =   "Fachgebiet Inf., Philipps-Univ., Marburg, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational linguistics; determinism; deterministic;
                 functional languages; functional logic languages; logic
                 programming; nonambiguity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Proietti:1995:UDF,
  author =       "Maurizio Proietti and Alberto Pettorossi",
  title =        "Unfolding--definition--folding, in this order, for
                 avoiding unnecessary variables in logic programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "1",
  pages =        "89--124",
  day =          "01",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&issue=1;
                 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=142&issue=1&aid=1861",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110L
                 (Logic programming)",
  conflocation = "Passau, Germany; 26-28 Aug. 1991",
  conftitle =    "Programming Language Implementation and Logic
                 Programming. 3rd Int. Symposium",
  corpsource =   "IASI-CNR, Roma, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "data structures; logic programming; logic programs;
                 predicates; programming theory; syntactical
                 characterization; transformation techniques;
                 unfold/fold transformation;
                 unfolding-definition-folding",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nilsson:1995:AIK,
  author =       "Ulf Nilsson",
  title =        "Abstract interpretation: a kind of magic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "1",
  pages =        "125--138",
  day =          "01",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&issue=1;
                 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=142&issue=1&aid=1857",
  acknowledgement = ack-nhfb,
  classification = "C6110L (Logic programming); C6160K (Deductive
                 databases); C6170 (Expert systems)",
  conflocation = "Passau, Germany; 26-28 Aug. 1991",
  conftitle =    "Programming Language Implementation and Logic
                 Programming. 3rd Int. Symposium",
  corpsource =   "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
                 Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract interpretation; bottom-up evaluation;
                 database queries; deductive databases; definite logic
                 program; logic programming; magic sets; magic
                 templates; query processing; top-down computation",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Kirchner:1995:E,
  author =       "C. Kirchner",
  title =        "Editorial",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "139--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Lynch:1995:RCC,
  author =       "Christopher Lynch and Wayne Snyder",
  title =        "Redundancy criteria for constrained completion",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "141--177",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1908",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C6110L (Logic
                 programming); C6170K (Knowledge engineering
                 techniques)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "Dept. of Comput. Sci., Boston Univ., MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completion procedures; constrained completion;
                 constraint handling; critical pairs; first-order
                 formulae; inference mechanisms; inference systems;
                 irreducibility predicate; prime superposition;
                 redundancy; redundancy criteria; rigorous analysis",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dershowitz:1995:NT,
  author =       "Nachum Dershowitz and Charles Hoot",
  title =        "Natural termination",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "179--207",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1909",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm
                 theory)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "forward closures; natural termination; path orderings;
                 program verification; programming theory; rewrite
                 systems; rewriting systems; simplification orderings",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rubio:1995:TAC,
  author =       "Albert Rubio and Robert Nieuwenhuis",
  title =        "A total {AC-compatible} ordering based on {RPO}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "209--227",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1910",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "Tech. Univ. of Catalonia, Barcelona, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "AC-RPO ordering; AC-symbols; built-in AC-unification;
                 complete theorem proving; rewriting systems; RPO; RPO
                 ordering; signature; simplification ordering; theorem
                 proving; total AC-compatible ordering",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Baader:1995:CTD,
  author =       "Franz Baader and Klaus U. Schulz",
  title =        "Combination techniques and decision problems for
                 disunification",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "229--255",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1911",
  acknowledgement = ack-nhfb,
  classification = "C1140E (Game theory); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "LuFG Theor. Inf., Tech. Hochschule Aachen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decision problems; decision theory; disjoint
                 equational theories; disunification; free algebra;
                 function symbol; ground solvability; linear constant
                 restriction; logic programming; rewriting systems;
                 theorem proving; unification algorithm",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Senizergues:1995:SUT,
  author =       "G{\'e}raud S{\'e}nizergues",
  title =        "Some undecidable termination problems for {semi-Thue}
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "257--276",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1912",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "fixed rule; program verification; programming theory;
                 semi-Thue systems; theorem proving; undecidable
                 termination problems; uniform termination problem;
                 uniformly terminating semi-Thue system",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Asperti:1995:PCL,
  author =       "Andrea Asperti and Cosimo Laneve",
  title =        "Paths, computations and labels in the
                 lambda-calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "277--297",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1913",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "Dipartimento di Matematica, Bologna Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "labels; lambda calculus; overlining;
                 path-characterization; reasoning; redex-families;
                 underlining",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gallier:1995:PPT,
  author =       "Jean Gallier",
  title =        "Proving properties of typed $\lambda$-terms using
                 realizability and covers, and sheaves",
  journal =      j-THEOR-COMP-SCI,
  volume =       "142",
  number =       "2",
  pages =        "299--368",
  day =          "15",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=142&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=142&issue=2&aid=1914",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  conflocation = "Montreal, Que., Canada; 16-18 June 1993",
  conftitle =    "5th International Conference on Rewriting Techniques
                 and Applications",
  corpsource =   "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "confluence; cover algebra; covers; lambda calculus;
                 metatheorem; proving properties; realizability;
                 reducibility; sheaves; strong normalization; theorem
                 proving; type theory; typed lambda-terms",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Van:1995:CRL,
  author =       "Do Long Van and B. {Le Saec} and I. Litovsky",
  title =        "Characterizations of rational $\omega$-languages by
                 means of right congruences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "1--21",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1741",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory)",
  corpsource =   "Inst. of Math., Hanoi, Viet Nam",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata theory; cycle congruence; formal languages;
                 minimal automaton; rational omega-languages; right
                 congruences; syntactic congruence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Krithivasan:1995:NPA,
  author =       "Kamala Krithivasan and Meena Mahajan",
  title =        "Nondeterministic, probabilistic and alternating
                 computations on cellular array models",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "23--49",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1737",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Madras, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alternating computations; cellular array models;
                 cellular automata; cellular automaton; nondeterminism;
                 nondeterministic computations; probabilistic
                 computations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Antimirov:1995:RER,
  author =       "Valentin M. Antimirov and Peter D. Mosses",
  title =        "Rewriting extended regular expressions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "51--72",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1726",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210L (Formal
                 languages and computational linguistics); C6170K
                 (Knowledge engineering techniques)",
  corpsource =   "CRIN, Inst. Nat. de Recherche en Inf. et Autom.,
                 Villers-les-Nancy, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complete Horn-equational axiomatization; distributive
                 lattice; extended algebra; extended regular expressions
                 rewriting; Horn clauses; inference mechanisms;
                 intersection; logical inferences; monotonic operations;
                 regular events; rewriting systems; term-rewriting
                 techniques; valid equations",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bender:1995:PIO,
  author =       "Michael A. Bender and Michel Gastaldo and Michel
                 Morvan",
  title =        "Parallel interval order recognition and construction
                 of interval representations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "73--91",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1739",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5440 (Multiprocessing systems)",
  corpsource =   "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "data structure; distributed memory systems;
                 distributed-memory machines; interval representations
                 construction; optimal probabilistic algorithms;
                 parallel algorithms; parallel interval order
                 recognition; parallel random access machines;
                 transitively-closed directed graph",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldstein:1995:CPG,
  author =       "Arthur S. Goldstein and Edward M. Reingold",
  title =        "The complexity of pursuit on a graph",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "93--112",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1872",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0250 (Combinatorial
                 mathematics); C1140E (Game theory); C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatorial games; complexity of pursuit;
                 computational complexity; EXPTIME-complete;
                 EXPTIME-completeness; game theory; graph theory;
                 initial positions; NP-hard; PSPACE-completeness;
                 PSPACE-hard",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jiang:1995:SCS,
  author =       "Tao Jiang and Vadim G. Timkovsky",
  title =        "Shortest consistent superstrings computable in
                 polynomial time",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "113--122",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1886",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci. and Syst., McMaster Univ.,
                 Hamilton, Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry; DNA
                 sequencing; hybridization; longest common
                 nonsuperstring; negative strings; NP-hard; polynomial
                 time; shortest consistent superstrings",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ito:1995:OST,
  author =       "Akira Ito and Katsushi Inoue and Itsuo Takanami and
                 Yue Wang",
  title =        "Optimal simulation of two-dimensional alternating
                 finite automata by three-way nondeterministic {Turing}
                 machines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "123--135",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1869",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci. and Syst. Eng., Yamaguchi Univ.,
                 Ube, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; finite automata; optimal
                 simulation; rectangular input tapes; space complexity;
                 three-way nondeterministic Turing machines; Turing
                 machines; two-dimensional alternating finite automata",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jiang:1995:ATA,
  author =       "Tao Jiang and Lusheng Wang and Kaizhong Zhang",
  title =        "Alignment of trees --- an alternative to tree edit",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "137--148",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1867",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., McMaster Univ., Hamilton, Ont.,
                 Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alignment of trees; computational complexity; labeled
                 trees; MAX SNP-hard; multiple alignment; polynomial
                 time; time complexity; tree edit; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Juedes:1995:WC,
  author =       "David W. Juedes and Jack H. Lutz",
  title =        "Weak completeness in {$E$} and {$E_2$}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "149--158",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1866",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity classes; computational complexity;
                 languages; weak completeness",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crescenzi:1995:RSS,
  author =       "Pierluigi Crescenzi and Christos H. Papadimitriou",
  title =        "Reversible simulation of space-bounded computations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "159--165",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1875",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Rome Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Bennett's simulation; deterministic automata;
                 deterministic Turing machines; nondeterministic Turing
                 machines; reversible simulation; space-bounded
                 computations; Turing machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Miltersen:1995:CPC,
  author =       "Peter Bro Miltersen",
  title =        "On the cell probe complexity of polynomial
                 evaluation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "167--174",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1870",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cell probe complexity; computational complexity;
                 finite field; polynomial evaluation; polynomials;
                 trivial cell probe algorithm",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "P. B. Miltersen",
}

@Article{DePrisco:1995:MPL,
  author =       "Roberto {De Prisco} and Giuseppe Parlati and Giuseppe
                 Persiano",
  title =        "Minimal path length of trees with known fringe",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "175--188",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1;
                 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=143&issue=1&aid=1877",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Columbia Univ., New York, NY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational geometry; known fringe; linear time
                 algorithm; minimal path length; trees; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Malgouyres:1995:GGC,
  author =       "R{\'e}my Malgouyres",
  title =        "Graphs generalizing closed curves with linear
                 construction of the {Hamiltonian} cycle.
                 {Parametrization} of discretized curves",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "189--249",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1775",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. d'Inf., Campus Univ. des Cezaux, Aubiere Cedex,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closed curves; computational geometry; discretized
                 curves; good graphs; graph theory; Hamiltonian cycle;
                 linear algorithm; linear construction;
                 parametrization",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matamala:1995:RCP,
  author =       "Mart{\'\i}n Matamala",
  title =        "Recursive construction of periodic steady state for
                 neural networks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "251--267",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1755",
  acknowledgement = ack-nhfb,
  classification = "C1230D (Neural nets)",
  corpsource =   "Dept. Ingenieria Matematica, Chile Univ., Santiago,
                 Chile",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "equivalence relation; neural nets; neural networks;
                 periodic steady state; recursive construction;
                 steady-state periodic behavior",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Harrison:1995:DPP,
  author =       "John Harrison",
  title =        "Dynamical properties of {PWD$0$L} systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "269--284",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1750",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Math. Sci, Binghamton Univ., Vestal, NY.,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary finite alphabet; context-sensitive language;
                 context-sensitive languages; decidable; DOL language;
                 dynamical properties; emptiness problem; finite morphic
                 refinement; finite partition; finiteness; morphic
                 equivalence relation; periodicity; piecewise
                 deterministic zero Lindenmayer scheme; PWDOL system",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Slutzki:1995:DTT,
  author =       "Giora Slutzki and S{\'a}ndor V{\'a}gv{\"o}lgyi",
  title =        "Deterministic top-down tree transducers with iterated
                 look-ahead",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "285--308",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1752",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "deterministic automata; deterministic top-down
                 look-ahead; deterministic top-down tree automata;
                 deterministic top-down tree transducers; deterministic
                 top-down tree transformations; iterated look-ahead",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1995:MDS,
  author =       "Zhi-Zhong Chen",
  title =        "The maximal $f$-dependent set problem for planar
                 graphs is in {NC}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "309--318",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1753",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Fac. of Sci. and Eng., Tokyo Denki Univ., Saitama,
                 Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry; CRCW
                 PRAM; graph theory; Max-f-DS problem; maximal
                 f-dependent set problem; NC; nonnegative integer-valued
                 function; planar graphs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fraenkel:1995:MNM,
  author =       "Aviezri S. Fraenkel and Alan Jaffray and Anton Kotzig
                 and Gert Sabidussi",
  title =        "Modular {Nim} (mathematical game)",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "319--333",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1894",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory)",
  corpsource =   "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
                 of Sci., Rehovot, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "2-player perfect information game; game theory;
                 Kotzig'r Nim; mathematical game; Modular Nim; unlabeled
                 points",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gubas:1995:NLB,
  author =       "Xaver Gub{\'a}{\v{s}} and Juraj Hromkovi{\v{c}} and
                 Juraj Waczul{\'\i}k",
  title =        "A nonlinear lower bound on the practical combinational
                 complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "335--342",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1903",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Comenius Univ., Bratislava,
                 Slovakia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean circuit; Boolean functions; combinational
                 complexity; computational complexity; constant-degree
                 parallel architectures; infinite sequence; nonlinear
                 lower bound; nonlinear number; one-output Boolean
                 functions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rytter:1995:CFR,
  author =       "Wojciech Rytter",
  title =        "Context-free recognition via shortest paths
                 computation: a version of {Valiant}'s algorithm",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "343--352",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1899",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymptotic complexity; Boolean matrices; computational
                 complexity; computational geometry; context-free
                 languages; context-free recognition; graph theory;
                 lattice graphs; nonassociativity; shortest paths;
                 shortest paths computation; shortest paths problem;
                 Valiant's algorithm",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1995:ALC,
  author =       "Louxin Zhang",
  title =        "On the approximation of longest common
                 nonsupersequences and shortest common nonsubsequences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "2",
  pages =        "353--362",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=143&issue=2&aid=1891",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary alphabet; computational complexity; longest
                 common nonsupersequences approximation; Max SNP-hard;
                 NP-complete; shortest common nonsubsequences",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Prodinger:1995:P,
  author =       "H. Prodinger and W. Szpankowski",
  title =        "Preface",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "1--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Flajolet:1995:MTAa,
  author =       "Philippe Flajolet and Xavier Gourdon and Philippe
                 Dumas",
  title =        "{Mellin} transforms and asymptotics: {Harmonic} sums",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "3--58",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1958",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0290Z (Other
                 numerical methods); C1160 (Combinatorial mathematics);
                 C4190 (Other numerical methods); C6120 (File
                 organisation)",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymptotics; average-case analysis; combinatorial
                 mathematics; common base function; communication
                 theory; data structures; digital data structures;
                 discrete probabilistic models; harmonic sums; integral
                 transforms; Mellin transforms; probabilistic
                 algorithms; transforms",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bergeron:1995:CDF,
  author =       "Fran{\c{c}}ois Bergeron and Ulrike Sattler",
  title =        "Constructible differentially finite algebraic series
                 in several variables",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "59--65",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1931",
  acknowledgement = ack-nhfb,
  classification = "B0220 (Mathematical analysis); B0290P (Differential
                 equations); C1120 (Mathematical analysis); C4170
                 (Differential equations)",
  corpsource =   "Quebec Univ., Montreal, Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closure properties; constructible differentially
                 finite algebraic series; differential equations;
                 first-order differential equations; functional
                 equation; series (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Drmota:1995:MCC,
  author =       "Michael Drmota and Mich{\`e}le Soria",
  title =        "Marking in combinatorial constructions: {Generating}
                 functions and limiting distributions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "67--99",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1928",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Discrete Math., Tech. Univ. Wien, Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatorial constructions; combinatorial
                 mathematics; generating functions; limiting
                 distributions; local limit theorems; logarithmic
                 singularity; marking; random mappings; trees; trees
                 (mathematics); uniform approximations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Flajolet:1995:MTAb,
  author =       "Philippe Flajolet and Robert Sedgewick",
  title =        "{Mellin} transforms and asymptotics: {Finite}
                 differences and {Rice}'s integrals",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "101--124",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1915",
  acknowledgement = ack-nhfb,
  classification = "B0230 (Integral transforms)B0250 (Combinatorial
                 mathematics); B0290Z (Other numerical methods); C1130
                 (Integral transforms); C1160 (Combinatorial
                 mathematics); C4190 (Other numerical methods)",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymptotics; combinatorics; contour integration;
                 digital search trees; digital tries; distributed leader
                 election; finite differences; high order differences;
                 Mellin transforms; quadtrees; residue calculus; Rice's
                 integrals; simple number sequences; transforms; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gardy:1995:DAS,
  author =       "Dani{\`e}le Gardy and Guy Louchard",
  title =        "Dynamic analysis of some relational databases
                 parameters",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "125--159",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1939",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C6160D
                 (Relational databases)",
  corpsource =   "Lab. PRISM, Versailles Univ., Saint-Quentin, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "covariance; deletions; dynamic analysis; Gaussian
                 processes; insertions; probability distribution;
                 queries; query optimization; query processing; random
                 variable; relational databases; relational databases
                 parameters; relational operator; updates",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Jacquet:1995:ABL,
  author =       "Philippe Jacquet and Wojciech Szpankowski",
  title =        "Asymptotic behavior of the {Lempel--Ziv} parsing
                 scheme and digital search trees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "161--197",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1932",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B6120B (Codes);
                 C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C6120 (File organisation); C6130
                 (Data handling techniques)C4210 (Formal logic)",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "analytical techniques; asymptotic behavior; data
                 compression; de-Poissonization; differential-functional
                 equations; digital search trees; grammars; Lempel--Ziv
                 parsing scheme; Markovian models; Mellin transform;
                 memoryless source; multiplicative
                 differential-functional equation; probabilistic
                 techniques; renewal equation; shortest substring; tree
                 searching; trees (mathematics); unequal probabilities;
                 uniform integrability; variable phrases",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Asymptotic behaviour of the {Lempil-Ziv} parsing
                 scheme in digital search trees",
}

@Article{Kirschenhofer:1995:AOS,
  author =       "Peter Kirschenhofer and Conrado Mart{\'\i}nez and
                 Helmut Prodinger",
  title =        "Analysis of an optimized search algorithm for skip
                 lists",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "199--220",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1930",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.
                 Wien, Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "key-to-key comparisons; optimized search algorithm;
                 precise analysis; skip lists; total search cost; tree
                 data structures; tree searching",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Mahmoud:1995:PAB,
  author =       "Hosam M. Mahmoud and Robert T. Smythe",
  title =        "Probabilistic analysis of bucket recursive trees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "221--249",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1942",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Stat., George Washington Univ., Washington,
                 DC, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bucket recursive trees; depth probability generating
                 function; ghost nodes; multitype nodes; multivariate
                 central limit theorem; multivariate structure; Polya
                 urn models; probabilistic analysis; probability;
                 stochastic rule; tree data structures; tree height",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Schachinger:1995:VCI,
  author =       "Werner Schachinger",
  title =        "On the variance of a class of inductive valuations of
                 data structures for digital search",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "251--275",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1940",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6120 (File
                 organisation)",
  corpsource =   "Inst. f{\"u}r Stat. Oper. Res. und Computerverfahren,
                 Wien Univ., Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Bernoulli model; binary tries; continuous periodic
                 function; data structures; digital search; inductive
                 valuations; Patricia tries; sufficient conditions; tree
                 data structures; tree searching",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Schmid:1995:RTQ,
  author =       "U. Schmid",
  title =        "Random trees in queueing systems with deadlines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "277--314",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-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=144&issue=1-2&aid=1916",
  acknowledgement = ack-nhfb,
  classification = "B0240C (Queueing theory); B0250 (Combinatorial
                 mathematics); C1140C (Queueing theory); C1160
                 (Combinatorial mathematics); C4210 (Formal logic)",
  corpsource =   "Dept. of Autom., Tech. Univ. Wien, Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aperiodic tasks; asymptotic methods; deadline meeting
                 properties; discrete-time single-server queueing
                 system; queueing systems; queueing theory; random
                 trees; scheduling; scheduling algorithms; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Braga:1995:PGE,
  author =       "G. Braga and G. Cattaneo and P. Flocchini and C.
                 {Quaranta Vogliotti}",
  title =        "Pattern growth in elementary cellular automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "1--26",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1782",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "LIP, Ecole Normale Superieure de Lyon, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cellular automata; chaotic characteristics; dynamical
                 properties; elementary cellular automata; necessary and
                 sufficient conditions; pattern growth; shift-like
                 behavior",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Srikrishna:1995:OPA,
  author =       "G. Srikrishna and C. {Pandu Rangan}",
  title =        "Optimal parallel algorithms for path problems on
                 planar graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "27--43",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1823",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Madras, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "all-bidirectional-edges; biconnected planar graph;
                 bridges; computational geometry; disjoint problem; edge
                 labeling; optimal parallel algorithms; parallel
                 algorithms; path problems; planar graphs; vertices",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Breitbart:1995:SBD,
  author =       "Y. Breitbart and H. {Hunt, III} and D. Rosenkrantz",
  title =        "On the size of binary decision diagrams representing
                 {Boolean} functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "45--69",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1815",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary BDDs; asymptotically sharp bounds; binary
                 decision diagrams; binary decision trees; Boolean
                 functions; branching programs; complexity; computation
                 path; computational complexity; lower bounds;
                 read-once-only branching programs; upper bounds",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Leiss:1995:ILE,
  author =       "Ernst L. Leiss",
  title =        "Implicit language equations: existence and uniqueness
                 of solutions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "71--93",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1810",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "concatenation; existence; explicit language equations;
                 formal languages; implicit language equations; union;
                 uniqueness",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Diks:1995:AWR,
  author =       "Krzysztof Diks and Evangelos Kranakis and Adam
                 Malinowski and Andrzej Pelc",
  title =        "Anonymous wireless rings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "95--109",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1812",
  acknowledgement = ack-nhfb,
  classification = "B6210L (Computer communications); C5620L (Local area
                 networks); C5640 (Protocols)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "anonymous wireless rings; computational model;
                 hardware rings; ring networks; token networks",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Creignou:1995:CPL,
  author =       "Nadia Creignou",
  title =        "The class of problems that are linearly equivalent to
                 {Satisfiability} or a uniform method for proving
                 {NP}-completeness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "111--145",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1816",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Dept. de Math., Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-Colorability; 3-Dimensional Matching; 3-Exact Cover;
                 computability; computational complexity; computational
                 model; Cubic Subgraph; decidability; Kernel of Graph;
                 linear-time equivalent; linear-time transformations;
                 linearly equivalent; natural combinatorial problems;
                 NP- completeness; Partition into Hamiltonian Subgraphs;
                 Partition into Paths; Partition into Triangles; Path
                 with Forbidden Pairs; Path without Chord; Restricted
                 Perfect Matching; SAT-equivalent; satisfiability;
                 sorting; sortings; Turing machine; uniform method",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stewart:1995:CPM,
  author =       "Iain A. Stewart",
  title =        "Complete problems for monotone {NP}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "147--157",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1809",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Univ. Coll. of Swansea, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "comparability graphs; complete problems; computational
                 complexity; cubic subgraph; digraph; Hamiltonian path;
                 monotone NP; monotone projection translations;
                 polynomial-time reductions; uniquely partially
                 orderable graphs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Drewes:1995:GSA,
  author =       "F. Drewes and A. Habel and H.-J. Kreowski and S.
                 Taubenberger",
  title =        "Generating self-affine fractals by collage grammars",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "159--187",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1759",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6130B (Graphics techniques); C6180 (User
                 interfaces)",
  corpsource =   "Fachbereich Math. und Inf., Bremen Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "circles; collage grammars; computer graphics; fractal
                 pattern; fractals; generalized Sierpinski grammars;
                 grammars; hyperedge replacement; line segments;
                 polygons; polyhedra; self-affine fractals;
                 self-similarity; syntactic devices",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cai:1995:UMD,
  author =       "Jiazhen Cai and Robert Paige",
  title =        "Using multiset discrimination to solve language
                 processing problems without hashing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "189--228",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib;
                 UnCover library database",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=145&issue=1-2&aid=1817",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6180N (Natural language processing)",
  corpsource =   "Dept. of Comput. Sci., Courant Inst. of Math. Sci.,
                 New York, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "basic block optimization; compiler methodology; global
                 optimization; grammar manipulation; grammars;
                 isomorphism problems; language processing problems;
                 lexicographic sorting; multiset discrimination; natural
                 languages; symbol table formation; worst case running
                 time",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Reutenauer:1995:VFR,
  author =       "Christophe Reutenauer and Marcel Paul
                 Sch{\"u}tzenberger",
  title =        "Vari{\'e}t{\'e}s et fonctions rationnelles. ({French})
                 [{Varieties} and rational functions]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "229--240",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1814",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Quebec Univ., Montreal, Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aperiodic monoids; formal languages; free monoid;
                 group theory; pro-finite topology; rational functions;
                 rational language; transducer; varieties",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ko:1995:PTC,
  author =       "Ker-I Ko",
  title =        "A polynomial-time computable curve whose interior has
                 a nonrecursive measure",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "241--270",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1781",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York, Stony
                 Brook, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational geometry; interior region; nonrecursive
                 measure; nonrecursive real number; polynomial-time
                 computable curve; two-dimensional plane",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Biran:1995:TBR,
  author =       "Ofer Biran and Shlomo Moran and Shmuel Zaks",
  title =        "Tight bounds on the round complexity of distributed
                 $1$-solvable tasks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "271--290",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1784",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C5640
                 (Protocols)",
  corpsource =   "IBM Israel Sci. and Technol. Center, Haifa, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1-solvable task; 1-solvable tasks; approximate
                 consensus; binary monotone consensus; computational
                 complexity; distributed 1-solvable tasks; order
                 preserving renaming; protocol; protocols; renaming;
                 round complexity; tight bounds; upper bound",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ginsburg:1995:IQO,
  author =       "Seymour Ginsburg and Katsumi Tanaka",
  title =        "Interval queries on object histories",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "291--316",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1774",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160D (Relational
                 databases)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Southern California,
                 Los Angeles, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closure property; computational-tuple sequence scheme;
                 database theory; interval queries; object histories;
                 relational databases",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Middendorf:1995:FVM,
  author =       "Martin Middendorf",
  title =        "On finding various minimal, maximal, and consistent
                 sequences over a binary alphabet",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "317--327",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1954",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Inst. f{\"u}r Angewandte Inf. und Formale
                 Beschreibungsverfahren, Karlsruhe Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary alphabet; complexity; computational complexity;
                 consistent sequences; longest minimal common
                 supersequence; MAX SNP-hard; shortest maximal common
                 subsequence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "On finding minimal, maximal, and consistent sequences
                 over a binary alphabet",
}

@Article{Jamison:1995:LTR,
  author =       "B. Jamison and S. Olariu",
  title =        "A linear-time recognition algorithm for
                 {$P_4$}-reducible graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "329--344",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1956",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
                 recognition); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "chordless path; clustering; cographs; computational
                 geometry; computational semantics; graph theory;
                 isomorphism; linear-time recognition algorithm; P/sub
                 4/-reducible graphs; pattern recognition; scheduling;
                 unique tree representation",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zhang:1995:CRB,
  author =       "Liang Zhang and Zhonghui Shen",
  title =        "Completion of recognizable bifix codes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "345--355",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1934",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130 (Data handling techniques)",
  corpsource =   "Shanghai Inst. of Urban Constru., China",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bifix codes; codes; embedding method; finite bifix
                 code; recognizable bifix codes",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Benson:1995:SEA,
  author =       "Gary Benson",
  title =        "A space efficient algorithm for finding the best
                 nonoverlapping alignment score",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "357--369",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1943",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition)",
  corpsource =   "Dept. of Math., Univ. of Southern California, Los
                 Angeles, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "best nonoverlapping alignment score; biological
                 context; chromosome; DNA; human disease; localizing
                 genes; maximum alignment score; pattern recognition;
                 protein molecules; single string; space efficient
                 algorithm",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hemaspaandra:1995:PSI,
  author =       "Lane A. Hemaspaandra and Zhigen Jiang",
  title =        "{P}-selectivity: {Intersections} and indices",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "371--380",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1924",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-ary Boolean connectives; almost-completely
                 degenerate; Boolean functions; complexity;
                 computational complexity; index set; indices;
                 intersections; P-selectivity; polynomial-time
                 algorithm",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Teng:1995:ISV,
  author =       "Shang-Hua Teng",
  title =        "Independent sets versus perfect matchings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "381--390",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1923",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bipartite graph; computational geometry; implicitly
                 represented large-scale graphs; independent sets; NC
                 algorithm; parallel algorithms; perfect matchings;
                 polynomial time random matching algorithm; random walk;
                 structural relationships; uniform random perfect
                 matching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maler:1995:DTP,
  author =       "Oded Maler",
  title =        "A decomposition theorem for probabilistic transition
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "391--396",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-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=145&issue=1-2&aid=1944",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C4220 (Automata
                 theory)",
  corpsource =   "VERIMAG, Montbonnot, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Bernoulli process; decomposability; decomposition
                 theorem; deterministic automata; finite Markov chain;
                 Markov processes; permutation-reset deterministic
                 automata; probabilistic systems; probabilistic
                 transition systems; randomness; state-homomorphic
                 image",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Scedrov:1995:MA,
  author =       "Andre Scedrov and Dennis DeTurk and Wolfgang Ziller",
  title =        "{Moez Alimohamed}, 1967--1994",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "1--3",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1941",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Alimohamed:1995:CLD,
  author =       "Moez Alimohamed",
  title =        "A characterization of lambda definability in
                 categorical models of implicit polymorphism",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "5--23",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1917",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Dept. of Math., Pennsylvania Univ., Philadelphia, PA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "categorical models; category theory; ccc models;
                 glueing; implicit polymorphism; lambda calculus; lambda
                 definability; sconing; simply typed lambda calculus;
                 type variables",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bloom:1995:SOS,
  author =       "Bard Bloom",
  title =        "Structural operational semantics for weak
                 bisimulations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "25--68",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1779",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "branching bisimulation; calculus of communicating
                 systems; CCS; equational axiom systems; observational
                 congruence; process algebra; rooted branching
                 bisimulation; rooted weak bisimulation; rule formats;
                 silent moves; structural operational semantics; WB cool
                 rules; weak bisimulations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ariola:1995:PFO,
  author =       "Zena M. Ariola and Arvind XXX",
  title =        "Properties of a first-order functional language with
                 sharing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "69--108",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1819",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4210L (Formal
                 languages and computational linguistics); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Oregon Univ., Eugene,
                 OR, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "argument subexpressions; calculus; compiler
                 optimizations; compilers; first-order functional
                 language; formal languages; functional languages; graph
                 rewriting system; graphs; GRS; lambda calculus;
                 left-cyclic rules; non-left-linear rules; optimisation;
                 program compilers; recursive functions; rewriting
                 systems; sharing; term model",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxnote =       "Check second author name: truncated at Web site.",
}

@Article{Cassez:1995:CER,
  author =       "Franck Cassez and Olivier Roux",
  title =        "Compilation of the {ELECTRE} reactive language into
                 finite transition systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "109--143",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1777",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240 (Programming and
                 algorithm theory); C6140D (High level languages);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "CNRS, Nantes Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asynchronous approach; asynchronous language; ELECTRE;
                 finite state machines; finite state transition system;
                 finite transition systems; finite-state machine; high
                 level languages; language compilation; operational
                 semantics; program compilers; programming theory;
                 reactive language; real-time systems; structural
                 induction; transition system",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kemp:1995:BEQ,
  author =       "David B. Kemp and Divesh Srivastava and Peter J.
                 Stuckey",
  title =        "Bottom-up evaluation and query optimization of
                 well-founded models",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "145--184",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1780",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6140D (High level
                 languages); C6160K (Deductive databases)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary programs; bottom-up evaluation; database
                 theory; deductive database; deductive databases; logic
                 programming languages; magic sets; negation; program
                 transformations; query languages; query optimization;
                 query processing; semi-naive evaluation; sideways
                 information of passing strategies; stratified programs;
                 unstratified negation; well-founded models",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Berghammer:1995:FDP,
  author =       "Rudolf Berghammer and Birgit Elbl and Ulf Schmerl",
  title =        "Formalizing {Dijkstra}'s predicate transformer wp in
                 weak second-order logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "185--197",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1818",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. f{\"u}r Inf. und Praktische Math., Kiel Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "formal languages; formal logic; many sorted language;
                 normal form theorem; predicate transformer; syntax;
                 theorem proving; weak second-order logic; wp",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bonacina:1995:TFC,
  author =       "Maria Paola Bonacina and Jieh Hsiang",
  title =        "Towards a foundation of completion procedures as
                 semidecision procedures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "199--242",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1821",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completion procedures; confluent rewrite systems;
                 contraction inference rules; decision theory;
                 equational theories; fairness; inductionless induction
                 method; inductive conjectures; inference mechanisms;
                 inference rules; Knuth--Bendix completion; rewriting
                 systems; search plan; semidecision procedures; theorem
                 proving",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Backofen:1995:CRF,
  author =       "Rolf Backofen and Gert Smolka",
  title =        "A complete and recursive feature theory",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "243--268",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1822",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110L (Logic programming); C6120
                 (File organisation)",
  corpsource =   "German Res. Center for Artificial Intelligence,
                 Saarlandes Univ., Saarbrucken, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary predicates; completeness; computational
                 linguistics; constraint-based grammar formalisms; data
                 structure; decidability; feature descriptions; feature
                 graphs; feature trees; features; first-order theory;
                 functional attributes; grammars; logic programming
                 languages; possibly quantified feature descriptions;
                 possibly quantified first-order formulae; programming
                 theory; record-like data structure; recursive feature
                 theory; satisfiability; sorts; terminating
                 simplification system; tree data structures; unary
                 predicates; validity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Naughton:1995:ARF,
  author =       "J. F. Naughton and R. Ramakrishnan and Y. Sagiv and J.
                 D. Ullman",
  title =        "Argument reduction by factoring",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "269--310",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1820",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "argument reduction; factoring; Magic Sets
                 transformation; optimisation; optimization; predicate;
                 programming theory; recursive functions; recursive
                 predicate; rewriting systems; separable recursions",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "J. F. Naughton and P. Ramakrishnan and Y. Sagiv and J.
                 D. Ullman",
}

@Article{Alessi:1995:FPT,
  author =       "Fabio Alessi and Paolo Baldan and Gianna Bell{\`e}",
  title =        "A fixed-point theorem in a category of compact metric
                 spaces",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "311--320",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1955",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Matematica e Inf., Udine Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "category; category theory; compact metric spaces;
                 contractivity; embedding-projection pairs;
                 endofunctors; existence; fixed-point theorem;
                 programming theory; uniqueness",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kobayashi:1995:FPM,
  author =       "Yuji Kobayashi",
  title =        "A finitely presented monoid which has solvable word
                 problem but has no regular complete presentation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "321--329",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1898",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Inf. Sci., Toho Univ., Funabashi, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "finite complete rewriting systems; finitely presented
                 monoid; group theory; regular complete system;
                 rewriting systems; solvable word problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1995:MSF,
  author =       "Guo-Qiang Zhang",
  title =        "On maximal stable functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "331--339",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1794",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Georgia Univ., Athens, GA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; dI-domains; Hausdorff
                 property; maximal elements; maximal stable functions;
                 sufficient condition; topological properties",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ingolfsdottir:1995:LES,
  author =       "Anna Ing{\'o}lfsd{\'o}ttir",
  title =        "Late and early semantics coincide for testing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "341--349",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-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=146&issue=1-2&aid=1938",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math. and Comput. Sci., Aalborg Univ.,
                 Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bisimulation-like equivalences; calculus of
                 communicating systems; CCS; operational semantics;
                 preorders; semantics",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bampis:1995:OPE,
  author =       "E. Bampis and J.-C K{\"o}nig and D. Trystram",
  title =        "Optimal parallel execution of complete binary trees
                 and grids into most popular interconnection networks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "1--18",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1901",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complete binary trees; computational complexity; de
                 Brujin interconnection network; distributed memory
                 systems; grid interconnection network; grids; hypercube
                 interconnection network; hypercube networks;
                 interconnection networks; linear interconnection
                 network; local communications; multiprocessor
                 interconnection networks; optimal parallel execution;
                 optimal time; parallel algorithms; parallel
                 distributed-memory computers; PRAM model; processor
                 scheduling; scheduling algorithms; trees (mathematics);
                 two-dimensional grid precedence graph",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gasieniec:1995:ZMR,
  author =       "Leszek G{\k{a}}sieniec and Wojciech Plandowski and
                 Wojciech Rytter",
  title =        "The zooming method: a recursive approach to time-space
                 efficient string-matching",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "19--30",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1883",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity); C6130
                 (Data handling techniques)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; formal languages;
                 Galil-Seiferas algorithm; linear-time constant-space
                 algorithm; maximal suffix; nonordered alphabets;
                 ordered alphabets; preprocessing phase; recursive
                 approach; recursive functions; search problems;
                 searching phase; string matching; time-space efficient
                 string-matching; two-dimensional patterns; zooming
                 method",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "L. Gasiemec and W. Plandowski and W. Rytter",
}

@Article{Bodlaender:1995:PCS,
  author =       "Hans L. Bodlaender and Rodney G. Downey and Michael R.
                 Fellows and Harold T. Wareham",
  title =        "The parameterized complexity of sequence alignment and
                 consensus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "31--54",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1885",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alphabet; asymptotic model; computational complexity;
                 feasible computability; fixed size alphabets;
                 fixed-parameter tractability; formal languages; longest
                 common subsequence problem; parameterized computational
                 complexity; parameters; sequence alignment; sequence
                 consensus; sequences; unrestricted alphabet sizes",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sureson:1995:NCN,
  author =       "Claude Sureson",
  title =        "{NP}{$\not=$}co-{NP} and models of arithmetic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "55--67",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1868",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Paris VII Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity question; computational complexity; exact
                 characterization; models of arithmetic; semantic
                 approach",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "{N Not Equal Co-NP} and models of arithmetic",
}

@Article{Jansen:1995:MBT,
  author =       "Klaus Jansen and Haiko M{\"u}ller",
  title =        "The minimum broadcast time problem for several
                 processor networks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "69--85",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1864",
  acknowledgement = ack-nhfb,
  classification = "B6210L (Computer communications); C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity); C5620 (Computer networks and techniques)",
  corpsource =   "Fachbereich IV-Math. und Inf., Trier Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bipartite planar graphs; broadcasting; chordal graphs;
                 communication network; complete grid graphs;
                 computational complexity; computer networks; graph
                 theory; grid graphs; information dissemination process;
                 minimum broadcast time problem; NP-completeness;
                 processor networks; split graphs; unique message",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Nishida:1995:QDS,
  author =       "Taishin Y. Nishida",
  title =        "Quasi-deterministic {$0$L} systems and their
                 representation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "87--116",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1884",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Sch. of Comput. and Cognitive Sci., Chukyo Univ.,
                 Toyota, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cardinality; context-free languages; decidable; DOL
                 languages; EFDOL languages; equivalence problem; HDOL
                 languages; HFDOL languages; HFDOL system; integer C;
                 NDOL languages; OL languages; quasi-deterministic OL
                 systems; regularity",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cheng:1995:CRS,
  author =       "Allan Cheng and Javier Esparza and Jens Palsberg",
  title =        "Complexity results for $1$-safe nets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "117--136",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1865",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1-safe nets; 1-safe Petri nets; arbitrary Petri nets;
                 complexity results; computational complexity; deadlock;
                 free-choice nets; liveness; NP-complete; Petri nets;
                 PSPACE-complete; reachability; standard problems;
                 subclasses",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zimand:1995:TSC,
  author =       "Marius Zimand",
  title =        "On the topological size of $p$-$m$-complete degrees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "137--147",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1874",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; nonisomorphism; NP-complete
                 sets; p-m-complete degrees; polynomial many-one
                 degrees; second Baire category; superset topology;
                 topological size; witness functions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schurz:1995:MGF,
  author =       "Gerhard Schurz",
  title =        "Most general first order theorems are not recursively
                 enumerable",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "149--163",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1863",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. f{\"u}r Philosophie, Salzburg Univ., Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; decidable; first order theorems; formal
                 logic; modal operators; n-ary predicates; propositional
                 logic; recursively enumerable logic; uniform
                 replacement",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aigrain:1995:PTC,
  author =       "Philippe Aigrain and Dani{\`e}le Beauquier",
  title =        "Polyomino tilings, cellular automata and codicity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "165--180",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1835",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C4210 (Formal logic); C4220
                 (Automata theory); C4240C (Computational complexity);
                 C6130 (Data handling techniques)",
  corpsource =   "Inst. de Recherche en Inf., Univ. Paul Sabatier,
                 Toulouse, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "4-connex finite part; cellular automata; codes;
                 codicity; complexity; computational complexity;
                 decidability; decidable; mutual relations;
                 neighbourhood relations; polyomino; polyomino tilings;
                 polyominoes",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Amaldi:1995:CAF,
  author =       "Edoardo Amaldi and Viggo Kann",
  title =        "The complexity and approximability of finding maximum
                 feasible subsystems of linear relations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "181--210",
  day =          "7",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1888",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1230D (Neural
                 nets); C4240C (Computational complexity); C5290 (Neural
                 computing techniques)",
  corpsource =   "Dept. of Math., Swiss Federal Inst. of Technol.,
                 Lausanne, Switzerland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximability; APX-complete problems; artificial
                 neural networks; combinatorial problem; complexity;
                 computational complexity; linear classifiers; linear
                 relations; MAX FLS; maximum feasible subsystems; NP
                 optimization problems; NP-hard; optimisation;
                 perceptrons",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Arques:1995:FSL,
  author =       "Didier Arqu{\`e}s and Olivier Grange",
  title =        "A fast scan-line algorithm for topological filling of
                 well-nested objects in {$2.5$D} digital pictures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "211--248",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1778",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry); C5260B (Computer vision and
                 image processing techniques); C6130B (Graphics
                 techniques)",
  corpsource =   "Lab. d'Inf., Besancon Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "2.5D digital pictures; algorithm theory; array; cell
                 coloring; color values; colour graphics; computational
                 geometry; connected object; distance; encasement;
                 family; fast scan-line algorithm; image processing;
                 nesting tree; significant objects; topological filling;
                 topological status; trees (mathematics); well-nested
                 objects",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yu:1995:EPA,
  author =       "Chang-Wu Yu and Gen-Huey Chen",
  title =        "Efficient parallel algorithms for doubly
                 convex-bipartite graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "249--265",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1854",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "adjacency property; computational complexity; CREW
                 PRAM; doubly convex-bipartite graphs; doubly CRCW PRAM;
                 efficient parallel algorithms; graph theory; ordering;
                 parallel algorithms; processors; time; vertex",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blot:1995:ACA,
  author =       "Jo{\"e}l Blot and Wenceslas Fernandez de la Vega and
                 Vangelis Th Paschos and Rachid Saad",
  title =        "Average case analysis of greedy algorithms for
                 optimisation problems on set systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "267--298",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-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=147&issue=1-2&aid=1876",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics)C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4170 (Differential equations); C4240
                 (Programming and algorithm theory)",
  corpsource =   "CERMSEM, Paris I Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; asymptotic analysis; average case
                 analysis; common component distribution; differential
                 equations; graph theory; greedy algorithms; ground set
                 size; hitting set; Markov chain approximation; Markov
                 processes; optimisation; optimisation problems;
                 ordinary differential equations; probability;
                 probability model; random bipartite graphs; random
                 processes; random set family generation; random set
                 systems; set cover; set packing; set system size; set
                 systems; set theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Diamond:1995:FCS,
  author =       "P. Diamond and P. Kloeden and V. Kozyakin and A.
                 Pokrovskii",
  title =        "On the fragmentary complexity of symbolic sequences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "1--17",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1895",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Math., Queensland Univ., Brisbane, Qld.,
                 Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; fragmentary complexity;
                 multirate systems of coprocessors; shift mappings;
                 symbolic sequence; symbolic sequences; torus",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Durand:1995:RNC,
  author =       "Bruno Durand",
  title =        "A {Random NP}-complete problem for inversion of {$2$D}
                 cellular automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "19--32",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1873",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Lab. de l'Inf. du Parallelisme, ENS-Lyon CNRS, Lyon,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "2D cellular automata inversion; cellular automata;
                 co-RNP-completeness; computational complexity; finite
                 tilings; polynomial reduction; probability; probability
                 functions; random NP-complete problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cai:1995:IRM,
  author =       "Liming Cai and Jianer Chen",
  title =        "On input read-modes of alternating {Turing} machines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "33--55",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1887",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4220 (Automata
                 theory); C4240C (Computational complexity)",
  corpsource =   "Dept. of Math., East Carolina Univ., Greenville, NC,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alternating Turing machines; computational complexity;
                 fixed integer; input read-modes; log-time hierarchy;
                 optimisation; precise circuit characterization; Turing
                 machines",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shoudai:1995:UMI,
  author =       "Takayoshi Shoudai and Satoru Miyano",
  title =        "Using maximal independent sets to solve problems in
                 parallel",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "57--65",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1855",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry)",
  corpsource =   "Lab. of Comput. Sci., Kyushu Univ., Fukuoka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry;
                 hereditary graph property; maximal independent sets;
                 maximal vertex-induced subgraph; NC algorithm; parallel
                 algorithms",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kumar:1995:ESI,
  author =       "Ratnesh Kumar and Vijay K. Garg",
  title =        "Extremal solutions of inequations over lattices with
                 applications to supervisory control",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "67--92",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1890",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1340D (Discrete
                 control systems); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Electr. Eng., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "discrete event systems; extremal solutions;
                 inequations; iterative techniques; Knaster-Tarski fixed
                 point theorem; lattices; logical discrete event
                 systems; programming theory; supervisory control",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bodlaender:1995:RGP,
  author =       "Hans L. Bodlaender and Klaus Jansen",
  title =        "Restrictions of graph partition problems. {Part I}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "93--109",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=2016",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bipartite graphs; bounded size; branching flow graph;
                 cliques; computational complexity; computational
                 geometry; graph partition problems; graph theory;
                 independent sets; interval graphs; job-assignment
                 problem; NP-complete; split graphs",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Althofer:1995:SPL,
  author =       "Ingo Alth{\"o}fer and J{\"o}rg B{\"u}ltermann",
  title =        "Superlinear period lengths in some subtraction games",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "111--119",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1960",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory)",
  corpsource =   "Fakultat f{\"u}r Math. und Inf.,
                 Friedrich-Schiller-Univ., Jena, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cubic period length; game theory; Nim game;
                 subtraction games; superlinear period lengths;
                 superpolynomial period lengths; Win/Loss states",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnold:1995:ISC,
  author =       "Andr{\'e} Arnold",
  title =        "An initial semantics for the $\mu$-calculus on trees
                 and {Rabin}'s complementation theorem",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "121--132",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=2007",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4210 (Formal logic)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "formal logic; initial semantics; mu-calculus; Rabin's
                 complementation lemma; trees; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dubhashi:1995:FML,
  author =       "Devdatt P. Dubhashi and Grammati E. Pantziou and Paul
                 G. Spirakis and Christos D. Zaroliagis",
  title =        "The fourth moment in {Luby}'s distribution",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "133--140",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=2015",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-wise independent; Luby's distribution; parallel
                 algorithms; probability space; randomised algorithms;
                 randomized computations; weighted graph",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kimber:1995:LLS,
  author =       "Don Kimber and Philip M. Long",
  title =        "On-line learning of smooth functions of a single
                 variable",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "141--156",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1962",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1240 (Adaptive
                 system theory)",
  corpsource =   "Inf. Syst. Lab., Stanford Univ., CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "best bounds; learning (artificial intelligence);
                 online learning; single variable; smooth functions;
                 squared errors; upper bounds; worst-case sum",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morita:1995:RSO,
  author =       "Kenichi Morita",
  title =        "Reversible simulation of one-dimensional irreversible
                 cellular automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "157--163",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1979",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Dept. of Ind. and Syst. Eng., Hiroshima Univ., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cellular automata; finite configurations; global
                 function; one-dimensional irreversible cellular
                 automata; reversible simulation",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zwick:1995:SNW,
  author =       "Uri Zwick",
  title =        "The smallest networks on which the {Ford-Fulkerson}
                 maximum flow procedure may fail to terminate",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "165--170",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1963",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Ford-Fulkerson maximum flow procedure; graph theory;
                 smallest networks",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pinotti:1995:PAP,
  author =       "Maria Cristina Pinotti and Geppino Pucci",
  title =        "Parallel algorithms for priority queue operations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "1",
  pages =        "171--180",
  day =          "21",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
                 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=148&issue=1&aid=1980",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; combinatorial problems; data
                 structure; Min-path Heap; p-processor EREW-PRAM;
                 parallel algorithms; priority queue operations",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Enjalbert:1995:P,
  author =       "P. Enjalbert and E. W. Mayr and K. W. Wagner",
  title =        "Preface",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "181--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Alvarez:1995:ADP,
  author =       "Carme {\`A}lvarez and Birgit Jenner",
  title =        "On adaptive {DLOGTIME} and {POLYLOGTIME} reductions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "183--205",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1974",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "Dept. de Llenguatges i Sistemes Inf., Univ.
                 Politecnica de Catalunya, Barcelona, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "adaptive DLOGTIME; adaptive reducibility;
                 computational complexity; POLYLOGTIME reductions;
                 relativized AC hierarchy; relativized NC hierarchy",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Borchert:1995:APR,
  author =       "Bernd Borchert",
  title =        "On the acceptance power of regular languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "207--225",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1973",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "Math. Inst., Heidelberg Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "acceptance power; co-NP; complexity classes;
                 computational complexity; formal languages;
                 nondeterministic polynomial-time computations; NP; p
                 prime; polynomial-time hierarchy; PSPACE; regular
                 languages",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bruyere:1995:SDP,
  author =       "V{\'e}ronique Bruy{\`e}re and Clelia De Felice and
                 Giovanna Guaiana",
  title =        "On some decision problems for trace codings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "227--260",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1977",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C4210 (Formal logic)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "Mons-Hainaut Univ., Mons, Belgium",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; decidable; decision problems; dependence
                 relations; encoding; formal logic; graph-theoretical
                 properties; strong coding; trace codings; trace
                 monoids",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Etessami:1995:RPL,
  author =       "Kousha Etessami and Neil Immerman",
  title =        "Reachability and the power of local ordering",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "261--279",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1975",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4240C
                 (Computational complexity)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "Dept. of Comput. Sci., Massachusetts Univ., Amherst,
                 MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity theory; computational complexity;
                 first-order logic; formal languages; graph theory; JAG
                 model; logspace machines; one-way locally ordered
                 graphs; power of local ordering; reachability;
                 transitive closure operator",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jancar:1995:UBP,
  author =       "Petr Jan{\v{c}}ar",
  title =        "Undecidability of bisimilarity for {Petri} nets and
                 some related problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "281--301",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1978",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "Dept. of Comput. Sci., Ostrava Univ., Czech Republic",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bisimilarity; decidability; decidability results;
                 parallel processes; Petri nets; reachability set
                 equality; semilinear bisimulations; undecidability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Laroussinie:1995:HTL,
  author =       "F. Laroussinie and Ph. Schnoebelen",
  title =        "A hierarchy of temporal logics with past",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "303--324",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1976",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "LIFIA, IMAG, Grenoble, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "branching-time temporal logics; classical hierarchy;
                 model-checking; nontrivial translation algorithms;
                 past-time modalities; temporal logic; temporal logics
                 hierarchy",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Naik:1995:QTC,
  author =       "Ashish V. Naik and Kenneth W. Regan and D. Sivakumar",
  title =        "On quasilinear-time complexity theory",
  journal =      j-THEOR-COMP-SCI,
  volume =       "148",
  number =       "2",
  pages =        "325--349",
  day =          "04",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:21 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=2&aid=1972",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4220 (Automata theory);
                 C4240C (Computational complexity)",
  conflocation = "Caen, France; 24-26 Feb. 1994",
  conftitle =    "11th Symposium on Theoretical Aspects of Computer
                 Science (STACS '94)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Buffalo, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bounded-query Turing reductions; computational
                 complexity; decision problems; decision theory;
                 equivalence; error correction codes; error-correcting
                 codes; NP languages; polynomial-time hierarchy;
                 quasilinear-time complexity theory; robust oracle
                 machines; search problems; Turing machines;
                 Valiant-Vazirani reduction",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hull:1995:F,
  author =       "R. Hull",
  title =        "Foreword",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "1--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Buneman:1995:PPC,
  author =       "Peter Buneman and Shamim Naqvi and Val Tannen and
                 Limsoon Wong",
  title =        "Principles of programming with complex objects and
                 collection types",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "3--48",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1965",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6110 (Systems analysis and
                 programming); C6140D (High level languages); C6160D
                 (Relational databases)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "category theory; collection types; complex objects;
                 database languages; database query languages; lists;
                 nested relations; programming; query languages;
                 relational calculus; relational database; relational
                 databases; set types; structural recursion",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{VandenBussche:1995:EPC,
  author =       "Jan {Van den Bussche} and Dirk Van Gucht",
  title =        "The expressive power of cardinality-bounded set values
                 in object-based data models",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "49--66",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1966",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6160J (Object-oriented
                 databases)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Dept. of Math. and Comput. Sci., Antwerp Univ.,
                 Belgium",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cardinality-bounded set values; complex values; data
                 structures; expressive power; first-order queries;
                 noncollapsing hierarchy; object-based data models;
                 object-oriented databases; standard object creation;
                 tuples; while-loops",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Grumbach:1995:EPC,
  author =       "St{\'e}phane Grumbach and Christophe Tollu",
  title =        "On the expressive power of counting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "67--99",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1967",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level languages);
                 C6160D (Relational databases)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymptotic probabilities; counting quantifiers;
                 expressive power of counting; first-order logic;
                 fixpoint logic; formal logic; game technique; inductive
                 logic; infinitary logic; LOGSPACE extension; PTIME
                 extension; query languages; relational databases;
                 unnested counters",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Abiteboul:1995:CIL,
  author =       "Serge Abiteboul and Moshe Y. Vardi and Victor Vianu",
  title =        "Computing with infinitary logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "101--128",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1968",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory);
                 C6140D (High level languages)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "C+SQL; database theory; finitely many variables;
                 first-order queries; formal logic; infinitary logic;
                 query languages; recursive extensions; regular
                 language; relational machine; unifying formalism",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kivinen:1995:AIF,
  author =       "Jyrki Kivinen and Heikki Mannila",
  title =        "Approximate inference of functional dependencies from
                 relations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "129--149",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1969",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1240 (Adaptive
                 system theory); C4250 (Database theory); C6160D
                 (Relational databases)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Dept. of Comput. Sci., Helsinki Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximate inference; approximately correct cover;
                 error measures; functional dependencies; inference
                 mechanisms; learning (artificial intelligence); machine
                 learning algorithm; relational databases; relations",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fekete:1995:HAN,
  author =       "Alan Fekete and Nancy Lynch and William E. Weihl",
  title =        "Hybrid atomicity for nested transactions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "151--178",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1970",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150J (Operating
                 systems); C6160B (Distributed databases)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Sydney Univ., NSW, Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; Avalon system; concurrency
                 control; hybrid atomicity; locking; modular property;
                 nested transaction systems; nested transactions;
                 timestamp-based algorithms; timestamps; transaction
                 processing",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Wong:1995:CSS,
  author =       "Man Hon Wong and Divyakant Agrawal",
  title =        "Context-specific synchronization for atomic data types
                 in object-based databases",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "1",
  pages =        "179--199",
  day =          "18",
  month =        sep,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&issue=1;
                 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=149&issue=1&aid=1971",
  acknowledgement = ack-nhfb,
  classification = "B6150M (Protocols); C5640 (Protocols); C6120 (File
                 organisation); C6160J (Object-oriented databases)",
  conflocation = "Berlin, Germany; 14-16 Oct. 1992",
  conftitle =    "ICDT 92. International Conference on Database Theory",
  corpsource =   "Dept. of Comput. Sci., Chinese Univ. of Hong Kong,
                 Shatin, Hong Kong",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; atomic data types; conflict
                 relations; context-specific synchronization; deferred
                 update; object-based databases; object-oriented
                 databases; operation types; ordered shared
                 relationships; protocol; protocols; recovery
                 strategies; synchronisation; synchronization mechanism;
                 synchronization protocols; two phase locking;
                 update-in-place",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Brogi:1995:FAC,
  author =       "Antonio Brogi and Franco Turini",
  title =        "Fully abstract compositional semantics for an algebra
                 of logic programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "2",
  pages =        "201--229",
  day =          "02",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&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=149&issue=2&aid=1952",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110L (Logic programming)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebra; compositional semantics; computational
                 linguistics; equivalence classes; equivalence relation;
                 equivalence relations; immediate consequence operator;
                 least Herbrand model equivalence; logic programming;
                 logic programs; logical equivalence; process algebra;
                 program composition operations; Weak
                 subsumption-equivalence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Costantini:1995:CSM,
  author =       "Stefania Costantini",
  title =        "Contributions to the stable model semantics of logic
                 programs with negation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "2",
  pages =        "231--255",
  day =          "02",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&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=149&issue=2&aid=1893",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110L (Logic programming)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational linguistics; default logic; instance
                 abduction; logic programming; logic programs; negation;
                 nonmonotonic reasoning; stable model semantics",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Abraham:1995:ICI,
  author =       "Uri Abraham",
  title =        "On interprocess communication and the implementation
                 of multi-writer atomic registers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "2",
  pages =        "257--298",
  day =          "02",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&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=149&issue=2&aid=1953",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5640
                 (Protocols)",
  corpsource =   "Dept. of Math. and Comput. Sci., Ben-Gurion Univ. of
                 the Negev, Beer-Sheva, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "atomic registers; interprocess communication;
                 multi-writer atomic registers; protocol; protocols;
                 shared memory systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "On interprocess communication and the implementation
                 of a multi-writer atomic register",
}

@Article{Montanari:1995:LEP,
  author =       "Ugo Montanari and Daniel Yankelevich",
  title =        "Location equivalence in a parametric setting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "2",
  pages =        "299--332",
  day =          "02",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&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=149&issue=2&aid=1853",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6150N
                 (Distributed systems software)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "associated equivalence; equivalence classes; forest;
                 location equivalence; multiprocessing programs;
                 parametric setting; sublocation relation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Desharnais:1995:EDS,
  author =       "Jules Desharnais and Nadir Belkhiter and Salah Ben
                 Mohamed Sghaier and Fairouz Tchier and Ali Jaoua and
                 Ali Mili and Nejib Zaguia",
  title =        "Embedding a demonic semilattice in a relation
                 algebra",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "2",
  pages =        "333--360",
  day =          "02",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&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=149&issue=2&aid=1905",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory);
                 C6160D (Relational databases)",
  corpsource =   "Dept. d'Inf., Laval Univ., Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "database theory; demonic semilattice; embedding
                 algebra; refinement ordering; relation algebra;
                 relational algebra",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schmidt-Schauss:1995:MTC,
  author =       "Manfred Schmidt-Schau{\ss} and Massimo Marchiori and
                 Sven Eric Panitz",
  title =        "Modular termination of $r$-consistent and left-linear
                 term rewriting systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "149",
  number =       "2",
  pages =        "361--374",
  day =          "02",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=149&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=149&issue=2&aid=2021",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Fachbereich Inf., J. W. Goethe-Univ., Frankfurt,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "left-linear; modularity of termination; program
                 verification; r-consistent; rewriting systems; term
                 rewriting systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ausiello:1995:ASN,
  author =       "G. Ausiello and P. Crescenzi and M. Protasi",
  title =        "Approximate solution of {NP} optimization problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "1--55",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 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=150&issue=1&aid=1925",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximate solution; approximation algorithms;
                 approximation preserving reducibilities; class APX;
                 combinatorial properties; computational complexity;
                 decidability; FPTAS; maximum satisfiability problem; NP
                 optimization problems; optimisation; optimization
                 problems; polynomial-time approximation; PTAS;
                 reducibility; unified framework",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Adamek:1995:GFP,
  author =       "Ji{\v{r}}{\'\i} Ad{\'a}mek and V{\'a}clav Koubek",
  title =        "On the greatest fixed point of a set functor",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "57--75",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 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=150&issue=1&aid=1951",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., Tech. Univ. Braunschweig,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "category theory; CPO- completion; finite depth; finite
                 iterations; greatest fixed point; metric completion;
                 set functor; set theory; Sigma-labelled trees;
                 signature; successor cardinalities; terminal
                 Sigma-coalgebra; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Droste:1995:RLC,
  author =       "Manfred Droste",
  title =        "Recognizable languages in concurrency monoids",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "77--109",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 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=150&issue=1&aid=1900",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Fac. Math., Tech. Univ. Dresden, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary relations; canonical congruence; concurrency
                 monoids; concurrency relations; finite automata; finite
                 computation sequences; formal languages; group theory;
                 Kleene-type characterization; labelled transition
                 systems; recognizable languages; trace theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Naumann:1995:PTH,
  author =       "David A. Naumann",
  title =        "Predicate transformers and higher-order programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "111--159",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 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=150&issue=1&aid=1881",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110F (Formal methods)",
  corpsource =   "Math. and Comput. Sci., Southwestern Univ.,
                 Georgetown, TX, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "categorial axiomatizations; categories; coexponents;
                 formal logic; formal specification; higher-order
                 programs; Hoare logic; monotonic predicate
                 transformers; parameter passing; powersets; predicate
                 transformers; preordered category; program constructs;
                 program specifications; programming theory; refinement
                 calculus; total deterministic programs",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gardiner:1995:APC,
  author =       "P. H. B. Gardiner",
  title =        "Algebraic proofs of consistency and completeness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "161--191",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 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=150&issue=1&aid=1845",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory); C6110F (Formal methods); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Formal Syst. Eur. Ltd., Oxford, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic proofs; arbitrary predicate transformer;
                 calculus of refinement; completeness; consistency;
                 direct translation; floor-like operator; formal logic;
                 Galois connection; Hoare logic inference rules;
                 inference mechanisms; natural ordering; nearest
                 embedded relation; predicate transformers; program
                 refinement; program verification; relational calculus;
                 set theory; soundness; weak algebraic set theory;
                 weakest prespecification operator",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hazewinkel:1995:ESI,
  author =       "M. Hazewinkel",
  title =        "Editorial to the {Subject Index Volumes 101--150}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "2",
  pages =        "195--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Anonymous:1995:SIV,
  author =       "Anonymous",
  title =        "{Subject Index Volumes 101--150}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "2",
  pages =        "197--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Anonymous:1995:RLI,
  author =       "Anonymous",
  title =        "{Reference List of Indexed Articles}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "2",
  pages =        "315--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Anonymous:1995:CIV,
  author =       "Anonymous",
  title =        "{Cumulative Index Volumes 101--150}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "2",
  pages =        "339--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Anonymous:1995:WTC,
  author =       "Anonymous",
  title =        "{Workshop on Topology and Completion in Semantics}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "??--??",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 14:14:47 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstraction; closure spaces; constraint programming;
                 digital topology; domain theory; duality; formal
                 languages; formal logic; lazy dataflow deadlock; modal
                 mu-calculus; monadic second order logic; process
                 algebra; rational omega-languages; recursion;
                 topology",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gastin:1995:P,
  author =       "P. Gastin and J. J. M. M. Rutten",
  title =        "Preface",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "1--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Ambler:1995:DCM,
  author =       "Simon Ambler and Marta Kwiatkowska and Nicholas
                 Measor",
  title =        "Duality and the completeness of the modal
                 $\mu$-calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "3--27",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1986",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Dept. of Math. and Comput. Sci., Leicester Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "category; completeness; contractions; descriptive
                 modal frames; duality; duality (mathematics); finitary
                 modal logic; fixed point operators; fixed points;
                 formal logic; homomorphisms; modal algebras; modal
                 mu-calculus; monotone operators; proof systems; theorem
                 proving",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Arnold:1995:TPR,
  author =       "Andr{\'e} Arnold",
  title =        "A topological property of rational
                 $\omega$-languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "29--36",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1987",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cluster points; formal languages; rational omega
                 languages; rational subset; topological property;
                 ultrametric distance",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{deBoer:1995:NIC,
  author =       "Frank S. de Boer and Alessandra Di Pierro and Catuscia
                 Palamidessi",
  title =        "Nondeterminism and infinite computations in constraint
                 programming",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "37--78",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1988",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C6110L (Logic
                 programming); C6170K (Knowledge engineering
                 techniques)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Vakgroep Inf., Utrecht Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "categorical approach; constraint handling; constraint
                 logic programming; constraint programming; infinite
                 behavior; infinite computations; logic programming;
                 minimal structure; nondeterminism; semantics;
                 sublanguages; synchronisation; synchronization;
                 upward-closure",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
  xxauthor =     "F. S. {De Boer} and A. Di Pierro and C. Palamidessi",
}

@Article{Bonsangue:1995:DBS,
  author =       "Marcello M. Bonsangue and Bart Jacobs and Joost N.
                 Kok",
  title =        "Duality beyond sober spaces: {Topological} spaces and
                 observation frames",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "79--124",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1989",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Dept. of Comput. Sci., Vrije Univ., Amsterdam,
                 Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "duality; formal logic; frames; geometric logic;
                 observable predicates; observation frames; ordinary
                 frames; power spaces; sober spaces; topological
                 spaces",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Courcelle:1995:MSO,
  author =       "Bruno Courcelle",
  title =        "The monadic second-order logic of graphs {IX}:
                 {Machines} and their behaviours",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "125--162",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1990",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "CNRS, Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic tree; automata theory; dynamic properties;
                 formal logic; graphs; monadic second-order logic;
                 program verification; relational structures; static
                 properties; transition systems; tree automata",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Edalat:1995:DTI,
  author =       "Abbas Edalat",
  title =        "Domain theory and integration",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "163--193",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1991",
  acknowledgement = ack-nhfb,
  classification = "C4160 (Numerical integration and differentiation);
                 C4240 (Programming and algorithm theory)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Dept. of Comput., London Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximating sequence; bounded Borel measures;
                 bounded real-valued function; bounded real-valued
                 functions; compact metric spaces; domain theory;
                 domain-theoretic framework; integration; least upper
                 bound; Lebesgue integral; measure theory; programming
                 theory; Riemann integral",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matthews:1995:ETL,
  author =       "S. G. Matthews",
  title =        "An extensional treatment of lazy data flow deadlock",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "195--205",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1992",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110P (Parallel programming); C6150N (Distributed
                 systems software)C6140D (High level languages)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "concurrency control; data flow message passing
                 networks; elegant nonoperational test; extensional
                 treatment; lazy data flow deadlock; lazy data flow
                 languages; message passing; parallel languages; partial
                 metric spaces; program correctness; programming theory;
                 semantic domains",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mislove:1995:FAR,
  author =       "Michael W. Mislove and Frank J. Oles",
  title =        "Full abstraction and recursion",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "207--256",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1993",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm theory);
                 C6140 (Programming languages)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in 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 =     "computational linguistics; explicit recursion
                 operators; extended language; full abstraction; order
                 adequate; ordered denotational model; ordered
                 operational model; programming language; programming
                 languages; programming theory; recursion; recursive
                 functions; semantic models; strongly order fully
                 abstract",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Smyth:1995:SMC,
  author =       "M. B. Smyth",
  title =        "Semi-metrics, closure spaces and digital topology",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "257--276",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1994",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4260 (Computational geometry)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Dept. of Comput., Imperial Coll. of Sci., Technol. and
                 Med., London, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Cech closure spaces; closure spaces; computational
                 geometry; digital spaces; digital topology; domain
                 equations; formal logic; generalized topological
                 structures; graph theory; inverse limits; modal
                 semantics; real unit interval; semi metrics;
                 semi-metrics; tolerance geometry; topological graphs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sunderhauf:1995:FCM,
  author =       "Philipp S{\"u}nderhauf",
  title =        "A faithful computational model of the real numbers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "1",
  pages =        "277--294",
  day =          "13",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&issue=1;
                 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=151&issue=1&aid=1995",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5230
                 (Digital arithmetic methods)",
  conflocation = "Chartres, France; 18-20 Nov. 1993",
  conftitle =    "Workshop on Topology and Completion in Semantics",
  corpsource =   "Fachbereich Math., Tech. Hochschule Darmstadt,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "continuous endofunctions; digit sequences; digital
                 arithmetic; faithful computational model; faithful
                 representation; finitary fashion; finite sequences;
                 quasi uniform structure; quasi uniformities; radix
                 expansions; real numbers; sequences; topological
                 structure; type theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shyamasundar:1995:F,
  author =       "R. K. Shyamasundar",
  title =        "Foreword",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "2",
  pages =        "295--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Castagna:1995:MLT,
  author =       "Giuseppe Castagna",
  title =        "A meta-language for typed object-oriented languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "2",
  pages =        "297--352",
  day =          "27",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&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=151&issue=2&aid=2009",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110J (Object-oriented programming)",
  conflocation = "Bombay, India; 15-17 Dec. 1993",
  conftitle =    "Thirteenth Conference on Foundations of Software
                 Technology and Theoretical Computer Science",
  corpsource =   "CNRS, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "lambda calculus; meta-language; object-oriented
                 languages; type theory; type-checker; typed
                 lambda-calculus; well-typed programs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ait-Kaci:1995:LSC,
  author =       "Hassan A{\"\i}t-Kaci and Jacques Garrigue",
  title =        "Label-selective $\lambda$-calculus syntax and
                 confluence",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "2",
  pages =        "353--383",
  day =          "27",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&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=151&issue=2&aid=2010",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  conflocation = "Bombay, India; 15-17 Dec. 1993",
  conftitle =    "Thirteenth Conference on Foundations of Software
                 Technology and Theoretical Computer Science",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "argument selection; concurrency; confluence;
                 label-selective lambda-calculus; lambda calculus;
                 lambda-calculus; record calculus; reduction; syntax",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vanBakel:1995:ITA,
  author =       "Steffen van Bakel",
  title =        "Intersection type assignment systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "2",
  pages =        "385--435",
  day =          "27",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&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=151&issue=2&aid=2011",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  conflocation = "Bombay, India; 15-17 Dec. 1993",
  conftitle =    "Thirteenth Conference on Foundations of Software
                 Technology and Theoretical Computer Science",
  corpsource =   "Afdeling Inf., Nijmegen Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "almost syntax directed system; BCD- system;
                 equivalence classes; intersection type assignment
                 systems; lambda calculus; type theory",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "S. {Van Bakel}",
}

@Article{Honda:1995:RBP,
  author =       "Kohei Honda and Nobuko Yoshida",
  title =        "On reduction-based process semantics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "2",
  pages =        "437--486",
  day =          "27",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&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=151&issue=2&aid=2012",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  conflocation = "Bombay, India; 15-17 Dec. 1993",
  conftitle =    "Thirteenth Conference on Foundations of Software
                 Technology and Theoretical Computer Science",
  corpsource =   "Dept. of Comput. Sci., Keio Univ., Yokohama, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "behavioural equivalence; convergence; equational
                 reasoning; inference mechanisms; name passing calculus;
                 observables; observation-based formulation; process
                 algebra; reduction relation; reduction-based process
                 semantics; semantic theories; v-calculus",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rao:1995:MPC,
  author =       "M. R. K. Krishna Rao",
  title =        "Modular proofs for completeness of hierarchical term
                 rewriting systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "151",
  number =       "2",
  pages =        "487--512",
  day =          "27",
  month =        nov,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=151&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=151&issue=2&aid=2013",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  conflocation = "Bombay, India; 15-17 Dec. 1993",
  conftitle =    "Thirteenth Conference on Foundations of Software
                 Technology and Theoretical Computer Science",
  corpsource =   "Comput. Sci. Group, Tata Inst. of Fundamental Res.,
                 Bombay, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness; constructor sharing systems;
                 hierarchical combinations; hierarchical term rewriting
                 systems; local confluence; locally confluent overlay
                 systems; modular proofs; modularity results; program
                 verification; rewriting systems; strong innermost
                 normalization; sufficient conditions; termination
                 properties; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fredholm:1995:IAF,
  author =       "Daniel Fredholm",
  title =        "Intensional aspects of function definitions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "1",
  pages =        "1--66",
  day =          "11",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&issue=1;
                 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=152&issue=1&aid=1902",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Stockholm Univ., Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "equational definitions; function definitions;
                 Herbrand-Godel-Kleene systems; intensional aspects;
                 mu-recursive definitions; primitive recursive
                 definitions; recursive functions",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hodges:1995:MSD,
  author =       "Wilfrid Hodges",
  title =        "The meaning of specifications {I}: {Domains} and
                 initial models",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "1",
  pages =        "67--89",
  day =          "11",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&issue=1;
                 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=152&issue=1&aid=1879",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110F (Formal methods);
                 C6140D (High level languages)",
  corpsource =   "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "directed commits; domain-theoretic terms; finite
                 vocabulary; formal specification; functor; Horn
                 clauses; initial models; initial semantics; natural
                 isomorphism; semantics; specification language;
                 specification languages; specifications meaning;
                 translations; universal Horn classes",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Astesiano:1995:FOE,
  author =       "Egidio Astesiano and Maura Cerioli",
  title =        "Free objects and equational deduction for partial
                 conditional specifications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "1",
  pages =        "91--138",
  day =          "11",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&issue=1;
                 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=152&issue=1&aid=1880",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C6110F (Formal
                 methods)",
  corpsource =   "Dipartimento di Inf. e Sci. dell'Inf., Genoa Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Birkhoff-like deduction theory; conditional axioms;
                 conditional total specifications; empty-carrier
                 problem; equational deduction; existential equalities;
                 first-order reduction; formal specification; free
                 objects; inference mechanisms; logical deduction;
                 necessary and sufficient conditions; partial algebras;
                 partial conditional specifications; positive
                 conditional axioms; term-generated extensional models",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kurihara:1995:MNT,
  author =       "Masahito Kurihara and Azuma Ohuchi",
  title =        "Modularity in noncopying term rewriting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "1",
  pages =        "139--169",
  day =          "11",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&issue=1;
                 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=152&issue=1&aid=1882",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110F
                 (Formal methods)",
  corpsource =   "Dept. of Inf. Eng., Hokkaido Univ., Sapporo, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness; constructors; disjointness condition;
                 graph rewriting systems; modularity; noncopying term
                 rewriting; program verification; rewriting systems;
                 term-based formalism; termination",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Benveniste:1995:CSS,
  author =       "Albert Benveniste and Bernard C. Levy and Eric Fabre
                 and Paul Le Guernic",
  title =        "A calculus of stochastic systems for the
                 specification, simulation, and hidden state estimation
                 of mixed stochastic\slash non-stochastic systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "171--217",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1929",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other topics in statistics); B6140C (Optical
                 information, image and video signal processing); C1140Z
                 (Other topics in statistics); C1220 (Simulation,
                 modelling and identification); C1250 (Pattern
                 recognition); C4210 (Formal logic); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "IRISA, Rennes, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "calculus of communicating systems; calculus of
                 stochastic systems; dependency relations; elementary
                 components; general combinator; hidden Markov models;
                 hidden state estimation; incremental simulation; Markov
                 random fields; mixed stochastic system specifications;
                 mixed stochastic/nonstochastic systems; pattern
                 recognition; pattern recognition problems; risk
                 analysis; SIGNAL synchronous language; simulation;
                 specification; state estimation; stochastic systems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Seidel:1995:PCP,
  author =       "Karen Seidel",
  title =        "Probabilistic communicating processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "219--249",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1920",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic axiomatisation; communicating sequential
                 processes; conditional probability measures;
                 deterministic properties; fairness; inference
                 mechanisms; infinite traces; probabilistic algorithms;
                 probabilistic algorithms correctness; probabilistic
                 communicating processes; probability measures; proof
                 rules; random algorithms; reasoning;
                 self-stabilisation; self-stabilising token ring;
                 semantic spaces",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Aceto:1995:CAT,
  author =       "Luca Aceto and Alan Jeffrey",
  title =        "A complete axiomatization of timed bisimulation for a
                 class of timed regular behaviours",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "251--268",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1919",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Aalborg Univ.,
                 Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "calculus of communicating systems; complete
                 axiomatization; finite-state recursion; Milner's
                 axiomatization; process algebra; process theory;
                 regular CCS; timed bisimulation; timed regular
                 behaviours",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Verma:1995:TCR,
  author =       "Rakesh M. Verma",
  title =        "Transformations and confluence for rewrite systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "269--283",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1889",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C6110 (Systems analysis and programming);
                 C6110F (Formal methods); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; algebraic specification;
                 algebraic specifications; automated reasoning;
                 confluence; confluent root overlaps; equational
                 programming; functional programming; inference
                 mechanisms; innermost rewriting relation; left-linear
                 systems; nonlinear systems; nonoverlapping noetherian
                 systems; nonoverlapping systems; normal forms; rewrite
                 systems; rewriting systems; semiregular systems;
                 transformations; weak persistence; weakly persistent
                 confluent systems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
  xxauthor =     "P. M. Verma",
}

@Article{Inverardi:1995:INF,
  author =       "Paola Inverardi and Monica Nesi",
  title =        "Infinite normal forms for non-linear term rewriting
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "285--303",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1878",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "infinite converging derivations; infinite normal
                 forms; left-linear systems; nonlinear term rewriting
                 systems; nonoverlapping systems; nonterminating rewrite
                 relations; orthogonal term rewriting systems; recursive
                 operator; retraction property; rewriting systems; term
                 algebra; unfolding rules",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Banach:1995:LCD,
  author =       "R. Banach",
  title =        "Locating the contractum in the double pushout
                 approach",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "305--320",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1935",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4210L (Formal languages
                 and computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Manchester Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic framework; algebraic graph rewriting;
                 contractum location; double pushout approach; garbage;
                 graph theory; pushout cube; rewriting systems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "P. Banach",
}

@Article{Mislove:1995:EEN,
  author =       "M. Mislove and M. Nivat and C. Papadimitnou",
  title =        "Editorial on the {Electronic Notes in Theoretical
                 Computer Science}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "321--??",
  month =        "",
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Rozenberg:1996:P,
  author =       "G. Rozenberg",
  title =        "Preface",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "1--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Petri:1996:NTS,
  author =       "C. A. Petri",
  title =        "Nets, time and space",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "3--48",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2057",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1220
                 (Simulation, modelling and identification)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "chrono-topology; computation; continuity problems;
                 continuous variable measurement; continuous variable
                 modelling; control; logic; measurement; modelling; net
                 compilation; net theory; observation; Petri nets;
                 physics; precision limit law; realistic modelling;
                 security construction",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Desel:1996:PNM,
  author =       "J. Desel and K.-P. Neuendorf and M.-D. Radola",
  title =        "Proving nonreachability by modulo-invariants",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "49--64",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2058",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4140 (Linear
                 algebra); C4210 (Formal logic); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Angewandte Inf. und Formale
                 Beschreibungsverfahren, Karlsruhe Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "classical place-invariants; computability; finite
                 invariant set; marking equation; marking
                 nonreachability; matrix algebra; modulo-invariants;
                 nonreachability proof; parallel programming; Petri
                 nets; reachability analysis; residue classes module;
                 theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Engelfriet:1996:MSP,
  author =       "Joost Engelfriet",
  title =        "A multiset semantics for the pi-calculus with
                 replication",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "65--94",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2059",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1220
                 (Simulation, modelling and identification); C4210
                 (Formal logic); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Leiden Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "calculus of communicating systems; multiset semantics;
                 parallel processing; Petri net semantics; Petri nets;
                 pi - calculus; pi-calculus; replication; semantic
                 mapping; simulation; strong bisimulation; structurally
                 congruent processes",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Esparza:1996:TME,
  author =       "Javier Esparza and Glenn Bruns",
  title =        "Trapping mutual exclusion in the box calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "95--128",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2060",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Lab. for Found. of Comput. Sci., Edinburgh Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "box calculus; mutual exclusion trapping; parallel
                 programming; parallel programs; Petri net semantics;
                 Petri nets; process algebra; program verification;
                 verification techniques",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hoogers:1996:ESS,
  author =       "P. W. Hoogers and H. C. M. Kleijn and P. S.
                 Thiagarajan",
  title =        "An event structure semantics for general {Petri}
                 nets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "129--170",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2061",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Leiden Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1-safe Petri nets; event structure semantics; general
                 Petri nets; local event structures; Petri nets; prime
                 event structures; stable event structures; UL-event
                 structures",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Meseguer:1996:PVU,
  author =       "Jos{\'e} Meseguer and Ugo Montanari and Vladimiro
                 Sassone",
  title =        "Process versus unfolding semantics for {Place\slash
                 Transition Petri} nets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "171--210",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2062",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Artificial Intelligence Center, SRI Int., Menlo Park,
                 CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic models; DecOcc; monoidal categories;
                 nonsequential processes; occurrence nets; Petri nets;
                 place/transition Petri nets; process semantics;
                 symmetric monoidal category; token game; unfolding
                 constructions; unfolding semantics",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Nielsen:1996:PNB,
  author =       "Mogens Nielsen and Glynn Winskel",
  title =        "{Petri} nets and bisimulation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "211--244",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2063",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "adjunctions; asynchronous transition systems;
                 bisimulation; categorical relationships; category
                 theory; concurrency; parallel programming; Petri nets;
                 process algebra",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Smith:1996:BCC,
  author =       "Einar Smith",
  title =        "On the border of causality: {Contact} and confusion",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "245--270",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2064",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "German Nat. Res. Center for Comput. Sci., St.
                 Augustin, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymmetric confusion; bistable asynchronous devices;
                 border of causality; concurrent processes; confusion;
                 contact; distributed systems; fairness; free-choice
                 nets; metastability; mutual exclusion module; net
                 theory; Petri nets; priority-requirements",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teruel:1996:STE,
  author =       "Enrique Teruel and Manuel Silva",
  title =        "Structure theory of equal conflict systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "153",
  number =       "1--2",
  pages =        "271--300",
  day =          "08",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=153&issue=1-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=1996&volume=153&issue=1-2&aid=2065",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Dept. de Inf. e Ingenieria de Sistemas, Zaragoza
                 Univ., Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decomposition; duality; equal conflict systems; formal
                 logic; free choice subclass; free choice systems; home
                 states; linear algebraic perspective; Petri nets;
                 place/transition net systems; rank theorem; structure
                 theory; weighted generalisation; weighted nets",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lingas:1996:P,
  author =       "A. Lingas",
  title =        "Preface",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "1--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Czumaj:1996:GPN,
  author =       "Artur Czumaj and Alan Gibbons",
  title =        "{Guthrie}'s problem: new equivalences and rapid
                 reductions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "3--22",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2067",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-edge colouring; algebra; algebraic expression
                 intersections; computational complexity; equations;
                 equivalences; exponential-time complexity; formal
                 languages; four-colour theorem; four-colouring
                 algorithms; four-vertex colourable graphs; graph
                 colouring; Guthrie's conjecture; implicit algorithm;
                 integer linear equation intersections; optimally fast
                 reduction; planar graph; polynomial time complexity;
                 rapid reductions; regular language intersections;
                 theorem proving; tree pairs; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Karpinski:1996:RVD,
  author =       "Marek Karpinski and Rutger Verbeek",
  title =        "On randomized versus deterministic computation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "23--39",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2068",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4220 (Automata
                 theory); C4240C (Computational complexity)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Dept. of Comput. Sci., Bonn Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; decidability; deterministic
                 algorithms; deterministic automata; deterministic
                 computation; deterministic time classes; exponential
                 deterministic time; Las Vegas algorithms; linear
                 randomized time; Monte Carlo methods; Monte Carlo
                 polynomial time; oracle; polynomial randomized time;
                 polynomial reduction; polynomial time hierarchy;
                 polynomial-size circuits; random coin tosses;
                 randomised algorithms; randomized computation;
                 randomized time classes; simulation; unfaithful
                 polynomial random reduction",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jaromczyk:1996:TEF,
  author =       "Jerzy W. Jaromczyk and Grzegorz {\'S}wia{\c{t}}ek",
  title =        "A theory of even functionals and their algorithmic
                 applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "41--56",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2069",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4130
                 (Interpolation and function approximation); C4140
                 (Linear algebra)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic applications; binary form; even
                 functionals; graph embeddings; graph theory;
                 homogeneous polynomials; matrix multiplication;
                 operands; permutations; polynomials; real symmetric
                 matrices; reflections; weighted graph",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cohen:1996:PFS,
  author =       "David M. Cohen and Michael L. Fredman",
  title =        "Products of finite state machines with full coverage",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "57--65",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2070",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Bellcore, Morristown, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "achievable states; communications protocol;
                 computation theory; computer theory; exponential number
                 state; family; finite state machine collection; finite
                 state machines; finite state machines products; full
                 coverage; heuristic method; identical input alphabet;
                 independently designed services; product machine;
                 reachable state; telecommunication services;
                 telecommunications services; telecommunications
                 theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ebinger:1996:LDI,
  author =       "Werner Ebinger and Anca Muscholl",
  title =        "Logical definability on infinite traces",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "67--84",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2071",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4210L (Formal languages and
                 computational linguistics)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Inst. f{\"u}r Inf., Stuttgart Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aperiodic real trace language; computation theory;
                 computational linguistics; definability; equivalence;
                 finite trace; first-order definable trace language;
                 formal logic; infinite trace; infinite traces; infinite
                 words; logic; logical definability; monadic
                 second-order logic; real trace language;
                 recognizability; recognizable language
                 characterization; star-free trace language",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wilke:1996:ACF,
  author =       "Thomas Wilke",
  title =        "An algebraic characterization of frontier testable
                 tree languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "85--106",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2072",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory); C4240C (Computational complexity);
                 C6120 (File organisation)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Inst. f{\"u}r Inf. und Praktische Math., Kiel Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic characterization; automata theory;
                 cardinality; computational complexity; finite set;
                 formal languages; frontier testable tree language;
                 frontier testable tree languages; pseudoidentities;
                 reverse definite tree languages; tree algebras; tree
                 automaton; tree data structures; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jategaonkar:1996:DTC,
  author =       "Lalita Jategaonkar and Albert R. Meyer",
  title =        "Deciding true concurrency equivalences on safe, finite
                 nets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "107--143",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2073",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4220 (Automata theory); C4240C (Computational
                 complexity)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "AT and T Bell Labs., Naperville, IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1- safe; complete; computation theory; computation
                 time; computational complexity; computational
                 complexity bound; decidability; decidable; DEXPTIME;
                 EXPSPACE; finite automata; finite net; finite Petri
                 net; hidden transitions; history-preserving
                 bisimulation; interleaving equivalence; multiprocessing
                 programs; Petri nets; pomset-trace equivalence problem;
                 safe finite nets; true concurrency; true concurrency
                 equivalence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sureson:1996:PNC,
  author =       "Claude Sureson",
  title =        "{P}, {NP}, {Co-NP} and weak systems of arithmetic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "145--163",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2040",
  acknowledgement = ack-nhfb,
  classification = "C1100 (Mathematical techniques); C4240C
                 (Computational complexity)",
  corpsource =   "Equipe de Logique Math., Paris VII Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arithmetic; Co-NP complexity class; computability;
                 computational complexity; nonstandard models;
                 NP-complexity; P-complexity; weak arithmetic systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fiorio:1996:TLT,
  author =       "Christophe Fiorio and Jens Gustedt",
  title =        "Two linear time {Union Find} strategies for image
                 processing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "165--181",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=1896",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B6140C (Optical
                 information, image and video signal processing); C1160
                 (Combinatorial mathematics); C1250 (Pattern
                 recognition); C4240C (Computational complexity); C5260B
                 (Computer vision and image processing techniques);
                 C6120 (File organisation)",
  corpsource =   "Univ. des Sci. et Tech. du Languedoc, Montpellier,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity bound; computational complexity;
                 constant-height tree; data structure; disjoint set
                 union problem; find operation amortization; generalized
                 algorithms; image processing; image segmentation;
                 linear-time algorithms; periodic updates; region
                 growing; restricted union operation order; set theory;
                 tree data structures; tree searching; Union-Find
                 strategies",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "C. Fiono and J. Gustedt",
}

@Article{Mitrana:1996:PS,
  author =       "Victor Mitrana and Gheorghe P{\u{a}}un and Grzegorz
                 Rozenberg and Arto Salomaa",
  title =        "Pattern systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "183--201",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=1892",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1250 (Pattern
                 recognition); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Inst. of Math., Romanian Acad. of Sci., Bucharest,
                 Romania",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "deterministic pattern systems; developmental
                 languages; erasing; formal languages; general pattern
                 systems; grammars; inductive inference; inference
                 mechanisms; iterated pattern languages; learning
                 theory; multi-pattern languages; pattern grammars;
                 pattern recognition; synchronized pattern systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Idury:1996:MMP,
  author =       "Ramana M. Idury and Alejandro A. Sch{\"a}ffer",
  title =        "Multiple matching of parameterized patterns",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "203--224",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=1904",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
                 recognition); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., Univ. of Southern California, Los
                 Angeles, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata theory; changeable pattern set; deletions;
                 fixed patterns; insertions; multiple pattern matching
                 algorithms; parameterized patterns; parameterized
                 string matching; pattern matching; pattern matching
                 automata; pattern preprocessing; string matching;
                 suffix trees; text; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{JaJa:1996:SSC,
  author =       "Joseph F. J{\'a}J{\'a} and Kwan Woo Ryu and Uzi
                 Vishkin",
  title =        "Sorting strings and constructing digital search trees
                 in parallel",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "225--245",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=1897",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Inst. for Adv. Comput. Studies, Maryland Univ.,
                 College Park, MD, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alphabet; Arbitrary CRCW PRAM; circular string; Common
                 CRCW PRAM; computation model; computational complexity;
                 deterministic algorithm; deterministic algorithms;
                 digital search trees; lexicographic ordering;
                 optimal-work parallel algorithms; parallel algorithms;
                 randomised algorithms; randomized algorithm; single
                 processor; sorting; sorting strings; string matching;
                 strings; tree searching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Engelfriet:1996:CCU,
  author =       "J. Engelfriet and T. Harju and A. Proskurowski and G.
                 Rozenberg",
  title =        "Characterization and complexity of uniformly
                 nonprimitive labeled $2$-structures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "247--282",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=1906",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Leiden Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "clan decomposition theorem; cographs; complete
                 structure; complexity; computational complexity;
                 directed graph; directed graphs; linear structure;
                 LOGCF algorithm; monadic second-order; node labeled
                 tree; parallel complexity; primitive structure;
                 transitive vertex series-parallel graphs; trees
                 (mathematics); uniformly nonprimitive labeled
                 2-structures",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blundo:1996:IRS,
  author =       "Carlo Blundo and Alfredo De Santis and Luisa Gargano
                 and Ugo Vaccaro",
  title =        "On the information rate of secret sharing schemes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "283--306",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2003",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C1160 (Combinatorial mathematics);
                 C4240C (Computational complexity); C6130S (Data
                 security)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "access structure; access structures; arbitrary access
                 structure; arbitrary positive constant; computational
                 complexity; cryptography; general lower bounds; graph
                 representation; graph theory; information rate; NP
                 complete; optimal information rate; secret sharing
                 schemes",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Calude:1996:ECM,
  author =       "Cristian Calude and Marius Zimand",
  title =        "Effective category and measure in abstract complexity
                 theory",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "307--327",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2004",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Auckland Univ., New Zealand",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract complexity theory; arbitrary recursive
                 threshold; Baire category theorem; category theory;
                 complexity classes; compression theorem; computational
                 complexity; effective measure zero; operator gap
                 theorem; operator speed up theorem; recursive measure;
                 recursive predicates",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{LafayedeMicheaux:1996:CGT,
  author =       "N. {Lafaye de Micheaux} and C. Rambaud",
  title =        "Confluence for graph transformations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "329--348",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=1947",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Fac. de Sci. de St. Jerome, Marseille, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "critical pair; graph rewriting systems; graph theory;
                 graph transformations; local confluence theorem;
                 noetherian; rewriting rules; rewriting systems; term
                 rewriting systems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "N. {Lalaye de Micheaux} and C. Rambaud",
}

@Article{Barua:1996:GGT,
  author =       "Rana Barua and S. Ramakrishnan",
  title =        "$\sigma$-game, $\sigma^+$-game and two-dimensional
                 additive cellular automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "349--366",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2032",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4220 (Automata
                 theory)",
  corpsource =   "Stat.-Math. Div., Indian Stat. Inst., Calcutta,
                 India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cellular automata; combinatorial game; cylinders;
                 divisibility properties; games of skill; graph; graph
                 theory; polynomials; rectangular grid; sigma /sup
                 +/-game; sigma-automaton; sigma-game; sufficient
                 condition; tori; two-dimensional additive cellular
                 automata",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hemaspaandra:1996:OA,
  author =       "Lane A. Hemaspaandra and Leen Torenvliet",
  title =        "Optimal advice",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "367--377",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2017",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "advice class; computational complexity; optimal
                 advice; p-selective sets; P/quadratic; PP/linear; set
                 theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramesh:1996:DCC,
  author =       "S. Ramesh and Bommadevara N. Srinivas",
  title =        "A direct characterization of completion",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "379--385",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2029",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Bombay, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "canonical completion; closed continuously directed
                 subsets; computational linguistics; conjecture; cpo;
                 direct characterization; fully abstract models; fully
                 abstract semantic models; partial order; poset; set
                 theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "S. Ramesh and B. N. Srinivas",
}

@Article{Justin:1996:CPS,
  author =       "J. Justin and G. Pirillo",
  title =        "On a combinatorial property of {Sturmian} words",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "2",
  pages =        "387--394",
  day =          "05",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&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=1996&volume=154&issue=2&aid=2018",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "LITP Institut Blaise Pascal, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "2 letter alphabet; combinatorial mathematics;
                 combinatorial property; finite Sturmian words; group
                 theory; infinite Sturmian word; non factors; permuted
                 products; Rees quotient; semigroup",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bloom:1996:FPO,
  author =       "Stephen L. Bloom and Zolt{\'a}n {\'E}sik",
  title =        "Fixed point operations on {CCC}'s. {Part I}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "1--38",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=1950",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Stevens Inst. of Technol.,
                 Hoboken, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Cartesian closed categories; category theory; Conway
                 identities; equational properties; fixed-point
                 operations; functional completeness theorem; morphisms;
                 normal form; poset categories; semantics",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Fixed-point operations on {CCC's}. {I}",
}

@Article{Sangiorgi:1996:LIS,
  author =       "Davide Sangiorgi",
  title =        "Locality and interleaving semantics in calculi for
                 mobile processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "39--83",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=1961",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Sophia
                 Antipolis, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract encoding; CCS; concurrency; congruence
                 properties; encoding; expressive power; induced
                 congruence; interleaving observation equivalence;
                 interleaving semantics; locality; location
                 bisimulation; mobile process calculi; nondeterminism;
                 noninterleaving semantics; parallel composition;
                 pi-calculus; primitive operator; process algebra;
                 process algebra semantics; sequentiality; spatial
                 dependencies",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kamareddine:1996:UN,
  author =       "Fairouz Kamareddine and Rob Nederpelt",
  title =        "A useful $\lambda$-notation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "85--109",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=2042",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "beta-redexes; binding; canonical type; compatibility;
                 de Brujin calculus; item notation; lambda calculus;
                 lambda-calculus; lambda-notation; normal forms; open
                 terms; preference type; reduction relation; reduction
                 strategies; strongly normalising Church--Rosser
                 relation; substitution calculus; term heart; term
                 restriction; typability; type theory; typing; unmatched
                 parentheses; variable occurrence; variable status",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Immerman:1996:EFF,
  author =       "Neil Immerman and Sushant Patnaik and David Stemple",
  title =        "The expressiveness of a family of finite set
                 languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "111--140",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=1921",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity); C4250
                 (Database theory); C6140D (High level languages)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
                 Amherst, MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; database languages; database
                 query languages; database theory; expressiveness;
                 finite set languages; formal languages; Horn clauses;
                 Horn operator; LOGSPACE complexity class; Machiavelli
                 language; order-independent properties; ordering; P
                 complexity class; set theory; Set-Reduce Language; SRL;
                 syntactic restrictions; type theory; typed set-based
                 database language; updates",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "Neil Immermann and Sushant Patnaik and David Stemple",
  xxauthor =     "N. Immerman and S. Patnaik and D. Stemple",
}

@Article{Fourneau:1996:NMC,
  author =       "Jean-Michel Fourneau and Erol Gelenbe and Rina Suros",
  title =        "{$G$}-networks with multiple classes of negative and
                 positive customers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "141--156",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=1959",
  acknowledgement = ack-nhfb,
  classification = "B0240C (Queueing theory); C1140C (Queueing theory)",
  corpsource =   "Lab. PR13M, Versailles Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "class-dependent service rates; customer destruction
                 capabilities; exponential service time distributions;
                 FIFO service center; G-networks; generalized queueing
                 networks; LIFO/PR service center; multiple classes;
                 negative customers; nonstandard product form; positive
                 customers; preemption; processor sharing; queueing
                 theory; resumption priority; routing probabilities;
                 service rate parameter; signals; triggers",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kagan:1996:CMM,
  author =       "Vadim Kagan and Anil Nerode and V. S. Subrahmanian",
  title =        "Computing minimal models by partial instantiation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "157--177",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=1850",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory);
                 C6110L (Logic programming)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "atom disjunctions; circumscription; clause bodies;
                 clause heads; combinatorial explosion; disjunctive
                 logic program; formal logic; grounding out;
                 instantiation by need; logic programming; minimal model
                 computation; modelling; nonmonotonic logic programs;
                 nonmonotonic negation; nonmonotonic reasoning; partial
                 instantiation; programming theory; propositional logic
                 programs; stable models; truth computation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nielson:1996:CPA,
  author =       "Flemming Nielson and Hanne Riis Nielson",
  title =        "From {CML} to its process algebra",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "179--219",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=1957",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "behaviour evolution; CML; communication behaviour
                 static expression; communication primitives;
                 computation; Concurrent ML; concurrent programming
                 languages; formal languages; parallel languages;
                 prefixes; process algebra; semantics; strong
                 polymorphic typing; structural operational semantics;
                 syntax; type evolution; type theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1996:QPA,
  author =       "Guo-Qiang Zhang",
  title =        "Quasi-prime algebraic domains",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "221--264",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=2074",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4210 (Formal logic); C4240 (Programming and algorithm
                 theory); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Georgia Univ., Athens, GA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebra; Cartesian closed domains; category theory;
                 database theory; denotational semantics; domain
                 equation solving; formal logic; functions; information
                 systems; irreducible information systems; morphisms;
                 programming languages; programming theory; quasi-linear
                 functions; quasi-prime algebraic domains; reflexive
                 domain; saturated domain; Scott continuous functions;
                 symmetric monoidal closed category; untyped lambda
                 calculus",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bunder:1996:TTN,
  author =       "M. W. Bunder and J. R. Hindley",
  title =        "Two $\beta=\lambda$-terms with no types in common",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "265--266",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=2088",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Math., Wollongong Univ., NSW, Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "beta-equal lambda-I-terms; closed lambda-K-terms;
                 Curry-style type-assignment system; lambda calculus;
                 type theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Drakengren:1996:USR,
  author =       "Thomas Drakengren",
  title =        "Uniqueness of {Scott}'s reflexive domain in
                 {$P\omega$}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "267--276",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=2043",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
                 Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "codings; D/sub infinity / models; domain uniqueness;
                 equations; extensional model; isomorphism; lambda
                 calculus; nontrivial solution; P omega; retract
                 equation; Scott's reflexive domain",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1996:NMS,
  author =       "Wenhui Zhang",
  title =        "Number of models and satisfiability of sets of
                 clauses",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "1",
  pages =        "277--288",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=1;
                 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=1996&volume=155&issue=1&aid=2085",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Telemark Coll., Norway",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-SAT problems; clause length; clause sets;
                 complexity; computability; computational complexity;
                 model number; modelling; propositional formulas;
                 satisfiability problems; set theory; variables number",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kuoherov:1996:VA,
  author =       "G. Kuoherov and P. Lescanne and P. Mosses",
  title =        "{Valentin Antimirov (1961--1995)}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "239--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Kucherov:1996:VA,
  author =       "Gregory Kucherov and Pierre Lescanne and Peter
                 Mosses",
  title =        "{Valentin Antimirov} (1961--1995)",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "289--290",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=2122",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Antimirov:1996:PDR,
  author =       "Valentin Antimirov",
  title =        "Partial derivatives of regular expressions and finite
                 automaton constructions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "291--319",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=2123",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "CRIN, Vandoeuvre-les-Nancy, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm; finite automata; finite automaton
                 constructions; finite partial derivative set; formal
                 languages; letters; nondeterministic finite automata;
                 partial derivatives; regular expressions; regular unit;
                 subterm; subterm concatenation; theorem proving; word
                 derivatives",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barcucci:1996:RCP,
  author =       "Elena Barcucci and Alberto Del Lungo and Maurice Nivat
                 and Renzo Pinzani",
  title =        "Reconstructing convex polyominoes from horizontal and
                 vertical projections",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "321--347",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=1927",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dipartimento di Sistemi e Inf., Firenze Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm; computational complexity; computational
                 geometry; computer-aided tomography; connected row
                 sets; convex polyomino reconstruction; convexity
                 conditions; data compression; decidability; discrete
                 bidimensional set reconstruction; horizontal
                 projections; image processing; NP-complete problem;
                 numerical matching with target sums problem; orthogonal
                 projections; pattern recognition; polynomial time
                 problem; row-convex polyomino; sequences; set theory;
                 unimodal sequences; vertical projections",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Keller:1996:FRP,
  author =       "J{\"o}rg Keller",
  title =        "Fast rehashing in {PRAM} emulations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "349--363",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=1926",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Fachbereich Inf., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "address space distribution; algorithm; computational
                 complexity; data redistribution; fast rehashing; file
                 organisation; hash function; linear hash functions;
                 local storage words; memory access patterns; memory
                 modules; module congestion; network latency; parallel
                 algorithms; parallel machines; PRAM emulations;
                 probability; processors; runtime; shared memory
                 systems; storage allocation; universal hashing",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lange:1996:MDM,
  author =       "Steffen Lange and Thomas Zeugmann and Shyam Kapur",
  title =        "Monotonic and dual monotonic language learning",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "365--410",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "ftp://ftp.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=1918",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Math. and Inf., HTWK Leipzig, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic language learning theory; algorithmic
                 languages; cumulativity learning theory; data; dual
                 monotonic language learning; dual strong-monotonic
                 learning; generalisation (artificial intelligence);
                 generalizations; guesses; inference device; inference
                 mechanisms; learning by example; monotonic language
                 learning; negative examples; output; positive examples;
                 shrinking specializations; specializations; strong
                 monotonicity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Iwama:1996:TLB,
  author =       "Kazuo Iwama and Chuzo Iwamoto and Manzur Morshed",
  title =        "Time lower bounds do not exist for {CRCW PRAMs}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "411--424",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=1933",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci. and Commun. Eng., Kyushu Univ.,
                 Fukuoka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; computational complexity; CRCW
                 PRAMs; monotonically increasing function;
                 nondegenerated Boolean function; parallel algorithms;
                 polynominally many processors; rapidly growing
                 function; time lower bounds; variables",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ehrenfeucht:1996:NBG,
  author =       "Andrzej Ehrenfeucht and Paulien ten Pas and Grzegorz
                 Rozenberg",
  title =        "A note on binary grammatical codes of trees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "425--438",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=2034",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary degree trees; binary grammatical codes; code
                 word length; coded tree leaves; derivation tree;
                 encoding; finite alphabet; grammars; minimal code
                 alphabet; ordered tree encoding; production rules;
                 strict binary codes; strings; trees; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Berstel:1996:LLB,
  author =       "Jean Berstel and Jean-Eric Pin",
  title =        "Local languages and the {Berry--Sethi} algorithm",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "439--446",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&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=1996&volume=155&issue=2&aid=2045",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "LITP, Inst. Blaise Pascal, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; Berry--Sethi algorithm; compiler
                 construction; compiler generators; computation;
                 document handling; document processing; finite
                 automata; finite automaton construction; formal
                 languages; formal proof; hypermedia; hypertext
                 software; local languages; rational expression;
                 recognizable languages; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hemaspaandra:1996:RCS,
  author =       "Lane A. Hemaspaandra and Albrecht Hoene and Mitsunori
                 Ogihara",
  title =        "Reducibility classes of {$P$}-selective sets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "155",
  number =       "2",
  pages =        "447--457",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Oct 31 12:32:13 2000",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  note =         "See erratum \cite{Hemaspaandra:2000:ERC}.",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=155&issue=2&aid=2035",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm; computational complexity; decidability;
                 equivalences; hierarchy; P-selective sets;
                 polynomial-time semidecision algorithm; reducibility
                 classes; reductions; set theory; strings",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nehlig:1996:AQA,
  author =       "Philippe Nehlig",
  title =        "Applications quasi affines: pavages par images
                 r{\'e}ciproques. ({French}) [{Quasi-affine}
                 applications: tilings for reciprocal images]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "1--38",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1981",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry); C6130B (Graphics
                 techniques)",
  corpsource =   "Computer Sci. Res. Centre, Strasbourg, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational geometry; computer graphics; discrete
                 geometry; floating point operations; reciprocal images;
                 rounding errors; tilings",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kemp:1996:BST,
  author =       "Rainer Kemp",
  title =        "Binary search trees constructed from nondistinct keys
                 with\slash without specified probabilities",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "39--70",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1936",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Fachbereich Inf., Frankfurt Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary search trees; finite multiset; input sequence;
                 nondistinct keys; specified probabilities; tree data
                 structures; tree searching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "B. Kemp",
}

@Article{Gyenizse:1996:CDB,
  author =       "P{\'a}l Gyenizse and S{\'a}ndor V{\'a}gv{\"o}lgyi",
  title =        "Compositions of deterministic bottom-up, top-down, and
                 regular look-ahead tree transformations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "71--97",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1937",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory)",
  corpsource =   "Res. Group on Theory of Automata, Hungarian Acad. of
                 Sci., Szeged, Hungary",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata theory; deterministic bottom-up; formal
                 languages; homomorphism tree transformations; inclusion
                 relationship; regular look-ahead; rewriting systems;
                 top-down; tree data structures; tree transformations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Krause:1996:GAY,
  author =       "Matthias Krause",
  title =        "Geometric arguments yield better bounds for threshold
                 circuits and distributed computing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "99--117",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1945",
  acknowledgement = ack-nhfb,
  classification = "C4230 (Switching theory); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Lehrstuhl Inf. II, Dortmund Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; communication complexity;
                 complexity; distributed computing; eigenvalues;
                 geometric arguments; probabilistic communication
                 complexity; probabilistic communication protocol;
                 threshold circuits; threshold logic",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bedon:1996:FAO,
  author =       "Nicolas Bedon",
  title =        "Finite automata and ordinals",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "119--144",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1946",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Inst. Gaspard Monge, Univ. de Marne-la-Vallee,
                 Noisy-le-Grand, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Choueka automata; decidability; finite automata;
                 monadic second order theory; ordinals; Wojciechowski
                 automata; word length",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "M. Bedon",
}

@Article{Louscou-Bozapalidou:1996:SCT,
  author =       "Olympia Louscou-Bozapalidou",
  title =        "Stochastically costed tree automata: {Turakainen}'s
                 theorem",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "145--158",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1949",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closure properties; formal languages; stochastic
                 automata; stochastic forest; stochastic languages;
                 stochastically costed tree automaton; trees
                 (mathematics); Turakainen's theorem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Francon:1996:TPA,
  author =       "Jean Fran{\c{c}}on",
  title =        "Sur la topologie d'un plan arithm{\'e}tique.
                 ({French}) [{On} the topology of an arithmetic plan]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "159--176",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=1997",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry); C5230 (Digital arithmetic
                 methods); C6130B (Graphics techniques)",
  corpsource =   "Lab. des Sci. de l'Image, d'Inf. et de Teledetection,
                 Strasbourg, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3D computer imaging; arithmetic plane; canonical
                 structure; computational geometry; digital arithmetic;
                 orientable combinatoric manifold; quadrangles; solid
                 modelling; topology",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schwartzbach:1996:SCH,
  author =       "Michael I. Schwartzbach",
  title =        "Static correctness of hierarchical procedures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "177--201",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2027",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm theory);
                 C6110F (Formal methods)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract types; assignments; example language;
                 first-order polymorphism; fully recursive types;
                 hierarchical procedure; inheritance; multiple
                 inheritance; opaque type; optimal method; procedure
                 calls; program fragment; program verification;
                 reusability; reuse; small types; specialization; static
                 correctness; static requirement; synonym types; truly
                 imperative language; type theory; type-safe
                 hierarchical procedure",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Forti:1996:GCH,
  author =       "Marco Forti and Furio Honsell",
  title =        "A general construction of hyperuniverses",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "203--215",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2028",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Istituto di Matematiche Appl. U. Dini, Pisa Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computation theory; computer theory; concurrency;
                 formal logic; general construction; hyperuniverse;
                 isomorphic structure; mathematical logic;
                 multiprocessing programs; nonhomeomorphic structure;
                 set theory; strong comprehension properties;
                 theoretical computer science",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Takahashi:1996:UCN,
  author =       "Yoshikane Takahashi",
  title =        "A unified constructive network model for
                 problem-solving",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "217--261",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2075",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory); C5290 (Neural computing
                 techniques)",
  corpsource =   "NTT Commun. Sci. Labs., Yokosuka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; computation theory; constituent
                 functions set; constraint; neural net model; neural
                 nets; neural network model; optimisation; optimization
                 problem; pattern classification; pattern matching;
                 problem solving; programming theory; restrictive
                 conditions; traveling salesman problem; travelling
                 salesman problem; travelling salesman problems; unified
                 constructive network model; unified method",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1996:NVD,
  author =       "Yonghoan Kim",
  title =        "New values in {Domineering}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "263--280",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2091",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0250 (Combinatorial
                 mathematics); C1140E (Game theory); C1160
                 (Combinatorial mathematics); C4230B (Combinatorial
                 switching theory)",
  corpsource =   "Dept. of Math., California Univ., Berkeley, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrarily small number; combinational switching;
                 combinatorial mathematics; corners; domineering;
                 domineering games; game theory; hot switch;
                 infinitesimal; iterative method; iterative methods;
                 kinks; new values; repeating domineering position
                 construction",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Terrier:1996:LRR,
  author =       "V{\'e}ronique Terrier",
  title =        "Language not recognizable in real time by one-way
                 cellular automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "281--287",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2052",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Lab. d'Inf., Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cellular automata; computation theory; computation
                 time; computational complexity; computational
                 linguistics; equivalence relation; input words;
                 iterative methods; language nonrecognition; language
                 recognition; OCA; one-way cellular automata; parallel
                 algorithms; real time; recognizability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnold:1996:ACO,
  author =       "Andr{\'e} Arnold and Ilaria Castellani",
  title =        "An algebraic characterization of observational
                 equivalence",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "289--299",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2082",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstraction homomorphism; algebra; algebraic
                 characterization; Arnold-Dicky; automata theory;
                 Castellani; formal logic; formulation; Hennessy--Milner
                 logic; observational equivalence; saturating
                 homomorphism; saturating homomorphisms; transition
                 system equivalence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Manzini:1996:OSL,
  author =       "Giovanni Manzini",
  title =        "On the ordering of sparse linear systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "301--313",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2092",
  acknowledgement = ack-nhfb,
  classification = "B0210 (Algebra); B0290H (Linear algebra); C1110
                 (Algebra); C4140 (Linear algebra)",
  corpsource =   "Dipartimento di Sci. e Tecnologie Avanzate,
                 Alessandria, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm; asymptotic cost; banded matrix; Gaussian
                 elimination algorithm; matrix algebra; matrix
                 transformation; n*n sparse matrix ordering; ordering;
                 permutation matrices; random matrix; reordering; sparse
                 linear systems; sparse matrices",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DePrisco:1996:NLB,
  author =       "Roberto {De Prisco} and Alfredo De Santis",
  title =        "New lower bounds on the cost of binary search trees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "156",
  number =       "1--2",
  pages =        "315--325",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:48 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-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=1996&volume=156&issue=1-2&aid=2094",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4240C
                 (Computational complexity); C6120 (File organisation)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary search tree; binary search trees; computational
                 complexity; computational cost; entropy; internal
                 nodes; Kraft sum; lower bound; probability
                 distribution; tree data structure; tree data
                 structures; tree searching; tree theory; trees
                 (mathematics); upper bound",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1996:WAC,
  author =       "Anonymous",
  title =        "{Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "??--??",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 14:14:47 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4170
                 (Differential equations); C4210 (Formal logic); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic complexity; computational complexity;
                 computational geometry; computer algebra; differential
                 algebra; differential equations; discrete combinatorial
                 geometry; geometric models; process algebra; sub
                 Riemannian geometry",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bronstein:1996:IPL,
  author =       "Manuel Bronstein and Marko Petkov{\v{s}}ek",
  title =        "An introduction to pseudo-linear algebra",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "3--33",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2114",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 B0290H (Linear algebra); B0290P (Differential
                 equations); C4130 (Interpolation and function
                 approximation); C4140 (Linear algebra); C4170
                 (Differential equations)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Inst. for Sci. Comput., Eidgenossische Tech.
                 Hochschule, Zurich, Switzerland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "common properties; difference equations; difference
                 operators; linear algebra; linear differential
                 equations; linear differential operators; polynomials;
                 pseudo-linear algebra; skew polynomials",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Devillers:1996:IRC,
  author =       "Olivier Devillers",
  title =        "An introduction to randomization in computational
                 geometry",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "35--52",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2115",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry); C6130 (Data handling
                 techniques)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom., Sophia
                 Antipolis, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational geometry; randomised algorithms;
                 randomization; sorting; sorting problem",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Elihai:1996:FHO,
  author =       "Y. Elihai and Y. Yomdin",
  title =        "Flexible high-order discretization of geometric data
                 for global motion planning",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "53--77",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2116",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation); C4260
                 (Computational geometry)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Grid Point Ltd., Ashdod, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational geometry; flexible high-order
                 discretization; geometric data; global motion planning;
                 normal forms; path planning; polynomials;
                 singularities; Taylor polynomials representation",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Grigoriev:1996:NSS,
  author =       "D. Grigoriev",
  title =        "{NC} solving of a system of linear ordinary
                 differential equations in several unknowns",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "79--90",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2117",
  acknowledgement = ack-nhfb,
  classification = "B0290P (Differential equations); C4170 (Differential
                 equations)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Dept. of Comput. Sci., Pennsylvania State Univ.,
                 University Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computability; linear differential equations; linear
                 ordinary differential equations; NC algorithm; NC
                 solving; standard basis form",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Grigoriev:1996:CAC,
  author =       "Dima Grigoriev and Marek Karpinski",
  title =        "Computability of the additive complexity of algebraic
                 circuits with root extracting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "91--99",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2118",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Dept. of Math., Pennsylvania State Univ., University
                 Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "additive complexity; algebraic circuits;
                 computability; computational complexity; root
                 extracting",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Laumond:1996:NSC,
  author =       "Jean-Paul Laumond and Jean-Jacques Risler",
  title =        "Nonholonomic systems: {Controllability} and
                 complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "101--114",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2119",
  acknowledgement = ack-nhfb,
  classification = "C1310 (Control system analysis and synthesis
                 methods); C3390 (Robotics); C4240C (Computational
                 complexity)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Lab. d'Autom. et d'Anal. des Syst., CNRS, Toulouse,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatorial results; complexity; computational
                 complexity; controllability; differential geometric
                 control theory; multibody mobile robot; nonholonomic
                 systems; path planning; polynomial systems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ollagnier:1996:AMD,
  author =       "Jean Moulin Ollagnier",
  title =        "Algorithms and methods in differential algebra",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "115--127",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2120",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4170 (Differential equations); C4210 (Formal logic);
                 C4240C (Computational complexity); C6130 (Data handling
                 techniques); C7310 (Mathematics computing)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Fac. de Sci. Econ. et de Gestion, Paris 12 Univ.,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic problems; computational complexity;
                 computer algebra systems; Darboux curves; decidability;
                 differential algebra; factorisable polynomial vector
                 fields; linear differential equations; Liouvillian
                 solutions; polynomials; symbol manipulation;
                 three-dimensional polynomial vector fields",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Risler:1996:BDN,
  author =       "Jean-Jacques Risler",
  title =        "A bound for the degree of nonholonomy in the plane",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "129--136",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 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=1996&volume=157&issue=1&aid=2121",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 C1310 (Control system analysis and synthesis methods);
                 C4130 (Interpolation and function approximation)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Ecole Normale Superieure, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "control system; controllability; degree of
                 nonholonomy; polynomials; vector fields",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ablayev:1996:LBO,
  author =       "Farid Ablayev",
  title =        "Lower bounds for one-way probabilistic communication
                 complexity and their application to space complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "139--159",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2098",
  acknowledgement = ack-nhfb,
  classification = "B6150M (Protocols); C4210 (Formal logic); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5640 (Protocols)",
  corpsource =   "Dept. of Theor. Cybern., Kazan Univ., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; boolean functions; communication
                 complexity; computational complexity; lower bounds;
                 one-way probabilistic communication complexity;
                 probabilistic communication protocols; protocols; space
                 complexity",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Burago:1996:CPO,
  author =       "Dima Burago and Michel de Rougemont and Anatol
                 Slissenko",
  title =        "On the complexity of partially observed {Markov}
                 decision processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "161--183",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2099",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory); C1140Z
                 (Other topics in statistics); C4240C (Computational
                 complexity)",
  corpsource =   "Inst. for Inf. and Autom., Acad. of Sci., St.
                 Petersburg, Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bijective coloring; colored vertices; computational
                 complexity; decision theory; finite stationary
                 processes; Markov processes; Max-Word problem are also
                 indicated; NP- hard; optimal strategies; partially
                 observed Markov decision processes complexity; polytime
                 approximations; probabilistic deviations; upper bound",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Grigoriev:1996:CLB,
  author =       "D. Grigoriev and N. Vorobjov",
  title =        "Complexity lower bounds for computation trees with
                 elementary transcendental function gates",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "185--214",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2100",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci. and Math., Pennsylvania State
                 Univ., University Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic functions; complexity lower bounds;
                 computation trees; computational complexity;
                 computational geometry; convex polyhedron; elementary
                 transcendental function gates; general Pfaffian
                 functions; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Karzanov:1996:HTS,
  author =       "Alexander V. Karzanov",
  title =        "How to tidy up a symmetric set-system by use of
                 uncrossing operations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "215--225",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2101",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0260 (Optimisation
                 techniques); C1140E (Game theory); C1180 (Optimisation
                 techniques)",
  corpsource =   "Inst. for Syst. Anal., Acad. of Sci., Moscow, Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary symmetric cross-closed; combinatorial
                 optimization; directed cuts; game theory; optimal
                 packing; optimisation; packing problems; polynomial
                 algorithm; symmetric set-system; T-cuts; time
                 polynomial; uncrossing operations; weighted version",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Muchnik:1996:GMC,
  author =       "Andrei A. Muchnik and Nikolai K. Vereshchagin",
  title =        "A general method to construct oracles realizing given
                 relationships between complexity classes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "227--258",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2102",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Inst. of New Technol., Moscow, Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity classes; computational complexity;
                 oracles",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Karpinski:1996:SAP,
  author =       "Marek Karpinski and Igor Shparlinski",
  title =        "On some approximation problems concerning sparse
                 polynomials over finite fields",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "259--266",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2103",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Bonn Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximation problems; deterministic algorithms;
                 finite fields; lower bounds; multivariate sparse
                 polynomials; polynomials; probabilistic algorithms;
                 sparse polynomials; univariate sparse polynomial",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Levin:1996:CCF,
  author =       "Leonid A. Levin",
  title =        "Computational complexity of functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "267--271",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2104",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Boston Univ., MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexities; computability; computational
                 complexity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shparlinski:1996:FPR,
  author =       "Igor Shparlinski",
  title =        "On finding primitive roots in finite fields",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "273--275",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2105",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Sch. of MPCE, Macquarie Univ., Sydney, NSW,
                 Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "deterministic algorithm; deterministic algorithms;
                 finite fields; primitive roots",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Verbitsky:1996:TPR,
  author =       "Oleg Verbitsky",
  title =        "Towards the parallel repetition conjecture",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "277--282",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&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=1996&volume=157&issue=2&aid=2106",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C4240C
                 (Computational complexity); C5640 (Protocols)",
  corpsource =   "Dept. of Math. Logic, Moscow State Univ., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; error probability;
                 Hales--Jewett theorem; parallel repetition conjecture;
                 probability; protocols; Ramsey theory; two-prover
                 one-round interactive protocol",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gabarro:1996:DPD,
  author =       "Joaquim Gabarr{\'o} and Conrado Mart{\'\i}nez and
                 Xavier Messeguer",
  title =        "A design of a parallel dictionary using skip lists",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "1--33",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=1922",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Dept. de Llenguatges i Sistemes Inf., Univ.
                 Politecnica de Catalunya, Barcelona, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "data structures; EREW PRAM; list processing; parallel
                 algorithms; parallel dictionary; parallel PRAM
                 dictionary; skip list algorithms; skip lists",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Koskas:1996:APW,
  author =       "Michel Koskas",
  title =        "About the $p$-paperfolding words",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "35--51",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=1948",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata theory; complexity function; computational
                 complexity; generating series; p-paperfolding words;
                 paperfolding sequence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ferreira:1996:RRG,
  author =       "Afonso Ferreira and Miltos Grammatikakis",
  title =        "Randomized routing on generalized hypercubes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "53--64",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=1982",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240
                 (Programming and algorithm theory)",
  corpsource =   "CNRS, Lyon, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary hypercube; generalized hypercubes; hypercube
                 networks; network routing; packets; permutation
                 routing; probabilistic permutation routing; randomised
                 algorithms; randomized routing",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fabre:1996:DSN,
  author =       "St{\'e}phane Fabre",
  title =        "{D}{\'e}pendance de syst{\`e}mes de num{\'e}ration
                 associ{\'e}s {\`a} des puissances d'un nombre de
                 {Pisot}. ({French}) [{Dependence} of number systems
                 associated with the influences of a {Pisot} number]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "65--79",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=1983",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4220 (Automata
                 theory)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-recognizable; finite automata; finite automaton;
                 infinite sequence; number systems; number theory;
                 Pisot-Vijayaraghavan numbers; positive integers;
                 recognizable; sequences",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jonoska:1996:SSS,
  author =       "Nata{\v{s}}a Jonoska",
  title =        "Sofic shifts with synchronizing presentations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "81--115",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=1996",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Math., Univ. of South Florida, Tampa, FL,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bi-infinite sequences; bi-synchronizing presentation;
                 binary sequences; directed graphs; factor language;
                 finite directed labeled graph; formal languages;
                 predecessor sets; sofic shift; subshift; symbolic
                 dynamical system; synchronizing presentations;
                 syntactic monoid",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Demange:1996:AMF,
  author =       "Marc Demange and Vangelis Th Paschos",
  title =        "On an approximation measure founded on the links
                 between optimization and polynomial approximation
                 theory",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "117--141",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=1998",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4130 (Interpolation and
                 function approximation); C4240C (Computational
                 complexity)",
  corpsource =   "LAMSADE, Univ. Paris-Dauphine, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximation measure; approximation theory;
                 combinatorial mathematics; combinatorial optimization;
                 complexity; computational complexity; equivalence;
                 maximum independent set; minimum vertex cover;
                 optimisation; polynomial approximation theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hirshfeld:1996:PAD,
  author =       "Yoram Hirshfeld and Mark Jerrum and Faron Moller",
  title =        "A polynomial algorithm for deciding bisimilarity of
                 normed context-free processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "143--159",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2002",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Edinburgh Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bisimilarity; computational complexity; context-free
                 grammars; equivalence problem; normed context-free
                 processes; NP; polynomial algorithm; simple grammars;
                 upper bound",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nishida:1996:SL,
  author =       "Taishin Y. Nishida and Arto Salomaa",
  title =        "Slender {$0$L} languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "161--176",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2005",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Fac. of Eng., Toyama Prefectural Univ., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "classification; context-free languages; decidability;
                 decision methods; interconnections; slender 0L
                 languages",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Slender {OL} languages",
}

@Article{Breslauer:1996:SCC,
  author =       "Dany Breslauer",
  title =        "Saving comparisons in the {Crochemore-Perrin} string
                 matching algorithm",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "177--192",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2006",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; linear-time constant-space;
                 pattern preprocessing step; string matching;
                 string-matching algorithm",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Agrawal:1996:GSL,
  author =       "M. Agrawal and V. Arvind",
  title =        "Geometric sets of low information content",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "193--219",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2014",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "Sch. of Math., SPIC Sci. Found., Madras, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; equivalence; formal
                 languages; halfspaces; hyperplanes; language classes;
                 linear programming; nonuniform families; polynomial
                 size depth-1 circuit; Turing self-reducible set;
                 weighted exact threshold gate",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mocas:1996:SCE,
  author =       "Sarah E. Mocas",
  title =        "Separating classes in the exponential-time hierarchy
                 from classes in {PH}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "221--231",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2019",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Portland State Univ., OR, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "classes in PH; computational complexity; deterministic
                 polynomial time; exponential-time hierarchy; NP oracle;
                 polynomial-time hierarchy; separations; time hierarchy
                 theorem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramalingam:1996:CCD,
  author =       "G. Ramalingam and Thomas Reps",
  title =        "On the computational complexity of dynamic graph
                 problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "233--277",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2020",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; dynamic graph problems;
                 dynamic problems; graph theory; incremental algorithms;
                 theory of computational complexity; time complexity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Takahashi:1996:SOP,
  author =       "Yoshikane Takahashi",
  title =        "Solving optimization problems with variable-constraint
                 by an extended {Cohen--Grossberg} model",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "279--341",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2026",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1230D (Neural
                 nets); C6110L (Logic programming)",
  corpsource =   "NTT Commun. Sci. Labs., Kanagawa, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Cohen--Grossberg model; constraint handling;
                 continuous optimization problems; Hopfield model;
                 Liapunov function; neural nets; neural networks;
                 optimisation; optimization problems; traveling salesman
                 problem; variable constraint; variable-constraint",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zwick:1996:CMP,
  author =       "Uri Zwick and Mike S. Paterson",
  title =        "The complexity of mean payoff games on graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "343--359",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2129",
  acknowledgement = ack-nhfb,
  classification = "C1140E (Game theory); C1160 (Combinatorial
                 mathematics); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; decision
                 problem; directed graphs; games on graphs; mean payoff
                 games; perfect information games;
                 pseudo-polynomial-time algorithm; simple stochastic
                 games; stochastic games",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Agrawal:1996:QLT,
  author =       "M. Agrawal and V. Arvind",
  title =        "Quasi-linear truth-table reductions to $p$-selective
                 sets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "361--370",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2108",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Sch. of Math., SPIC Sci. Found., Madras, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; low information content;
                 p-selective sets; quasi-linear; reductions of
                 complexity classes; structural complexity theory;
                 truth-table reductions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burckel:1996:CIC,
  author =       "Serge Burckel",
  title =        "Closed iterative calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "371--378",
  day =          "20",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:55 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-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=1996&volume=158&issue=1-2&aid=2112",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Dept. de Math., Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "calculus; closed iterative calculus; graph theory;
                 iterative calculus; mapping",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1996:CEBa,
  author =       "Anonymous",
  title =        "Contents {EATCS Bulletin Number 58}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "158",
  number =       "1--2",
  pages =        "379--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Gouyou-Beauchamps:1996:PSI,
  author =       "D. Gouyou-Beauchamps and J.-G. Penaud",
  title =        "Preface to the {Special Issue on GASCOM '94}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "3--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Wilf:1996:RDP,
  author =       "Herbert S. Wilf",
  title =        "Recents d{\'e}v{\'e}loppements et probl{\`e}mes dans
                 le domaine de la g{\'e}n{\'e}ration al{\'e}atoire.
                 ({French}) [Recent developments and problems in the
                 area of random generation]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "5--13",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2138",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  language =     "French",
}

@Article{Alonso:1996:PAG,
  author =       "Laurent Alonso and Ren{\'e} Schott",
  title =        "A parallel algorithm for the generation of a
                 permutation and applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "15--28",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2139",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)C6120 (File
                 organisation); C4240C (Computational complexity);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "CRIN, Inst. Nat. de Recherche en Inf. et
                 Autom.-Lorraine, Vandoeuvre-les-Nancy, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bijection; computational complexity; Dyck word;
                 Motzkin words; O(Log/sup 2/(n)) time; parallel
                 algorithm; parallel algorithms; permutation; tree data
                 structures; trees; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barcucci:1996:DPP,
  author =       "Elena Barcucci and Alberto Del Lungo and Renzo
                 Pinzani",
  title =        "``{Deco}'' polyominoes, permutations and random
                 generation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "29--42",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2140",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C5230 (Digital arithmetic
                 methods)",
  corpsource =   "Dept. of Syst. and Inf., Florence Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatorial mathematics; deco polyominoes; hexagonal
                 lattices; linear algorithm; permutations; random
                 generation; random number generation; triangular
                 lattices",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Denise:1996:GAU,
  author =       "Alain Denise",
  title =        "{G}{\'e}n{\'e}ration al{\'e}atoire uniforme de mots de
                 langages rationnels. ({French}) [{Generating} uniformly
                 random words of rational languages]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "43--63",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2141",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory); C4240C
                 (Computational complexity)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cardinality; computational complexity; deterministic
                 automata; formal languages; logarithmic complexity;
                 minimal finite deterministic automata; random words;
                 rational languages",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Louchard:1996:PAS,
  author =       "G. Louchard",
  title =        "Probabilistic analysis of some (un)directed animals",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "65--79",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2142",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other topics in statistics); C1140Z (Other
                 topics in statistics)",
  corpsource =   "Dept. d'Inf., Univ. Libre de Bruxelles, Belgium",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymptotic densities; asymptotic distributions;
                 Brownian motion; decomposition parameter; directed
                 animals; directed column convex animals; Gaussian
                 processes; Gaussian stochastic processes; internal path
                 length; limiting processes; probabilistic analysis;
                 probability; stochastic integrals; stochastic
                 processes; stochastic properties; trajectories;
                 undirected animals; weak convergence theorems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mosbah:1996:PHR,
  author =       "Mohamed Mosbah",
  title =        "Probabilistic hyperedge replacement grammars",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "81--102",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2143",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "derivation tree; graph grammars; inductive function;
                 inductive graph predicate; probabilistic graph grammar;
                 probabilistic hyperedge replacement grammars;
                 probabilistic measure; probability; probability
                 function; statistical properties",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Aigrain:1996:PSI,
  author =       "P. Aigrain",
  title =        "Preface to the {Special Issue on the 3rd International
                 Workshop on Polyominoes and Tilings}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "103--104",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 14:14:47 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "IRIT, Univ. Paul Sabatier, Toulouse, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata; coding; computational geometry; counting
                 polyominoes; grammars; polyomino codes; tilings;
                 translations of polyominoes",
  pubcountry =   "Netherlands",
  treatment =    "G General Review",
}

@Article{Fournier:1996:PFP,
  author =       "J. C. Fournier",
  title =        "Pavage des figures planes sans trous par des dominos:
                 {Fondement} graphique de l'algorithme de {Thurston},
                 parallelisation, unicit{\'e} et d{\'e}composition.
                 ({French}) [{Tiling} pictures of the plane without
                 holes by dominoes: graphical basis of the {Thurston}
                 algorithm, parallelisation, uniqueness and
                 decomposition]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "105--128",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2145",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry); C6130B (Graphics
                 techniques)",
  corpsource =   "Dept. d'Inf., Univ. Paris 12, Creteil, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bipartite graphs; black squares; chessboard-like
                 coloured picture; computational geometry; computer
                 graphics; decomposition; dominoes; graph theory;
                 graphical basis; matchings; parallelisation; Thurston
                 algorithm; tiling pictures; uniqueness; unit squares",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barcucci:1996:PDT,
  author =       "Elena Barcucci and Alberto Del Lungo and Renzo Pinzani
                 and Renzo Sprugnoli",
  title =        "Polyominoes defined by their vertical and horizontal
                 projections",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "129--136",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2146",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry)",
  corpsource =   "Dept. of Syst. and Inf., Florence Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational geometry; directed column-convex
                 polyominoes; horizontal projections; orthogonal
                 projections; polyominoes; row-convex polyominoes;
                 vertical projections",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chaboud:1996:DTP,
  author =       "Thomas Chaboud",
  title =        "Domino tiling in planar graphs with regular and
                 bipartite dual",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "137--142",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 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=1996&volume=159&issue=1&aid=2147",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory); C1160
                 (Combinatorial mathematics); C4260 (Computational
                 geometry)",
  corpsource =   "Lab. d'Inf. du Parallelism, ENS Lyon, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bipartite dual; computational geometry; domino tiling;
                 game theory; planar graphs; regular dual; Thurston's
                 linear-time tiling algorithm",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bundgen:1996:BAT,
  author =       "Reinhard B{\"u}ndgen",
  title =        "{Buchberger}'s algorithm: {The} term rewriter's point
                 of view",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "143--190",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=1999",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Wilhelm-Schickard-Inst. f{\"u}r Inf., Tubingen Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Buchberger's algorithm; completion procedures;
                 critical pair computation process; finite
                 approximation; finite fields; infinite rule set;
                 infinite term rewriting system; polynomials; rewriting
                 systems; term completion module; term rewriting",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Asperti:1996:ISI,
  author =       "Andrea Asperti and Cosimo Laneve",
  title =        "Interaction systems {II}: {The} practice of optimal
                 reductions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "191--244",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=2000",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6120 (File organisation)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Bologna Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "control flow constructs; data structures; family
                 relation; functional paradigm; higher-order rewriting
                 systems; inductive types; interaction systems;
                 labeling; lambda calculus; optimal reductions;
                 rewriting systems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gritzner:1996:RAM,
  author =       "Thomas F. Gritzner and Rudolf Berghammer",
  title =        "A relation algebraic model of robust correctness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "245--270",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=2001",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110F (Formal methods);
                 C6160D (Relational databases)",
  corpsource =   "Fakultat f{\"u}r Inf., Tech. Univ. Munchen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract relational approach; demonic nondeterminism;
                 Dijkstra's wp-calculus; flat lattices; formal
                 specification; Hoare's chaos semantics; Morgan's
                 specification statement; programs refinement;
                 refinement relation; relation algebraic model;
                 relational algebra; robust correctness",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Erdogmus:1996:OSN,
  author =       "Hakan Erdogmus and Robert Johnston and Michael
                 Ferguson",
  title =        "On the operational semantics of nondeterminism and
                 divergence",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "271--317",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=2107",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. for Inf. Technol., Nat. Res. Council of Canada,
                 Ottawa, Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "divergence; internal transition; nondeterminism;
                 nondeterministic processes; operational model;
                 operational semantics; operational theory of
                 divergence; process algebra; process algebraic
                 languages; stable internal states; weak process",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sambin:1996:CDT,
  author =       "Giovanni Sambin and Silvio Valentini and Paolo
                 Virgili",
  title =        "Constructive domain theory as a branch of
                 intuitionistic pointfree topology",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "319--341",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=2110",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dipartimento di Matematica Pura e Applicata, Padova
                 Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximable mappings; constructive domain theory;
                 formal logic; information base; intuitionistic
                 approach; intuitionistic pointfree topology;
                 intuitionistic type theory; intuitive interpretation;
                 Martin-L{\"o}f theory; pointfree topology; Scott
                 domains; standard set theoretic notation; type theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arai:1996:PHP,
  author =       "Noriko H. Arai",
  title =        "A proper hierarchy of propositional sequent calculi",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "343--354",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=2134",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Hiroshima City Univ., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; DAG form;
                 directed acyclic graphs; directed graphs; LK; proper
                 hierarchy; propositional sequent calculi; tree form",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ying:1996:WIC,
  author =       "Mingsheng Ying",
  title =        "When is the ideal completion of abstract basis
                 algebraic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "355--356",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&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=1996&volume=159&issue=2&aid=2124",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Jiangxi Normal Univ., Nanchang,
                 China",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract basis; algebraic domain; approximable
                 relations; category of bases; continuous domains;
                 continuous mappings; domain theory; formal logic; ideal
                 completion; process algebra; sufficient and necessary
                 condition",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Maddux:1996:RAS,
  author =       "Roger D. Maddux",
  title =        "Relation-algebraic semantics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "1--85",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2023",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm theory);
                 C4250 (Database theory)",
  corpsource =   "Dept. of Math., Iowa State Univ., Ames, IA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean algebra; Boolean algebras; computational
                 linguistics; correct interpretation; demonic
                 composition; demonic union; domain of nontermination;
                 excluded miracle; fixed point theorem; if then else;
                 input/output relation; invariance theorem;
                 nondeterministic choice; predicate transformers;
                 program schemes; program statements; programming
                 languages; programming theory; relation algebraic
                 semantics; relational algebra; sequential composition;
                 single mu recursion; standard laws; while statements",
  pubcountry =   "Netherlands",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Courcelle:1996:MSO,
  author =       "Bruno Courcelle",
  title =        "The monadic second-order logic of graphs {$X$}:
                 {Linear} orderings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "87--143",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2024",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cographs; dependency graphs; finite set; finite term;
                 fixed formulas; fixed monadic second order formulas;
                 formal languages; graph operations; graph theory;
                 graphs; graphs X; hierarchical structure; linear
                 orderings; modular decomposition; monadic second order
                 logic; partial k paths; partially commutative words;
                 prime graphs; recognizability; relational structures;
                 subclass",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tronci:1996:EPCa,
  author =       "Enrico Tronci",
  title =        "Equational programming in $\lambda$-calculus via
                 {SL-systems}. {Part} 1",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "145--184",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2046",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4240
                 (Programming and algorithm theory); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Dipartimento di Matematica Pura ed Applicata, l'Aquila
                 Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "beta solvable; closed lambda terms; compiler;
                 computational linguistics; data structures;
                 decidability; equational programming language;
                 executable codes; finite set; functional programming;
                 lambda calculus; programming language; programming
                 languages; programming theory; self application; set
                 theory; simultaneous substitution; SL systems;
                 solvability problem; specifications; system solving
                 algorithm; undecidable",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tronci:1996:EPCb,
  author =       "Enrico Tronci",
  title =        "Equational programming in $\lambda$-calculus via
                 {SL-systems}. {Part 2}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "185--216",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2047",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity); C6110
                 (Systems analysis and programming)",
  corpsource =   "Dipartimento di Matematica Pura ed Applicata, l'Aquila
                 Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "beta solvable; compiler; computational complexity;
                 computational linguistics; decidability; decidable;
                 equational programming language; finite set; functional
                 programming; lambda calculus; NP complete problem; NP
                 regular SL systems; programming theory; separation like
                 systems; simultaneous substitution; solvability
                 problem; system solving algorithm; undecidability;
                 unrestrained self application",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tuijn:1996:CCG,
  author =       "Chris Tuijn and Marc Gyssens",
  title =        "{CGOOD}, a categorical graph-oriented object data
                 model",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "217--239",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2030",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
                 recognition); C4250 (Database theory); C6120 (File
                 organisation); C6140D (High level languages); C6160J
                 (Object-oriented databases)",
  corpsource =   "Agfa-Gevaert N.V., Mortsel, Belgium",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "categorical approach; categorical constructs;
                 categorical graph oriented object data model; category
                 theory; CGOOD; data structures; functional abstraction;
                 graph category; graph theory; instance level;
                 morphisms; object oriented data model; object-oriented
                 databases; pattern matching; pattern matchings; query
                 language; query languages; relational database
                 operators; transitive closure; typed graphs; update
                 language",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baaz:1996:CFO,
  author =       "Matthias Baaz and Alexander Leitsch and Richard Zach",
  title =        "Completeness of a first-order temporal logic with
                 time-gaps",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "241--270",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2048",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.
                 Wien, Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "branching gaps; completeness; cut free complete
                 sequent calculus; discrete linear time; first order
                 temporal logic; linear time; programming theory;
                 recursively axiomatizable; resolution system; temporal
                 logic; time gaps; time structures; trees; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "M. Baaz and A. Leitsch and P. Zach",
}

@Article{Kaminski:1996:PAO,
  author =       "Michael Kaminski and Chung Kei Wong",
  title =        "The power of the ``always'' operator in first-order
                 temporal logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "271--281",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2049",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "always operator; first order linear time temporal
                 logic; linear time; next operators; programming theory;
                 temporal logic; translation; until operators; validity
                 questions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yamasaki:1996:SRN,
  author =       "Susumu Yamasaki",
  title =        "{SLDNF} resolution with non-safe rule and fixpoint
                 semantics for general logic programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "283--303",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2050",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C6110L (Logic
                 programming)",
  corpsource =   "Dept. of Comput. and Inf. Technol., Okayama Univ.,
                 Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "atom sets; failure sets; fixpoint semantics; formal
                 logic; general logic programs; logic programming;
                 negative literal; non ground negative literals; non
                 safe rule; safe rule; set theory; SLD resolution with
                 negation as failure; SLDNF resolution",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Durand:1996:FOS,
  author =       "Arnaud Durand and Solomampionona Ranaivoson",
  title =        "First-order spectra with one binary predicate",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "305--320",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2053",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4240C
                 (Computational complexity)",
  corpsource =   "Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary predicate; cardinalities; computational
                 complexity; finite structures; first order sentences;
                 first order spectra; formal languages; generalized
                 spectra; input integer; integers; large complexity
                 class; natural sets; polynomials; set theory; single
                 binary relation; type theory; unary function symbols;
                 unary languages",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "A. Durand and S. Panaivoson",
}

@Article{Bonatti:1996:QDD,
  author =       "Piero A. Bonatti and Thomas Eiter",
  title =        "Querying disjunctive databases through nonmonotonic
                 logics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "321--363",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2133",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4250 (Database theory); C6140D (High level
                 languages); C6160K (Deductive databases)",
  corpsource =   "Dipartimento di Inf., Torino Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "autoepistemic logic; Boolean queries; brave reasoning;
                 cautious reasoning; counting argument; database theory;
                 deductive databases; default logic; disjunctive
                 database querying; dual results; expressive power;
                 finer grained characterization; formal logic; knowledge
                 representation; nonmonotonic logics; nonmonotonic
                 reasoning; query expressions; query languages; query
                 processing; semantics; Sigma /sub 2//sup p/
                 recognizable Boolean queries",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Marriott:1996:NBC,
  author =       "Kim Marriott and Martin Odersky",
  title =        "Negative {Boolean} constraints",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "365--380",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-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=1996&volume=160&issue=1-2&aid=2150",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
                 Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean algebra; complexity; computability;
                 computational complexity; constraint handling;
                 constraint logic programming; equivalence; implication;
                 inequation independence; machine reasoning; negative
                 Boolean constraints; satisfiability; spatial query
                 decomposition; validity; variable elimination",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1996:MIVa,
  author =       "Anonymous",
  title =        "{Master Index Volume 151--160}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "160",
  number =       "1--2",
  pages =        "383--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Chen:1996:PCM,
  author =       "Zhi-Zhong Chen",
  title =        "Parallel constructions of maximal path sets and
                 applications to short superstrings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "1--21",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2051",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Math. Sci., Tokyo Denki Univ., Saitama,
                 Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; compression ratio; maximal path sets;
                 parallel algorithms; parallel approximation algorithms;
                 RNC algorithm; set theory; short superstrings; string
                 matching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carrere:1996:KRA,
  author =       "F. Carrere",
  title =        "On the {Kleijn--Rozenberg} $k$-adjacent languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "23--68",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2025",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Lab. of Comput. Sci., Bordeaux I Univ., Talence,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-adjacency; $k$-adjacent derivations; $k$-adjacent
                 languages; context-free grammars; formal languages;
                 grammars; languages; rewriting process",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Labhalla:1996:ACR,
  author =       "Salah Labhalla and Henri Lombardi and Roger Marlin",
  title =        "Algorithmes de calcul de la r{\'e}duction de {Hermite}
                 d'une matrice {\`a} coefficients polynomiaux.
                 ({French}) [{Algorithms} for computing an {Hermitian}
                 reduction of a matrix with polynomial coefficients]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "69--92",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2031",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. de Math., Univ. de Marrakech, Morocco",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "basis matrix; complexity; computational complexity;
                 determinants; Hermitian matrices; Hermitian reduction;
                 linear algebra; matrix; polynomial coefficients;
                 polynomial matrices; polynomial time algorithm;
                 progressive triangulation",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Harju:1996:FPC,
  author =       "Tero Harju and Marjo Lipponen and Alexandru Mateescu",
  title =        "Flatwords and {Post Correspondence Problem}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "93--108",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2033",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Math., Turku Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; flatwords; formal languages; Post
                 Correspondence Problem; prime solutions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mayer:1996:CPI,
  author =       "Alain J. Mayer and Larry J. Stockmeyer",
  title =        "The complexity of {PDL} with interleaving",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "109--122",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2036",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Columbia Univ., New York, NY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computability; computational complexity;
                 concurrently executing programs; formal logic;
                 interleaving; parallel programming; PDL; propositional
                 dynamic logic; satisfiability problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fortnow:1996:RBI,
  author =       "Lance Fortnow and Martin Kummer",
  title =        "On resource-bounded instance complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "123--140",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2038",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Chicago Univ., IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "C-complexity; CD-complexity; computational complexity;
                 instance complexity; NP-hard; recursive set;
                 resource-bounded; shortest program; string; string
                 matching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Petersen:1996:LPW,
  author =       "H. Petersen",
  title =        "On the language of primitive words",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "141--156",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2039",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory); C4240C
                 (Computational complexity)",
  corpsource =   "Inst. f{\"u}r Inf., Stuttgart Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic coding theory; Boolean functions;
                 complexity; computational complexity; constant-depth
                 polynomial-size unbounded fan-in boolean circuits;
                 context-free languages; decidability; formal language
                 theory; Lyndon words; primitive words; primitivity;
                 pushdown automata; RAM model; shorter word; two-way
                 deterministic pushdown automata; unambiguous
                 context-free language",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Selmi:1996:TL,
  author =       "Carla Selmi",
  title =        "Over testable languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "157--190",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2041",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory)",
  corpsource =   "LITP, Paris VII Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "combinatorial description; commutative semigroup;
                 finite automata; formal languages; generator family;
                 grammars; group theory; locally idempotent semigroups;
                 locally testable semigroups; over testable languages;
                 piecewise testable; strongly locally testable",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carton:1996:CA,
  author =       "Olivier Carton",
  title =        "Chain automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "191--203",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2044",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4220 (Automata
                 theory)",
  corpsource =   "Inst. Gaspard Monge, Univ. de Marne-la-Vallee, Noisy
                 le Grand, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "acceptance condition; chain automata; complement;
                 decidability; finite automata; formal languages; group
                 theory; intersection; Muller automata; omega-language;
                 Rabin automata; Rabin index; union",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hotz:1996:PCC,
  author =       "G{\"u}nter Hotz and Gisela Pitsch",
  title =        "On parsing coupled-context-free languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "205--233",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2055",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity); C6180N
                 (Natural language processing)",
  corpsource =   "FB 14-Inf., Saarlandes Univ., Saarbrucken, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; context-free grammars;
                 context-free languages; coupled-context-free grammars;
                 coupled-context-free languages; generative capacity;
                 graph grammars; infinite language hierarchy; language
                 subclasses; natural language syntax; natural languages;
                 nonterminals; normal form; parentheses; parsing;
                 simultaneous substitution; time complexity; tree
                 adjoining grammars; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fulk:1996:LPI,
  author =       "Mark Fulk and Sanjay Jain",
  title =        "Learning in the presence of inaccurate information",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "235--261",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2076",
  acknowledgement = ack-nhfb,
  classification = "C1220 (Simulation, modelling and identification);
                 C1230 (Artificial intelligence); C1240 (Adaptive system
                 theory); C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Genesee Valley Software, Brighton, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "allowed errors; computable function graphs; formal
                 languages; function learning; functions; grammar
                 identification; grammars; graphs; hierarchies;
                 hypotheses; identification; identification in the
                 limit; imperfect environment; inaccurate information;
                 incomplete data; incomplete environment; learner's
                 environment; learning (artificial intelligence);
                 learning model; missing data; noisy data; noisy
                 environment; positive data; program identification;
                 programming theory; recursive functions; recursively
                 enumerable languages; spurious data; success criteria;
                 tradeoffs; uncertainty handling",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Regan:1996:ISP,
  author =       "Kenneth W. Regan",
  title =        "Index sets and presentations of complexity classes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "263--287",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2087",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Buffalo, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arithmetical hierarchy; complexity class index sets;
                 complexity class presentations; computational
                 complexity; enforcable properties; exponential time;
                 formal languages; indexing; infinite polynomial
                 hierarchy; P-biimmune languages; P-immune languages;
                 priority argument; recursively presentable class; set
                 theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maruyama:1996:ITW,
  author =       "Osamu Maruyama and Satoru Miyano",
  title =        "Inferring a tree from walks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "289--300",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2097",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Inf. Syst., Kyushu Univ., Fukuoka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "colour string; computability; computational
                 complexity; edge-colour sequence; graph colouring;
                 graph edges; inference mechanisms; linear chain
                 inference; NP-complete problem; partial walks;
                 solvability; tree inference; trees (mathematics);
                 undirected edge-colored graph",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cucker:1996:GKP,
  author =       "Felipe Cucker and Michael Shub",
  title =        "Generalized {Knapsack} problems and fixed degree
                 separations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "301--306",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2205",
  acknowledgement = ack-nhfb,
  classification = "C1290 (Applications of systems theory); C4220
                 (Automata theory); C4240C (Computational complexity)",
  corpsource =   "Univ. Pompeu Fabra, Barcelona, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean setting; complexity classes; computational
                 complexity; deterministic time; fixed degree
                 separations; fixed-degree polynomial time bounds;
                 generalized knapsack problems; nondeterministic time;
                 operations research; strict inclusion; Turing
                 machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Andreev:1996:CHD,
  author =       "Alexander E. Andreev and Andrea E. F. Clementi and
                 Jos{\'e} D. P. Rolim",
  title =        "Constructing the highest degree subgraph for dense
                 graphs is in {NCAS}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "307--314",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2217",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Math. and Mech., Moscow Univ., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximability; approximate solutions; approximation
                 theory; computational complexity; dense graphs; graph
                 theory; highest-degree subgraph; NC-approximation
                 scheme; NCAS class; P- complete problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vigna:1996:RBD,
  author =       "Sebastiano Vigna",
  title =        "On the relations between distributive computability
                 and the {BSS} model",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "5--21",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2188",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "BSS model; computability; distributive computability;
                 equivalence; equivalence classes; natural distributive
                 graph; recursive functions; structural
                 characterization",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moore:1996:RTR,
  author =       "Cristopher Moore",
  title =        "Recursion theory on the reals and continuous-time
                 computation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "23--44",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2189",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Santa Fe Inst., NM, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "classical recursion theory; computability;
                 continuous-time computation; differentially algebraic;
                 reals; recursive functions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brattka:1996:RCC,
  author =       "Vasco Brattka",
  title =        "Recursive characterization of computable real-valued
                 functions and relations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "45--77",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2190",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Theor. Inf. I, Fern Univ., Hagen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "basic relations; computability; computable real-valued
                 functions; computable relations; metric spaces;
                 real-valued functions; recursive functions; recursive
                 relations; Turing machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Escardo:1996:PER,
  author =       "Mart{\'\i}n H{\"o}tzel Escard{\'o}",
  title =        "{PCF} extended with real numbers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "79--115",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2191",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm theory);
                 C6140 (Programming languages)",
  corpsource =   "Dept. of Comput., Imperial Coll. of Sci. Technol. and
                 Med., London, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; continuous words; denotational
                 semantics; operational semantics; partial real number;
                 PCF; programming languages; real number type; real
                 numbers; type theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pelibossian:1996:LLC,
  author =       "Hratchia P{\'e}libossian",
  title =        "On the linearity of on-line computable functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "117--132",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2192",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "LITP, Paris VII Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computability; finite automata; linearity; on-line
                 computable functions",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Revol:1996:PEA,
  author =       "Nathalie Revol and Jean-Louis Roch",
  title =        "Parallel evaluation of arithmetic circuits",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "133--150",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2193",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5210 (Logic design methods); C5230 (Digital arithmetic
                 methods); C6110P (Parallel programming)",
  corpsource =   "LMC, IMAG, Grenoble, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic structures; arithmetic circuits; automatic
                 parallelization; digital arithmetic; fast VLSI; generic
                 algorithm; logic testing; parallel algorithms; parallel
                 evaluation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mikov:1996:LSA,
  author =       "Alexander I. Mikov",
  title =        "Large-scale addition of machine real numbers:
                 {Accuracy} estimates",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "151--170",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 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=1996&volume=162&issue=1&aid=2194",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. Sci., Perm State Univ., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "accuracy estimates; digital arithmetic; floating-point
                 arithmetic; large-scale addition; machine real numbers;
                 positive independent random variables; random
                 variables; real distribution interval; roundoff error",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pan:1996:PCP,
  author =       "Victor Y. Pan",
  title =        "Parallel computation of polynomial {GCD} and some
                 related parallel computations over abstract fields",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "173--223",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2233",
  acknowledgement = ack-nhfb,
  classification = "B0210 (Algebra); C1110 (Algebra); C4240C
                 (Computational complexity)",
  corpsource =   "Lehman Coll., City Univ. of New York, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Berlekamp--Massey problem; Cauchy matrix;
                 computational complexity; greatest common divisor;
                 Hankel matrices; Hankel matrix; Pade approximation;
                 polynomial matrices; polynomial matrix; structured
                 matrix; Toeplitz matrices; Toeplitz matrix; Vandermonde
                 matrix",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baker:1996:MES,
  author =       "Brenda S. Baker and Edward G. {Coffman, Jr.}",
  title =        "Mutual exclusion scheduling",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "225--243",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2234",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4170 (Differential
                 equations); C4230M (Multiprocessor interconnection);
                 C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; domain decomposition; graph
                 theory; heuristics; load-balancing; mutual exclusion
                 scheduling; NP-hard problem; optimisation; parallel
                 algorithms; partial differential equations; polynomial
                 time; processor scheduling; time intervals",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{MeyeraufderHeide:1996:ESR,
  author =       "Friedhelm {Meyer auf der Heide} and Christian
                 Scheideler and Volker Stemann",
  title =        "Exploiting storage redundancy to speed up randomized
                 shared memory simulations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "245--281",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2235",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C5440 (Multiprocessing
                 systems); C5640 (Protocols)",
  corpsource =   "Dept. of Comput. Sci., Paderborn Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "access protocols; distributed memory machines;
                 distributed memory systems; hash functions; memory
                 protocols; n-processor optical crossbar; n-processor
                 PRAM; optical interconnections; parallel access time;
                 parallel machines; random-access storage; randomized
                 shared memory simulations; redundancy; shared memory
                 systems; simple access protocol; static dictionary;
                 storage redundancy",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mayr:1996:DCA,
  author =       "Ernst W. Mayr and Ralph Werchner",
  title =        "Divide-and-conquer algorithms on the hypercube",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "283--296",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2236",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5440
                 (Multiprocessing systems); C6150J (Operating systems)",
  corpsource =   "Inst. f{\"u}r Inf., Tech. Univ. Munchen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "butterfly network; cube-connected-cycles network;
                 divide and conquer methods; divide-and-conquer
                 algorithms; hypercube; hypercube networks; resource
                 allocation; shuffle-exchange networks; unbalanced
                 distribution",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsu:1996:EMP,
  author =       "Tsan-sheng Hsu and Vijaya Ramachandran",
  title =        "Efficient massively parallel implementation of some
                 combinatorial algorithms",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "297--322",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2237",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C6110P (Parallel
                 programming); C6115 (Programming support); C6150N
                 (Distributed systems software)",
  corpsource =   "Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "code rewriting rules; combinatorial algorithms; data
                 allocation scheme; efficient massively parallel
                 implementation; graph theory; MasPar MP-1; massively
                 parallel SIMD machine; MPL language; parallel
                 algorithms; programming environments; rewriting
                 systems; sequential codes; undirected graph algorithms;
                 virtual machines; virtual processing",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Finta:1996:SUU,
  author =       "Lucian Finta and Zhen Liu and Ioannis Milis and
                 Evripidis Bampis",
  title =        "Scheduling {UET--UCT} series--parallel graphs on two
                 processors",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "323--340",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2238",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240C (Computational
                 complexity); C6150N (Distributed systems software)",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom.,
                 Sophia-Antipolis, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; graph theory; in-forests;
                 minimisation; optimal schedule; out-forests; processor
                 scheduling; quadratic algorithm; SP1 graphs; task
                 graphs; UET-UCT series-parallel graphs;
                 unit-communication-time delays",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chakrabarti:1996:RAJ,
  author =       "Soumen Chakrabarti",
  title =        "Random allocation of jobs with weights and
                 precedence",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "341--349",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2239",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C6150J (Operating
                 systems); C6150N (Distributed systems software)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "dynamic task-parallel programs; irregular
                 task-parallel programs; makespan minimisation; natural
                 lower bound; processor scheduling; random allocation;
                 resource allocation; tree searching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Garcia:1996:MPA,
  author =       "Miguel Angel Garc{\'\i}a",
  title =        "Massively parallel approximation of irregular
                 triangular meshes of arbitrary topology with smooth
                 parametric surfaces",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "2",
  pages =        "351--369",
  day =          "20",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&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=1996&volume=162&issue=2&aid=2240",
  acknowledgement = ack-nhfb,
  classification = "C4185 (Finite element analysis); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry); C5220P (Parallel architecture)",
  corpsource =   "Div. of Robotics and Artificial Intelligence,
                 Polytech. Univ. of Catalonia, Barcelona, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3D triangular meshes; arbitrary topology;
                 computational geometry; data-parallel; first order
                 geometric continuity; irregular triangular meshes; mesh
                 generation; parallel algorithms; parallel
                 approximation; parallel architectures; parallel
                 implementation; proposed surface model; smooth
                 parametric surfaces; task-farm topology",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Courcelle:1996:BNU,
  author =       "Bruno Courcelle",
  title =        "Basic notions of universal algebra for language theory
                 and graph grammars",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "1--54",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2086",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Lab. d'Inf., Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "basic notions; Boolean algebra; context-free
                 languages; equational subsets; finite graphs; finite
                 hypergraphs; finite trees; formal languages; graph
                 grammars; language theory; partially commutative words;
                 recognizable subsets; regular languages; traces; tuples
                 of words; universal algebra",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bloom:1996:FSA,
  author =       "Stephen L. Bloom and Zolt{\'a}n {\'E}sik",
  title =        "Free shuffle algebras in language varieties",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "55--98",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2171",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Comput. Sci., Stevens Inst. of Technol.,
                 Hoboken, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "formal languages; formal logic; free monoid; free
                 shuffle algebras; language varieties; regular subsets;
                 shuffle semirings",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Niwinski:1996:GC,
  author =       "Damian Niwi{\'n}ski and Igor Walukiewicz",
  title =        "Games for the $\mu$-calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "99--116",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2077",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory); C4210
                 (Formal logic)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness result; completeness theorem; formal
                 logic; game theory; infinite game; logical rules;
                 Martin's determinacy theorem; program specification;
                 propositional $\mu$-calculus; tableau",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "D. Niwinskie and I. Walukiewicz",
}

@Article{Colussi:1996:HCC,
  author =       "Livio Colussi and Laura Toniolo",
  title =        "How the character comparison order shapes the shift
                 function of on-line pattern matching algorithms",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "117--144",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2078",
  acknowledgement = ack-nhfb,
  classification = "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Dipartimento di Matematica Pura e Applicata, Padova
                 Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "character comparison order; on-line pattern matching
                 algorithms; pattern matching; pattern preprocessing;
                 shift function; string matching; text search step;
                 uniform definition",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Derencourt:1996:TWC,
  author =       "Denis Derencourt",
  title =        "A three-word code which is not prefix--suffix
                 composed",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "145--160",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2080",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130 (Data handling techniques)",
  corpsource =   "Lab. d'Inf. Fondamentale de Lille, Lille I Univ.,
                 Villeneuve d'Ascq, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "codes; finite p-s composed codes; finite prefix;
                 finite prefix-suffix composed code; p-s-composed n-word
                 code; suffix codes; three-word code",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hausen-Tropper:1996:FTA,
  author =       "E. Hausen-Tropper",
  title =        "A framework for a theory of automated learning",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "161--176",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2084",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1240 (Adaptive
                 system theory); C4210 (Formal logic); C4240C
                 (Computational complexity); C6170K (Knowledge
                 engineering techniques)",
  corpsource =   "Dept. d'Inf., Quebec Univ., Montreal, Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automated learning theory; cognitive theories;
                 computational complexity; ethological theories; formal
                 logic; homotopy; knowledge base; knowledge based
                 systems; knowledge representation; learning (artificial
                 intelligence); neurological aspects; NP-complete;
                 psychological theories; second-order logic; synaptic
                 routing; topological theory",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Beigel:1996:FCB,
  author =       "Richard Beigel and William Gasarch and Efim Kinber",
  title =        "Frequency computation and bounded queries",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "177--192",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2090",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bounded queries; coding theory; complexity;
                 computability; computational complexity; database
                 theory; frequency computation; halting problem; lower
                 bounds; query processing; upper bounds",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "R. Beigel and W. Gasarch and E. Kinber",
}

@Article{Lehr:1996:VSA,
  author =       "Siegfried Lehr and Jeffrey Shallit and John Tromp",
  title =        "On the vector space of the automatic reals",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "193--210",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2175",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Math. Inst. A, Stuttgart Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "$k$-automatic sequence; automatic reals; base-k
                 digits; deterministic automata; finite automata;
                 finite-state function; transcendental number; vector
                 space",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Levcopoulos:1996:EFI,
  author =       "Christos Levcopoulos and Ola Petersson",
  title =        "Exploiting few inversions when sorting: {Sequential}
                 and parallel algorithms",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "211--238",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2197",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)C6130 (Data
                 handling techniques); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; EREW PRAM; input sequence;
                 parallel algorithms; presortedness; sequential
                 algorithms; sorting",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gu:1996:OHA,
  author =       "Xunrang Gu and Yuzhang Zhu",
  title =        "Optimal heapsort algorithm",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "239--243",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2174",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C6120 (File organisation);
                 C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Shanghai Univ. of Sci. and
                 Technol., China",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; data structures;
                 optimal heapsort algorithm; optimal performance;
                 sorting",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vollmer:1996:RTC,
  author =       "Heribert Vollmer and Klaus W. Wagner",
  title =        "Recursion theoretic characterizations of complexity
                 classes of counting functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "245--258",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2178",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Lehrstuhl f{\"u}r Theor. Inf., Wurzburg Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic characterizations; arithmetical functions;
                 complexity classes; computational complexity; counting
                 functions; Gap-P; recursion theoretic
                 characterizations; summation; weak product",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Long:1996:NGC,
  author =       "Dongyang Long",
  title =        "Note on group codes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "259--267",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2179",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Zhongshan Univ., Guangzhou,
                 China",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "codes; diamond property; group codes; necessary and
                 sufficient conditions; star closure; strong code;
                 syntactic monoid",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "On group codes",
}

@Article{Fredholm:1996:CMP,
  author =       "Daniel Fredholm",
  title =        "Computing minimum with primitive recursion over
                 lists",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "269--276",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2184",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Dept. of Math., Stockholm Univ., Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "call-by-value evaluation order; lists; natural
                 numbers; number theory; primitive recursion; recursive
                 functions",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gilman:1996:SLI,
  author =       "Robert H. Gilman",
  title =        "A shrinking lemma for indexed languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "277--281",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2185",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Math., Stevens Inst. of Technol., Hoboken,
                 NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "formal languages; indexed languages; pumping lemma;
                 shrinking lemma",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Tsukiji:1996:SCB,
  author =       "Tatsuie Tsukiji",
  title =        "On a small class of {Boolean} sums",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "283--289",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2210",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Tokyo Inst. of Technol.,
                 Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; Boolean sums; cardinality;
                 computational complexity; monotone circuit complexity;
                 natural class",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Blanchard:1996:DBC,
  author =       "F. Blanchard and A. Maass",
  title =        "Dynamical behaviour of {Coven}'s aperiodic cellular
                 automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "291--302",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2221",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Lab. de Math. Discretes, Marseilles, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aperiodic word; cellular automata; chain transitive;
                 Coven's aperiodic cellular automata; dynamical
                 behaviour; equicontinuous points",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Malgouyres:1996:TNL,
  author =       "R{\'e}my Malgouyres",
  title =        "There is no local characterization of separating and
                 thin objects in {$Z^3$}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "303--308",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2224",
  acknowledgement = ack-nhfb,
  classification = "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition); C4260
                 (Computational geometry)",
  corpsource =   "ISMRA, Caen, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "6-adjacent; 6-connected components; computational
                 geometry; image processing; local characterization;
                 thin objects",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ziadi:1996:REL,
  author =       "Djelloul Ziadi",
  title =        "Regular expression for a language without empty word",
  journal =      j-THEOR-COMP-SCI,
  volume =       "163",
  number =       "1--2",
  pages =        "309--315",
  day =          "30",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=1996&volume=163&issue=1-2&aid=2231",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Lab. d'Inf., Rouen Univ., Mont-Saint-Aignan, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "formal language; formal languages; linear-time
                 algorithm; recursive definition; recursive functions;
                 regular expression",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carlsson:1996:HB,
  author =       "Svante Carlsson and Jingsen Chen and Christer
                 Mattsson",
  title =        "Heaps with bits",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "1--12",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2093",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Lulea Univ., Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; CRCW PRAM; CREW
                 PRAM; data structures; fast algorithm; fine heap; heap
                 operations; heap structure; heapsort; parallel
                 algorithms; parallel computation; parallel searching;
                 parallel time complexity; priority queue operations;
                 random-access storage; search problems; sorting;
                 sublogarithmic time",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Case:1996:ALH,
  author =       "John Case and Sanjay Jain and Arun Sharma",
  title =        "Anomalous learning helps succinctness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "13--28",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2095",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1240 (Adaptive
                 system theory); C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Delaware Univ.,
                 Newark, DE, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic procedure; anomalous learning;
                 characteristic functions; decision procedures; finite
                 sets; inference; infinite subclasses; learnability;
                 learning systems; recursive functions; set theory;
                 succinctness",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Harrison:1996:ACL,
  author =       "John Harrison",
  title =        "On almost cylindrical languages and the decidability
                 of the {D0L} and {PWD0L} primitivity problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "29--40",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2109",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Math., Pennsylvania State Univ., University
                 Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmically constructible context sensitive
                 language; almost cylindrical languages; almost
                 cylindrical set; context-sensitive languages; D0L
                 scheme; decidability; decidability results; formal
                 language theory; periodic D0L languages; primitive
                 words; PWD0L primitivity problems; RWD0L primitivity
                 problem; set theory; undecidability result",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sirvent:1996:RBD,
  author =       "V{\'\i}ctor F. Sirvent",
  title =        "Relationships between the dynamical systems associated
                 to the {Rauzy} substitutions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "41--57",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2111",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. de Matematicas, Univ. Simon Bolivar, Caracas,
                 Venezuela",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "dynamical systems; matrix algebra; Pisot
                 substitutions; Rauzy substitutions; set theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Picouleau:1996:WCA,
  author =       "C. Picouleau",
  title =        "Worst-case analysis of fast heuristics for packing
                 squares into a square",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "59--72",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2125",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240C (Computational
                 complexity); C4260 (Computational geometry)",
  corpsource =   "LITP-IBP, Paris VI Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bounded worst case ratio; computational complexity;
                 computational geometry; fast heuristics; heuristic
                 programming; layer by layer strategy; minimal edge;
                 minimisation; NP hard problem; relative worst case
                 ratio; set theory; squares; worst case analysis",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Middendorf:1996:TDP,
  author =       "Martin Middendorf",
  title =        "Two-dimensional partitioning problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "73--106",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2126",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C6120 (File organisation);
                 C6130 (Data handling techniques)",
  corpsource =   "Inst. f{\"u}r Angewandte Inf. und Formale
                 Beschreibungsverfahren, Karlsruhe Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "2 dimensional consecutive sets problem; complexity;
                 computational complexity; consecutive sets; scheduling;
                 set theory; storage management; storage organization;
                 string; string matching; two dimensional partitioning
                 problems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Diks:1996:RCF,
  author =       "Krzysztof Diks and Andrzej Pelc",
  title =        "Reliable computations on faulty {EREW PRAM}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "107--122",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2127",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5320G
                 (Semiconductor storage); C5470 (Performance evaluation
                 and testing); C6120 (File organisation)",
  corpsource =   "Dept. d'Inf., Quebec Univ., Montreal, Que., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; constant
                 probability; fault prone machine; fault tolerant
                 computing; faulty EREW PRAM; list ranking problem;
                 optimal safe algorithm; parallel algorithms; prefix
                 sums; probability; random independent stop failures;
                 random-access storage; reliable computations; storage
                 management",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Salomaa:1996:SEG,
  author =       "Kai Salomaa and Derick Wood and Sheng Yu",
  title =        "Structural equivalence and {ET$0$L} grammars",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "123--140",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2128",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Math., Turku Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "context sensitive grammar; context-sensitive grammars;
                 decidability; extended E0L grammars; propagating ET0L
                 grammars; structural equivalence; syntax trees; trees
                 (mathematics); undecidability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lutz:1996:CVK,
  author =       "Jack H. Lutz and Elvira Mayordomo",
  title =        "{Cook} versus {Karp-Levin}: Separating completeness
                 notions if {NP} is not small",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "141--163",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2130",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness notions; complexity; computational
                 complexity; Cook complete; decidability; decision
                 problems; Karp-Levin complete; NP; NP search problems;
                 truth-table reducibilities",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hubert:1996:PCS,
  author =       "Pascal Hubert",
  title =        "Propri{\'e}t{\'e}s combinatoires des suites
                 d{\'e}finies par le billard dans les triangles pavants.
                 ({French}) [{Combinatorial} properties of sequences
                 defined by a billiard in paved triangles]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "165--183",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2149",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Inst. de Math. de Luminy, Marseille, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "billiard; coding sequences; combinatorial properties;
                 complexity; computational complexity; computational
                 geometry; formal languages; half equilateral triangle;
                 infinite words; isosceles right angle triangle;
                 symbolic dynamics",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fill:1996:LRC,
  author =       "James Allen Fill",
  title =        "Limits and rates of convergence for the distribution
                 of search cost under the move-to-front rule",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "185--206",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2151",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4240 (Programming
                 and algorithm theory); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Math. Sci., Johns Hopkins Univ., Baltimore,
                 MD, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; asymptotic distribution;
                 computational complexity; convergence; Markov chain;
                 move-to-front rule; search cost; search problems;
                 self-organizing lists; stationarity; total variation
                 distance",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Finkel:1996:PAM,
  author =       "Alain Finkel and Isabelle Tellier",
  title =        "A polynomial algorithm for the membership problem with
                 categorial grammars",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "207--221",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2152",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "LIFAC, ENS de Cachan, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "categorial grammars; category theory; computational
                 complexity; context-free grammars; grammars; Lambek
                 Calculus; membership problem; polynomial algorithm",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DeFelice:1996:AHF,
  author =       "Clelia {De Felice}",
  title =        "An application of {Haj{\'o}s} factorizations to
                 variable-length codes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "223--252",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2164",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C4210 (Formal logic)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "codes; decidability; decidable; embedding problem;
                 finite cyclic groups; free submonoid; Hajos
                 factorizations; Schutzenberger's factorization;
                 variable-length code; variable-length codes",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moews:1996:CSG,
  author =       "David Moews",
  title =        "Coin-sliding and {Go}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "253--276",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2291",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory); C1230
                 (Artificial intelligence)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "coin-sliding game; endgame positions; game theory;
                 games of skill; Go; two-player perfect information
                 game",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tomescu:1996:AAL,
  author =       "Ioan Tomescu",
  title =        "On the asymptotic average length of a maximum common
                 subsequence for words over a finite alphabet",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "277--285",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2200",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Fac. of Math., Bucharest Univ., Romania",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asymptotic average length; asymptotic behaviour;
                 finite alphabet; formal languages; maximum common
                 subsequence; words",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1996:CSI,
  author =       "Arvind Gupta and Naomi Nishimura",
  title =        "The complexity of subgraph isomorphism for classes of
                 partial $k$-trees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "287--298",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2254",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bounded tree-width graphs; complete characterization;
                 complexity; computational complexity; connectivity
                 conditions; graph theory; NP-complete; partial
                 $k$-trees; subgraph isomorphism",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Iliopoulos:1996:WTO,
  author =       "Costas S. Iliopoulos and Kunsoo Park",
  title =        "A work-time optimal algorithm for computing all string
                 covers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "299--310",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-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=1996&volume=164&issue=1-2&aid=2255",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., King's Coll., London, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "all-covers problem; computational complexity;
                 concatenations; CRCW PRAM algorithm; optimal algorithm;
                 parallel algorithms; regularity; repetitive structures;
                 string covers; string matching; time complexity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1996:CEBb,
  author =       "Anonymous",
  title =        "Contents {EATCS Bulletin Number 59}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "311--??",
  month =        "",
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Nov 21 19:16:33 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Bidoit:1996:BTP,
  author =       "Michel Bidoit and Rolf Hennicker",
  title =        "Behavioural theories and the proof of behavioural
                 properties",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "3--55",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2242",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110F (Formal methods)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "Ecole Normale Superieure, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "behavioural properties proof; behavioural theories;
                 congruence relations; equality predicate symbol;
                 first-order logic; first-order theories; formal logic;
                 observational equalities; program verification;
                 programming theory; proof system; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Codish:1996:PIA,
  author =       "Michael Codish and Grigory Mashevitzky",
  title =        "Proving implications by algebraic approximation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "57--74",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2243",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "Dept. of Math. and Comput. Sci., Ben-Gurion Univ. of
                 the Negev, Beer-Sheva, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic approximation; algebraic specification;
                 implications proving; infinite domain; lattice
                 structures; program verification; semilattice; theorem
                 proving; universally quantified implications",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Antoy:1996:SRS,
  author =       "Sergio Antoy and Aart Middeldorp",
  title =        "A sequential reduction strategy",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "75--95",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2244",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "Dept. of Comput. Sci., Portland State Univ., OR, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "normalization proof; orthogonal term rewriting system;
                 outermost-fair-like strategy; rewriting systems;
                 sequential reduction strategy",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gramlich:1996:TCP,
  author =       "Bernhard Gramlich",
  title =        "On termination and confluence properties of disjoint
                 and constructor-sharing conditional rewrite systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "97--131",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2245",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm
                 theory)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "confluence properties; constructor-sharing conditional
                 rewrite systems; innermost termination; modularity
                 behavior; program verification; rewriting systems;
                 signature extensions; sufficient conditions;
                 termination; weak innermost termination; weak
                 termination",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Alpuente:1996:CSB,
  author =       "Mar{\'\i}a Alpuente and Moreno Falaschi and Germ{\'a}n
                 Vidal",
  title =        "A compositional semantic basis for the analysis of
                 equational {Horn} programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "133--169",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2246",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "Dept. de Sistemas Inf. y Comput., Univ. Politecnica de
                 Valencia, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract narrower; AND-compositional program analysis;
                 compositional semantic basis; computability; equational
                 Horn programs; equational theory; Horn clauses;
                 operational semantics; programming theory;
                 satisfiability",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Teusink:1996:TVC,
  author =       "Frank Teusink",
  title =        "Three-valued completion for abductive logic programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "171--200",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2247",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C6110L (Logic programming)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "CWI, Amsterdam, Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abductive logic programs; inference mechanisms;
                 Kunen's completion semantics; logic programming; proof
                 procedures; ternary logic; three-valued completion",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Miller:1996:FMC,
  author =       "Dale Miller",
  title =        "Forum: {A} multiple-conclusion specification logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "1",
  pages =        "201--232",
  day =          "30",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=1;
                 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=1996&volume=165&issue=1&aid=2248",
  acknowledgement = ack-nhfb,
  classification = "C6110J (Object-oriented programming); C6110L (Logic
                 programming); C6120 (File organisation); C6140D (High
                 level languages)",
  conflocation = "Madrid, Spain; 14-16 Sept. 1994",
  conftitle =    "Algebraic and Logic Programming. 4th International
                 Conference, ALP'94",
  corpsource =   "Dept. of Comput. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract data types; concurrency; Forum; higher-order
                 programming; lambda Prolog; linear logic refinement;
                 Linear Objects; LO; logic programming; logic
                 programming languages; Lolli; multiple-conclusion
                 specification logic",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Fraser:1996:CSS,
  author =       "Campbell Fraser",
  title =        "Consistent subsequences and supersequences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "233--246",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2079",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; NP-complete;
                 sequence inclusion; sequence noninclusion; sequences;
                 subsequences; supersequences",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maurin:1996:ECB,
  author =       "Fran{\c{c}}oise Maurin",
  title =        "Exact complexity bounds for ordinal addition",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "247--273",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2162",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. de Math., Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity bounds; computational complexity;
                 decidability; decidable; decision algorithm; finite
                 automata; ordinal addition",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pelecq:1996:AGC,
  author =       "Laurent P{\'e}lecq",
  title =        "Automorphism groups of context-free graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "275--293",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2163",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory)",
  corpsource =   "Bordeaux I Univ., Talence, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automorphism group; context-free graphs; context-free
                 languages; deterministic rooted context-free graph;
                 graph theory; graphs; pushdown automata; transition
                 graphs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Berthe:1996:FFS,
  author =       "Val{\'e}rie Berth{\'e}",
  title =        "Frequences des facteurs des suites sturmiennes.
                 ({French}) [{Frequencies} of factors of {Sturmian}
                 series]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "295--309",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2165",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Lab. de Math. Discretes, CNRS, Marseille, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational linguistics; continuous fraction;
                 Fibonacci series; frequencies of factors; graph theory;
                 sequences; series (mathematics); Sturmian series; word
                 graph",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Munro:1996:SRO,
  author =       "J. Ian Munro and Venkatesh Raman",
  title =        "Selection from read-only memory and sorting with
                 minimum data movement",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "311--323",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2166",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C6130 (Data
                 handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "average case algorithm; computational complexity; data
                 organization; read-only memory; sorting; sorting with
                 minimum data movement; time-space tradeoffs; worst case
                 algorithm",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morcrette:1996:EDF,
  author =       "Michelle Morcrette",
  title =        "Sur l'{\'e}quivalence de descriptions de figures
                 iter{\'e}es. ({French}) [{On} the equivalence of
                 descriptions of iterative figures]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "325--354",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2167",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Inst. Blaise Pascal, Paris VI Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "endomorphism; finite automata; fractal sets; fractals;
                 free semigroup; IFS; Kiesswetter curve; recurrent
                 model; recurrent set method; recurrent sets; recursive
                 functions; regular languages; von Koch curve",
  language =     "French",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kulkarni:1996:LTP,
  author =       "Sulekha R. Kulkarni and Priti Shankar",
  title =        "Linear time parsers for classes of non context free
                 languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "355--390",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2172",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Comput. Sci. and Autom., Indian Inst. of
                 Sci., Bangalore, India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "context-sensitive grammars; context-sensitive
                 languages; control grammars; deterministic context free
                 languages; non context free languages; parser
                 generator; parsers; tree adjoining grammars; two-level
                 control grammars",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Habib:1996:TSD,
  author =       "Michel Habib and Lhouari Nourine",
  title =        "Tree structure for distributive lattices and its
                 applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "391--405",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2173",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4240C
                 (Computational complexity); C6120 (File organisation)",
  corpsource =   "Univ. des Sci. et Tech. du Languedoc, Montpellier,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; data structures;
                 distributive lattices; join; lattice operations; meet;
                 reachability; space complexity; time complexity;
                 transitive closure; tree data structures; tree
                 representation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blundo:1996:FDS,
  author =       "Carlo Blundo and Antonella Cresti and Alfredo De
                 Santis and Ugo Vaccaro",
  title =        "Fully dynamic secret sharing schemes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "407--440",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2206",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130S (Data security)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "access structure; broadcast message; cryptography;
                 fully dynamic; randomness; secret sharing schemes;
                 security",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Auletta:1996:DSA,
  author =       "Vincenzo Auletta and Domenico Parente and Giuseppe
                 Persiano",
  title =        "Dynamic and static algorithms for optimal placement of
                 resources in a tree",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "441--461",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2292",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; dynamic version; identical
                 resources; linear time algorithm; minimal cost
                 placement; optimal placement of resources; resource
                 allocation; static problem; trees (mathematics);
                 weighted tree-shaped network",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dumitrescu:1996:NPG,
  author =       "Sorina Dumitrescu",
  title =        "Nonreturning {PC} grammar systems can be simulated by
                 returning systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "463--474",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2199",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Fac. of Math., Bucharest Univ., Romania",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "context-free grammars; context-free rules; generative
                 capacity; noncentralized returning parallel
                 communicating grammar systems; nonreturning parallel
                 communicating grammar systems; parallel algorithms;
                 returning-nonreturning relationship; simulation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Imai:1996:FSS,
  author =       "Katsunobu Imai and Kenichi Morita",
  title =        "Firing squad synchronization problem in reversible
                 cellular automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "475--482",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2219",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Fac. of Eng., Hiroshima Univ., Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "backward deterministic cellular automata; cellular
                 automata; computation time; computational complexity;
                 deterministic automata; finite number; firing squad
                 synchronization problem; firing state; firing states;
                 FSSP; partitioned cellular automata; reversible
                 cellular automata; synchronisation; weaker condition",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brimkov:1996:SNC,
  author =       "V. Brimkov and B. Codenotti and M. Leoncini and G.
                 Resta",
  title =        "Strong {NP-completeness} of a matrix similarity
                 problem",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "483--490",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&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=1996&volume=165&issue=2&aid=2306",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240C (Computational
                 complexity)",
  corpsource =   "Istituto di Matematica Comput., CNR, Pisa, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "block diagonal; combinatorial; computational
                 complexity; condition number; DICHOTOMY; distinct
                 diagonal elements; invariant subspaces; matrix algebra;
                 matrix similarity problem; nonsingular matrix; rational
                 entries; similarity transformation; strong
                 NP-completeness; tolerance; upper triangular matrix;
                 well scaled matrices",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramakrishna:1996:ILTa,
  author =       "Y. S. Ramakrishna and P. M. Melliar-Smith and L. E.
                 Moser and L. K. Dillon and G. Kutty",
  title =        "Interval logics and their decision procedures. Part
                 {I}: {An} interval logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "166",
  number =       "1--2",
  pages =        "1--47",
  day =          "20",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=166&issue=1-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=1996&volume=166&issue=1-2&aid=2195",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Santa Barbara, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic specification; automata theory; Buchi
                 Automata; concurrent systems specification; concurrent
                 systems verification; decidability; decidable; decision
                 procedures; diagrams; emptiness problem; FIL; finite
                 stuttering; formal logic; future interval logic;
                 instants; interval logic; intuitive graphical
                 representation; parallel algorithms; program
                 verification; propositional temporal logic; reasoning;
                 reduction; refinement-based multilevel correctness
                 proof; semantic model; temporal logic; time intervals;
                 timing diagrams",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Park:1996:AFA,
  author =       "Uchang Park",
  title =        "An algebraic formulation of the aggregative closure
                 query",
  journal =      j-THEOR-COMP-SCI,
  volume =       "166",
  number =       "1--2",
  pages =        "49--62",
  day =          "20",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=166&issue=1-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=1996&volume=166&issue=1-2&aid=2022",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Duksung Women's Univ., Seoul,
                 South Korea",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aggregate operators; aggregate product operator;
                 aggregate sum operator; aggregations; aggregative
                 closure problem; aggregative closure query; algebraic
                 formulation; computational semantics; database terms;
                 database theory; naive algorithm; path algebra; problem
                 domain; query processing; relational algebra;
                 relational databases; seminaive algorithm; subset
                 conditions; transitive closure problem; transitive
                 paths",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shen:1996:MPL,
  author =       "Enshao Shen and Qijia Tian",
  title =        "Monadic partition logics and finite automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "166",
  number =       "1--2",
  pages =        "63--81",
  day =          "20",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=166&issue=1-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=1996&volume=166&issue=1-2&aid=2054",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci., Shanghai Jiaotong Univ.,
                 China",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "expressive power; extended logic; finite automata;
                 first-order logic; formal languages; formal logic;
                 monadic partition logics; monadic partition
                 quantifiers; monadic second-order logic; semantic
                 features; specification",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoofman:1996:CMI,
  author =       "R. Hoofman",
  title =        "Comparing models of the intensional typed
                 $\lambda$-calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "166",
  number =       "1--2",
  pages =        "83--99",
  day =          "20",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=166&issue=1-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=1996&volume=166&issue=1-2&aid=2081",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math. and Comput. Sci., Amsterdam Univ.,
                 Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "intensional typed lambda calculus; lambda calculus;
                 maximal theory; minimal interpretation; powerset
                 models; type constructor; type theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Etalle:1996:TCM,
  author =       "Sandro Etalle and Maurizio Gabbrielli",
  title =        "Transformations of {CLP} modules",
  journal =      j-THEOR-COMP-SCI,
  volume =       "166",
  number =       "1--2",
  pages =        "101--146",
  day =          "20",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=166&issue=1-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=1996&volume=166&issue=1-2&aid=2089",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6110L (Logic
                 programming)",
  corpsource =   "D.I.S.I., Genova Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "answer constraints; applicability conditions; CLP
                 module transformation; CLP programs; computational
                 behaviour; constraint handling; constraint logic
                 programming; constraint replacement; correctness; least
                 model semantics; nonmodular system; pure logic
                 programs; restrictive conditions; resultants semantics;
                 splitting; transformation system; transformed modules;
                 trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Fouks:1996:MRA,
  author =       "Jean-D{\'e}nis Fouks and Jean-Claude Spehner",
  title =        "Meta-resolution: {An} algorithmic formalisation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "166",
  number =       "1--2",
  pages =        "147--172",
  day =          "20",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:18 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=166&issue=1-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=1996&volume=166&issue=1-2&aid=2096",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C6120 (File organisation)",
  corpsource =   "IRCOM-SIC, Poitiers Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithmic formalisation; computability;
                 computational complexity; data structure; data
                 structures; meta argument; meta resolution; minimal
                 contradictory subformula; SAT; satisfiability
                 condition; Tseitin formulae",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Demri:1996:LAD,
  author =       "St{\'e}phane Demri and Ewa Orlowska",
  title =        "Logical analysis of demonic nondeterministic
                 programs",
  journal =      j-