%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.24",
%%%     date            = "06 March 2014",
%%%     time            = "08:04:16 MST",
%%%     filename        = "infoproc1990.bib",
%%%     address         = "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        = "07298 70372 286608 3057907",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX; Information Processing
%%%                        Letters",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of the journal
%%%                        Information Processing Letters (CODEN IFPLAT,
%%%                        ISSN 0020-0190), published by
%%%                        Elsevier/North-Holland, covering
%%%                        (incompletely) the decade 1990--1999.
%%%
%%%                        At version 1.26, the original infoproc.bib
%%%                        file was approaching 4000 entries, so it was
%%%                        split into decade-specific files, to avoid
%%%                        hitting internal limits of BibTeX and TeX.
%%%
%%%                        Entries with addenda, comments, corrigenda,
%%%                        errata, letters to the editor, and remarks on
%%%                        earlier articles contain cross references to
%%%                        entries for those articles, which are
%%%                        included here for completeness, even if they
%%%                        are duplicated in another of the
%%%                        decade-specific bibliographies for this
%%%                        journal.
%%%
%%%                        This journal now has a World-Wide Web site at
%%%
%%%                            http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/
%%%
%%%                        with tables of contents from 1994 (Volume
%%%                        49) to date.  All of the data at that site
%%%                        for volumes 49 onward has been merged into
%%%                        this file.
%%%
%%%                        Abstracts and full text of articles are
%%%                        available electronically to qualified
%%%                        subscribers, which includes members of
%%%                        organizations with institutional
%%%                        subscriptions; most large universities should
%%%                        fall in this group.  For details, visit
%%%
%%%                            http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/?menu=cont&label=table
%%%
%%%                        At version 2.24, the year coverage looked
%%%                        like this:
%%%
%%%                             1983 (   1)    1993 ( 208)    2003 (   0)
%%%                             1984 (   0)    1994 ( 221)    2004 (   0)
%%%                             1985 (   0)    1995 ( 239)    2005 (   0)
%%%                             1986 (   0)    1996 ( 222)    2006 (   0)
%%%                             1987 (   1)    1997 ( 201)    2007 (   0)
%%%                             1988 (   1)    1998 ( 216)    2008 (   0)
%%%                             1989 (   3)    1999 ( 169)    2009 (   0)
%%%                             1990 ( 191)    2000 (   2)    2010 (   0)
%%%                             1991 ( 232)    2001 (   0)    2011 (   1)
%%%                             1992 ( 236)    2002 (   1)
%%%
%%%                             Article:       2145
%%%
%%%                             Total entries: 2145
%%%
%%%                        The initial draft was extracted from the ACM
%%%                        Computing Archive CD ROM for the 1980s, with
%%%                        manual corrections and additions.
%%%
%%%                        At version 1.09, this bibliography was
%%%                        extended with 854 new entries derived from
%%%                        the OCLC Contents1st database, after
%%%                        conversion to BibTeX format, and extensive
%%%                        editing and correction.  Regrettably, that
%%%                        database does not record final page numbers
%%%                        of journal articles, so were are many page
%%%                        ranges of the form 123--?? in this
%%%                        bibliography, until they were corrected
%%%                        with data from other databases, and from
%%%                        manual checking of articles in the original
%%%                        journal issues.  At version 1.17, another
%%%                        1044 entries were added from a search in
%%%                        the Compendex databases (1970--1996), and
%%%                        about 1000 others were updated with
%%%                        additional information.
%%%
%%%                        An additional 470 new entries were added at
%%%                        version 1.22 from the MathSciNet database,
%%%                        and most of the missing final page numbers in
%%%                        the other entries were supplied from
%%%                        MathSciNet data.
%%%
%%%                        At version 1.25, another 134 new entries were
%%%                        added from a combination of data from the
%%%                        journal Web site, and from other databases.
%%%
%%%                        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, 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{
  "\ifx \cedla \undefined \let \cedla = \c \fi"
  #
  "\ifx \cftil \undefined \def \cftil#1{\~#1} \fi"
  #
  "\ifx \cprime \undefined \def \cprime {$\mathsurround=0pt '$}\fi"
  #
  "\ifx \Dbar \undefined \def \Dbar {\leavevmode\raise0.2ex\hbox{--}\kern-0.5emD} \fi"
  #
  "\ifx \k \undefined \let \k = \c \fi"
  #
  "\ifx \lfhook \undefined \let \lfhook = \relax \fi"
  #
  "\ifx \mathbb \undefined \def \mathbb #1{{\bf #1}}\fi"
  #
  "\ifx \polhk \undefined \let \polhk = \k \fi"
  #
  "\ifx \soft \undefined \def \soft{'} \fi"
  #
  "\hyphenation{
                Ishi-zu-ka
                Kath-ryn
                Ker-n-i-ghan
                Krom-mes
                Lar-ra-bee
                Man-o-har
                Mehl-horn
                Mee-nak-shi
                Ne-va-lai-nen
                Pat-rick
                Port-able
                Post-Script
                Pren-tice
                Rich-ard
                Richt-er
                Ro-bert
                Schra-der
                Schwartz-bach
                Sha-mos
                Sit-ha-ra-ma
                Spring-er
                Ta-ka-na-mi
                The-o-dore
                Uz-ga-lis
                Vong-sat-horn
               } "
}

%%% ====================================================================
%%% 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-INFO-PROC-LETT        = "Information Processing Letters"}

%%% ====================================================================
%%% Bibliography entries.
%%% The University of Utah Marriott Library has volumes 8..60
%%% (1979--1996), so I have been unable to check questions about entries
%%% for volumes 1..7.

@Article{Frederickson:1983:SUT,
  author =       "Greg N. Frederickson",
  title =        "Scheduling Unit-Time Tasks with Integer Release Times
                 and Deadlines",
  journal =      j-INFO-PROC-LETT,
  volume =       "16",
  number =       "4",
  pages =        "171--173",
  day =          "13",
  month =        may,
  year =         "1983",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68C15 (68C25 90B35)",
  MRnumber =     "84m:68030",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See note \cite{Steiner:1993:NSU}.",
  acknowledgement = ack-nhfb,
  classification = "913; C6150J (Operating systems)",
  corpsource =   "Dept. of Computer Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "deadlines; integer release times; off-line minimum
                 problem; operating systems (computers); scheduling;
                 unit-time tasks",
  treatment =    "P Practical",
}

@Article{Verjus:1987:PDA,
  author =       "J. Pierre Verjus",
  title =        "On the proof of a distributed algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "25",
  number =       "3",
  pages =        "145--147",
  day =          "29",
  month =        may,
  year =         "1987",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See comments
                 \cite{VanGasteren:1990:CPD,Pettersson:1991:LEC}.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Inst de Recherche en Informatique et
                 Syst{\`e}mes Al{\'e}atoires, Rennes, Fr",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. de Recherche en Inf. et Syst. Al{\'e}atoires,
                 Rennes, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "ad absurdum reasoning; algorithm theory; Algorithms;
                 algorithms; computer programming; computer systems,
                 digital --- Distributed; correctness proof; distributed
                 algorithm; distributed processing; elementary automata;
                 invariance property; reductio ad absurdum; termination
                 detection; theorem proving; theory; verification",
  pubcountry =   "Netherlands A02",
  subject =      "C.2.1 Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Architecture
                 and Design, Distributed networks \\ F.2.2 Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Complexity of proof procedures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mehlhorn:1988:FAA,
  author =       "Kurt Mehlhorn",
  title =        "A faster approximation algorithm for the {Steiner}
                 problem in graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "27",
  number =       "3",
  pages =        "125--128",
  day =          "25",
  month =        mar,
  year =         "1988",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C05 68R10)",
  MRnumber =     "89d:68031",
  MRreviewer =   "Lawrence V. Saxton",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See note \cite{Floren:1991:NFA}.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Univ des Saarlandes, Saarbr{\"u}cken, West Ger",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Saarlandes Univ., Saarbrucken, West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithms; approximation algorithm; computational
                 complexity; computer programming --- Algorithms;
                 connected undirected distance graph; Graph Theory;
                 graph theory; mathematical techniques; Steiner minimal
                 tree; steiner problem; Steiner tree; theory; trees
                 (mathematics); undirected distance graph",
  pubcountry =   "Netherlands A03",
  subject =      "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation \\ G.2.m Mathematics of Computing,
                 DISCRETE MATHEMATICS, Miscellaneous",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Raymond:1989:DAM,
  author =       "Kerry Raymond",
  title =        "A distributed algorithm for multiple entries to a
                 critical section",
  journal =      j-INFO-PROC-LETT,
  volume =       "30",
  number =       "4",
  pages =        "189--193",
  day =          "27",
  month =        feb,
  year =         "1989",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See note \cite{Satyanarayanan:1992:NRT}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Queensland",
  affiliationaddress = "St. Lucia, Aust",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Queensland Univ., St. Lucia,
                 Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; algorithms; Algorithms; Computer
                 Programming; Computer Systems, Digital--Distributed;
                 critical section; Critical Sections; distributed
                 algorithm; Distributed Algorithms; distributed mutual
                 exclusion; distributed processing; Distributed
                 Programming; multiple entries; Mutual Exclusion;
                 performance; synchronisation; theory; verification",
  subject =      "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous
                 \\ D.4.7 Software, OPERATING SYSTEMS, Organization and
                 Design, Distributed systems \\ D.4.1 Software,
                 OPERATING SYSTEMS, Process Management,
                 Synchronization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kochol:1989:EMC,
  author =       "Martin Kochol",
  title =        "Efficient monotone circuits for threshold functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "32",
  number =       "3",
  pages =        "121--122",
  day =          "24",
  month =        aug,
  year =         "1989",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "90h:68061",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See comment \cite{Dunne:1990:CKP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Mathematical Inst SAV",
  affiliationaddress = "Bratislava, Czech",
  classification = "721; 723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Math. Inst. SAV, Bratislava, Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Ajtai; Automata Theory--Computability and
                 Decidability; Circuit Complexity; computational
                 complexity; Computer Metatheory; Computer Systems
                 Programming--Sorting; depth; efficient sorting network;
                 Komlos; monotone circuits; size; sorting; Szemeredi;
                 Threshold Functions; threshold functions; Threshold
                 Logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Makinen:1989:SIP,
  author =       "Erkki M{\"a}kinen",
  title =        "On the subtree isomorphism problem for ordered trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "32",
  number =       "5",
  pages =        "271--273",
  day =          "22",
  month =        sep,
  year =         "1989",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C05 68P05 68Q25)",
  MRnumber =     "90k:68139",
  MRreviewer =   "Fabrizio Luccio",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also comments \cite{Grossi:1991:FCS}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tampere",
  affiliationaddress = "Tampere, Finl",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Tampere Univ., Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; algorithms; Combinatorial
                 Mathematics; Mathematical Techniques; Ordered Trees;
                 ordered trees; Pattern Recognition; String Pattern
                 Matching; string pattern matching; subtree isomorphism
                 problem; theory; tree encoding; Tree Isomorphism; trees
                 (mathematics); verification; Zaks Sequence",
  subject =      "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory, Trees \\ F.2.2 Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Pattern
                 matching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crescenzi:1990:RCE,
  author =       "P. Crescenzi and R. Silvestri",
  title =        "Relative complexity of evaluating the optimum cost and
                 constructing the optimum for maximization problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "221--226",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Roma `La Sapienza'",
  affiliationaddress = "Rome, Italy",
  classification = "723; 921; C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Matematica, Rome Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer
                 Metatheory--Computability and Decidability; decision
                 problems; honest function; language recognition
                 problems; Many-One Reducibility; Maximization Problems;
                 maximization problems; NP; NP Completeness;
                 optimisation; Optimization; optimum cost; polynomial
                 time weakly invertible; relative complexity; Turing
                 Reducibility; Turing reducibility",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Suzuki:1990:LAB,
  author =       "Hitoshi Suzuki and Naomi Takahashi and Takao
                 Nishizeki",
  title =        "A linear algorithm for bipartition of biconnected
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "227--231",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tohoku Univ",
  affiliationaddress = "Sendai, Jpn",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Commun., Fac. of Eng., Tohoku Univ.,
                 Sendai, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Biconnected Graphs;
                 biconnected graphs; Bipartition; bipartition; Computer
                 Programming; depth first search; disjoint connected
                 subgraphs; Graph Partitioning; graph theory; linear
                 algorithm; Mathematical Techniques--Graph Theory;
                 specified vertex",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Han:1990:TLB,
  author =       "Yijie Han and Yoshihide Igarashi",
  title =        "Time lower bounds for sorting on multi-dimensional
                 mesh-connected processor arrays",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "233--238",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Kentucky",
  affiliationaddress = "Lexington, KY, USA",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; chain argument; Computational
                 Complexity; Computer Metatheory--Computability and
                 Decidability; Computer Systems Programming; Computer
                 Systems, Digital--Parallel Processing; computing time;
                 indexing; indexing schemes; lower bound; Lower Bounds;
                 Mesh Connected Processor Arrays; n*n mesh-connected
                 model; nontrivial lower bounds; parallel algorithms;
                 processor arrays; Sorting; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kamper:1990:RRD,
  author =       "J{\"u}rgen K{\"a}mper",
  title =        "A result relating disjunctive self-reducibility to
                 {$P$}-immunity",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "239--242",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Oldenburg",
  affiliationaddress = "Oldenburg, West Ger",
  classification = "721; 723; C4240 (Programming and algorithm theory)",
  corpsource =   "Fachbereich Inf., Oldenburg Univ., West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; complexity theory; computational
                 complexity; Computational Complexity; Computer
                 Metatheory--Computability and Decidability; disjunctive
                 self-reducibility; Formal Languages; languages;
                 P-immunity; P-Immunity; P-NP-problem; polynomial time;
                 Self Reducibility; strong separations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kannan:1990:FHT,
  author =       "C. S. Kannan and Henry Y. H. Chuang",
  title =        "Fast {Hough} transform on a mesh connected processor
                 array",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "243--248",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pittsburgh",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C5260B (Computer vision and picture processing)",
  corpsource =   "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer
                 Programming--Algorithms; Computer Systems,
                 Digital--Parallel Processing; computerised picture
                 processing; edge pixels; Fast Hough Transform; Hough
                 transform; Image Pattern Analysis; Image Processing;
                 input data; low level image processing; Mathematical
                 Transformations; mesh connected processor array; Mesh
                 Connected Processor Arrays; O(n) time; Parallel
                 Algorithms; parallel algorithms; torus processor array;
                 x-y coordinates",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Boxer:1990:CIPa,
  author =       "Laurence Boxer and Russ Miller",
  title =        "Common intersections of polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "249--254",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See corrigenda \cite{Boxer:1990:CIPb}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Niagara Univ",
  affiliationaddress = "Niagara, NY, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput., Niagara Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; common intersection; Common Intersection
                 Problem; computational complexity; computational
                 geometry; Computational Geometry; Computer Programming;
                 Computer Systems, Digital--Parallel Processing;
                 Concurrent Read Exclusive Write; CREW PRAM; crew pram;
                 hypercube; Mathematical Techniques--Geometry; mesh
                 computers; parallel algorithms; Parallel Algorithms;
                 parallel implementations; parallel machines; Parallel
                 Random Access Machines; serial implementation;
                 vertically convex planar polygons",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Agrawal:1990:ELS,
  author =       "Divyakant Agrawal and Amr {El Abbadi}",
  title =        "Exploiting logical structures in replicated
                 databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "255--260",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "723; C4250 (Database theory); C6160B (Distributed
                 DBMS)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "data integrity; Database Systems; database theory;
                 Distributed; distributed database; distributed
                 databases; distributed mutual exclusion; fault tolerant
                 computing; Fault Tolerant Databases; logical
                 structures; Mutual Exclusion; Replica Control; replica
                 control protocols; Replicated Databases; replicated
                 databases; structural information; synchronisation;
                 synchronization cost",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shoup:1990:DCF,
  author =       "Victor Shoup",
  title =        "On the deterministic complexity of factoring
                 polynomials over finite fields",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "261--267",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin-Madison",
  affiliationaddress = "Madison, WI, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; average-case running time; computational
                 complexity; Computer Programming; Deterministic
                 Complexity; deterministic complexity; factoring
                 polynomials; Factorization; Finite Fields; finite
                 fields; Irreducible Polynomials; Mathematical
                 Techniques--Polynomials; polynomials; worst-case
                 running time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anderson:1990:SRP,
  author =       "Richard J. Anderson and Gary L. Miller",
  title =        "A simple randomized parallel algorithm for
                 list-ranking",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "5",
  pages =        "269--273",
  day =          "10",
  month =        jan,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington",
  affiliationaddress = "Seattle, WA, USA",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Washington Univ., Seattle, WA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; Computer Systems,
                 Digital--Parallel Processing; EREW PRAM; Exclusive Read
                 Exclusive Write; list-ranking; optimal algorithms;
                 Parallel Algorithms; parallel algorithms; Parallel
                 Random Access Machines; randomized parallel algorithm;
                 sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bertossi:1990:PAC,
  author =       "Alan A. Bertossi and Sabrina Moretti",
  title =        "Parallel algorithms on circular-arc graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "275--281",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Analysis of Algorithms; circular-arc graphs;
                 computational complexity; Computer Systems, Digital;
                 Discrete Mathematics; Graph Algorithms; graph theory;
                 Mathematical Techniques--Combinatorial Mathematics;
                 maximum weighted clique; maximum weighted independent
                 set; minimum weighted dominating set; minimum weighted
                 total dominating set; parallel algorithms; parallel
                 computers; Parallel Processing; set theory; shared
                 memory model; SMM",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dillencourt:1990:RDT,
  author =       "Michael B. Dillencourt",
  title =        "Realizability of {Delaunay} triangulations",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "283--287",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4290 (Other computer
                 theory)",
  corpsource =   "Dept. of Inf. and Comput. Sci., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial Mathematics; Computational Geometry;
                 computational geometry; Computers,
                 Digital--Computational Methods; Delaunay Triangulation;
                 Delaunay triangulations; inner triangulation;
                 Mathematical Techniques; realizability; simple polygon;
                 Voronoi Diagram",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gunther:1990:PIE,
  author =       "Neil J. Gunther and John G. Shaw",
  title =        "Path integral evaluation of {ALOHA} network
                 transients",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "289--295",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Xerox PARC",
  affiliationaddress = "Palo Alto, CA, USA",
  classification = "718; 723; 921; 922; B0220 (Analysis); B0290R
                 (Integral equations); B6150 (Communication system
                 theory); B6210L (Computer communications); C1120
                 (Analysis); C4180 (Integral equations); C5620 (Computer
                 networks and techniques)",
  corpsource =   "Xerox PARC, Palo Alto, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "aloha Computer Network; ALOHA network models; ALOHA
                 network transients; Computer Networks; computer
                 networks; Diffusion Approximation; expected first
                 passage times; Feynman path-integral; integral
                 equations; large transient behavior; Markov Chains;
                 Mathematical Techniques--Numerical Methods;
                 multi-access systems; numerical analysis; path integral
                 calculations; path integral evaluation; Performance;
                 Performance Modeling; Probability--Random Processes;
                 protocols; self-consistent; simple diffusion
                 approximation; Weiner action",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Altman:1990:SRS,
  author =       "Tom Altman and Bogdan S. Chlebus",
  title =        "Sorting roughly sorted sequences in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "297--300",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Kentucky",
  affiliationaddress = "Lexington, KY, USA",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Analysis of Algorithms; Complexity of Algorithms;
                 computational complexity; Computer Systems Programming;
                 Computer Systems, Digital--Parallel Processing;
                 concurrent-read concurrent-write; CRCW PRAM; input
                 sequence; keys; max-prefix problem; maximum; parallel
                 algorithms; PRAM; prefix; presortedness; radius;
                 roughly sorted sequences; Sorting; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Olariu:1990:GCS,
  author =       "Stephan Olariu",
  title =        "A generalization of {Chvatal}'s star-cutset lemma",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "301--303",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Chromatic Number; chromatic number; Chvatal
                 star-cutset lemma; Computer Metatheory--Programming
                 Theory; Cutsets; Graph Theory; graph theory; induced
                 subgraphs; Mathematical Techniques; minimal imperfect
                 graphs; pairwise adjacent vertices; Perfect Graphs;
                 perfect graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hagerup:1990:GTC,
  author =       "Torben Hagerup and Christine R{\"u}b",
  title =        "A guided tour of {Chernoff} bounds",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "305--308",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, West Ger",
  classification = "921; 922; C1140Z (Other and miscellaneous)",
  corpsource =   "Fachbereich Inf., Univ. des Saarlandes, Saarbrucken,
                 West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bernoulli Trials; Chernoff Bounds; Chernoff bounds;
                 heads; independent coin tossings; inequalities;
                 Mathematical Techniques--Algorithms; Probabilistic
                 Analysis; Probability; probability; Random Processes;
                 statistical analysis; strong upper bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Galil:1990:LAC,
  author =       "Zvi Galil and Kunsoo Park",
  title =        "A linear-time algorithm for concave one-dimensional
                 dynamic programming",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "309--311",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Columbia Univ",
  affiliationaddress = "New York, NY, USA",
  classification = "921; C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Columbia Univ., New York, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Complexity of Algorithms; computational complexity;
                 concave one-dimensional dynamic programming; dynamic
                 programming; linear-time algorithm; Mathematical
                 Programming, Dynamic; Mathematical
                 Techniques--Algorithms; Quadrangle Inequality;
                 real-valued function; totally monotone matrix",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hingston:1990:DJA,
  author =       "Philips Hingston and Ross Wilkinson",
  title =        "A distributed join algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "313--317",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Royal Melbourne Inst of Technology",
  affiliationaddress = "Melbourne, Aust",
  classification = "723; C4250 (Database theory); C6160B (Distributed
                 DBMS); C6160D (Relational DBMS)",
  corpsource =   "Dept. of Comput. Sci., R. Melbourne Inst. of Technol.,
                 Melbourne, Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming--Algorithms; Database Systems;
                 database theory; Distributed; distributed databases;
                 distributed join algorithm; distributed relational
                 databases; horizontal partition; Relational Databases;
                 relational databases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Khuller:1990:TCP,
  author =       "Samir Khuller and Joseph S. B. Mitchell",
  title =        "On a triangle counting problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "319--321",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; Combinatorial Mathematics; computational
                 complexity; Computational Geometry; computational
                 geometry; Computer Programming--Algorithms; corners;
                 Mathematical Techniques; plane; points; Range Query;
                 set; triangle counting problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Knapp:1990:PTP,
  author =       "Edgar Knapp",
  title =        "A predicate transformer for progress",
  journal =      j-INFO-PROC-LETT,
  volume =       "33",
  number =       "6",
  pages =        "323--330",
  day =          "10",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary relation; certain closure operation; Computer
                 Metatheory--Programming Theory; Computer Systems
                 Programming; concurrent program semantics; Concurrent
                 Programming; equivalent; expressive power; junctivity
                 properties; leads-to; monotonic; Multiprocessing
                 Programs; Predicate Transformer; predicate transformer;
                 program state; programming theory; progress properties;
                 Progress Specification; strict; weakest predicate;
                 wlt",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kurihara:1990:MTR,
  author =       "Masahito Kurihara and Ikuo Kaji",
  title =        "Modular term rewriting systems and the termination",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "1--4",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hokkaido Univ",
  affiliationaddress = "Sapporo, Jpn",
  classification = "721; 723; C4210 (Formal logic)",
  corpsource =   "Dept. of Inf. Eng., Hokkaido Univ., Sapporo, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory--Formal Languages; Computer
                 Metatheory; Modular Reduction; modular reduction;
                 modular term rewriting; rewriting systems; Term
                 Rewriting Systems; Termination; termination",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ahuja:1990:FPA,
  author =       "Mohan Ahuja",
  title =        "Flush primitives for asynchronous distributed
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "5--12",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "722; 723; C5620 (Computer networks and techniques);
                 C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Asynchronous Distributed Systems; asynchronous
                 distributed systems; backward-flush; channel
                 primitives; Computer Programming--Algorithms; Computer
                 Systems, Digital; concurrency; design; Distributed;
                 Distributed Algorithms; distributed algorithms;
                 distributed processing; F-channel; Flush Primitives;
                 Flush primitives; forward-flush; global snapshots;
                 multiprocessing programs; proofs of correctness;
                 two-way-flush",
  treatment =    "P Practical",
}

@Article{Simonson:1990:RCP,
  author =       "Shai Simonson",
  title =        "Routing with critical paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "13--19",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Chicago",
  affiliationaddress = "Chicago, IL, USA",
  classification = "713; 921; B1130B (Computer-aided circuit analysis
                 and design); B2570 (Semiconductor integrated circuits);
                 C7410D (Electronic engineering)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Illinois
                 Univ., Chicago, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bound; circuit layout; circuit layout CAD; Critical
                 Paths; fixed bounds; Graph Embedding; Graph Theory;
                 graph theory; Integrated Circuits, VLSI--layout;
                 Mathematical Techniques; path lengths; polynomial time;
                 Routing; simple paths; undirected graph; VLSI; VLSI
                 Layout",
  treatment =    "P Practical",
}

@Article{Andersson:1990:CTT,
  author =       "Arne Andersson and Svante Carlsson",
  title =        "Construction of a tree from its traversals in optimal
                 time and space",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "21--25",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lund Univ",
  affiliationaddress = "Lund, Swed",
  classification = "723; 921; C1160 (Combinatorial mathematics); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary search tree; Binary Search Trees; Computer
                 Programming--Algorithms; construction algorithm; Data
                 Processing--Data Structures; data structures; linear
                 time; Mathematical Techniques; optimal time; space;
                 traversals; Tree Construction; tree construction; Tree
                 Traversal; Trees; trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Jacob:1990:SDH,
  author =       "Jeremy Jacob",
  title =        "Separability and the detection of hidden channels",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "27--29",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Communicating Sequential Processes; Computer
                 Metatheory; Computer Security; Computer Systems,
                 Digital; Cutting Channels; cutting channels;
                 Distributed; Hidden Channels; hidden channels
                 detection; program verification; Separability;
                 separability; unknown channels",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Martinez:1990:CRC,
  author =       "Alejandro D. Martinez and Rosita Wachenchauzer and
                 Rafael D. Lins",
  title =        "Cyclic reference counting with local mark-scan",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "31--35",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Escuela Superior Latinoamericana de Informatica",
  affiliationaddress = "Buenos Aires, Argent",
  classification = "723; C6120 (File organisation)",
  corpsource =   "Escuela Superior Latinoamericana de Inf., Buenos
                 Aires, Argentina",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Operating Systems; Computer
                 Programming; correctness; cyclic reference counting;
                 Functional Programming; Garbage Collection Algorithms;
                 general garbage collection; local mark-scan; storage
                 management",
  treatment =    "P Practical",
}

@Article{Murphy:1990:FNN,
  author =       "O. J. Murphy and S. M. Selkow",
  title =        "Finding nearest neighbors with {Voronoi}
                 tessellations",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "37--41",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Vermont",
  affiliationaddress = "Burlington, VT, USA",
  classification = "723; 903; C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci. and Electr. Eng., Vermont Univ.,
                 Burlington, VT, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "$k$-dimensional space; Data Processing--Data
                 Structures; data structures; expected constant time;
                 file; Information Retrieval; Information Science; Multi
                 Key Searching; nearest neighbors; Nearest Neighbors;
                 Voronoi tessellations; Voronoi Tessellations",
  treatment =    "P Practical",
}

@Article{Purdy:1990:ATC,
  author =       "Carla Neaderhouser Purdy and George B. Purdy",
  title =        "The area-time complexity of the greatest common
                 divisor problem: a lower bound",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "43--46",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Cincinnati",
  affiliationaddress = "Cincinnati, OH, USA",
  classification = "713; 723; C4240 (Programming and algorithm theory);
                 C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. Sci., Cincinnati Univ., OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "area-time bounds; area-time complexity; Area-Time
                 Complexity; computational complexity; Computer
                 Metatheory--Computability and Decidability; Computer
                 Programming--Algorithms; digital arithmetic; Greatest
                 Common Divisor; greatest common divisor problem;
                 information-flow barriers; Integer Arithmetic;
                 Integrated Circuits, VLSI; lower bound; Lower Bounds;
                 Mathematical Models; n-bit binary integers; systolic
                 binary GCD chip; VLSI chip",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Leung:1990:PSM,
  author =       "Joseph Y.-T. Leung and Gilbert H. Young",
  title =        "Preemptive scheduling to minimize mean weighted flow
                 time",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "47--50",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  classification = "722; 723; 913; C1180 (Optimisation techniques);
                 C1290 (Applications of systems theory)",
  corpsource =   "Comput. Sci. Program, Texas Univ., Dallas, Richardson,
                 TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems, Digital; equal-length tasks; Mean
                 Weighted Flow Time; mean weighted flow time
                 minimisation; minimisation; NP Completeness; NP
                 Hardness; NP-hard; Parallel Processing; Preemptive
                 Scheduling; preemptive scheduling; Scheduling;
                 scheduling",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Morrison:1990:CBM,
  author =       "R. Morrison and M. P. Atkinson and A. L. Brown and A.
                 Dearle",
  title =        "On the classification of binding mechanisms",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "1",
  pages =        "51--55",
  day =          "22",
  month =        feb,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of St. Andrews",
  affiliationaddress = "St Andrews, Scotl",
  classification = "723; C6120 (File organisation); C6150J (Operating
                 systems); C6160 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., St. Andrews Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binding Mechanisms; binding mechanisms;
                 classification; Computer Operating Systems; Computer
                 Programming Languages; data base management systems;
                 database management systems; Database Systems; file
                 organisation; file systems; operating systems;
                 operating systems (computers); persistent information
                 space architecture; subsystems composing",
  treatment =    "P Practical",
}

@Article{Ntafos:1990:RRP,
  author =       "Simeon Ntafos",
  title =        "The robber route problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "59--63",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Comput. Sci. Program, Texas Univ., Dallas, Richardson,
                 TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "boundary; complexity; computational complexity;
                 Computational Geometry; computational geometry;
                 Computer Metatheory--Computability and Decidability;
                 Computer Programming--Algorithms; edges; Geometric
                 Algorithms; Geometry; Mathematical Techniques;
                 necessary and sufficient conditions; Path Planning;
                 point; polygon; Robber Route Problem; robber route
                 problem; set; shortest route; sights; threats; watchman
                 route problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dey:1990:LAT,
  author =       "Pradip Dey and Barrett R. Bryant and Tadao Takaoka",
  title =        "Lexical ambiguity in tree adjoining grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "65--69",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Alabama at Birmingham",
  affiliationaddress = "Birmingham, AL, USA",
  classification = "721; 723; 921; C4210 (Formal logic); C4240
                 (Programming and algorithm theory); C4290 (Other
                 computer theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Alabama Univ.,
                 Birmingham, AL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; computational complexity;
                 computational linguistics; computationally efficient;
                 computationally intractable; Computer
                 Programming--Algorithms; Grammars; grammars; Lexical
                 Ambiguity; lexical ambiguity; Mathematical
                 Techniques--Trees; Natural Language Parsing; Parsing;
                 Syntactic Analysis; Tree Adjoining Grammars; tree
                 adjoining grammars",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wee:1990:ARN,
  author =       "Young C. Wee and Seth Chaiken and Dan E. Willard",
  title =        "On the angle restricted nearest neighbor problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "71--76",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York at Albany",
  affiliationaddress = "Albany, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; all pairs angle restricted nearest
                 neighbors problem; Angle Restricted Neighbors Problem;
                 computational complexity; computational geometry;
                 Computer Programming; divide-and conquer algorithm;
                 Mathematical Techniques--Trees; metric; Monotone Matrix
                 Searching; Nearest Neighbor Problem; plane; Search
                 Methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sen:1990:FAM,
  author =       "Sandeep Sen",
  title =        "Finding an approximate median with high probability in
                 constant parallel time",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "77--80",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Duke Univ",
  affiliationaddress = "Durham, NC, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Analysis of Algorithms;
                 Approximate Median; approximate median; Computational
                 Complexity; Computer Metatheory--Computability and
                 Decidability; Computer Programming; Computer Systems,
                 Digital--Parallel Processing; constant parallel time;
                 CRCW PRAM; CRCW PRAM model; Mathematical
                 Techniques--Combinatorial Mathematics; Parallel
                 Algorithms; probability; rank; totally ordered set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cook:1990:FCL,
  author =       "Stephen Cook and Toniann Pitassi",
  title =        "A feasibly constructive lower bound for resolution
                 proofs",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "81--85",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto",
  affiliationaddress = "Toronto, Ont, Can",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "candidate resolution proof; Computer Metatheory;
                 Computer Programming--Algorithms; correctness proof;
                 counting arguments; lower bound; Lower Bounds; mistake;
                 polynomial time greedy algorithm; programming theory;
                 Resolution Proofs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Laumond:1990:CPT,
  author =       "Jean-Paul Laumond",
  title =        "Connectivity of plane triangulations",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "87--96",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "LAAS\slash CNRS",
  affiliationaddress = "Toulouse, Fr",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "LAAS/CNRS, Toulouse, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2-step linear process; 3-connectivity; 4-connected
                 planar graphs; 4-connectivity test; 5-connectivity;
                 articulation k-sets; circuits; computational
                 complexity; Computational Geometry; computational
                 geometry; Computer Programming--Algorithms;
                 Connectivity; faces; Graph Theory; graph theory;
                 Hamiltonian circuit problem; Hamiltonian Circuits;
                 k-connected triangulation; Linear Algorithms; linear
                 algorithms; Mathematical Techniques; Planar Graphs;
                 Plane Triangulations; plane triangulations; sets of
                 articulation; subgraph listing algorithms; testing;
                 topological characterization; topological planar
                 graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Olariu:1990:CTG,
  author =       "Stephan Olariu",
  title =        "On the closure of triangle-free graphs under
                 substitution",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "97--101",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bipartite graphs; closure; computational complexity;
                 Computer Programming--Algorithms; forbidden
                 configurations; Graph Theory; graph theory;
                 Mathematical Techniques; Perfect Graphs; substitution;
                 Triangle-Free Graphs; triangle-free graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cosnard:1990:CSX,
  author =       "Michel Cosnard and Jean Duprat and Afonso G.
                 Ferreira",
  title =        "The complexity of searching in {X+Y} and other
                 multisets",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "2",
  pages =        "103--109",
  day =          "16",
  month =        mar,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "LIP-IMAG",
  affiliationaddress = "Lyon, Fr",
  classification = "723; C1110 (Algebra); C1160 (Combinatorial
                 mathematics); C4140 (Linear algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "LIP-IMAG, Ecole Normale Sup{\'e}rieure de Lyon,
                 France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity; computational complexity; Computer
                 Programming--Algorithms; Computer Systems Programming;
                 lower bound; matrices; matrix; matrix algebra;
                 multisets; Partially Ordered Sets; search problems;
                 Searching; searching; selection; set theory; Sorted
                 Matrices; Sorting; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1990:FPI,
  author =       "C. A. R. Hoare",
  title =        "Fixed points of increasing functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "111--112",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Computing Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory; Computer Programming--Theory;
                 Fixed Points; fixed points; functional composition;
                 Increasing Functions; increasing functions; Parallel
                 Composition; parallel composition; partial order;
                 Programming Theory; programming theory; Sequential
                 Composition",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pallo:1990:DMB,
  author =       "J. M. Pallo",
  title =        "A distance metric on binary trees using
                 lattice-theoretic measures",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "113--116",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Bourgogne",
  affiliationaddress = "Dijon, Fr",
  classification = "921; C1160 (Combinatorial mathematics); C6120 (File
                 organisation)",
  corpsource =   "Dept. d'Inf., Bourgogne Univ., Dijon, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary Trees; binary trees; data structures; Distance
                 Metric; distance metric; height function;
                 lattice-theoretic measures; Mathematical Techniques;
                 Rotation Lattice; strictly antitone supervaluation;
                 Trees; trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bertoni:1990:CPA,
  author =       "A. Bertoni and M. Goldwurm and P. Massazza",
  title =        "Counting problems and algebraic formal power series in
                 noncommuting variables",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "117--121",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ degli Studi di Milano",
  affiliationaddress = "Milano, Italy",
  classification = "721; 921; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milano Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebraic Formal Power Series; algebraic formal power
                 series; Automata Theory; Circuit Complexity;
                 complexity; computational complexity; Context Free
                 Languages; context-free language; Counting Problems;
                 counting problems; formal languages; Integer Division;
                 integer division; log-space uniform boolean circuits;
                 Mathematical Techniques--Algebra; noncommuting
                 variables; series (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Harn:1990:EPE,
  author =       "Lein Harn and Thomas Kiesler",
  title =        "An efficient probabilistic encryption scheme",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "123--129",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Missouri-Kansas City",
  affiliationaddress = "Kansas City, MO, USA",
  classification = "723; 922; C6130 (Data handling techniques)",
  corpsource =   "Comput. Sci. Telecommun. Program, Missouri Univ.,
                 Kansas City, MO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Cryptography; cryptography; digital signature scheme;
                 Probabilistic Encryption; probabilistic encryption
                 scheme; Probability; Public Key Cryptography; public
                 key encryption; Quadratic Residues; RSA scheme;
                 trapdoor function",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Park:1990:DSS,
  author =       "Moon Hwa Park and Myunghwan Kim",
  title =        "A distributed synchronization scheme for fair
                 multi-process handshakes",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "131--138",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sungshin Women's Univ",
  affiliationaddress = "Seoul, Korea",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Sungshin Women's Univ., Seoul,
                 South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming--Algorithms; Computer Systems,
                 Digital; Distributed; distributed processing;
                 Distributed Synchronization; distributed
                 synchronization scheme; Dynamic Ordering; fair
                 multiprocess handshake; Handshake fairness;
                 Multiprocess Handshake; programming theory; Scheduling;
                 synchronisation; Synchronization Algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Goeman:1990:TTS,
  author =       "Henk Goeman",
  title =        "Towards a theory of (self) applicative communicating
                 processes. {A} short note",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "139--142",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Leiden Univ",
  affiliationaddress = "Leiden, Neth",
  classification = "722; 723; C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Leiden Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Abstraction; abstraction; applicative communicating
                 processes; Communicating Processes; Computer
                 Metatheory; Computer Systems, Digital; concurrency;
                 data structures; direct combination; Distributed;
                 encapsulation; Lambda Calculus; lambda-calculus;
                 multiprocessing programs; operational semantics;
                 Process Algebra; process algebra; recursive constructs;
                 Self-Application; sequential composition",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Meinel:1990:LVC,
  author =       "Christoph Meinel",
  title =        "Logic vs. complexity theoretic properties of the graph
                 accessibility problem for directed graphs of bounded
                 degree",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "143--146",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Humboldt-Univ zu Berlin",
  affiliationaddress = "Berlin, East Ger",
  classification = "921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Sektion Math., Humboldt-Univ., Berlin, East Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bounded degree; Complexity; complexity theoretic
                 properties; computational complexity; Directed Graphs;
                 directed graphs; Graph Accessibility Problem; graph
                 accessibility problem; Graph Theory; Mathematical
                 Techniques; Nonuniform Branching Programs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teng:1990:SEP,
  author =       "Shang-Hua Teng",
  title =        "Space efficient Processor Identity protocol",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "147--154",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C5620 (Computer networks and techniques)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "asynchronous parallel computation; Asynchronous
                 Parallel Computing; asynchronous parallel systems;
                 computational complexity; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 Distributed Algorithms; distributed computation;
                 Parallel Processing; probabilistic protocol; Processor
                 Identify Problem; Processor Identity Protocol;
                 protocols; shared memory; space efficient processor
                 identity protocol; Space Efficient Protocols",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Tipper:1990:SIA,
  author =       "John C. Tipper",
  title =        "A straightforward iterative algorithm for the planar
                 {Voronoi} diagram",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "155--160",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Australian Natl Univ",
  affiliationaddress = "Canberra, Aust",
  classification = "723; C4130 (Interpolation and function
                 approximation); C4190 (Other numerical methods); C6120
                 (File organisation)",
  corpsource =   "Dept. of Geol., Australian Nat. Univ., Canberra, ACT,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational geometry; Computer Graphics; Computer
                 Programming--Algorithms; convex hull; data sets; data
                 structures; Delaunay Triangulation; Iterative
                 Algorithms; iterative methods; planar Voronoi diagram;
                 Spatial Data Structures; straightforward iterative
                 algorithm; Triangulation; Voronoi Diagrams",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Plehn:1990:PSI,
  author =       "J{\"u}rgen Plehn",
  title =        "Preemptive scheduling of independent jobs with release
                 times and deadlines on a hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "161--166",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Bonn",
  affiliationaddress = "Bonn, West Ger",
  classification = "722; 723; C4240 (Programming and algorithm theory)",
  corpsource =   "Forschungsinst. f{\"u}r Diskrete Math., Bonn Univ.,
                 West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems, Digital; Deadlines; deadlines;
                 hypercube; Hypercubes; independent jobs; linear
                 program; Mathematical Programming, Linear;
                 Multiprocessing; parallel algorithms; Preemptive
                 Scheduling; preemptive scheduling; Release Times;
                 release times; Scheduling; scheduling",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Manber:1990:RBS,
  author =       "Udi Manber",
  title =        "Recognizing breadth-first search trees in linear
                 time",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "167--171",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Arizona",
  affiliationaddress = "Tucson, AZ, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; breadth-first search trees; computational
                 complexity; Computer Programming; Data Processing--Data
                 Structures; graph theory; Linear Tree Algorithms;
                 linear-time algorithm; Mathematical Techniques--Trees;
                 roots; Search Algorithms; search problems; Search
                 Trees; spanning tree; trees (mathematics); undirected
                 graph; Undirected Graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kale:1990:APH,
  author =       "L. V. Kale",
  title =        "An almost perfect heuristic for the {$N$}-nonattacking
                 queens problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "173--178",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Urbana Champaign",
  affiliationaddress = "Urbana, IL, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana
                 Champaign, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "almost perfect heuristic; Backtracking; combinatorial
                 mathematics; Combinatorial Mathematics; Computer
                 Programming--Algorithms; first solution; heuristic
                 programming; Heuristic Search; Mathematical Techniques;
                 N nonattacking Queens Problems; N-nonattacking queens
                 problem; Search Algorithms; value-ordering heuristic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lutz:1990:SPD,
  author =       "Earlin Lutz",
  title =        "Some proofs of data refinement",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "179--185",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723; C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Abstract Data Structures; abstract program fragment;
                 Computer Metatheory--Programming Theory; Computer
                 Programming; correctness conditions; Data
                 Processing--Data Structures; Data Refinement; data
                 refinement; data structures; Program Correctness;
                 programming theory; proof rules; replacement; Theory;
                 variables",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1990:CTS,
  author =       "Biing-Feng Wang and Gen-Huey Chen and Ferng-Ching
                 Lin",
  title =        "Constant time sorting on a processor array with a
                 reconfigurable bus system",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "187--192",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Array Processing; bottom processors; Computer
                 Programming--Algorithms; Computer Systems Programming;
                 Computer Systems, Digital--Parallel Processing;
                 Constant Time Sorting; constant time sorting algorithm;
                 data comparisons; data input; data items; data output;
                 enumeration sort; parallel algorithms; Parallel
                 Algorithms; reconfigurable bus system; Reconfigurable
                 Buses; sorting; Sorting; sorting by ranking; square
                 array; three-dimensional processor array; triangular
                 arrays",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bradford:1990:SMB,
  author =       "James H. Bradford",
  title =        "Sequence matching with binary codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "193--196",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brock Univ",
  affiliationaddress = "St. Catharines, Ont, Can",
  classification = "723; B6120B (Codes); C1250 (Pattern recognition);
                 C1260 (Information theory)",
  corpsource =   "Dept. of Comput. Sci., Brock Univ., St. Catharines,
                 Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; Algorithms; Binary Codes; binary codes;
                 binary codewords; binary numbers; Codes, Symbolic;
                 Computer Metatheory--Computability and Decidability;
                 Computer Programming; error correction codes; Hamming
                 Distance; Hamming distance; Levenshtein Distance;
                 Levenshtein distance; pattern recognition; Sequence
                 Matching; sequence matching; string pairs; String
                 Similarity; string similarity; String-To-String Editing
                 Problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bagchi:1990:PAG,
  author =       "A. Bagchi and S. L. Hakimi and J. Mitchem and E.
                 Schmeichel",
  title =        "Parallel algorithms for gossiping by mail",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "197--202",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "723; B6110 (Information theory); C1160
                 (Combinatorial mathematics); C1260 (Information
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., California
                 Univ., Davis, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "communication mode; communication problem; complexity;
                 computational complexity; Computer
                 Metatheory--Computability and Decidability; Computer
                 Programming--Algorithms; Computer Systems,
                 Digital--Parallel Processing; Data Transmission;
                 general graphs; gossiping; Gossiping By Mail; graph
                 families; graph theory; hypercubes; information theory;
                 message dissemination; nearly optimal parallel
                 algorithms; one-way communication; one-way mail;
                 Parallel Algorithms; parallel algorithms;
                 point-to-point communication; transmission; trees;
                 undirected graph; Undirected Graphs; unique piece of
                 information; vertex",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Khuller:1990:CAK,
  author =       "Samir Khuller",
  title =        "Coloring algorithms for {K}$_5$-minor free graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "203--208",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; colouring algorithms; computational
                 complexity; Computer Programming; Computer Systems,
                 Digital--Parallel Processing; five color; four
                 coloring; Graph Coloring; graph colouring; Graph
                 Minors; K/sub 5/-minor free graphs; Mathematical
                 Techniques--Graph Theory; NC algorithm; Parallel
                 Algorithms; parallel algorithms; Planar Graphs;
                 polynomial time algorithm; Polynomial Time Algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cooper:1990:CFA,
  author =       "James Cooper and Leslie Kitchen",
  title =        "{CASOP}: {A} fast algorithm for computing the $n$-ary
                 composition of a binary associative operator",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "209--213",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Western Australia",
  affiliationaddress = "Nedlands, Aust",
  classification = "723; C1250 (Pattern recognition); C4240 (Programming
                 and algorithm theory); C5260B (Computer vision and
                 picture processing)",
  corpsource =   "Dept. of Comput. Sci., Western Australia Univ.,
                 Nedlands, WA, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary associative operator; CASOP; CASOP Algorithm;
                 computational complexity; Computer
                 Programming--Algorithms; computer vision; computer
                 vision task; contiguous subsequences; data items; fast
                 algorithm; Image Processing; n-ary composition; n-ary
                 operation; n-ary operator; or-ring together n-tuples;
                 order M; region dilation; rows; run-length encoding;
                 Vision--Artificial",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ramalingam:1990:NSP,
  author =       "G. Ramalingam and C. Pandu Rangan",
  title =        "New sequential and parallel algorithms for interval
                 graph recognition",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "4",
  pages =        "215--219",
  day =          "24",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; graph theory; interval graph recognition;
                 Interval Graphs; interval graphs; interval
                 representation; Mathematical Techniques--Graph Theory;
                 Parallel Algorithms; parallel algorithms; sequential
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dunne:1990:CKP,
  author =       "P. E. Dunne",
  title =        "Comment on {Kochol}'s paper {``Efficient monotone
                 circuits for threshold functions''} {[Inform. Process.
                 Lett. {\bf 32}(3), 24 August 1989, pp. 121--122]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "221--222",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Kochol:1989:EMC}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory)",
  corpsource =   "Dept. of Comput. Sci., Liverpool Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; circuit complexity; computational
                 complexity; monotone circuits; threshold functions;
                 threshold logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ronn:1990:DTD,
  author =       "Stefan Ronn and Heikki Saikkonen",
  title =        "Distributed termination detection with counters",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "223--227",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Swedish Sch of Economics and Business Administration",
  affiliationaddress = "Helsinki, Finl",
  classification = "722; 723; B6150 (Communication system theory); C4240
                 (Programming and algorithm theory); C5620 (Computer
                 networks and techniques)",
  corpsource =   "Dept. of Stat. and Comput. Sci., Swedish Sch. of Econ.
                 and Bus. Adm., Helsinki, Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "communication channel; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 counters; Distributed; distributed processing;
                 Distributed Termination; distributed termination
                 detection; Global Termination; messages; passive
                 machines; programming theory; system recovery;
                 Termination Detection; undirected connected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tuza:1990:PSD,
  author =       "Zsolt Tuza",
  title =        "Periodic string division generated by deterministic
                 {$L$} systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "229--234",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hungarian Acad of Sciences",
  affiliationaddress = "Budapest, Hung",
  classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Comput. and Autom. Inst., Hungarian Acad. of Sci.,
                 Budapest, Hungary",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Code Languages; code-language; D0L
                 system; deterministic automata; deterministic L
                 systems; Deterministic Lindenmayer Systems; Formal
                 Languages; formal languages; growth functions;
                 interactive systems; Lindenmayer system; Periodic
                 String Division; periodic string division; rewriting;
                 string division",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1990:PAF,
  author =       "Sung Kwon Kim",
  title =        "A parallel algorithm for finding a maximum clique of a
                 set of circular arcs of a circle",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "235--241",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington",
  affiliationaddress = "Seattle, WA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; circular-arc graph; Circular-Arc Graphs;
                 circular-arc model; computational complexity; Computer
                 Programming; Computer Systems
                 Programming--Multiprocessing Programs; crew pram; CREW
                 PRAM; graph theory; Mathematical Techniques--Graph
                 Theory; Maximum Clique; maximum clique; parallel
                 algorithm; Parallel Algorithms; parallel algorithms;
                 set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Murphy:1990:UFT,
  author =       "Owen Murphy",
  title =        "A unifying framework for trie design heuristics",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "243--249",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Vermont",
  affiliationaddress = "Burlington, VT, USA",
  classification = "723; 903; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Vermont Univ., Burlington, VT,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arbitrary cost functions; binary word; combinatorial
                 optimisation; computational complexity; cost functions;
                 Data Processing; Data Structures; database theory;
                 information measures; information retrieval;
                 Information Science--Information Retrieval; information
                 storage; information theoretic heuristic; Information
                 Theory; information theory; keys; Multikey Searching;
                 optimisation; r-error digital search problem; search
                 problems; stepwise heuristic; trees (mathematics); trie
                 design heuristics; Trie Index Construction; uncertainty
                 measure; uncertainty-based information measures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pugh:1990:SOB,
  author =       "William Pugh",
  title =        "Slow optimally balanced search strategies vs. cached
                 fast uniformly balanced search strategies",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "251--254",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "723; C4250 (Database theory); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Balanced Data Structures; balanced tree; buffer
                 storage; cached fast uniformly balanced search
                 strategies; Computer Programming--Algorithms; Data
                 Processing; Data Structures; data structures; database
                 theory; nonuniform query distribution; optimally
                 balanced data structure; search problems; Search
                 Strategies; self-adjusting trees; trees (mathematics);
                 uniformly balanced data structure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pombortsis:1990:SSP,
  author =       "A. Pombortsis",
  title =        "Sharing special purpose resources in a multiprocessor
                 environment",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "255--260",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Thessaloniki",
  affiliationaddress = "Thessaloniki, Greece",
  classification = "722; 723; C4230 (Switching theory); C5220 (Computer
                 architecture); C5440 (Multiprocessor systems and
                 techniques)",
  corpsource =   "Dept. of Phys., Thessaloniki Univ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems, Digital; fast circuit switching
                 strategy; FCS strategy; host multiprocessor
                 architecture; interconnection network; memory modules;
                 Multiprocessing; multiprocessor environment;
                 multiprocessor interconnection networks; Parallel
                 Processing; resource arbitration interconnection
                 network; Resource Sharing; resource sharing;
                 scheduling; simulation study; special purpose
                 resources; splitting load sharing strategy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kuo:1990:NSC,
  author =       "R. T. Kuo and S. S. Tseng",
  title =        "The necessary and sufficient condition for the
                 worst-case male optimal stable matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "261--263",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; C4240 (Programming and algorithm theory); C4250
                 (Database theory)",
  corpsource =   "National Chiao Tung Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computer Programming;
                 database theory; pattern recognition; probability;
                 search problems; sequential stable matching problem;
                 Stable Matching Problem; worst-case male optimal stable
                 matching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Robson:1990:RAM,
  author =       "J. M. Robson",
  title =        "Random access machines with multi-dimensional
                 memories",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "265--266",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Australian Natl Univ",
  affiliationaddress = "Canberra, Aust",
  classification = "722; 723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Australian Nat. Univ.,
                 Canberra, ACT, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Array Processing; complexity;
                 computational complexity; Computer Systems, Digital;
                 multi-dimensional memories; Multidimensional Arrays;
                 Multiprocessing; RAM-algol; Random Access Machines;
                 random access machines; two-dimensional arrays",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weiss:1990:MSI,
  author =       "Mark Allen Weiss and Robert Sedgewick",
  title =        "More on {Shellsort} increment sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "267--270",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Florida Int Univ",
  affiliationaddress = "Miami, FL, USA",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Sch. of Comput. Sci., Florida Int. Univ., University
                 Park, Miami, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; computational
                 complexity; Computer Programming; Computer Systems
                 Programming--Sorting; Frobenius problem; Increment
                 Sequences; Shellsort; Shellsort increment sequences;
                 sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gonnet:1990:AKS,
  author =       "Gaston H. Gonnet and Ricardo A. Baeza-Yates",
  title =        "An analysis of the {Karp-Rabin} string matching
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "271--274",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  abstract =     "We present an average case analysis of the Karp-Rabin
                 string matching algorithm. This algorithm is a
                 probabilistic algorithm that adapts hashing techniques
                 to string searching. We also propose an efficient
                 implementation of this algorithm.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Canada",
  classification = "723; 922; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; average case analysis;
                 Computer Programming; Hashing; hashing techniques;
                 Karp-Rabin Algorithm; Karp-Rabin string matching
                 algorithm; pattern recognition; probabilistic
                 algorithm; Probability; search problems; String
                 Matching; String Searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Althofer:1990:TLB,
  author =       "Ingo Alth{\"o}fer",
  title =        "Tight lower bounds on the length of word chains",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "5",
  pages =        "275--276",
  day =          "7",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Bielefeld",
  affiliationaddress = "Bielefeld, West Ger",
  classification = "721; C4210 (Formal logic)",
  corpsource =   "Fak. f{\"u}r Math., Bielefeld Univ., West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "addition chains; Automata Theory; formal languages;
                 Formal Languages; lower bounds; Lower Bounds; word
                 chains; Word Chains",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldreich:1990:NCI,
  author =       "Oded Goldreich",
  title =        "A note on computational indistinguishability",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "277--281",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion Computer Science Dep",
  affiliationaddress = "Haifa, Isr",
  classification = "723; 922; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Technion, Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Complexity; computational complexity;
                 Computational Indistinguishability; computational
                 indistinguishability; Computer Metatheory; Computer
                 Programming--Algorithms; efficiently constructible
                 distributions; Mathematical Statistics--Random Number
                 Generation; Pseudorandom Generators; pseudorandom
                 generators; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chandrasekharan:1990:ITT,
  author =       "N. Chandrasekharan",
  title =        "Isomorphism testing of $k$-trees is in {NC}, for fixed
                 $k$",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "283--287",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Clemson Univ",
  affiliationaddress = "Clemson, SC, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. Sci., Clemson, Univ., SC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; computational
                 complexity; Computational Complexity; Computer
                 Programming; Computer Systems, Digital--Parallel
                 Processing; isomorphism testing; Isomorphism Testing;
                 k-chordal graphs; k-trees; K-Trees; Mathematical
                 Techniques--Trees; NC algorithm; parallel algorithms;
                 Parallel Algorithms; partial k-trees; tree isomorphism
                 algorithm; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chomicki:1990:GCW,
  author =       "Jan Chomicki and V. S. Subrahmanian",
  title =        "Generalized closed world assumption is
                 {$\Pi_2^0$}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "289--291",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of North Carolina",
  affiliationaddress = "Chapel Hill, NC, USA",
  classification = "721; 723; C4240 (Programming and algorithm theory);
                 C6170 (Expert systems)",
  corpsource =   "Dept. of Comput. Sci., North Carolina Univ., Chapel
                 Hill, NC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Arithmetical Hierarchy; arithmetical hierarchy;
                 Automata Theory--Computability and Decidability;
                 Computer Metatheory; disjunctive database rule;
                 Generalized Closed World Assumption; inference
                 mechanisms; inference rule; Logic Programming; logic
                 programming; logic programs; negation; Non Horn Logic
                 Programs; Pi /sub 2//sup 0/-complete; Programming
                 Theory; programming theory; undecidability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Heath:1990:CSA,
  author =       "Lenwood S. Heath",
  title =        "Covering a set with arithmetic progressions is
                 {NP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "293--298",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Virginia Polytechnic Inst and State Univ",
  affiliationaddress = "Blacksburg, VA, USA",
  classification = "721; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Virginia Polytech. Inst. and
                 State Univ., Blacksburg, VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Arithmetic Progressions; arithmetic progressions;
                 Automata Theory--Computability and Decidability;
                 combinatorial problems; Computational Complexity;
                 computational complexity; exact covering problem;
                 finite arithmetic progressions; Mathematical
                 Techniques; MINIMUM COVER; NP-complete; partitioning
                 problems; Set Covering; set covering; Set Theory; set
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zargham:1990:TDF,
  author =       "M. R. Zargham and K. J. Danhof",
  title =        "Toward a definition of fault analysis for {Petri} nets
                 models",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "299--305",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Southern Illinois Univ.,
                 Carbondale, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "concurrent systems; fault analysis; fault detection;
                 fault diagnosis; parallel programming; permanent
                 transition fault; Petri nets; Petri nets models;
                 program diagnostics; programming theory; restricted
                 Petri nets; system reliability",
  treatment =    "P Practical",
}

@Article{Klein:1990:PAE,
  author =       "Philip Klein and Clifford Stein",
  title =        "A parallel algorithm for eliminating cycles in
                 undirected graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "307--312",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming--Algorithms; Computer Systems,
                 Digital--Parallel Processing; Edge Disjoint Cycles;
                 edge-disjoint cycles; eliminating cycles; Euler Tour;
                 Euler tour; Graph Theory; graph theory; Mathematical
                 Techniques; parallel algorithm; Parallel Algorithms;
                 parallel algorithms; Undirected Graphs; undirected
                 graphs; weighted version",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matsliach:1990:DTL,
  author =       "Gabriel Matsliach and Oded Shmueli",
  title =        "Distributing a {$B^+$}-tree in a loosely coupled
                 environment",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "313--321",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion-Israel Inst of Technology",
  affiliationaddress = "Haifa, Isr",
  classification = "723; 921; C4250 (Database theory); C6120 (File
                 organisation); C6160B (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "B/sup +/-tree; Broadcast Networks; Computer
                 Networks--Local Networks; Computer Systems,
                 Digital--Multiprocessing; data file; Data Processing;
                 data structures; Data Structures; database theory;
                 disks; distributed data structures; Distributed Data
                 Structures; distributed databases; local broadcast
                 network; loosely coupled environment; Mathematical
                 Techniques--Trees; Message Passing; processors; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sengupta:1990:DFR,
  author =       "A. Sengupta and S. Bandyopadhyay",
  title =        "Deadlock-free routing in $k$-ary hypercube network in
                 presence of processor failures",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "323--328",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of South Carolina",
  affiliationaddress = "Columbia, SC, USA",
  classification = "722; 723; 921; C4230 (Switching theory); C5220
                 (Computer architecture); C5440 (Multiprocessor systems
                 and techniques)",
  corpsource =   "Dept. of Comput. Sci., Univ. of South Carolina,
                 Columbia, SC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Networks; Computer Programming--Algorithms;
                 Computer Systems, Digital; Deadlock Free Routing;
                 deadlock-free algorithms; Hypercube Networks;
                 interconnection network; Interconnection Networks;
                 k-ary hypercube network; Mathematical Techniques--Graph
                 Theory; message routing; Multiprocessing;
                 multiprocessor interconnection networks; Processor
                 Failures; processor failures; protocols; Routing
                 Protocols; system recovery; virtual communication
                 channels",
  treatment =    "P Practical",
}

@Article{Wand:1990:SPL,
  author =       "Mitchell Wand",
  title =        "A short proof of the lexical addressing algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "1--5",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Northeastern Univ",
  affiliationaddress = "Boston, MA, USA",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; binding relations; Church coding; compiler
                 correctness proofs; Computer Metatheory--Programming
                 Theory; Computer Programming; Computer Programming
                 Languages; correctness proving; deBruijn coding;
                 Environment Coding; environment coding; Formal
                 Semantics; Frege coding; Lexical Address Coding;
                 Lexical Addressing Algorithm; lexical addressing
                 algorithm; Natural Coding; natural coding; Program
                 Correctness; program verification; programming language
                 semantics",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ahuja:1990:FAP,
  author =       "Mohan Ahuja and Yahui Zhu",
  title =        "An {$O(n\log n)$} feasibility algorithm for preemptive
                 scheduling of $n$ independent jobs on a hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "7--11",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "723; C4230 (Switching theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Balanced Search Trees; Computer
                 Programming; feasibility algorithm; hypercube;
                 Hypercubes; independent jobs; multiprocessor
                 interconnection networks; Preemptive Scheduling;
                 preemptive scheduling; Scheduling; scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aggarwal:1990:CLD,
  author =       "Alok Aggarwal and Subhash Suri",
  title =        "Computing the longest diagonal of a simple polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "13--18",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "723; 921; C4190 (Other numerical methods)",
  corpsource =   "IBM Thomas J. Watson Center, Yorktown Heights, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational Geometry; computational
                 geometry; Computer Programming; Longest Diagonal;
                 longest diagonal computing; Mathematical
                 Techniques--Geometry; Polygons; simple polygon",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jacob:1990:MRC,
  author =       "Jeremy Jacob",
  title =        "A model of reconfiguration in communicating sequential
                 processes",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "19--22",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "722; 723; C6110B (Software engineering techniques)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "communicating sequential processes; Communication
                 Sequential Processes; Computer Operating Systems;
                 Computer Systems, Digital; Distributed; Dynamic
                 Reconfiguration; Formal Semantics; formal
                 specification; Reconfigurability; reconfiguration
                 model",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bajaj:1990:PNR,
  author =       "Chanderjit L. Bajaj and Tamal Dey",
  title =        "Polygon nesting and robustness",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "23--32",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "723; 921; C4190 (Other numerical methods); C6130B
                 (Graphics techniques)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational Geometry; computational
                 geometry; Computer Graphics; computer graphics;
                 Computer Programming; floating point arithmetic;
                 Mathematical Techniques--Geometry; nonintersecting;
                 planar polygons; Polygon Nesting; polygon nesting;
                 robust algorithm; Robustness; robustness",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Siromoney:1990:PKC,
  author =       "Rani Siromoney and Lisa Mathew",
  title =        "A public key cryptosystem based on {Lyndon} words",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "33--36",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (20M35)",
  MRnumber =     "92d:94022",
  MRreviewer =   "Do Long Van",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Madras Christian Coll",
  affiliationaddress = "Madras, India",
  classification = "723; 921; B6120B (Codes); C6130 (Data handling
                 techniques)",
  corpsource =   "Madras Christian Coll., India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Cryptography; cryptography; cryptotext; Lyndon Words;
                 Lyndon words; Mathematical Techniques--Number Theory;
                 Morphisms; plaintext blocksize; public key
                 cryptosystem; Public Key Cryptosystems; rewriting
                 systems; Thue rewriting rules; Thue Systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ching:1990:DDD,
  author =       "Yu-Tai Ching and Kurt Mehlhorn and Michiel H. M.
                 Smid",
  title =        "Dynamic deferred data structuring",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "37--40",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Acad Sinica",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723; C6120 (File organisation)",
  corpsource =   "Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary comparison model; Data Processing; Data
                 Structures; data structures; Deferred Data Structures;
                 Deletions; deletions; dynamic deferred data
                 structuring; Insertions; insertions; Membership
                 Queries; membership queries",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lodi:1990:RTS,
  author =       "E. Lodi and F. Luccio and L. Pagli",
  title =        "Routing in times square mode",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "41--48",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Salerno",
  affiliationaddress = "Salerno, Italy",
  classification = "713; 723; B1130B (Computer-aided circuit analysis
                 and design); B2570 (Semiconductor integrated circuits);
                 C7410D (Electronic engineering)",
  corpsource =   "Dipartimento di Inf. Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Channel Routing; channel routing model; circuit layout
                 CAD; Computer Aided Design; Computer
                 Programming--Algorithms; horizontal tracks; Integrated
                 Circuits, VLSI; polynomial routing algorithm; standard
                 layout; time square mode; Times Square Mode; VLSI;
                 Wiring Algorithms",
  treatment =    "P Practical",
}

@Article{Rubinfeld:1990:CTR,
  author =       "Ronitt Rubinfeld",
  title =        "The cover time of a regular expander is {$O(n\log
                 n)$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "49--51",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "U.C. Berkeley",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "723; 921; 922; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Comput. Sci. Div., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Complexity; computational complexity;
                 Computer Programming--Algorithms; cover time; graph;
                 Graph Theory; Mathematical Techniques;
                 Probability--Random Processes; random walk; regular
                 expander; Regular Expanders",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boxer:1990:CIPb,
  author =       "L. Boxer and R. Miller",
  title =        "Corrigenda: {``Common intersections of polygons''}
                 {[Inform. Process. Lett. {\bf 33}(5), 10 January 1990,
                 pp. 249--254]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "53--53",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Boxer:1990:CIPa}.",
  acknowledgement = ack-nhfb,
  classification = "C4190 (Other numerical methods)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Niagara Univ., NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "common intersection of polygons; computational
                 geometry; CREW PRAM; envelope function; vertically
                 convex planar polygons",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kumar:1990:CDD,
  author =       "D. Kumar and S. S. Iyengar and M. B. Sharma",
  title =        "Corrections to a distributed depth-first search
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "1",
  pages =        "55--56",
  day =          "15",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Eng. and Sci., Case Western Reserve
                 Univ., Cleveland, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "coding errors; computational complexity; distributed
                 depth-first search algorithm; time complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lubiw:1990:CCS,
  author =       "Anna Lubiw",
  title =        "Counterexample to a conjecture of {Szymanski} on
                 hypercube routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "57--61",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4230 (Switching theory)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems, Digital; counterexample; directed
                 edge; edge disjoint shortest paths; graph theory;
                 hypercube routing; Hypercubes; Mathematical Techniques
                 --- Combinatorial Mathematics; Multiprocessing;
                 multiprocessor interconnection networks; permutation;
                 Routing; Szymanski; target; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Herman:1990:PS,
  author =       "Ted Herman",
  title =        "Probabilistic self-stabilization",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "63--67",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "722; 723; 922; C1140Z (Other and miscellaneous);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "abnormal; algorithm theory; circulate; communication;
                 Computer Programming --- Algorithms; Computer Systems,
                 Digital; convergence; Distributed; distributed
                 processing; identical processes; normal state;
                 Probabilistic Algorithms; probabilistic
                 self-stabilizing algorithm; Probability; probability;
                 ring; Self-Stabilization; token; unidirectional;
                 Uniform Rings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Guenther:1990:EEF,
  author =       "G. R. Guenther",
  title =        "Efficient expansion of factored expressions",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "69--72",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Laurentian Univ",
  affiliationaddress = "Sudbury, Ont, Can",
  classification = "723; C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6140D (High level languages)",
  corpsource =   "Dept. of Math. and Comput. Sci., Laurentian Univ.,
                 Sudbury, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Computer
                 Programming Languages; Factored Expressions; factored
                 expressions; formal languages; generator; high level
                 languages; iterator; Iterators; programming theory;
                 Regular Expressions; regular expressions; Theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Maes:1990:CSC,
  author =       "Maurice Maes",
  title =        "On a cyclic string-to-string correction problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "73--78",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Philips Research Lab",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Philips Res. Labs., Eindhoven, Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; cyclic string-to-string correction
                 problem; Cyclic Strings; distance functions; distance
                 measure; edit operations; encoding; equivalent;
                 minimum-cost sequences; Pattern Matching; polygonal
                 objects; similarity measure; String Correction",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barnard:1990:PTA,
  author =       "D. T. Barnard and D. B. Skillicorn",
  title =        "Pipelining tree-structured algorithms on {SIMD}
                 architectures",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "79--84",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "723; C4240 (Programming and algorithm theory); C5220
                 (Computer architecture); C5440 (Multiprocessor systems
                 and techniques)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm complexity; Algorithms; asymptotically
                 optimal; Computer Programming; Computer Systems
                 Programming --- Multiprocessing Programs; Computer
                 Systems, Digital --- Multiprocessing;
                 Divide-and-Conquer; NC/sup 1/; NC/sup 2/; Parallel
                 Algorithms; parallel algorithms; parallel
                 architectures; pipeline processing; Pipelined
                 Architectures; pipelining; Processor Allocation;
                 processor utilization; SIMD Architectures; SIMD
                 architectures; tree-structured algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fung:1990:SLT,
  author =       "Khun Yee Fung and Tina M. Nicholl and Robert E. Tarjan
                 and Christopher J. {Van Wyk}",
  title =        "Simplified linear-time {Jordan} sorting and polygon
                 clipping",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "85--92",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Western Ontario",
  affiliationaddress = "London, Ont, Can",
  classification = "723; C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods); C4240 (Programming and algorithm
                 theory); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Western Ontario Univ., London,
                 Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; computational
                 geometry; Computational Geometry; Computer Programming;
                 Computer Systems Programming --- Sorting; Data
                 Processing --- Data Structures; data structure;
                 efficient algorithms; intersection points; Jordan
                 curve; Jordan Sorting; level-linked search tree;
                 linear-time Jordan sorting; Mathematical Techniques ---
                 Geometry; polygon clipping; Polygon Clipping;
                 rectangle; Search Trees; simple polygon; sorting;
                 triangulating; window; x-axis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1990:OLE,
  author =       "Ching-Lin Wang",
  title =        "Obtaining lazy evaluation with continuations in
                 {Scheme}",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "93--97",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tamkang Univ Tamsui",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723; C6110 (Systems analysis and programming);
                 C6140D (High level languages)",
  corpsource =   "Dept. of Comput. Sci., Tamkang Univ., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "advanced control structures; Computer Programming
                 Languages; Continuations; data structure continuations;
                 first-class continuations; Functional Programming; high
                 level languages; infinite data structures; lazy
                 evaluation; Lazy Evaluation; programming; Scheme;
                 Scheme Computer Language; streams",
  treatment =    "P Practical",
}

@Article{Wegener:1990:ESC,
  author =       "Ingo Wegener",
  title =        "Efficient simulation of circuits by {EREW PRAMs}",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "99--102",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Dortmund",
  affiliationaddress = "Dortmund, West Ger",
  classification = "721; 723; C4240 (Programming and algorithm theory)",
  corpsource =   "FB Inf., Dortmund Univ., West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bounded Fan-In Circuits; bounded fan-in circuits;
                 Circuit Complexity; circuit simulation; Complexity
                 Theory; computational complexity; Computer Simulation;
                 Computer Systems, Digital --- Multiprocessing;
                 conjunctions; CRCW PRAMs; disjunctions; EREW PRAMs;
                 exclusive-read exclusive-write; Logic Circuits;
                 negation; parallel algorithms; Parallel Random Access
                 Machines; unbounded fan-in circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sideris:1990:AGA,
  author =       "Martha Sideris",
  title =        "On attribute grammars without attribute synthesis",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "2",
  pages =        "103--109",
  day =          "29",
  month =        jun,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Computer Technology Inst",
  affiliationaddress = "Patras, Greece",
  classification = "721; C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Comput. Technol. Inst., Patras, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Attribute Grammars; attribute grammars; attribute
                 synthesis; Automata Theory; bounded width; Complexity
                 Theory; computational complexity; Context Free
                 Grammars; context-free grammars; functionless logic
                 programs; identities; polynomial space; polynomial
                 time; recursion",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Altman:1990:NAC,
  author =       "Tom Altman and George Logothetis",
  title =        "A note on ambiguity in context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "111--114",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Kentucky",
  affiliationaddress = "Lexington, KY, USA",
  classification = "721; 921; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Ambiguity; ambiguity; Automata Theory;
                 concatenation-ambiguity; Context Free Grammars;
                 context-free grammars; decidability; Mathematical
                 Techniques--Algebra; undecidable; union-ambiguity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lambrichts:1990:CFC,
  author =       "Erik Lambrichts and Peter Nees and Jan Paredaens and
                 Peter Peelman and Letizia Tanca",
  title =        "Checking functional consistency in deductive
                 databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "115--120",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Antwerp",
  affiliationaddress = "Antwerp, Belg",
  classification = "723; C4250 (Database theory); C6160D (Relational
                 DBMS)",
  corpsource =   "Dept. of Comput. Sci., Antwerp Univ., Belgium",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; Computer Programming--Logic Programming;
                 Database Systems; database theory; Datalog; Deductive
                 Databases; deductive databases; Functional Consistency;
                 functional consistency checking; functions; global
                 dependencies; l-consistency; local dependencies;
                 negation; relational databases; strong type system;
                 Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crochemore:1990:PCM,
  author =       "Maxime Crochemore and Wojciech Rytter",
  title =        "Parallel construction of minimal suffix and factor
                 automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "121--128",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Paris VII",
  affiliationaddress = "Paris, Fr",
  classification = "721; 723; 921; C1160 (Combinatorial mathematics);
                 C4220 (Automata theory); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "LITP, Paris VII Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; complexity; computational complexity;
                 Computer Programming--Algorithms; Computer Systems,
                 Digital--Parallel Processing; concurrent-write model;
                 Directed Acyclic Word Graphs; directed acyclic word
                 graphs; directed graphs; employed processors;
                 exclusive-write model; finite automata; logarithmic
                 factor; Mathematical Techniques--Graph Theory; Minimal
                 Factor Automata; minimal factor automata; Minimal
                 Suffix Automata; minimal suffix automata; Parallel
                 Algorithms; parallel algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kwiatkowska:1990:MT,
  author =       "Marta Z. Kwiatkowska",
  title =        "A metric for traces",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "129--135",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Leicester",
  affiliationaddress = "Leicester, Engl",
  classification = "723; 921; C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Studies, Leicester Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory; Computer Programming Languages;
                 Concurrency; depth distinguishing strings; equivalence
                 classes; Mathematical Techniques--Topology; Metric
                 Spaces; nondeterministic behaviours; sequential
                 behaviours; Theory; topological properties; topology;
                 traces; ultrametric",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mehlhorn:1990:HLE,
  author =       "K. Mehlhorn and S. N{\"a}her and C. Uhrig",
  title =        "Hidden line elimination for isooriented rectangles",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "137--143",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, West Ger",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "FB Inf., Univ. des Saarlandes, Saarbrucken, West
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; computational complexity; computational
                 geometry; Computational Geometry; Computer Graphics;
                 Computer Programming--Algorithms; Data Processing--Data
                 Structures; edges; Hidden Line Elimination; hidden line
                 elimination problem; isooriented rectangles;
                 Isooriented Rectangles; line segments; Mathematical
                 Techniques--Geometry; observer; random access machine;
                 scene; visible parts",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vardi:1990:ECM,
  author =       "Moshe Y. Vardi",
  title =        "Endmarkers can make a difference",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "145--148",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "721; C4220 (Automata theory)",
  corpsource =   "IBM Almaden Res. Center, San Jose, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; complete; endmarker; Endmarkers;
                 finite automata; Formal Languages; nondeterministic
                 logarithmic space; Nonemptiness Problem; nonemptiness
                 problem; NP Completeness; Two Way Automata; two-way
                 automata; Unary Alphabets; unary alphabets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arikati:1990:LAO,
  author =       "Srinivasa Rao Arikati and C. Pandu Rangan",
  title =        "Linear algorithm for optimal path cover problem on
                 interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "149--153",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "adjacency lists; Algorithms; computational complexity;
                 Computer Programming; Data Processing--Data Structures;
                 edges; graph theory; Interval Graphs; interval graphs;
                 linear algorithm; Mathematical Techniques--Graph
                 Theory; minimum cardinality; NP-complete; optimal path
                 cover problem; Path Covering; vertex-disjoint paths",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Launchbury:1990:SAA,
  author =       "John Launchbury",
  title =        "Strictness analysis aids inductive proofs",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "155--159",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Glasgow",
  affiliationaddress = "Glasgow, Scotl",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "admissibility; Computer Metatheory; domain; Inductive
                 Proofs; inductive proofs; predicates; programming
                 theory; retracts; Strictness Analysis; strictness
                 analysis; subdomain",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Piotrowski:1990:FMS,
  author =       "Jerzy A. Piotrowski",
  title =        "A functional model of a simplified sequential
                 machine",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "3",
  pages =        "161--166",
  day =          "20",
  month =        jul,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of New South Wales",
  affiliationaddress = "Kensington, Aust",
  classification = "721; 723; C0220 (Education and training)",
  corpsource =   "Dept. of Comput. Sci., New South Wales Univ.,
                 Kensington, NSW, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory--Sequential Machines; Computer
                 Science; computer science education; Computing 1A;
                 course; Education; educational courses; fetch-execute
                 cycle; functional model; functions; Miranda;
                 programming language; simplified sequential machine;
                 University of NSW; von Neumann machine; Von Neumann
                 Machines",
  treatment =    "G General Review",
}

@Article{Lin:1990:PAG,
  author =       "Chau-Jy Lin",
  title =        "Parallel algorithm for generating permutations on
                 linear array",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "167--170",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math., Nat. Chiao Tung Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; combinatorial mathematics; computational
                 complexity; Computer Programming; Computer Systems
                 Programming--Multiprocessing Programs; generating
                 permutations; identical processing elements; linear
                 array; Mathematical Techniques--Combinatorial
                 Mathematics; maximal elapsed time; parallel algorithm;
                 Parallel Algorithms; parallel algorithms; permutation
                 generation algorithm; Permutations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gouda:1990:SUC,
  author =       "Mohamed G. Gouda and Ted Herman",
  title =        "Stabilizing unison",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "171--175",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Clock Synchronization; clocks; Computer Systems,
                 Digital; Distributed; distributed processing;
                 distributed synchronous systems; self-stabilization;
                 Self-Stabilization; synchronisation; Synchronous
                 Systems; System Stability; unison",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yuan:1990:CCD,
  author =       "Shyan-Ming Yuan",
  title =        "The communication complexity for decentralized
                 evaluation of functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "177--182",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Industrial Technology Research Inst",
  affiliationaddress = "Taiwan",
  classification = "722; 723; 921; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Electron. Res. Service Organ., Ind. Technol. Res.
                 Inst., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bit complexity; Bit Complexity; communication
                 complexity; Communication Complexity; computational
                 complexity; Computer Systems, Digital; decentralized
                 algorithm; decentralized evaluation; Distributed;
                 Distributed Evaluation; distributed processing; fully
                 reducible functions; function evaluation; Function
                 Evaluation; irreducible functions; Mathematical
                 Techniques--Function Evaluation; message complexity;
                 Message Complexity; message interchanges; number of
                 messages required; partially reducible functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mehlhorn:1990:BOD,
  author =       "Kurt Mehlhorn and Stefan N{\"a}her",
  title =        "Bounded ordered dictionaries in {$O(\log \log n)$}
                 time and {$O(n)$} space",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "183--189",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, West Ger",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Fachbereich 14, Univ. des Saarlandes, Saarbrucken,
                 West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bounded Ordered Dictionaries; bounded ordered
                 dictionaries; Bounded Priority Queues; bounded priority
                 queues; Computational Complexity; computational
                 complexity; Data Processing; Data Structures; data
                 structures; Dictionaries; Hashing; hashing;
                 Mathematical Techniques--Trees; search tree; Search
                 Trees; time bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Inverardi:1990:RSV,
  author =       "P. Inverardi and M. Nesi",
  title =        "A rewriting strategy to verify observational
                 congruence",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "191--199",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IEI-CNR",
  affiliationaddress = "Pisa, Italy",
  classification = "723; C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "IEI-CNR, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "axiomatic presentations; behavioural equivalences; CCS
                 Specifications; completion; Computer Metatheory--Formal
                 Languages; Computer Programming Languages; Computer
                 Systems, Digital--Distributed; Concurrency;
                 concurrency; divergence; finite canonical term
                 rewriting system; finite CCS specification; normal
                 form; Observational Congruence; observational
                 congruence; program verification; rewriting strategy;
                 rewriting systems; Specification Languages;
                 specification languages; Term Rewriting Systems;
                 Theory; verification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alon:1990:GPP,
  author =       "Noga Alon",
  title =        "Generating pseudo-random permutations and maximum flow
                 algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "201--204",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "IBM Almaden Res. Center, San Jose, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; combinatorial mathematics; computational
                 complexity; Computer Programming; Derandomization;
                 derandomization; deterministic maximum-flow algorithm;
                 Longest Common Ascending Subsequence; longest common
                 ascending subsequence; Mathematical
                 Techniques--Combinatorial Mathematics; Maximum Flow
                 Algorithms; pseudo-random permutations; Pseudorandom
                 Permutations; relatively dense networks; running time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Manacher:1990:OAF,
  author =       "Glenn K. Manacher and Terrance A. Mankus and Carol
                 Joan Smith",
  title =        "An optimum {$\Theta (n \log n)$} algorithm for finding
                 a canonical {Hamiltonian} path and a canonical
                 {Hamiltonian} circuit in a set of intervals",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "205--211",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Chicago",
  affiliationaddress = "Chicago, IL, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., Stat. and Comput. Sci., Illinois
                 Univ., Chicago, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; canonical Hamiltonian circuit; canonical
                 Hamiltonian path; computational complexity; Computer
                 Programming; graph theory; Hamiltonian Circuits;
                 Hamiltonian Paths; interval graph; Interval Graphs;
                 Mathematical Techniques--Graph Theory; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Deng:1990:OPA,
  author =       "Xiaotie Deng",
  title =        "An optimal parallel algorithm for linear programming
                 in the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "4",
  pages =        "213--217",
  day =          "7",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "723; 921; C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory); C4290 (Other
                 computer theory)",
  corpsource =   "Dept. of Oper. Res., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 Computer Systems Programming--Multiprocessing Programs;
                 CRCW PRAM; linear programming; Mathematical
                 Programming, Linear; Mathematical Techniques--Geometry;
                 optimal parallel algorithm; Parallel Algorithms;
                 parallel algorithms; processor-time complexity;
                 two-dimensional linear programming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Block:1990:MEG,
  author =       "Kenneth Block and Tai-Kuo Woo",
  title =        "A more efficient generalization of {Peterson}'s mutual
                 exclusion algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "219--222",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Florida Univ.,
                 Gainesville, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; computational
                 complexity; Computer Programming; Computer Systems
                 Programming--Multiprocessing Programs; concurrency
                 control; Concurrent Programming; critical section;
                 Mutual Exclusion; mutual exclusion algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Loui:1990:ALB,
  author =       "Michael C. Loui and Milind A. Sohoni",
  title =        "An algorithm for load balancing in multiprocessor
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "223--228",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Urbana-Champaign",
  affiliationaddress = "Urbana, IL, USA",
  classification = "723; C4240 (Programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6150J (Operating
                 systems)",
  corpsource =   "Coordinated Sci. Lab., Ilinois Univ.,
                 Urbana-Champaign, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; completions; Computer
                 Programming; Computer Systems
                 Programming--Multiprocessing Programs; Load Balancing;
                 load balancing; longest queue; Memory Access;
                 multiprocessing systems; multiprocessor systems;
                 potential memory collisions; reporting task arrivals;
                 scheduling; Shared Memory; shared memory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Toda:1990:CTS,
  author =       "Seinosuke Toda",
  title =        "On the complexity of topological sorting",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "229--233",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (05C85 68Q22 68R10)",
  MRnumber =     "92c:68060",
  MRreviewer =   "Andreas Brandst{\"a}dt",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Electro-communications",
  affiliationaddress = "Tokyo, Jpn",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6130 (Data
                 handling techniques)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Math., Univ. of
                 Electro-Commun., Tokyo, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "acyclic digraph; Acyclic Graphs; algorithm theory;
                 complexity; computational complexity; Computer
                 Metatheory--Computational Complexity; Computer Systems
                 Programming; Digraphs; Directed Graphs; directed
                 graphs; DL-complete set; DTOP; Mathematical
                 Techniques--Graph Theory; NL-complete set; Sorting;
                 sorting; Topological Sorting; topological sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gradel:1990:SIA,
  author =       "Erich Gr{\"a}del",
  title =        "Simple interpretations among complicated theories",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "235--238",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Basel",
  affiliationaddress = "Basel, Switz",
  classification = "721; 723; 921; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Math. Inst., Basel Univ., Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory--Computability and Decidability;
                 complexity results; complicated theories; Computational
                 Complexity; computational complexity; Computer
                 Metatheory; decidability; Decision Problems; decision
                 problems; exponential space upper bounds; formal logic;
                 interpretations; Mathematical Techniques; Mathematical
                 Theories; Quantified Propositional Temporal Logic;
                 quantified propositional temporal logic; Temporal
                 Logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grigg:1990:SMP,
  author =       "Ken Grigg and Serge Miguet and Yves Robert",
  title =        "Symmetric matrix-vector product on a ring of
                 processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "239--248",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lab de l'Informatique du Parallelisme LIP-IMAG",
  affiliationaddress = "Lyon, Fr",
  classification = "723; 731; 921; C4140 (Linear algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lab. de l'Inf. du Parallelisme LIP-IMAG, Ecole Normale
                 Sup{\'e}rieure de Lyon, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Computer Programming; Computer
                 Systems Programming--Multiprocessing Programs; Control
                 Systems; control systems; data allocation; efficient
                 algorithm; Mathematical Techniques; Matrix Algebra;
                 matrix algebra; Matrix-Vector Product; number of
                 processors; numerical experiments; parallel algorithms;
                 problem size; ring of processors; symmetric matrix;
                 Transputers; transputers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cimikowski:1990:FHC,
  author =       "Robert J. Cimikowski",
  title =        "Finding {Hamiltonian} cycles in certain planar
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "249--254",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "New Mexico State Univ",
  affiliationaddress = "Las Cruces, NM, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., New Mexico State Univ., Las
                 Cruces, NM, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Computer Programming--Algorithms;
                 Delaunary Triangulations; Delaunay triangulations;
                 Euclidean proximity graphs; Graph Theory; graph theory;
                 Hamiltonian Cycles; Hamiltonian cycles; inner
                 triangulation; interior face; linear-time algorithm;
                 Mathematical Techniques; Planar Graphs; planar graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1990:OAC,
  author =       "Maw Shang Chang and Nen-Fu Huang and Chuan-Yi Tang",
  title =        "An optimal algorithm for constructing oriented
                 {Voronoi} diagrams and geographic neighborhood graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "255--260",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung Cheng Univ",
  affiliationaddress = "Chiayi, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. of Comput. Sci. and Inf. Eng., Nat. Chung Cheng
                 Univ., Chiayi, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 computational geometry; Computer
                 Programming--Algorithms; Geographic Neighborhood
                 Graphs; geographic neighborhood graphs; Graph Theory;
                 graph theory; lower bound; Mathematical Techniques;
                 oriented Voronoi diagrams; Voronoi Diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hellerstein:1990:TCR,
  author =       "Lisa Hellerstein and Philip Klein and Robert Wilber",
  title =        "On the time-space complexity of reachability queries
                 for preprocessed graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "261--267",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "UC Berkeley",
  affiliationaddress = "Berkeley, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "California Univ., Berkeley, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bipartite Graphs; computational complexity;
                 computational geometry; Computer
                 Programming--Algorithms; directed bipartite graph;
                 Directed Graphs; directed graphs; graph problems; Graph
                 Theory; Mathematical Techniques; Preprocessed Graphs;
                 preprocessed graphs; reachability; Reachability
                 Queries; reachability queries; time-space complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dickerson:1990:FNN,
  author =       "Matthew T. Dickerson and R. Scot Drysdale",
  title =        "Fixed-radius near neighbors search algorithms for
                 points and segments",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "5",
  pages =        "269--273",
  day =          "28",
  month =        aug,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dep of Mathematics and Computer Science, Middlebury
                 Coll",
  affiliationaddress = "Middlebury, VT, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Middlebury, VT, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; computational
                 geometry; Computer Programming; data structure;
                 fixed-radius near neighbors search problem; graph
                 theory; points; Search Algorithms; search problems;
                 segments; Voronoi diagram; Voronoi Diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{VanGasteren:1990:CPD,
  author =       "A. J. M. {Van Gasteren} and G. Tel",
  title =        "Comments on {``On the proof of a distributed
                 algorithm''}: always-true is not invariant",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "277--279",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sun May 02 08:38:25 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Verjus:1987:PDA,Pettersson:1991:LEC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Utrecht Univ",
  affiliationaddress = "Utrecht, Neth",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; Computer Systems,
                 Digital --- Distributed; distributed algorithm;
                 Distributed Algorithms; distributed processing;
                 induction method; invariance proofs; Invariance Proofs;
                 program verification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shmoys:1990:AHK,
  author =       "David B. Shmoys and David P. Williamson",
  title =        "Analyzing the {Held-Karp} {TSP} bound. {A}
                 monotonicity property with application",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "281--285",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B10 (68Q25 90C35)",
  MRnumber =     "92g:90073",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "921; B0250 (Combinatorial mathematics); B0260
                 (Optimisation techniques); C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C1290
                 (Applications of systems theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "combinatorial mathematics; Held-Karp TSP bound; linear
                 program; linear programming; Mathematical Programming,
                 Linear; Mathematical Techniques; minimum spanning
                 trees; Minimum Spanning Trees; Monotonicity;
                 monotonicity property; node-degree constraints;
                 operations research; Operations Research; optimally
                 weighted 1-tree; subtour elimination constraints;
                 Traveling Salesman Problem; travelling salesman
                 problem; Trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mostowski:1990:AAS,
  author =       "A. W. Mostowski",
  title =        "Alternating automata with start formulas",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "287--290",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Gdansk",
  affiliationaddress = "Gdansk, Pol",
  classification = "721; 921; C1160 (Combinatorial mathematics); C4220
                 (Automata theory)",
  corpsource =   "Math. Inst., Gdansk Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Alternating Automata; alternating automata; Automata
                 Theory; automata theory; Boolean operations; infinite
                 trees; Mathematical Techniques --- Trees; Start
                 Formulas; start formulas; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Karner:1990:NTB,
  author =       "George Karner",
  title =        "A note on terminal balancing of algebraic systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "291--293",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Alcatel Austria-Elin Forschungzentrum",
  affiliationaddress = "Wien, Austria",
  classification = "721; 921; C4210 (Formal logic)",
  corpsource =   "Alcatel Austria-Elin Forschungszentrum, Wien,
                 Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebraic Systems; algebraic systems; Automata Theory;
                 context-free grammar; context-free grammars; Formal
                 Languages; formal languages; Mathematical Techniques
                 --- Algebra; positive semiring; series (mathematics);
                 Terminal Balancing; terminal balancing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yen:1990:WPD,
  author =       "Chain-Chin Yen and R. C. T. Lee",
  title =        "The weighted perfect domination problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "295--299",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. of Inf. Sci., Nat. Tsing Hua Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bipartite Graphs; bipartite graphs; Chordal Graphs;
                 chordal graphs; computational complexity; Computer
                 Programming --- Algorithms; Graph Theory; graph theory;
                 linear algorithm; Mathematical Techniques; NP-
                 complete; Trees; trees; trees (mathematics);
                 unweighted; Weighted Perfect Domination Problem;
                 weighted perfect domination problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aggarwal:1990:TLB,
  author =       "Alok Aggarwal and Tom Leighton",
  title =        "A tight lower bound for the train reversal problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "301--304",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4200
                 (Computer theory)",
  corpsource =   "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown
                 Heights, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computation theory; Computer Metatheory
                 --- Computational Complexity; Computer Programming;
                 simple recursive algorithm; sorting; tight lower bound;
                 Train Reversal Problem; train reversal problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wu:1990:AEH,
  author =       "Chwan-Hwa Wu and Chia-Jiu Wang and Heng-Ming Tai",
  title =        "Application of exponential hetero-associative memory
                 on frequency classifier",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "305--311",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Auburn Univ",
  affiliationaddress = "Auburn, AL, USA",
  classification = "723; C1230 (Artificial intelligence); C1250 (Pattern
                 recognition); C1320 (Stability)",
  corpsource =   "Dept. of Electr. Eng., Auburn Univ., AL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "cluttered signals; content-addressable storage; Data
                 Storage, Digital --- Associative; Exponential
                 Associative Memories; exponential correlation function;
                 exponential encoding scheme; exponential
                 hetero-associative memory; frequency classifier;
                 Frequency Classifiers; global minimum state;
                 Heteroassociative Memories; memory storage capacities;
                 neural nets; Neural Networks; pattern recognition;
                 stability",
  treatment =    "P Practical",
}

@Article{Sheu:1990:EPK,
  author =       "Jang-Ping Sheu and Jyh-Shyan Tang",
  title =        "Efficient parallel $k$ selection algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "313--316",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Taiwan",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Nat. Central Univ., Chungli,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computation Time; Computer Metatheory ---
                 Computational Complexity; Computer Programming;
                 Computer Systems Programming --- Multiprocessing
                 Programs; n-cube network; parallel algorithm; Parallel
                 Algorithms; parallel algorithms; parallel k selection
                 algorithm; Time Complexity; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wu:1990:SCA,
  author =       "Sun Wu and Udi Manber and Gene Myers and Webb Miller",
  title =        "{$O(NP)$} sequence comparison algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "317--323",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Arizona",
  affiliationaddress = "Tucson, AZ, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods)",
  corpsource =   "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational geometry; Computer
                 Programming; deletions; graph theory; insertions;
                 Longest Common Subsequence Problem; Mathematical
                 Techniques --- Graph Theory; O(NP) sequence comparison
                 algorithm; Sequence Comparison; shortest edit script;
                 Shortest Edit Script; subsequence; worst-case running
                 time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chin:1990:DCC,
  author =       "Andrew Chin",
  title =        "On the depth complexity of the counting functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "325--328",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oxford",
  affiliationaddress = "Oxford, Engl",
  classification = "721; 723; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Math. Inst., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean Circuits; Boolean circuits; Boolean functions;
                 Circuit Depth; circuit depth; communication complexity;
                 computational complexity; Computer Programming ---
                 Algorithms; Counting Functions; counting functions;
                 Depth Complexity; depth complexity; Logic Circuits;
                 parallel algorithms; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liu:1990:NGB,
  author =       "Zhen Liu",
  title =        "A Note on {Graham}'s Bound",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "1--5",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "INRIA Cent Sophia Antipolis",
  affiliationaddress = "Valbonne, Fr",
  classification = "722; 723; C4230 (Switching theory); C5470
                 (Performance evaluation and testing)",
  corpsource =   "INRIA Centre Sophia Antipolis, Valbonne, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems, Digital; Graham's bound;
                 Interprocessor Communication Delays; interprocessor
                 communication delays; Makespan; makespan;
                 Multiprocessing; multiprocessor interconnection
                 networks; multiprocessors; Parallel Processing;
                 parallel processing systems; performance evaluation;
                 precedence constraints; Scheduling; scheduling; tasks;
                 upper bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1990:OTP,
  author =       "Wen-Huei Chen and Ching-Sung Lu and Elben R. Brozovsky
                 and Jin-Tuu Wang",
  title =        "An optimization technique for protocol conformance
                 testing using multiple {UIO} sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "7--11",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Telecommunication Lab",
  affiliationaddress = "Taiwan",
  classification = "723; 921; C1180 (Optimisation techniques); C5470
                 (Performance evaluation and testing); C5620 (Computer
                 networks and techniques)",
  corpsource =   "Telecommun. Labs., Chung-Li, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Networks; Computer Programming--Algorithms;
                 Conformance Testing; Mathematical Techniques--Graph
                 Theory; multiple UIO sequences; multiple unique
                 input/output; optimisation; optimization technique;
                 performance evaluation; protocol conformance testing;
                 Protocol Testing; Protocols; protocols; Rural Chinese
                 Postman Algorithm; Rural Chinese Postman algorithm;
                 test sequence generation; transition graph; Transition
                 Graphs; U Graphs; Unique Input/Output Sequences",
  treatment =    "P Practical",
}

@Article{Jedrzejowicz:1990:IHS,
  author =       "Joanna J{\polhk{e}}drzejowicz",
  title =        "Infinite hierarchy of shuffle expressions over a
                 finite alphabet",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "13--17",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Gdansk",
  affiliationaddress = "Gdansk, Pol",
  classification = "721; C4210 (Formal logic)",
  corpsource =   "Inst. of Math., Gdansk Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; finite alphabet; Formal Languages;
                 formal languages; infinite hierarchy; Shuffle Closure
                 Operators; Shuffle Expressions; shuffle expressions;
                 Shuffle Operators; shuffle resistant coding",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1990:FMI,
  author =       "Haklin Kim",
  title =        "Finding a maximum independent set in a permutation
                 graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "19--23",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "92f:05090",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tennessee",
  affiliationaddress = "Martin, TN, USA",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math. and Comput. Sci., Tennessee Univ.,
                 Martin, TN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Cliques; Computer Programming; graph
                 theory; Independent Sets; Mathematical
                 Techniques--Graph Theory; Maximum Independent Set;
                 maximum independent set; O(n \log n) algorithm;
                 permutation graph; Permutation Graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dederichs:1990:SLM,
  author =       "Frank Dederichs and Rainer Weber",
  title =        "Safety and liveness from a methodological point of
                 view",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "25--30",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See comments
                 \cite{Abadi:1991:PLC,Dederichs:1991:RCM}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ M{\"u}nchen",
  affiliationaddress = "Munich, Ger",
  classification = "722; 723; C6110B (Software engineering techniques)",
  corpsource =   "Inst. f{\"u}r Inf. Tech. Univ., Munchen, West
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "characterizations; Computer Systems, Digital;
                 Distributed; distributed processing; distributed
                 systems; formal specification; Liveness; liveness;
                 methodological impacts; Safety; safety; specification",
  treatment =    "P Practical",
}

@Article{Wang:1990:TDP,
  author =       "Biing-Feng Wang and Gen-Huey Chen",
  title =        "Two-Dimensional processor array with a reconfigurable
                 bus system is at least as powerful as {CRCW} model",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "31--36",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C5440 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computation model; computational complexity; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 Concurrent Read Concurrent Write; CRCW model;
                 Multiprocessing; parallel processing; polymorphic-torus
                 network; Reconfigurable Bus; reconfigurable bus system;
                 Shared Memory Computers; shared-memory computer; two
                 dimensional processor array; VLSI implementation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Burris:1990:UCR,
  author =       "Stanley Burris and John Lawrence",
  title =        "Unification in commutative rings is not finitary",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "37--38",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "921; C4210 (Formal logic)",
  corpsource =   "Dept. of Pure Math., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Commutative Rings; commutative rings;
                 E-unification; equational theory CR; finitary;
                 Mathematical Techniques; rewriting systems; term
                 rewriting; theorem proving; Unification; unification
                 type; unitary",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fields:1990:FAM,
  author =       "Malcolm C. Fields and Greg N. Frederickson",
  title =        "A faster algorithm for the maximum weighted tardiness
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "39--44",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "723; 913; B0260 (Optimisation techniques); C1180
                 (Optimisation techniques)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming--Algorithms; convex programming;
                 faster algorithm; Job Scheduling; Maximum Weighted
                 Tardiness Problem; maximum weighted tardiness problem;
                 minimisation; minimizing; Precedence Constraints;
                 precedence constraints; Scheduling; scheduling; weight
                 functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldreich:1990:BBW,
  author =       "Oded Goldreich and Erez Petrank",
  title =        "The best of both worlds: guaranteeing termination in
                 fast randomized {Byzantine Agreement} protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "45--49",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion, Dep of Computer Science",
  affiliationaddress = "Haifa, Isr",
  classification = "722; 723; 922; C5470 (Performance evaluation and
                 testing); C5620 (Computer networks and techniques)",
  corpsource =   "Dept. of Comput. Sci., Technion, Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "average complexity; Byzantine Agreement; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 Distributed; distributed processing; fast randomized
                 Byzantine Agreement protocols; fault tolerant
                 computing; faulty processors; guaranteeing termination;
                 Probability--Random Processes; protocols; Randomized
                 Algorithms; Randomized Byzantine Agreement",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Qiu:1990:NDA,
  author =       "Ke Qiu and Henk Meijer",
  title =        "A note on diameter of acyclic directed hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "51--52",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "acyclic directed hypercubes; Acyclic Graphs;
                 acyclically oriented; chordless path; diameter;
                 Directed Graphs; directed graphs; Fibonacci number;
                 Graph Theory; Hypercubes; Mathematical Techniques;
                 undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bodlaender:1990:BES,
  author =       "Hans L. Bodlaender and Gerard Tel",
  title =        "Bit-optimal election in synchronous rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "1",
  pages =        "53--56",
  day =          "1",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Utrecht",
  affiliationaddress = "Utrecht, Neth",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C5620 (Computer networks and techniques)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bit Complexity; bit complexity; computational
                 complexity; computer networks; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 Distributed; Election Algorithm; election algorithm;
                 polynomial; Synchronous Rings; synchronous rings; time
                 complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hagerup:1990:INS,
  author =       "Torben Hagerup and Hong Shen",
  title =        "Improved nonconservative sequential and parallel
                 integer sorting",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "57--63",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, West Ger",
  classification = "723; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Fachbereich Inf., Saarlandes Univ., Saarbrucken, West
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer
                 Programming--Algorithms; Computer Systems Programming;
                 Computer Systems, Digital--Parallel Processing; Integer
                 Sorting; nonconservative sequential integer sorting;
                 Parallel Algorithms; parallel algorithms; parallel
                 integer sorting; parallel machines; Parallel Sorting;
                 search problems; Sorting; sorting; unit-cost EREW PRAM;
                 unit-cost RAM",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Biro:1990:OIR,
  author =       "Miklos Biro",
  title =        "Object-oriented interaction in resource constrained
                 scheduling",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "65--67",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Computer and Automation Inst",
  affiliationaddress = "Budapest, Hung",
  classification = "723; 912; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory); C6130B
                 (Graphics techniques)",
  corpsource =   "Comput. and Autom. Inst., Acad. of Sci., Budapest,
                 Hungary",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; computer graphics; Computer
                 Programming--Object Oriented Programming; graph
                 colouring; graph theory; Mathematical Techniques--Graph
                 Theory; object-oriented interaction; Operations
                 Research; presentation hardware; Resource Constrained
                 Scheduling; resource constrained scheduling;
                 Scheduling; scheduling; software; two-dimensional
                 bin-packing",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Slobodova:1990:OGD,
  author =       "Anna Slobodova",
  title =        "One-way globally deterministic synchronized
                 alternating finite automata recognize exactly
                 deterministic context-sensitive languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "69--72",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comenius Univ",
  affiliationaddress = "Bratislava, CSSR",
  classification = "721; 723; C4210 (Formal logic); C4220 (Automata
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Comenius Univ., Bratislava,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; computational complexity; Computer
                 Metatheory--Computational Complexity; Context Sensitive
                 Languages; context-sensitive languages; deterministic
                 context-sensitive languages; Finite Automata; finite
                 automata; globally deterministic synchronized
                 alternating finite automata; synchronized alternating
                 devices; Synchronized Alternation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vavasis:1990:QPN,
  author =       "Stephen A. Vavasis",
  title =        "Quadratic programming is in {NP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "73--77",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723; 921; B0260 (Optimisation techniques); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "combinatorial optimization; computational complexity;
                 Computer Metatheory--Computational Complexity;
                 economics; engineering design; game theory;
                 Mathematical Programming; NP Completeness; NP-complete;
                 NP-hard; optimization; Quadratic Programming; quadratic
                 programming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cai:1990:LBC,
  author =       "Jin-yi Cai",
  title =        "Lower bounds for constant-depth circuits in the
                 presence of help bits",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "79--83",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "721; 723; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean circuit; Boolean Circuits; Boolean function;
                 Boolean functions; computational complexity; Computer
                 Metatheory--Computational Complexity; Constant Depth
                 Circuits; constant-depth circuits; exponential lower
                 bound; help bits; Logic Circuits; lower bounds; parity
                 functions; PH; PSPACE",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1990:UBB,
  author =       "Jae Moon Lee and Jong Soo Park and Myunghwan Kim",
  title =        "An upper bound on buffer size for join operation using
                 nonclustered indexes",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "85--90",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Seoul, South Korea",
  classification = "723; C4250 (Database theory); C6160D (Relational
                 DBMS)",
  corpsource =   "Dept. of Electr. Eng., Korea Advanced Inst. of Sci.
                 and Technol., Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bipartite graph; Buffer Size; buffer size; Database
                 Systems; database theory; join operation; Join
                 Operations; joining attributes; Nonclustered Index;
                 nonclustered indexes; page connectivity graph;
                 Relational; relational databases; upper bound; vertex
                 cover",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lipton:1990:PIP,
  author =       "Richard J. Lipton and Arvin Park",
  title =        "The processor identity problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "91--94",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "722; 723; 922; C4240 (Programming and algorithm
                 theory); C5620 (Computer networks and techniques)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "choice coordination problem; common shared memory;
                 Computer Programming--Algorithms; Computer Systems
                 Programming--Multiprocessing Programs; Computer
                 Systems, Digital; encode; Multiprocessing;
                 multiprocessor coordination problems; mutual exclusion
                 problem; Parallel Algorithms; parallel algorithms;
                 Probabilistic Algorithms; probabilistic protocol;
                 Probability; Processor Identity Problem; processor
                 identity problem; protocols; shared memory; Shared
                 Memory Multiprocessors; software structures;
                 synchronisation; system hardware; unique identifiers",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Haldar:1990:OCC,
  author =       "Chandan Haldar and L. M. Patnaik",
  title =        "Oracle complexities for computational geometry of
                 semi-algebraic sets and {Voronoi} diagrams",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "95--102",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "723; 921; C1180 (Optimisation techniques); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Autom., Indian Inst. of
                 Sci., Bangalore, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic complexities; computational complexity;
                 computational geometry; Computer
                 Programming--Algorithms; Convex Hull; convex
                 programming; convexity; geometric properties; Geometry;
                 Mathematical Techniques; oracles; semi-algebraic sets;
                 Semialgebraic Sets; Voronoi Diagrams; Voronoi
                 diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Megson:1990:IMT,
  author =       "G. M. Megson and F. M. F. Gaston",
  title =        "Improved matrix triangularisation using a double
                 pipeline systolic array",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "2",
  pages =        "103--109",
  day =          "15",
  month =        oct,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Newcastle-Upon-Tyne",
  affiliationaddress = "Newcastle-Upon-Tyne, Engl",
  classification = "722; 723; 921; C1250 (Pattern recognition); C4140
                 (Linear algebra); C4240 (Programming and algorithm
                 theory); C5260B (Computer vision and picture
                 processing)",
  corpsource =   "Comput. Lab., Newcastle upon Tyne Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "cellular arrays; computation time; Computer Systems,
                 Digital; computerised picture processing; double
                 pipeline systolic array; latency; Mathematical
                 Techniques--Matrix Algebra; matrix algebra; matrix
                 triangularisation; Matrix Triangularization; parallel
                 algorithms; Pipeline Processing; Systolic Arrays",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1990:EAG,
  author =       "De-Lei Lee",
  title =        "Efficient address generation in a parallel processor",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "111--116",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "York Univ",
  affiliationaddress = "North York, Ont, Can",
  classification = "722; 723; C4140 (Linear algebra); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., York Univ., North York, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Address Generation; address generation; backward
                 diagonals; columns; computational complexity; Computer
                 Systems, Digital--Multiprocessing; conflict-free
                 access; Data Storage Units; forward diagonals; logic
                 gates; matrix; matrix algebra; Memory Access; memory
                 addresses; Memory Management; memory modules; memory
                 system; parallel access; parallel algorithms; parallel
                 generation; parallel processor; rows; sufficient",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1990:ASN,
  author =       "Jingde Cheng",
  title =        "An algebraic semantics of notional entailment logic
                 {Cn}",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "117--121",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kyushu Univ",
  affiliationaddress = "Fukuoka, Jpn",
  classification = "723; 921; C1110 (Algebra); C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci. and Commun. Eng., Kyushu Univ.,
                 Fukuoka, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebra; algebraic semantics; Algebraic Semantics;
                 Computer Metatheory; entailment lattices; formal logic;
                 Formal Logic; knowledge engineering; Mathematical
                 Techniques--Algebra; notional entailment logic;
                 Notional Entailment Logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tsalgatidou:1990:MAI,
  author =       "Aphrodite Tsalgatidou",
  title =        "Modelling and animating information systems dynamics",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "123--127",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "01 Pliroforiki",
  affiliationaddress = "Athens, Greece",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C6110B (Software engineering techniques); C6130B
                 (Graphics techniques); C7100 (Business and
                 administration)",
  corpsource =   "01 Pliroforiki, Athens, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "application domain policy; change-related; computer
                 animation; Computer Software--Software Engineering;
                 Computer Systems, Digital; Dynamic Modeling; explicit
                 modelling; flexible information systems; graphical
                 animation; Information Systems; information systems
                 dynamics; management information systems; Mathematical
                 Models; Mathematical Techniques--Petri Nets; modified
                 Petri net; object-oriented; object-oriented
                 programming; Petri net based model; Petri nets;
                 requirements specifications; rule-based model; signals;
                 software engineering; validation",
  treatment =    "P Practical",
}

@Article{Li:1990:FUM,
  author =       "Shuo-Yen Robert Li",
  title =        "On full utilization of multi-channel capacity with
                 priority protocol",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "129--133",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Chinese Univ of Hong Kong",
  affiliationaddress = "Shatin, Hong Kong",
  classification = "723; B6150 (Communication system theory); B6210L
                 (Computer communications); C5620 (Computer networks and
                 techniques)",
  corpsource =   "Dept. of Inf. Eng., Chinese Univ. of Hong Kong,
                 Shatin, Hong Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Access Protocols; communication channel; Computer
                 Networks; Data Transmission; intended messages; message
                 selection; multi-channel capacity; multi-user conflict;
                 Multiuser Channels; necessary and sufficient;
                 predetermined priority ordering; priority protocol;
                 Priority Protocols; Protocols; protocols; slotted
                 access protocol; transmission session",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sanchis:1990:CTC,
  author =       "Laura A. Sanchis",
  title =        "On the complexity of test case generation for
                 {NP}-hard problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "135--140",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Colgate Univ",
  affiliationaddress = "Hamilton, NY, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Colgate Univ., Hamilton, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Approximation Algorithms; Computational Complexity;
                 computational complexity; Computer Metatheory; Computer
                 Programming--Algorithms; NP Hard Problems; NP-hard
                 problems; NP=co-NP; Test Case Generation; test case
                 generation; test instances",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kollias:1990:OEO,
  author =       "John G. Kollias and Yannis Manolopoulos and Christos
                 H. Papadimitriou",
  title =        "The optimum execution order of queries in linear
                 storage",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "141--145",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Technical Univ of Athens",
  affiliationaddress = "Athens, Greece",
  classification = "723; 921; C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Nat. Tech. Univ. of Athens, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer
                 Programming--Algorithms; Database Systems; file
                 positions; file queries; file traversal; linear
                 storage; Mathematical Programming, Linear;
                 minimisation; optimum execution order; Query
                 Processing; read head; storage management; total
                 distance; Traveling Salesman Problem; traveling
                 salesman problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Larmore:1990:OAU,
  author =       "Lawrence L. Larmore",
  title =        "An optimal algorithm with unknown time complexity for
                 convex matrix searching",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "147--151",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Riverside, CA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4140 (Linear algebra);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., California Univ.,
                 Riverside, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; asymptotic class; asymptotic time
                 complexity; computational complexity; Computer
                 Metatheory--Computational Complexity; Computer
                 Programming; convex matrix searching; Convex Matrix
                 Searching Problem; decision theory; decision tree
                 computation model; dynamic programming; lower bound;
                 Mathematical Programming, Dynamic; matrix algebra;
                 minimum height decision tree; optimal algorithm; Search
                 Algorithms; search problems; trees (mathematics);
                 unknown time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1990:FPA,
  author =       "R. Lin and S. Olariu",
  title =        "A fast parallel algorithm to recognize partitionable
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "153--157",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dep of Computer Science",
  affiliationaddress = "Geneseo, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Geneseo, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; cographs; Complement Reducible Graphs;
                 complement-reducible graphs; computational complexity;
                 Computer Metatheory--Computational Complexity; Computer
                 Programming; Computer Systems
                 Programming--Multiprocessing Programs; edges; EREW
                 parallel random access machine; Graph Recognition;
                 graph theory; Mathematical Techniques--Graph Theory;
                 parallel algorithm; Parallel Algorithms; parallel
                 algorithms; Partionable Graphs; partitionable graphs;
                 recognition algorithm; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paulik:1990:WAG,
  author =       "A. Paulik",
  title =        "Worst-case analysis of a generalized heapsort
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "3",
  pages =        "159--165",
  day =          "1",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst f{\"u}r Numerische und Angewandte Mathematik",
  affiliationaddress = "G{\"o}ttingen, West Ger",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Inst. f{\"u}r Numerische und Angewandte Math.,
                 G{\"o}ttingen, West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; comparisons; computational complexity;
                 Computer Programming; Computer Systems
                 Programming--Sorting; d-heap; d-heapsort; generalized
                 heapsort algorithm; Heapsort Algorithms; movements;
                 sorting; sorting algorithm; time requirement function;
                 weighted sum; worst-case analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teo:1990:PAG,
  author =       "Kim-Heng Teo and Tai-Ching Tuan",
  title =        "Performance analysis of greedy heuristic to find a
                 minimum total-jogs layout for river routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "167--170",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oklahoma",
  affiliationaddress = "Norman, OK, USA",
  classification = "713; 723; 921; B0260 (Optimisation techniques);
                 B1130B (Computer-aided circuit analysis and design);
                 C1180 (Optimisation techniques); C7410D (Electronic
                 engineering)",
  corpsource =   "Sch. of Electr. Eng. and Comput. Sci., Oklahoma Univ.,
                 Norman, OK, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "circuit layout CAD; Computer Aided Design; Computer
                 Programming--Algorithms; dynamic programming; dynamic
                 programming algorithm; electrical resistance; greedy
                 heuristic; Greedy Heuristics; Integrated Circuits,
                 VLSI; Integrated Circuits--Layout; Mathematical
                 Programming, Dynamic; minimum total-jogs layout;
                 performance analysis; performance evaluation; River
                 Routing; river routing; Total Jogs Layout; VLSI",
  treatment =    "P Practical",
}

@Article{Barbosa:1990:BVN,
  author =       "Valmir C. Barbosa",
  title =        "Blocking versus nonblocking interprocess
                 communication. {A} note on the effect on concurrency",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "171--175",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Federal do Rio de Janeiro",
  affiliationaddress = "Rio de Janeiro, Braz",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory); C5620
                 (Computer networks and techniques)",
  corpsource =   "Univ. Federal do Rio de Janeiro, Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "blocking interprocess communications; computational
                 complexity; Computer Systems, Digital; Concurrency;
                 concurrency; Distributed; distributed computation;
                 distributed processing; Edge Colouring; fairness; Graph
                 Coloring; graph colouring; Interprocess Communication;
                 k-capacity channels; Mathematical Techniques--Graph
                 Theory; nonblocking interprocess communication;
                 synchronous model",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Buning:1990:ESP,
  author =       "Hans Kleine B{\"u}ning",
  title =        "Existence of simple propositional formulas",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "177--182",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ GH",
  affiliationaddress = "Duisburg, West Ger",
  classification = "723; C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110 (Systems analysis and
                 programming)",
  corpsource =   "FB 11-Praktische Inf., Univ. GH, Duisburg, West
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer
                 Metatheory--Programming Theory; Computer Programming;
                 definite Horn-formula; equivalent Horn-formula; formal
                 logic; Horn Formulas; Logic Programming; logic
                 programming; NP-completeness; propositional formulas;
                 quadratic formula; Quadratic Formulas; Renaming;
                 renaming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Qian:1990:ASD,
  author =       "Xiaolei Qian",
  key =          "Qian",
  title =        "An Axiom System for Database Transactions",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "183--189",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6110B (Software engineering techniques); C6160
                 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "axiom system; Axion Systems; complete Hoare axiom
                 system; Computer Metatheory--Programming Theory;
                 Computer Programming--Theory; data manipulation
                 language; database integrity; database management
                 systems; Database Programming; Database Systems;
                 database transactions; databases; first-order definable
                 database updates; formal semantics; formal
                 specification; optimization; program correctness;
                 Program Correctness; Program Specification; program
                 specifications; program verification; reasoning;
                 synthesis; Theory; transaction processing; transaction
                 verification; verification",
  owner =        "robyn",
  treatment =    "P Practical",
}

@Article{Woeginger:1990:SST,
  author =       "Gerhard Woeginger",
  title =        "A simple solution to the two paths problem in planar
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "191--192",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst f{\"u}r Mathematik",
  affiliationaddress = "Graz, Austria",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. f{\"u}r Math. B, Tech. Univ. Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming--Algorithms; Graph Theory; graph
                 theory; Mathematical Techniques; Planar Graphs; planar
                 graphs; Two Paths Problem; two paths problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dijkstra:1990:MFR,
  author =       "Edsger W. Dijkstra",
  title =        "Making a fair roulette from a possibly biased coin",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "193--193",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "fair roulette; game theory; possibly biased coin;
                 probabilities; probability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramesh:1990:CMP,
  author =       "S. Ramesh",
  title =        "On the completeness of modular proof systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "195--201",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B70 68Q55)",
  MRnumber =     "92c:68128",
  MRreviewer =   "Gabriel Ciobanu",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Bombay, India",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6110B (Software engineering techniques); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Bombay, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complete proof systems; completeness; compositional
                 proof system; Computer Programming Languages;
                 correctness of programs; logical formulae; Modular
                 Proof Systems; modular proof systems; program
                 verification; programming languages; Proof Systems;
                 syntax-directed proof system; Theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Makinen:1990:GIP,
  author =       "Erkki Makinen",
  title =        "The grammatical inference problem for the {Szilard}
                 languages of linear grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "203--206",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tampere",
  affiliationaddress = "Tampere, Finl",
  classification = "721; 723; C1230 (Artificial intelligence); C4210
                 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Tampere Univ., Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Computer Programming--Algorithms;
                 Context Free Grammars; grammars; Grammatical Inference;
                 grammatical inference problem; inference mechanisms;
                 Linear Grammars; linear grammars; set union problem;
                 Szilard Languages; Szilard languages; time complexity;
                 zero-reversible languages",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Falkowski:1990:PR,
  author =       "Bernd-J{\"u}rgen Falkowski",
  title =        "Perceptrons revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "207--213",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Datex AI",
  affiliationaddress = "M{\"u}nchen, West Ger",
  classification = "723; C1230 (Artificial intelligence); C5220
                 (Computer architecture)",
  corpsource =   "Datex AI, Gesellschaft f{\"u}r Angewandte Kunstliche
                 Intelligenz mbH, Munchen, West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "back propagation learning algorithm; computer
                 architecture; Group Invariance Theorem; group
                 invariance theorem; multilayer networks; neural nets;
                 Neural Networks; neural networks; Perceptrons;
                 perceptrons",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kutylowski:1990:RSO,
  author =       "Miros{\l}aw Kuty{\l}owski",
  title =        "Remarks on sorting and one-way multihead finite
                 automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "215--218",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05 (68Q15 68Q68)",
  MRnumber =     "92e:68042",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst f{\"u}r Theoretische Informatik",
  affiliationaddress = "Darmstadt, West Ger",
  classification = "721; 723; C4220 (Automata theory); C6130 (Data
                 handling techniques)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., Tech. Hochschule Darmstadt,
                 West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "1-MFA; Automata Theory; Computer Systems
                 Programming--Sorting; Finite Automata; finite automata;
                 linear time; low complexity; Multihead Automata;
                 one-way multihead finite automata; sorting",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vyskoc:1990:MBR,
  author =       "Jozef Vyskoc",
  title =        "Making bubblesort recursive",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "219--220",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Slovak Acad of Sciences",
  affiliationaddress = "Bratislava, Czech",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Comput. Center, Slovak Acad. of Sci., Bratislava,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bubblesort; bubblesort algorithm; computational
                 complexity; Computer Programming--Algorithms; Computer
                 Systems Programming; mergesort algorithms; performance;
                 Sorting; sorting; Sorting Algorithms; sorting
                 algorithms; time complexities",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1990:PSP,
  author =       "Hyoung Joong Kim and Jang Gyu Lee",
  title =        "Partial sum problem mapping into a hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "221--224",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kangwon Natl Univ",
  affiliationaddress = "Korea",
  classification = "723; B6120B (Codes); C4190 (Other numerical
                 methods); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Control and Instrum. Eng., Kangwon Nat.
                 Univ., Chooncheon, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming--Algorithms; Computer Systems
                 Programming; contention-free; encoding; hypercube
                 mapping method; Hypercubes; interprocess
                 communications; Multiprocessing Programs; nodes;
                 Parallel Algorithms; parallel algorithms; Partial Sum
                 Problem; partial sum problem; regular communication;
                 routing algorithm; unique reflected Gray code",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hur:1990:SS,
  author =       "Jin Ho Hur and Kilnam Chon",
  title =        "Self and selftype",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "225--230",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Korea",
  classification = "723; C6110 (Systems analysis and programming); C6120
                 (File organisation); C6140D (High level languages)",
  corpsource =   "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and
                 Technol., Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "compile time; Computer Programming Languages; Computer
                 Programming--Object Oriented Programming; data
                 structures; enclosing code block; high level languages;
                 inheritance; Object Oriented Languages; object oriented
                 languages; object-oriented programming; pseudo
                 constant; self; Selftype; selftype; static type
                 checking; Type Checking",
  treatment =    "P Practical",
}

@Article{Damaschke:1990:DCC,
  author =       "Peter Damaschke and Haiko M{\"u}ller and Dieter
                 Kratsch",
  title =        "Domination in convex and chordal bipartite graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "231--236",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "92d:68061",
  MRreviewer =   "Andreas Brandst{\"a}dt",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Friedrich-Schiller-Univ",
  affiliationaddress = "Jena, Ger",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Friedrich-Schiller-Univ., Jena, East Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3SAT reduction; Algorithms; algorithms; Bipartite
                 Graphs; chordal bipartite graphs; Chordal Graphs;
                 computational complexity; Computer Programming; convex
                 bipartite graphs; Convex Graphs; Domination Problems;
                 domination problems; Graph Algorithms; graph theory;
                 independent dominating set; Mathematical
                 Techniques--Graph Theory; NP-complete; polynomial time;
                 total dominating set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Martin:1990:NDO,
  author =       "Ursula Martin",
  title =        "A note on division orderings on strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "237--240",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Royal Holloway and Bedford New Coll",
  affiliationaddress = "Egham, Engl",
  classification = "721; C4210 (Formal logic)",
  corpsource =   "Dept. of Comp. Sci., Holloway and Bedford New Coll.,
                 Egham, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Division Orderings; Formal Languages;
                 formal languages; lexicographic ordering; Orderings on
                 Strings; permutations; relabelling; String Orderings;
                 strings; sufficient condition; tame; total division
                 orderings; two letter alphabets; word",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sheu:1990:EAC,
  author =       "Jang-Ping Sheu and Zen-Fu Chiang",
  title =        "Efficient allocation of chain-like task on chain-like
                 network computers",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "241--245",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Chungli, Taiwan",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6150J (Operating systems)",
  corpsource =   "Dept. of Electr. Eng., Nat. Central Univ., Chungli,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; allocation; chain-like network computers;
                 chain-like task; Chainlike Computer Networks; Chainlike
                 Tasks; computational complexity; Computer
                 Programming--Algorithms; Computer Systems Programming;
                 Computer Systems, Digital--Distributed; constraint
                 relaxation; modules; Multiprocessing Programs; resource
                 allocation; Task Allocation; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Damm:1990:PCD,
  author =       "Carsten Damm",
  title =        "Problems complete for {$\oplus L$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "247--250",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Humboldt-Univ zu Berlin",
  affiliationaddress = "Berlin, Ger",
  classification = "721; C4210 (Formal logic); C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Sektion Math., Humboldt-Univ. zu Berlin, East
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; complete; computational complexity;
                 Computer Metatheory--Computational Complexity; Cook
                 class; DET; determinants; F/sub 2/-analogon; Formal
                 Languages; formal languages; languages; logarithmic
                 space bounded Turing machines; natural problems; NC/sup
                 1/-reductions; nondeterministic; Parity Acceptance;
                 parity-acceptance; Turing Machines; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1990:EDA,
  author =       "Siu Wing Cheng and Ravi Janardan",
  title =        "Efficient dynamic algorithms for some geometric
                 intersection problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "251--258",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., MN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 Dynamic Algorithms; dynamic algorithms; fixed point;
                 fixed slope; geometric intersection; Geometric
                 Intersection Problems; isothetic hyper-rectangles;
                 linear-space solutions; logarithmic factor;
                 Mathematical Techniques--Geometry; nonintersecting
                 segments; orthogonal segment intersection search;
                 plane; point enclosure problem; query segment; set;
                 subset; supporting line; update time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gyssens:1990:HCN,
  author =       "Marc Gyssens and Jan Paredaens and Dirk {Van Gucht}",
  title =        "On a hierarchy of classes for nested databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "259--266",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Limburg",
  affiliationaddress = "Limburg, Belg",
  classification = "721; 723; 921; C4250 (Database theory); C6160D
                 (Relational DBMS)",
  corpsource =   "Limburg Univ., Diepenbeek, Belgium",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic operations; Automata Theory--Computability
                 and Decidability; Closure Properties; closure
                 properties; Computer Programming--Algorithms; Database
                 Systems; database theory; decidable; flat relational
                 model; Hierarchical Nested Relations; hierarchical
                 nested relations; hierarchy; Mathematical
                 Techniques--Algebra; membership; Nested Databases;
                 nested databases; nested relational model;
                 normalization-lossless relations; Relational;
                 relational databases; restricted classes; restructuring
                 operators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Makarov:1990:SFA,
  author =       "O. M. Makarov",
  title =        "On the synthesis of fast algorithms for signal
                 processing",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "267--272",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst of Biology of the South Seas",
  affiliationaddress = "Sevastopol, USSR",
  classification = "723; 921; C1260 (Information theory); C4140 (Linear
                 algebra); C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. of Biol. of the South Seas, Sevastopol, USSR",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Computer Programming--Algorithms;
                 Convolution; digital signal processing; Digital
                 Techniques; Fast Algorithms; fast algorithms;
                 Mathematical Techniques--Matrix Algebra; Mathematical
                 Transformations; matrices; matrix algebra;
                 multiplication; rows; Signal Processing; signal
                 processing; synthesis; transformations; vector",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dublish:1990:SCS,
  author =       "P. Dublish",
  title =        "Some comments on the subtree isomorphism problem for
                 ordered trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "5",
  pages =        "273--275",
  day =          "1",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Inf., Hildesheim Univ., West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; linear time algorithms;
                 rooted ordered trees; subtree isomorphism; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ghosh:1990:OAC,
  author =       "Subir Kumar Ghosh and Anil Maheshwari",
  title =        "An optimal algorithm for computing a minimum nested
                 nonconvex polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "277--280",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tata Inst of fundamental Research",
  affiliationaddress = "Bombay, India",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4290 (Other computer theory)",
  corpsource =   "Tata Inst. of Fundamental Res., Bombay, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computational Geometry;
                 computational geometry; Computer Programming;
                 Mathematical Techniques --- Geometry; minimum nested
                 nonconvex polygon; nested polygon; Nested Polygons;
                 Nonconvex Polygons; optimal algorithm; Optimization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kocsis:1990:RCR,
  author =       "F. Kocsis and J. F. B{\"o}hme",
  title =        "Rotation-based computations for ray-tracing
                 second-order surfaces and curves",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "281--283",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ruhr Univ Bochum",
  affiliationaddress = "Bochum, West Ger",
  classification = "723; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory); C6130B (Graphics techniques)",
  corpsource =   "Dept. of Electr. Eng., Ruhr Univ., Bochum, West
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity; computational geometry; computer graphics;
                 Computer Graphics; curves; Curves; form factor
                 determination; geometrical optics; graphics;
                 intersection; intersection equation; Quadric Surfaces;
                 ray-tracing; rotation-based arithmetic; second-order
                 curve; second-order surfaces; Surfaces; visibility
                 computations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brogi:1990:HRL,
  author =       "Antonio Brogi and Evelina Lamma and Paola Mello",
  title =        "Hypothetical reasoning in logic programming. {A}
                 semantic approach",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "285--291",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "723; C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "completeness; computational linguistics; Computer
                 Programming; Computer Programming Languages; extended
                 language; Hypothetical Reasoning; hypothetical
                 reasoning; inference mechanisms; Logic Programming;
                 logic programming; logic theories; model theory;
                 soundness; Theory Composition Operator; theory
                 composition operator",
  treatment =    "P Practical",
}

@Article{Fulop:1990:EPU,
  author =       "Z. F{\"u}l{\"o}p and S. V{\'a}gv{\"o}lgyi",
  title =        "The emptiness problem is undecidable for domains of
                 partial monadic $2$-modular tree transformations",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "293--296",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hungarian Acad of Sciences",
  affiliationaddress = "Szeged, Hung",
  classification = "721; 921; C4220 (Automata theory)",
  corpsource =   "Hungarian Acad. of Sci., Szeged, Hungary",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "automata theory; Automata Theory; Computability and
                 Decidability; decidability; emptiness problem;
                 Emptiness Problem; Mathematical Techniques --- Trees;
                 Modular Tree Transducers; partial monadic 2-modular
                 tree transformations; post correspondence problem;
                 string transducers; tree transducers; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoogerwoord:1990:CDC,
  author =       "Rob R. Hoogerwoord",
  title =        "A calculational derivation of the {CASOP} algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "297--299",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; associativity; Casop Algorithm; CASOP
                 algorithm; Computer Programming; formal derivation;
                 formula manipulation; functional programming;
                 Mathematical Techniques --- Operators; programming
                 theory; Recurrence Relations; recurrence relations;
                 sequential programming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matsliach:1990:PAF,
  author =       "Gabriel Matsliach",
  title =        "Performance analysis of file organizations that use
                 multi-bucket data leaves",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "301--310",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion - Israel Inst of Technology",
  affiliationaddress = "Haifa, Israel",
  classification = "723; C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "average disk space utilization; Data Processing; Data
                 Structures; data structures; file organisation; File
                 Organization; file organizations; insert operations;
                 multi-bucket data leaves; multibucket data leaves;
                 Multibucket Leaves; overflow bucket; performance
                 evaluation",
  treatment =    "P Practical",
}

@Article{Salomaa:1990:IPL,
  author =       "Kai Salomaa and Sheng Yu",
  title =        "The immortality problem for {Lag} systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "311--315",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (03D05 03D40 68Q80)",
  MRnumber =     "92g:68074",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Turku",
  affiliationaddress = "Turku, Finl",
  classification = "721; C4220 (Automata theory)",
  corpsource =   "Dept. of Math., Turku Univ., Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Cellular Automata; cellular automata;
                 Computability and Decidability; decidability; finite
                 automata; Immortality Problem; immortality problem; Lag
                 Systems; Lag systems; Tag systems; undecidability
                 property",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DiBattista:1990:BGU,
  author =       "Giuseppe {Di Battista} and Wei-Ping Liu and Ivan
                 Rival",
  title =        "Bipartite graphs, upward drawings, and planarity",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "317--322",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Roma `La Sapienza'",
  affiliationaddress = "Roma, Italy",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Roma Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; automatic graph layout; Automatic
                 Graph Layout; bipartite digraph; Bipartite Graphs;
                 Computer Programming --- Algorithms; graph theory;
                 Graph Theory; Mathematical Techniques; ordered sets;
                 Ordered Sets; Planar Graphs; planarity; upward
                 drawings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1990:PAS,
  author =       "Sung Kwon Kim",
  title =        "Parallel algorithms for the segment dragging problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "6",
  pages =        "323--327",
  day =          "15",
  month =        dec,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington",
  affiliationaddress = "Seattle, WA, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4290 (Other computer theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 EREW PRAM; geometric problem; Mathematical Techniques
                 --- Geometry; parallel algorithm; Parallel Algorithms;
                 parallel algorithms; query vertical line segment;
                 Segment Dragging; segment dragging problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1991:MRI,
  author =       "Chung-Kuo Chang and M. G. Gouda",
  title =        "On the minimum requirements for independent recovery
                 in distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "1--7",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "722; 723; C5620 (Computer networks and techniques)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computer networks; Computer Programming--Algorithms;
                 Computer Systems, Digital; distributed processing;
                 Distributed Systems; distributed systems; Fault
                 Tolerant Capability; Independent Recovery; independent
                 recovery; minimum requirements; necessary and
                 sufficient conditions; single machine failure",
  treatment =    "P Practical",
}

@Article{Zhang:1991:OCD,
  author =       "Xubo Zhang",
  title =        "Overlap closures do not suffice for termination of
                 general term rewriting systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "9--11",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Eng. and Sci., Case Western Reserve
                 Univ., Cleveland, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "general term rewriting systems; nonterminating; open
                 problems; overlap closures; rewriting systems;
                 termination; trivial overlap closures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chaudhuri:1991:SLC,
  author =       "Soma Chaudhuri and Richard E. Ladner",
  title =        "Safety and liveness of $\omega$-context-free
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "13--20",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "92e:68092",
  MRreviewer =   "Zdzis{\l}aw Grodzki",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington",
  affiliationaddress = "Seattle, WA, USA",
  classification = "721; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Context Free Languages; context-free
                 languages; liveness; Liveness; omega-context-free
                 languages; safety; Safety; sufficient conditions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Olariu:1991:OGH,
  author =       "Stephan Olariu",
  title =        "An optimal greedy heuristic to color interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "21--25",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; color interval graphs; Computer
                 Programming; Graph Coloring; graph colouring; Greedy
                 Heuristics; Interval Graphs; linear order; Mathematical
                 Techniques--Graph Theory; optimal greedy heuristic;
                 vertex set",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kann:1991:MBD,
  author =       "Viggo Kann",
  title =        "Maximum bounded $3$-dimensional matching is {MAX
                 SNP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "27--35",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Royal Inst of Technology",
  affiliationaddress = "Stockholm, Swed",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "R. Inst. of Technol., Stockholm, Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "combinatorial mathematics; Computational Complexity;
                 computational complexity; Computer Metatheory; Matching
                 Problems; Mathematical Techniques--Combinatorial
                 Mathematics; max SNP Hardness; MAX SNP-complete;
                 maximum bounded 3-dimensional matching; maximum
                 covering; occurrences",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Manolopoulos:1991:SDD,
  author =       "Yannis Manolopoulos and Athina Vakali",
  title =        "Seek distances in disks with two independent heads per
                 surface",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "37--42",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aristotelian Univ of Thessaloniki",
  affiliationaddress = "Thessaloniki, Greece",
  classification = "722; 723; 913; C5320C (Storage on moving magnetic
                 media)",
  corpsource =   "Dept. of Electr. Eng., Aristotelian Univ. of
                 Thessaloniki, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Operating Systems; Data Storage Units;
                 magnetic disc storage; scheduling; Seek Distances;
                 single-headed disk systems; two headed disk systems;
                 Two-Headed Disk Systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sarkar:1991:MSB,
  author =       "U. K. Sarkar and P. P. Chakrabarti and S. Ghose and S.
                 C. {De Sarkar}",
  title =        "Multiple stack branch and bound",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "43--48",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kharagpur, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Kharagpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximate solution; Best First Search;
                 Branch and Bound Algorithms; combinatorial mathematics;
                 Computer Programming; Data Processing--Data Structures;
                 data structures; Euclidean traveling salesman problem;
                 Mathematical Programming, Linear; multiple stack branch
                 and bound algorithm; multiple stack data structure;
                 operations research; Search Methods; Traveling Salesman
                 Problem",
  treatment =    "P Practical",
}

@Article{Campbell:1991:MVG,
  author =       "Douglas Campbell and John Higgins",
  title =        "Minimal visibility graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "49--53",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also note \cite{Shen:1993:NMV}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Brigham Young Univ",
  affiliationaddress = "Provo, UT, USA",
  classification = "921; C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods)",
  corpsource =   "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Geometry; computational geometry; Graph
                 Theory; graph theory; Mathematical Techniques; minimum
                 visibility graphs; nonintersecting line segments;
                 Visibility Graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yu:1991:TRG,
  author =       "Bin Yu and Xinggang Lin and Youshou Wu",
  title =        "The tree representation of the graph used in binary
                 image processing",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "1",
  pages =        "55--59",
  day =          "10",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tsinghua Univ",
  affiliationaddress = "Beijing, China",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1250
                 (Pattern recognition); C6120 (File organisation)",
  corpsource =   "Dept. of Electron. Eng., Tsinghua Univ., Beijing,
                 China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary image processing; Binary Trees; Data
                 Processing--Data Structures; data structures; graph;
                 Image Processing; line adjacency graph; Line Adjacency
                 Graphs; Mathematical Techniques--Trees; picture
                 processing; pruning; storing; traversing; tree
                 representation; trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Litovsky:1991:PFL,
  author =       "Igor Litovsky",
  title =        "Prefix-free languages as $\omega$-generators",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "61--65",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "92c:68110",
  MRreviewer =   "Pascal Weil",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "U.R.A. 1304 du C.N.R.S.,",
  affiliationaddress = "Talence, Fr",
  classification = "721; 723; C4210 (Formal logic)",
  corpsource =   "Lab. Bordelais de Recherche en Inf., CNRS, Talence,
                 France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Computer Programming --- Algorithms;
                 formal languages; Formal Languages; omega-generators;
                 Omega-Generators; Prefix Free Languages; prefix-free
                 languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luccio:1991:APU,
  author =       "Fabrizio Luccio and Andrea Pietracaprina and Geppino
                 Pucci",
  title =        "Analysis of Parallel Uniform Hashing",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "67--69",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "723; C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; Data
                 Processing; file organisation; File Organization; Hash
                 Tables; hash tables; Parallel Algorithms; parallel
                 algorithms; Parallel Uniform Hashing; parallel uniform
                 hashing; performance; Ph-step; PRAM; shared memory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Snyder:1991:LBR,
  author =       "Timothy Law Snyder",
  title =        "Lower bounds for rectilinear {Steiner} trees in
                 bounded space",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "71--74",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "92b:68036a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Snyder:1991:CLB}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgetown Univ",
  affiliationaddress = "Washington, DC, USA",
  classification = "921; C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods)",
  corpsource =   "Dept. of Comput. Sci., Georgetown Univ., Washington,
                 DC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bounded space; computational geometry; d-cube;
                 Generalized Hanan Theorem; lower bounds; Mathematical
                 Techniques; Minimal Rectilinear Steiner Trees;
                 rectilinear Steiner trees; Steiner Trees; total weight;
                 Trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Handley:1991:SED,
  author =       "C. C. Handley",
  title =        "A space efficient distributive sort",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "75--78",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Otago",
  affiliationaddress = "Dunedin, NZ",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Otago Univ., Dunedin, New
                 Zealand",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Cheetah Sort; Cheetah Sort algorithm; Clocksort;
                 computational complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming; Distributive
                 Sorting; MSDOS; Pascal; Sorting; sorting; space
                 efficient distributive sort; Uniform Sort",
  treatment =    "P Practical",
}

@Article{Tamassia:1991:IRM,
  author =       "Roberto Tamassia",
  title =        "An incremental reconstruction method for dynamic
                 planar point location",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "79--83",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "723; 921; C4190 (Other numerical methods); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational Geometry; computational
                 geometry; Computer Programming; data structures;
                 dynamic planar point location; incremental
                 reconstruction method; Mathematical Techniques ---
                 Geometry; Planar Point Location; Point Location; query;
                 smooth nondecreasing integer function; static point
                 location data structures; Triangulation;
                 triangulations; update time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tanaka:1991:DAS,
  author =       "Yoshihiro Tanaka",
  title =        "A dual algorithm for the satisfiability problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "85--89",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Central Research Inst of Electric Power Industry",
  affiliationaddress = "Tokyo, Jpn",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Central Res. Inst. of Electr. Power Ind., Tokyo,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; combinatorial mathematics; computational
                 complexity; Computer Metatheory --- Computational
                 Complexity; Computer Programming; Davis--Putnam
                 procedure; dual algorithm; Dual Algorithms; dual
                 disjunctive form; Karnaugh Maps; Orthogonalization;
                 orthogonalization; preconditioning; SAT;
                 Satisfiability; satisfiability problem;
                 unsatisfiability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Beigel:1991:PPT,
  author =       "Richard Beigel and Lane A. Hemachandra and Gerd
                 Wechsung",
  title =        "Probabilistic polynomial time is closed under parity
                 reductions",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "91--94",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Yale Univ",
  affiliationaddress = "New Haven, CT, USA",
  classification = "723; 922; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity classes; Computational Complexity;
                 computational complexity; Computer Metatheory; Parity
                 Reductions; parity reductions; polynomials;
                 Probabilistic Polynomial Time; probabilistic polynomial
                 time; Probability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonWright:1991:PIR,
  author =       "J. {von Wright}",
  title =        "Program inversion in the refinement calculus",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "95--100",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Swedish Sch of Economics and Business Education",
  affiliationaddress = "Vasa, Finl",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6110B (Software engineering techniques)",
  corpsource =   "Swedish Sch. of Econ. and Bus. Educ., Vasa, Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "angelic nondeterminism; calculational method; Computer
                 Metatheory; Computer Programming --- Theory; formal
                 specification; program inversion; Program Inversion;
                 programming theory; Programming Theory; refinement
                 calculus; Refinement Calculus",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gibbons:1991:BBT,
  author =       "Alan Gibbons and Ridha Ziani",
  title =        "The balanced binary tree technique on mesh-connected
                 computers",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "101--109",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Warwick",
  affiliationaddress = "Coventry, Engl",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic expressions; arithmetic expressions;
                 Balanced Binary Tree Technique; balanced binary tree
                 technique; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; Computer Systems, Digital; H-tree approach;
                 input-driven languages; Mesh Connected Computers;
                 mesh-connected computers; Multiprocessing; P-RAM model;
                 parallel algorithm design; Parallel Algorithms;
                 parallel algorithms; parallel computation; parsing
                 expressions; random-access storage; trees
                 (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{He:1991:EPA,
  author =       "Xin He",
  title =        "An efficient parallel algorithm for finding minimum
                 weight matching for points on a convex polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "111--116",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York at Buffalo",
  affiliationaddress = "Buffalo, NY, USA",
  classification = "723; 921; C4190 (Other numerical methods); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Buffalo, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational geometry; Computer
                 Programming; Computer Systems Programming ---
                 Multiprocessing Programs; concurrent read exclusive
                 write PRAM; convex polygon; Euclidean distance;
                 Mathematical Techniques --- Graph Theory; Minimum
                 Weight Matching; minimum weight matching; parallel
                 algorithm; Parallel Algorithms; parallel algorithms;
                 points; random-access storage; Weighted Perfect
                 Matching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Carlsson:1991:OAD,
  author =       "Svante Carlsson",
  title =        "An optimal algorithm for deleting the root of a heap",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "2",
  pages =        "117--120",
  day =          "31",
  month =        jan,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lund Univ",
  affiliationaddress = "Lund, Swed",
  classification = "723; C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; correction; Data
                 Processing --- Data Structures; data structures;
                 deleting the root; heap; Heaps; lower bound result;
                 optimal algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Skyum:1991:SAC,
  author =       "Sven Skyum",
  title =        "A simple algorithm for computing the smallest
                 enclosing circle",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "121--125",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aarhus Univ",
  affiliationaddress = "Aarhus, Den",
  classification = "723; 921; C4190 (Other numerical methods)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; Algorithms; closest-point Voronoi diagram;
                 Computational Geometry; computational geometry;
                 Computer Programming; computing; convex polygon; Convex
                 Polygons; farthest point Voronoi diagram; Mathematical
                 Techniques --- Geometry; smallest enclosing circle;
                 Voronoi Diagrams",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Czyzowicz:1991:SFL,
  author =       "Jurek Czyzowicz and K. B. Lakshmanan and Andrzej
                 Pelc",
  title =        "Searching with a forbidden lie pattern in responses",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "127--132",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q25 90D35)",
  MRnumber =     "92e:68027",
  MRreviewer =   "Peter B. Gibbons",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ du Quebec",
  affiliationaddress = "Hull, Que, Can",
  classification = "723; 922; C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. d'Inf., Quebec Univ., Hull, Que., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; forbidden lie
                 pattern; Game Theory; game theory; Probability;
                 responses; Search Games; search problems; searching;
                 Two Person Games; worst-case optimal search
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Manber:1991:ASM,
  author =       "Udi Manber and Ricardo Baeza-Yates",
  title =        "An algorithm for string matching with a sequence of
                 don't cares",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "133--136",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Arizona",
  affiliationaddress = "Tucson, AZ, USA",
  classification = "723; C6120 (File organisation); C7250 (Information
                 storage and retrieval)",
  corpsource =   "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; Algorithms; biological sequences; Computer
                 Programming; Data Processing --- Data Structures; data
                 structures; information retrieval; pattern; proximity
                 searching; search; sequence of don't cares; String
                 Matching; string matching; suffix array data structure;
                 text searching systems; two-dimensional orthogonal
                 range queries problem; upper bound",
  treatment =    "P Practical",
}

@Article{Duris:1991:SS,
  author =       "Pavol Duris and Imrich Vrto",
  title =        "Semelectivity is not sufficient",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "137--141",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Slovak Acad of Sciences",
  affiliationaddress = "Bratislava, Czech",
  classification = "713; 723; B2570 (Semiconductor integrated circuits);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Comput. Centre, Slovak Acad. of Sci., Bratislava,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Area Complexity; area complexity; computational
                 complexity; Computer Metatheory --- Computational
                 Complexity; Integrated Circuits, VLSI; semelective VLSI
                 circuits; Semelectivity; time-determinate input
                 assumption; VLSI",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jiang:1991:TGP,
  author =       "Bin Jiang",
  title =        "Traversing graphs in a paging environment, {BFS} or
                 {DFS}?",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "143--147",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ETH Zuerich",
  affiliationaddress = "Zuerich, Switz",
  classification = "723; 921; C1160 (Combinatorial mathematics); C6120
                 (File organisation); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "Dept. of Comput. Sci., ETH Zurich, Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; BFS; Breadth First Search; breadth-first
                 search; classical complexity; Computer Programming;
                 database applications; database management systems;
                 Depth First Search; depth-first search; DFS; graph
                 theory; graph traversal; Mathematical Techniques ---
                 Graph Theory; paging environment; Search Algorithms;
                 traversing graphs; virtual storage",
  treatment =    "P Practical",
}

@Article{Green:1991:OS,
  author =       "Frederic Green",
  title =        "Oracle separating {$\oplus P$} from {$PP^{PH}$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "149--153",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Clark Univ",
  affiliationaddress = "Worcester, MA, USA",
  classification = "721; 723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Clark Univ.,
                 Worcester, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Computability and Decidability;
                 circuit complexity; computational complexity;
                 Computational Complexity; Computer Metatheory; constant
                 depth circuit; Logic Devices --- Threshold Elements;
                 oracle; Oracles; parity; single threshold gate;
                 Threshold Circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Janssen:1991:OPR,
  author =       "A. J. E. M. Janssen",
  title =        "An optimization problem related to neural networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "155--157",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "92B20 (68T05)",
  MRnumber =     "92b:92005",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Philips Research Lab",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; 921; C1180 (Optimisation techniques); C1230
                 (Artificial intelligence)",
  corpsource =   "Philips Res. Labs., Eindhoven, Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Lagrange Multipliers; neural nets; Neural Networks;
                 neural networks; optimisation; Optimization;
                 optimization problem; positive semi-definite real
                 (n*n)-matrix",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sasaki:1991:EDS,
  author =       "Galen Sasaki",
  title =        "The Effect of the Density of States on the
                 {Metropolis} Algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "159--163",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas",
  affiliationaddress = "Austin, TX, USA",
  classification = "723; 921; B0260 (Optimisation techniques); C1180
                 (Optimisation techniques)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Texas Univ.,
                 Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; density of
                 states; Graph Bisection; Graph Bisection Problem; graph
                 bisection problems; Markov processes; matching;
                 Matching Problem; Mathematical Programming, Linear;
                 Mathematical Techniques --- Graph Theory; Metropolis
                 Algorithm; Metropolis algorithm; Optimization;
                 optimization problems; performance measure; simulated
                 annealing; traveling salesman",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huynh:1991:EES,
  author =       "D{\~u}ng T. H{\`u}ynh",
  title =        "The effective entropies of some extensions of
                 context-free languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "165--169",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  annote =       "The original paper has no accents on the author name,
                 but MathSciNet does. Perhaps the journal typesetting
                 system lacked the needed accents.",
  classification = "721; 723; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Comput. Sci. Program, Texas Univ., Dallas, Richardson,
                 TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "absolute entropy; Automata Theory; complexity classes;
                 computational complexity; Computer Programming ---
                 Algorithms; Context Free Languages; context-free
                 languages; deterministic-polynomial time; EDOL
                 language; effective entropies; Effective Entropy;
                 Entropy; extensions; simple matrix grammar; simple
                 matrix language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Turski:1991:SSR,
  author =       "Wladyslaw M. Turski",
  title =        "On starvation and some related issues",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "171--174",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Warsaw Univ",
  affiliationaddress = "Warsaw, Pol",
  classification = "723; C6110B (Software engineering techniques)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Software; Computer Systems, Digital;
                 Concurrency; concurrent processes; Deadlock; Dining
                 Philosophers; Distributed; formal specification;
                 program specification; software reliability;
                 Starvation; starvation; synchronization",
  treatment =    "P Practical",
}

@Article{Hofri:1991:OCS,
  author =       "Micha Hofri and Hadas Shachnai",
  title =        "On the optimality of the counter scheme for dynamic
                 linear lists",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "3",
  pages =        "175--179\$",
  day =          "18",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion - Israel Inst of Technology",
  affiliationaddress = "Haifa, Isr",
  classification = "723; C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "access frequencies; Computer Programming ---
                 Algorithms; Counter Scheme; counter scheme; Data
                 Processing; Data Structures; deterministic policies;
                 Dynamic Linear Lists; dynamic linear lists; file
                 organisation; independent reference model; optimality;
                 references",
  treatment =    "P Practical",
}

@Article{Wen:1991:PMS,
  author =       "Zhaofang Wen",
  title =        "Parallel multiple search",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "181--186",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; algorithms; Binary Search; binary search;
                 computation model; Computer Programming; Computer
                 Systems Programming --- Multiprocessing Programs; EREW
                 PRAM; Parallel Algorithms; parallel algorithms;
                 Parallel Random Access Machine; Parallel Search;
                 random-access storage; Search Algorithms; search
                 problems; searching; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jacobs:1991:PCA,
  author =       "D. P. Jacobs",
  title =        "Probabilistic checking of associativity in algebras",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "187--191",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Clemson Univ",
  affiliationaddress = "Clemson, SC, USA",
  classification = "723; 921; 922; C1140G (Monte Carlo methods)",
  corpsource =   "Dept. of Comput. Sci., Clemson Univ., SC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; arbitrary algebra; arbitrary multilinear
                 identity; arithmetic operations; Associativity;
                 Computer Programming; Mathematical Statistics --- Monte
                 Carlo Methods; Mathematical Techniques --- Algebra;
                 Monte Carlo Algorithms; Monte Carlo algorithms; Monte
                 Carlo methods; nonassociative algebra; probabilistic
                 algebra; Probabilistic Algorithms; Probability;
                 probability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Deng:1991:SPR,
  author =       "Xiaotie Deng and Sanjeev Mahajan",
  title =        "Server problems and resistive spaces",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "193--196",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Simon Fraser Univ",
  affiliationaddress = "Burnaby, Can",
  classification = "723; 922; C4240 (Programming and algorithm theory)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computer Programming;
                 k-competitive algorithms; K-Server Problem; k-server
                 problem; network servers; online algorithm; Potential
                 Functions; Probability --- Random Processes; randomized
                 algorithm; Randomized Algorithms; resistive space;
                 Resistive Spaces; resistive spaces",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Irving:1991:AMI,
  author =       "Robert W. Irving",
  title =        "On approximating the minimum independent dominating
                 set",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "197--200",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Glasgow",
  affiliationaddress = "Glasgow, Scotl",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bipartite; combinatorial mathematics; combinatorial
                 problems; Computational Complexity; computational
                 complexity; Computer Metatheory; Computer Programming
                 --- Algorithms; graph; Graph Algorithms; Mathematical
                 Techniques --- Graph Theory; Minimum Independent
                 Dominating Set; minimum independent dominating set;
                 NP-hard; optimisation; polynomial-time approximation
                 algorithm; smallest maximal independent set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tan:1991:ISP,
  author =       "Xue-Hou Tan and Tomio Hirata and Yasuyoshi Inagaki",
  title =        "The intersection searching problem for $c$-oriented
                 polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "201--204",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Nagoya Univ",
  affiliationaddress = "Nagoya, Jpn",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
                 (Other numerical methods)",
  corpsource =   "Fac. of Eng., Nagoya Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; algorithms; c-oriented polygons;
                 Computational Geometry; computational geometry;
                 Computer Programming; geometric searching; Intersection
                 Search; intersection searching problem; Mathematical
                 Techniques --- Geometry; Polygon Intersection; search
                 problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huizing:1991:IDC,
  author =       "C. Huizing and W. P. {de Roever}",
  title =        "Introduction to design choices in the semantics of
                 {Statecharts}",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "205--213",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; C6110B (Software engineering techniques)",
  corpsource =   "Eindhoven Univ. of Technol., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming Languages; distributed computing;
                 distributed processing; language Statecharts; reactive
                 system; Reactive Systems; real-time systems; Semantics;
                 specification languages; Statecharts Language; visual
                 languages; visual programming",
  treatment =    "P Practical",
}

@Article{Zwick:1991:EKT,
  author =       "U. Zwick",
  title =        "An extension of {Khrapchenko}'s theorem",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "215--217",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; computational complexity; formula
                 complexity; Huffman coding; Khrapchenko's theorem;
                 lower bounds; parity function; unate basis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liang:1991:NAD,
  author =       "Y. Liang and C. Rhee and S. K. Dhall and S.
                 Lakshmivarahan",
  title =        "A new approach for the domination problem on
                 permutation graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "219--224",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oklahoma",
  affiliationaddress = "Norman, OK, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics)",
  corpsource =   "Parallel Process. Inst., Oklahoma Univ., Norman, OK,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; algorithm theory; Algorithms; Computer
                 Programming; Domination Problem; domination problem;
                 Graph Algorithms; graph theory; Mathematical Techniques
                 --- Graph Theory; minimum weight dominating set;
                 Minimum Weight Dominating Sets; Permutation Graphs;
                 permutation graphs; sparse permutation graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Corbett:1991:UAS,
  author =       "Peter F. Corbett and Isaac D. Scherson",
  title =        "A unified algorithm for sorting on multidimensional
                 mesh-connected processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "225--231",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Princeton Univ., NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary hypercube; Bitonic Sort; Bitonic sort; Computer
                 Programming --- Algorithms; Computer Systems
                 Programming; Hypermesh; indexing scheme; Meshsort;
                 MeshSort; MMCCs; multidimensional mesh-connected
                 computers; multidimensional systems; multiprocessing
                 systems; multiprocessors; Parallel Algorithms; parallel
                 algorithms; Shearsort; Sorting; sorting; sorting
                 algorithms; two-dimensional mesh",
  treatment =    "P Practical",
}

@Article{Serna:1991:ALP,
  author =       "Maria Serna",
  title =        "Approximating linear programming is log-space complete
                 for {P}",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "233--236",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Polytechnic Univ of Catalonia",
  affiliationaddress = "Barcelona, Spain",
  classification = "723; 921; C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math. I., Polytechnic Univ. of
                 Catalonia, Barcelona, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean circuit; computational complexity;
                 computational complexity, linear programming; Computer
                 Metatheory --- Computational Complexity; linear
                 programming; log-space reductions; Mathematical
                 Programming, Linear; nonparallel approximability;
                 optimal vector solution; P-complete; Parallel
                 Approximately; parallel processing; solution
                 approximation; true gates; vector",
  treatment =    "P Practical",
}

@Article{Alt:1991:CMC,
  author =       "H. Alt and N. Blum and K. Mehlhorn and M. Paul",
  title =        "Computing a maximum cardinality matching in a
                 bipartite graph in time {$O(n^{1.5}\sqrt m/log n)$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "4",
  pages =        "237--240",
  day =          "28",
  month =        feb,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Freie Univ Berlin",
  affiliationaddress = "Berlin, Ger",
  classification = "723; 921; C1160 (Combinatorial mathematics)",
  corpsource =   "FB Math., Freie Univ., Berlin, West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; bipartite graph; Bipartite Graphs;
                 Computer Programming; fast adjacency matrix scanning
                 technique; graph theory; Mathematical Techniques ---
                 Graph Theory; Maximum Cardinality Matching; maximum
                 cardinality matching; search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yuan:1991:TPS,
  author =       "Shyan Ming Yuan",
  title =        "Topological properties of supercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "241--245",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C10 68Q10)",
  MRnumber =     "92f:68010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4230 (Switching theory)",
  corpsource =   "Dept. of Comput. Sci., Nat. Chiao Tung Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems, Digital; connectivity; diameter
                 properties; Fault Tolerant Networks; graph theory;
                 graph-theory; hypercube networks; hypercube topology;
                 Interconnection Networks; Mathematical Techniques ---
                 Graph Theory; Multiprocessing; N-node supercube;
                 Network Topology; node-disjoint path; Parallel
                 Processing; Supercubes; Topological Properties;
                 topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mullin:1991:CUC,
  author =       "James K. Mullin",
  title =        "A Caution on Universal Classes of Hash Functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "247--256",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Western Ontario",
  affiliationaddress = "London, Ont, Can",
  classification = "723; C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Western Ontario,
                 London, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computers, Microcomputer; Data Processing; Data
                 Structures; data structures; Fixed Precision Hash
                 Functions; fixed-precision; hash addresses; Hash
                 Functions; hash functions; Hashing Performance;
                 microcomputer hardware; programming theory; random
                 choices; universal classes; Universal Hash Functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Beauquier:1991:UPA,
  author =       "Dani{\`e}le Beauquier",
  title =        "An undecidable problem about rational sets and contour
                 words of polyominoes",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "257--263",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D40 (68R15)",
  MRnumber =     "92f:03046",
  MRreviewer =   "Rodney G. Downey",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Paris VI",
  affiliationaddress = "Paris, Fr",
  classification = "721; 921; C1160 (Combinatorial mathematics); C4210
                 (Formal logic)",
  corpsource =   "LITP, Paris VI Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; contour word; Contour Words; contour
                 words; Decidability; decidability; Formal Languages;
                 formal languages; four letters alphabet; graph theory;
                 Mathematical Techniques --- Combinatorial Mathematics;
                 Polyominoes; polyominoes; Rational Languages; Rational
                 Sets; rational sets; recognizable language; set theory;
                 undecidable problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kaldewaij:1991:DTB,
  author =       "Anne Kaldewaij and Berry Schoenmakers",
  title =        "The derivation of a tighter bound for top-down skew
                 heaps",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "265--271",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68P10)",
  MRnumber =     "92d:68063",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; C1140C (Queueing theory); C4240 (Programming
                 and algorithm theory); C6120 (File organisation)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Amortized Complexity; amortized
                 complexity; computational complexity; Computer
                 Programming; Computer Systems Programming --- Sorting;
                 Data Processing --- Data Structures; data structure;
                 data structures; functional programming; Functional
                 Programs; functional programs; potential function;
                 priority queue operations; Priority Queues; queueing
                 theory; Skew Heaps; Skewsort; sorting; tighter bound;
                 time complexity; top-down skew heaps",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Itoh:1991:CFI,
  author =       "Toshiya Itoh",
  title =        "Characterization for a family of infinitely many
                 irreducible equally spaced polynomials",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "273--277",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11T06 (94B99)",
  MRnumber =     "92d:11129",
  MRreviewer =   "Rudolf Lidl",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Inst of Technology",
  affiliationaddress = "Yokohama, Jpn",
  classification = "721; 723; 921; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Inf. Process., Graduate Sch., Tokyo Inst. of
                 Technol., Yokohama, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity; computational complexity; Computer
                 Programming --- Algorithms; Computers, Digital ---
                 Multiplying Circuits; cryptography; Dividers; Equally
                 Spaced Polynomials; error correction; Galois Fields;
                 irreducible equally spaced polynomials; Mathematical
                 Techniques; parallel algorithms; Polynomials;
                 polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sakakibara:1991:LQC,
  author =       "Yasubumi Sakakibara",
  title =        "On learning from queries and counterexamples in the
                 presence of noise",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "279--284",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05",
  MRnumber =     "92f:68148",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Fujitsu Ltd",
  affiliationaddress = "Numazu, Jpn",
  classification = "723; 922; C1240 (Adaptive system theory); C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu
                 Ltd., Shizuoka, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automata Theory --- Finite Automata;
                 classification noise process; computational complexity;
                 Computer Programming; Concept Learning; formal
                 languages; Learning Algorithms; Learning From Queries;
                 Learning Systems; learning systems; membership queries;
                 Noise, Spurious Signal; polynomial-time learning
                 algorithm; Probability --- Random Processes; Random
                 Sampling; random sampling; Sampling; sampling oracle",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Taubenfeld:1991:NRC,
  author =       "Gadi Taubenfeld",
  title =        "On the nonexistence of resilient consensus protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "285--289",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Yale Univ",
  affiliationaddress = "New Haven, CT, USA",
  classification = "722; 723; B6150 (Communication system theory); C5470
                 (Performance evaluation and testing); C5620 (Computer
                 networks and techniques)",
  corpsource =   "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Asynchronous Message Passing Systems; asynchronous
                 message passing systems; Computer Networks ---
                 Protocols; Computer Systems, Digital; Consensus
                 Protocols; Crash Failures; Fault Tolerant Computing;
                 fault tolerant computing; Message Passing; message
                 switching; Multiprocessing; protocols; Resilient
                 Consensus Protocols; resilient consensus protocols;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1991:LSP,
  author =       "Qingzhou Wang and Kam Hoi Cheng",
  title =        "List scheduling of parallel tasks",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "5",
  pages =        "291--297",
  day =          "14",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Houston",
  affiliationaddress = "Houston, TX, USA",
  classification = "722; 723; 921; C4240 (Programming and algorithm
                 theory); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Computer Systems, Digital; earliest
                 completion time heuristic; homogeneous system; list
                 processing; List Scheduling; list scheduling algorithm;
                 Mathematical Techniques --- Combinatorial Mathematics;
                 Multiprocessing; Nonpreemptive Scheduling; parallel
                 algorithms; parallel tasks; performance ratio;
                 scheduling; Scheduling; Task Precedence Graphs; Task
                 Scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Taubner:1991:NNR,
  author =       "Dirk Taubner",
  title =        "A note on the notation of recursion in process
                 algebras",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "299--303",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Siemens AG, Corporate Research and Development",
  affiliationaddress = "Munchen, Federal Republic of Germany",
  classification = "723; 921; C4210 (Formal logic)",
  corpsource =   "Corp. Res. and Dev., Siemens AG, Munchen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory; Computer Programming Languages
                 --- Theory; equivalence; fix notation; Mathematical
                 Techniques --- Algebra; mu rotation; mu-notation;
                 notation; operating semantics; Operational Semantics;
                 Process Algebras; process algebras; rec notation;
                 rec-notation; Recursion; recursion; recursive
                 definitions; recursive functions; Semantics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teo:1991:IUB,
  author =       "Kim-Heng Teo and Tai-Ching Tuan",
  title =        "An improved upper bound on the number of intersections
                 between two rectangular paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "305--309",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Taipei Inst of Technology",
  affiliationaddress = "Taipei, Taiwan",
  classification = "713; 723; 921; C4290 (Other computer theory)",
  corpsource =   "Taipei Inst. of Technol., Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Geometry; computational geometry;
                 Computer Aided Design; Integrated Circuits, VLSI;
                 interferences; intersections; Manhattan Paths;
                 Rectangular Paths; rectangular paths; self
                 interference; upper bound; VLSI; VLSI Layout; VLSI
                 layout design",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mahmoud:1991:MEB,
  author =       "Sabri A. Mahmoud",
  title =        "Motion estimation based on modified {Fourier}
                 spectrum",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "311--313",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "King Saud Univ",
  affiliationaddress = "Riyadh, Saudi Arabia",
  classification = "723; 921; C1250 (Pattern recognition)",
  corpsource =   "Dept. of Comput. Eng., King Saud Univ., Riyadh, Saudi
                 Arabia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Fourier
                 transforms; Image Analysis; Image Motion Analysis;
                 Image Processing; image sequence; Mathematical
                 Techniques --- Estimation; Mathematical Transformations
                 --- Fast Fourier Transforms; modified Fourier spectrum;
                 Motion Estimation; motion estimation; pattern
                 recognition; Peak Detection Algorithms; picture
                 processing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Danvy:1991:SCN,
  author =       "Olivier Danvy",
  title =        "Semantics-directed compilation of nonlinear patterns",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "315--322",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kansas State Univ",
  affiliationaddress = "Manhattan, KS, USA",
  classification = "723; C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Kansas State Univ.,
                 Manhattan, KS, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "automatic derivation; compiled patterns; Computer
                 Metatheory; Computer Programming --- Theory; Computer
                 Programming Languages; computerised pattern
                 recognition; Nonlinear Patterns; nonlinear patterns;
                 Partial Evaluation; partial evaluation; Pattern
                 Compilation; pattern compiler; Pattern Matching;
                 pattern matching program; program compilers;
                 Programming Theory; Semantics-Directed Compilation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vidyasankar:1991:VSC,
  author =       "K. Vidyasankar",
  title =        "A very simple construction of $1$-writer multireader
                 multivalued atomic variable",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "323--326",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Memorial Univ of Newfoundland",
  affiliationaddress = "St. John's, Newfoundl, Can",
  classification = "722; 723; C4290 (Other computer theory)",
  corpsource =   "Dept. of Comput. Sci., Memorial Univ. of Newfoundland,
                 St. John's, Nfld., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "1-writer multireader; boolean atomic variable;
                 Computer Metatheory; Computer Systems, Digital;
                 Concurrent Reading and Writing; Distributed;
                 distributed computing; distributed processing;
                 Multireader Atomic Variables; multivalued atomic
                 variable; Multivalued Atomic Variables; multivalued
                 regular variables; Nonatomic Operations; shared
                 register; Shared Variables; shared variables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1991:SAI,
  author =       "Biing-Feng Wang and Chuen-Liang Chen and Gen-Huey
                 Chen",
  title =        "A simple approach to implementing multiplication with
                 small tables",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "327--329",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723; C5230 (Digital arithmetic methods)C6130 (Data
                 handling techniques); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Systems Programming; Data Processing --- Data
                 Structures; data structures; digital arithmetic;
                 multiplication; Multiplication; small tables; table
                 lookup; Table Lookup",
  treatment =    "P Practical",
}

@Article{Galil:1991:NSU,
  author =       "Zvi Galil and Giuseppe F. Italiano",
  title =        "A note on set union with arbitrary deunions",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "331--335",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Columbia Univ",
  affiliationaddress = "New York, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Columbia Univ., New York, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; arbitrary deunions;
                 computational complexity; Computer Programming;
                 Computer Programming --- Logic Programming; Data
                 Processing --- Data Structures; data structures;
                 deunion; Disjoint Sets; disjoint sets; find; logic
                 programming; Mathematical Techniques --- Set Theory;
                 Memory Management; memory management; set theory; set
                 union; Set Union Algorithms; Tree Structures; union",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1991:CG,
  author =       "Myung-Joon Lee and Kwang-Moo Choe",
  title =        "{${\rm SLR}(k)$} covering for {${\rm LR}(k)$}
                 grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "337--347",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q50 (68Q52)",
  MRnumber =     "92d:68080a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigenda \cite{Lee:1991:CCG}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Seoul, South Korea",
  classification = "721; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and
                 Technol., Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Context Free Grammars; context-free
                 grammar; context-free grammars; formal languages;
                 Formal Languages; grammar covering; Grammar Covering;
                 LR(k) Context Free Grammars; LR(k) grammars; LR(k)
                 parser; right covered; SLR(k) grammar; SLR(k) Grammars;
                 transformation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Srikant:1991:FPA,
  author =       "R. Srikant and Kamala Krithivasan",
  title =        "Fastest path across constrained moving rectilinear
                 obstacles",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "349--353",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "723; 921; C3120C (Spatial variables); C3390
                 (Robotics); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 Computer Programming --- Algorithms; Fastest Path
                 Problems; Mathematical Techniques --- Geometry; Motion
                 Planning; Moving Obstacles; moving obstacles; point
                 robot; position control; Rectilinear Obstacles;
                 rectilinear obstacles; Robotics; robots; shortest path;
                 Shortest Paths Problems; stationary obstacles",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1991:BHP,
  author =       "Nageswara S. V. Rao and Weixiong Zhang",
  title =        "Building heaps in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "37",
  number =       "6",
  pages =        "355--358",
  day =          "28",
  month =        mar,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; building heaps; computational complexity;
                 Computer Programming; Computer Systems Programming ---
                 Multiprocessing Programs; Data Processing --- Data
                 Structures; data structures; EREW PRAM; EREW PRAMs;
                 Exclusive-Read Exclusive-Write; heap; Heaps; hypercube;
                 Hypercubes; Parallel Algorithms; parallel algorithms;
                 Parallel Random Access Machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dielissen:1991:RPP,
  author =       "Victor J. Dielissen and Anne Kaldewaij",
  title =        "Rectangular partition is polynomial in two dimensions
                 but {NP}-complete in three",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "1--6",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "92g:68060",
  MRreviewer =   "Hans-Dietrich Hecker",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4290 (Other computer theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 computational geometry; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Geometry; Mathematical Techniques;
                 NP-complete; Orthogonal Polygons; Polygon
                 Decomposition; polygon decomposition; polynomial;
                 rectangular partition; Rectangular Partitioning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goralcik:1991:APF,
  author =       "P. Goral{\v{c}}{\'\i}k and A.
                 Goral{\v{c}}{\'\i}kov{\'a} and V. Koubek",
  title =        "Alternation with a pebble",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "7--13",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q70)",
  MRnumber =     "92i:68080",
  MRreviewer =   "J{\"u}rgen Dassow",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Rouen",
  affiliationaddress = "Mont Saint-Aignan, Fr",
  classification = "721; C4220 (Automata theory)",
  corpsource =   "LIR, Rouen Univ., Mont Saint-Aignan, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "alternation; Alternation; Automata Theory; class Reg;
                 finite automata; Finite Automata; Formal Languages;
                 pebble; regular languages; Regular Languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stojmenovic:1991:BHS,
  author =       "Ivan Stojmenovi{\'c}",
  title =        "Bisections and ham-sandwich cuts of convex polygons
                 and polyhedra",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "15--21",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "92g:68150",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Ottawa",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "723; 921; C4290 (Other computer theory)",
  corpsource =   "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bisection of Polytopes; bisections;
                 Computational Geometry; computational geometry;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming; Convex Polygons; convex polygons;
                 Convex Polyhedra; ham-sandwich cuts; linear time
                 sequential algorithm; Mathematical Techniques ---
                 Geometry; Polygon Bisection; polyhedra; Polyhedra
                 Bisection; straight line",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Elmagarmid:1991:IAQ,
  author =       "Ahmed K. Elmagarmid and Wei Min Du",
  title =        "Integrity aspects of quasi serializability",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "23--28",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "92i:68030",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "723; C6130 (Data handling techniques); C6160
                 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "correctness criterion; Data Integrity; data integrity;
                 database management systems; Database Systems;
                 Distributed; global transactions; integrity aspects;
                 Integrity of Data; local executions; multidatabase
                 consistency; Multidatabases; quasi serializability;
                 Quasi-Serializability; Serializability",
  treatment =    "P Practical",
}

@Article{Horng:1991:OSA,
  author =       "Shi-Jinn Horng and Wen-Tsuen Chen and Ming-Yi Fang",
  title =        "Optimal speed-up algorithms for template matching on
                 {SIMD} hypercube multiprocessors with restricted local
                 memory",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "29--37",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; C1250 (Pattern recognition); C5260B (Computer
                 vision and picture processing)",
  corpsource =   "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory --- Computational Complexity;
                 Computer Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; Computer
                 Vision; computerised picture processing; Hypercubes;
                 Image Processing; Optimal Speedup; optimal speedup
                 algorithms; overall time complexities; Parallel
                 Algorithms; restricted local memory; SIMD hypercube
                 multiprocessors; SIMD Multiprocessors; Template
                 Matching; template matching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shoup:1991:SFP,
  author =       "Victor Shoup",
  title =        "Smoothness and factoring polynomials over finite
                 fields",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "39--42",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11Y16 (11T06 68Q25)",
  MRnumber =     "92f:11178",
  MRreviewer =   "Lajos R{\'o}nyai",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto",
  affiliationaddress = "Toronto, Ont, Can",
  classification = "723; 921; B0290F (Interpolation and function
                 approximation); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Metatheory --- Computational
                 Complexity; Computer Programming; deterministic
                 algorithm; Extended Riemann Hypothesis; extended
                 Riemann hypothesis; Factoring Algorithms; factoring
                 polynomials; Factorization; Finite Fields; finite
                 fields; Mathematical Techniques --- Polynomials;
                 Polynomial Factorization; polynomials; smoothness",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1991:GTA,
  author =       "Xu Cheng",
  title =        "A graph transformation algorithm for concurrency
                 control in a partitioned database",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "43--48",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Shanghai Computer Software Lab",
  affiliationaddress = "Shanghai, China",
  classification = "723; 921; C6150J (Operating systems); C6160B
                 (Distributed DBMS)",
  corpsource =   "Shanghai Comput. Software Lab., China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Acyclicity Theorem; application structure; application
                 system; Computer Programming --- Algorithms;
                 Concurrency Control; concurrency control; database
                 management systems; Database Systems; Distributed;
                 graph transformation algorithm; Graph Transformation
                 Algorithms; Mathematical Techniques --- Graph Theory;
                 Multiversion Databases; partitioned database;
                 Partitioned Databases; Timestamp Algorithms;
                 timestamp-ordering; two-phase locking",
  treatment =    "P Practical",
}

@Article{Chen:1991:UAP,
  author =       "Calvin C.-Y. Chen and Sajal K. Das and Selim G. Akl",
  title =        "A unified approach to parallel depth-first traversals
                 of general trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "1",
  pages =        "49--55",
  day =          "12",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68R10)",
  MRnumber =     "92g:68057",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of North Texas",
  affiliationaddress = "Denton, TX, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., North Texas Univ., Denton, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; Data Processing ---
                 Data Structures; data structures; EREW; exclusive-read
                 and exclusive-write; general trees; generalized
                 algorithm; Linked List Ranking; linked list ranking
                 problem; Mathematical Techniques --- Trees; Parallel
                 Algorithms; parallel algorithms; parallel depth-first
                 traversals; parallel random access machine; Search
                 Methods; time complexity; traversing trees; Tree
                 Traversal; trees (mathematics); unified approach",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Crochemore:1991:EPA,
  author =       "Maxime Crochemore and Wojciech Rytter",
  title =        "Efficient parallel algorithms to test square-freeness
                 and factorize strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "57--60",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22",
  MRnumber =     "92d:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Paris 7",
  affiliationaddress = "Paris, France",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "LITP, Paris Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; combinatorial mathematics; computational
                 complexity; Computer Programming; Computer Systems
                 Programming --- Multiprocessing Programs; CRCW PRAM;
                 Information Theory --- Data Compression; Mathematical
                 Techniques --- Combinatorial Mathematics; Parallel
                 Algorithms; parallel algorithms; Parallel Random Access
                 Machines; random-access storage; sequential time
                 algorithm; square-freeness; String Factorization;
                 strings factorization; Suffix Trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alvarez:1991:PCT,
  author =       "C. {\`A}lvarez and J. Gabarr{\'o}",
  title =        "The parallel complexity of two problems on
                 concurrency",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "61--70",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q10)",
  MRnumber =     "92d:68057",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Politecnica de Catalunya",
  affiliationaddress = "Barcelona, Spain",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. de Llenguatges i Sistemes Inf., Univ.
                 Politecnica de Catalunya, Barcelona, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Computability and Decidability;
                 Boolean Circuits; Computational Complexity;
                 computational complexity; Computer Metatheory; Computer
                 Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; Concurrency;
                 concurrency; Mathematical Techniques --- Petri Nets;
                 membership; Parallel Algorithms; parallel algorithms;
                 Parallel Complexity; parallel complexity; Partially
                 Commutative Monoids; partially commutative monoids;
                 Petri nets; Trace Equivalence; trace equivalence;
                 unbounded fan-in circuits",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yen:1991:PTA,
  author =       "Hsu Chun Yen",
  title =        "A polynomial time algorithm to decide pairwise
                 concurrency of transitions for $1$-bounded
                 conflict-free {Petri} nets",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "71--76",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q90",
  MRnumber =     "92e:68148",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng. Nat. Taiwan Univ., Taipei,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "1-bounded conflict-free Petri nets; computational
                 complexity; Computer Metatheory --- Computational
                 Complexity; Computer Programming --- Algorithms;
                 Concurrency; Conflict Free Petri Nets; Mathematical
                 Techniques; pairwise concurrency; Pairwise Concurrency;
                 Petri nets; Petri Nets; polynomial time algorithm;
                 Polynomial Time Algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Manzini:1991:RSH,
  author =       "Giovanni Manzini",
  title =        "Radix sort on the hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "77--81",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10",
  MRnumber =     "92d:68038",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Scuola Normale Superiore",
  affiliationaddress = "Pisa, Italy",
  classification = "723; C4230 (Switching theory); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Scuola Normale Superiore, Piazza dei Cavalieri, Pisa,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Computer Systems
                 Programming; hypercube; hypercube networks; Hypercubes;
                 Multiple Routing; multiple routing procedure; Parallel
                 Algorithms; parallel algorithms; Radix Sort; radix sort
                 algorithm; Sorting",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Meidanis:1991:LBA,
  author =       "Jo{\~a}o Meid{\^a}nis",
  title =        "Lower bounds for arithmetic problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "83--87",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11Y16 (68Q05 68Q25)",
  MRnumber =     "92e:11148",
  MRreviewer =   "Lajos R{\'o}nyai",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin",
  affiliationaddress = "Madison, WI, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Arithmetic Problems; arithmetic problems;
                 computation tree; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming; Jacobi Symbol; Lower Bounds; lower bounds;
                 Mathematical Techniques --- Number Theory; Modular
                 Exponentiation; Primality Testing; random access
                 machine",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Messeguer:1991:DBU,
  author =       "Xavier Messeguer",
  title =        "Dynamic behaviour in updating process over {BST} of
                 size two with probabilistic deletion algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "89--100",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68P05)",
  MRnumber =     "92j:68050",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Departament L.S.I.",
  affiliationaddress = "Barcelona, Spain",
  classification = "723; 922; C1160 (Combinatorial mathematics); C6120
                 (File organisation)",
  corpsource =   "Dept. LSI, Univ. Politechnica de Cataluna, Barcelona,
                 Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary Search Trees; binary search trees;
                 complexity measures; Computer Metatheory ---
                 Computational Complexity; Computer Programming; Data
                 Processing --- Data Structures; data structures;
                 Deletion Algorithms; dynamic behaviour; invariance;
                 Jonassen-Knuth methods; Probabilistic Algorithms;
                 probabilistic deletion algorithms; probability;
                 Probability --- Random Processes; random permutations;
                 Search Trees; trees (mathematics); Updating",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Misra:1991:PS,
  author =       "Jayadev Misra",
  title =        "Phase synchronization",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "101--105",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sun May 02 08:36:33 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigenda \cite{Misra:1992:CPS}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas",
  affiliationaddress = "Austin, TX, USA",
  classification = "723; C5620 (Computer networks and techniques);
                 C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; Computer Systems,
                 Digital --- Distributed; Concurrency; concurrency
                 control; distributed processing; Parallel Random Access
                 Machines; phase synchronisation; Phase Synchronization;
                 PRAM; prams; protocols; shared store initialisation;
                 shared store initialization problem; synchronisation;
                 Synchronization; synchronous systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Minsker:1991:TAP,
  author =       "Steven Minsker",
  title =        "The {Towers} of {Antwerpen} problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "2",
  pages =        "107--111",
  day =          "26",
  month =        apr,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q20)",
  MRnumber =     "92d:68065",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "SUNY-Potsdam Coll",
  affiliationaddress = "Potsdam, NY, USA",
  classification = "723; C1290 (Applications of systems theory)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Potsdam, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Artificial Intelligence; Computer
                 Programming; operations research; optimal algorithm;
                 Optimal Algorithms; ring movement; stacks; Towers of
                 Antwerpen Problem; Towers of Antwerpen problem; Towers
                 of Hanoi problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kao:1991:OMB,
  author =       "Ming-Yang Kao and Stephen R. Tate",
  title =        "Online matching with blocked input",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "113--116",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "92f:68067",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Duke Univ",
  affiliationaddress = "Durham, NC, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bipartite Graphs; blocked input; blocked
                 online bipartite matching; computational complexity;
                 Computer Programming; Graph Algorithms; Graph Matching;
                 graph theory; Matching Problems; Mathematical
                 Techniques --- Graph Theory; Online Algorithms;
                 performance gain; search problems; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fernandez-Baca:1991:MHG,
  author =       "David Fern{\'a}ndez-Baca and Mark A. Williams",
  title =        "On matroids and hierarchical graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "117--121",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05B35 (68R05 68R10)",
  MRnumber =     "92g:05056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Iowa State Univ",
  affiliationaddress = "Ames, IA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; Graph Algorithms; graph theory; Greedy
                 Algorithms; Hierarchical Graphs; hierarchical graphs;
                 Mathematical Techniques --- Graph Theory; Matroids;
                 matroids; polynomially-solvable problems;
                 PSPACE-complete",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rote:1991:CMH,
  author =       "G{\"u}nter Rote",
  title =        "Computing the minimum {Hausdorff} distance between
                 two-point sets on a line under translation",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "123--127",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68T10)",
  MRnumber =     "92d:68114",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ Graz",
  affiliationaddress = "Graz, Austria",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Math., Tech. Univ., Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 Computer Vision; geometry; Hausdorff Distance;
                 Mathematical Techniques --- Geometry; minimum Hausdorff
                 distance; optimal algorithm; Pattern Matching; Pattern
                 Recognition; point sets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Langemyr:1991:CCG,
  author =       "Lars Langemyr",
  title =        "Circuits for computing the {GCD} of two polynomials
                 over an algebraic number field",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "129--134",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40 (68Q22 68Q25)",
  MRnumber =     "92d:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ T{\"u}bingen",
  affiliationaddress = "T{\"u}bingen, Ger",
  classification = "721; 723; 921; C4210 (Formal logic)C4130
                 (Interpolation and function approximation); C4230B
                 (Combinatorial switching theory); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Wilhelm-Schickard-Inst. f{\"u}r Inf., T{\"u}bingen
                 Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebraic Fields; algebraic number field; Boolean
                 algebra; Boolean Circuits; boolean circuits; Computer
                 Programming --- Algorithms; depth; GCD; Greatest Common
                 Denominator; greatest common divisor; Logic Circuits;
                 Mathematical Techniques; minimisation of switching
                 nets; parallel algorithms; Polynomials; polynomials;
                 sequential modular algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Martel:1991:SAM,
  author =       "Charles Martel",
  title =        "Self-adjusting multi-way search trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "135--141",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "92d:68035",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Div. of Comput. Sci., California Univ., Davis, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Data Processing;
                 data structure; data structures; Data Structures;
                 Dictionaries; k-forest; k-Forests; lookup frequencies;
                 Mathematical Techniques --- Trees; Multiway Search
                 Trees; search problems; Search Trees; self-adjusting
                 multi-way search tree; splay trees; static optimality;
                 table lookup; trees (mathematics); virtual memory
                 environment; virtual storage; weighted dictionary;
                 working set",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rajanarayanan:1991:NOD,
  author =       "Subbiah Rajanarayanan and Sitharama S. Iyengar",
  title =        "A new optimal distributed algorithm for the set
                 intersection problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "143--148",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "92d:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Louisiana State Univ., Baton
                 Rouge, LA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Asynchronous Systems; cardinality;
                 computational complexity; Computer Programming;
                 Computer Systems Programming --- Multiprocessing
                 Programs; decentralized distributed algorithm;
                 Distributed Algorithms; distributed processing;
                 Mathematical Techniques --- Set Theory; optimal
                 distributed algorithm; Parallel Algorithms; Set
                 Intersection; set intersection problem; set theory;
                 smallest-sized subset; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rote:1991:CSC,
  author =       "G{\"u}nter Rote and Gerhard Woeginger and Binhai Zhu
                 and Zhengyan Wang",
  title =        "Counting $k$-subsets and convex $k$-gons in the
                 plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "149--151",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "92i:68183",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Universitat Graz",
  affiliationaddress = "Graz, Aust",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Math., Tech. Univ., Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 convex hull; convex k-gons; K-gons; K-subsets;
                 k-subsets; Mathematical Techniques --- Geometry; naive
                 algorithm; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mnuk:1991:DDB,
  author =       "Michal Mnuk",
  title =        "A div($n$) depth {Boolean} circuit for smooth modular
                 inverse",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "153--156",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Slovak Acad of Sciences",
  affiliationaddress = "Bratislava, Czech",
  classification = "723; C4230B (Combinatorial switching theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Comput. Center, Slovak Acad. of Sci., Bratislava,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Boolean algebra; Boolean Circuits;
                 computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming;
                 Computer Systems Programming --- Multiprocessing
                 Programs; div(n) depth Boolean circuit; Inverse
                 Computation; minimisation of switching nets; Modular
                 Inverse; NC/sup 1/ reduction; Parallel Algorithms;
                 parallel algorithms; prime factor; smooth modular
                 inverse",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pramanik:1991:DCK,
  author =       "P. Pramanik and P. K. Das and A. K. Bandyopadhyay and
                 D. Q. M. Fay",
  title =        "A deadlock-free communication kernel for loop
                 architecture",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "157--161",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Jadavpur Univ",
  affiliationaddress = "Calcutta, India",
  classification = "722; 723; C6150J (Operating systems)",
  corpsource =   "Jadavpur Univ., Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Communication Kernels; Computer Operating Systems;
                 Computer Systems, Digital; Computers, Digital --- Data
                 Communication Systems; Deadlock Prevention;
                 deadlock-free communication structure; Distributed;
                 distributed operating system; loop architecture;
                 Message Passing Multiprocessors; message-passing
                 computers; network operating systems; system recovery;
                 unidirectional loop",
  treatment =    "P Practical",
}

@Article{Acketa:1991:NLP,
  author =       "Dragan M. Acketa and Jovi{\v{s}}a D. {\v{Z}}uni{\'c}",
  title =        "On the number of linear partitions of the
                 $(m,n)$-grid",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "3",
  pages =        "163--168",
  day =          "17",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "92d:68110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Novi Sad",
  affiliationaddress = "Novi Sad, Yugosl",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Novi Sad Univ., Yugoslavia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Metatheory
                 --- Computational Complexity; Computer Programming;
                 counting; finite point set; infinite grid; Linear
                 Partitions; linear partitions; Mathematical Techniques
                 --- Geometry; minimal pairs; set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bradford:1991:ITA,
  author =       "James H. Bradford and T. A. Jenkyns",
  title =        "On the inadequacy of tournament algorithms for the
                 {$N$}{-SCS} problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "169--171",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "92e:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brock Univ",
  affiliationaddress = "St. Catharines, Ont, Can",
  classification = "721; 723; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Brock Univ., St. Catharines,
                 Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Automata Theory ---
                 Formal Languages; Computer Programming; formal
                 languages; N-SCS problem; shortest common
                 supersequence; Shortest Common Supersequence Problem;
                 string language; Tournament Algorithms; tournament
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chrobak:1991:NSP,
  author =       "Marek Chrobak and Lawrence L. Larmore",
  title =        "A note on the server problem and a benevolent
                 adversary",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "173--175",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (90B22)",
  MRnumber =     "92d:68031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Riverside, CA, USA",
  classification = "723; C1140E (Game theory); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Riverside,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; benevolent adversary;
                 Computer Programming; Computer Systems, Digital ---
                 Multiprocessing; game theory; K-Server Problem; lazy
                 moves; online algorithm; Online Algorithms; Scheduling;
                 server problem; Server Problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Floren:1991:NFA,
  author =       "Rolf Floren",
  title =        "A note on: {``A faster approximation algorithm for the
                 {Steiner} problem in graphs'' [Inform. Process. Lett.
                 {\bf 27} (1988), no. 3, 125--128; MR 89d:68031] by K.
                 Mehlhorn}",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "177--178",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "92g:68113",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Mehlhorn:1988:FAA}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Dortmund",
  affiliationaddress = "Dortmund, Germany",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lehrstuhl Inf. XII, Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximation algorithm; Approximation
                 Algorithms; approximation theory; complexity;
                 computational complexity; Computer Programming; edges;
                 graph theory; graphs; Mathematical Techniques --- Graph
                 Theory; Steiner Problem; Steiner tree approximation
                 algorithm; Steiner Trees; terminals; V; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldberg:1991:PIM,
  author =       "Andrew V. Goldberg",
  title =        "Processor-efficient implementation of a maximum flow
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "179--185",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial Optimization; computational
                 complexity; Computer Programming; Computer Systems
                 Programming --- Multiprocessing Programs; Data
                 Processing --- Data Structures; dynamic array data
                 structure; Mathematical Techniques --- Combinatorial
                 Mathematics; Maximum Distance Discharge Algorithm;
                 maximum distance discharge algorithm; maximum flow
                 algorithm; near-optimal speedup; Network Flows;
                 Optimization; Parallel Algorithms; parallel algorithms;
                 processors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Siklossy:1991:SRM,
  author =       "Laurent Siklossy and Eduard Tulp",
  title =        "The space reduction method: a method to reduce the
                 size of search spaces",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "187--192",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "433; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial Mathematics; Graph Search; graph
                 searching; graph theory; Mathematical Techniques;
                 parallel arcs; Railroad Transportation --- Route
                 Analysis; Search Methods; search problems; search
                 spaces; Space Reduction Method; space reduction method;
                 SRM; transportation service networks; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gasarch:1991:SLR,
  author =       "William I. Gasarch",
  title =        "On selecting the $k$ largest with restricted quadratic
                 queries",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "193--195",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "92k:68035",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput Sci., Inst. for Adv. Study, Maryland
                 Univ., College Park, MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "comparisons; Computational Complexity; computational
                 complexity; Computer Metatheory; Concrete Complexity; k
                 largest elements; lower bound; Queries; rankings; real
                 numbers; restricted quadratic queries; selection
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leiss:1991:ECB,
  author =       "Ernst L. Leiss and Hari N. Reddy",
  title =        "Embedding complete binary trees into hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "197--199",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C05 05C10)",
  MRnumber =     "92i:68126",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Houston",
  affiliationaddress = "Houston, TX, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4230
                 (Switching theory)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary Trees; complete binary trees; Computer Systems,
                 Digital --- Multiprocessing; edge; embedding; Graph
                 Embeddings; height; hypercube networks; Hypercubes;
                 hypercubes; Interconnection Networks; interconnection
                 networks; Mathematical Techniques; MIMD systems; Tree
                 Embeddings; Trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shonkwiler:1991:CHS,
  author =       "R. Shonkwiler",
  title =        "Computing the {Hausdorff} set distance in linear time
                 for any {$L_p$} point distance",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "201--207",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68U10)",
  MRnumber =     "92d:68115",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4290 (Other computer theory)",
  corpsource =   "Sch. of Math., Georgia Inst. of Technol., Atlanta, GA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arbitrary dimension; cellularized point sets;
                 computational complexity; Computational Geometry;
                 computational geometry; Computer Programming ---
                 Algorithms; Hausdorff Set Distance; Hausdorff set
                 distance; Image Processing; image processing; L/sub p/
                 point distance; linear time minimal memory algorithm;
                 Mathematical Techniques; metric field; Metric Fields;
                 Set Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Basart:1991:SUB,
  author =       "J. M. Basart",
  title =        "Some upper bounds for minimal trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "209--213",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C05 68Q25)",
  MRnumber =     "92i:68119",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Autonoma de Barcelona",
  affiliationaddress = "Catalonia, Spain",
  classification = "921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. d'Inf., Fac. de Ciencies, Univ., Autonoma de
                 Barcelona, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "circumference; computational complexity; Computational
                 Geometry; computational geometry; Euclidean Steiner
                 minimal tree; Euclidean Steiner Minimal Trees; length;
                 Mathematical Techniques; Minimal Trees; Rectilinear
                 Minimal Tree; rectilinear minimal tree; rectilinear
                 Steiner minimal tree; square; Trees; trees
                 (mathematics); Upper Bounds; upper bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cai:1991:NEC,
  author =       "Jin-yi Cai and Lane A. Hemachandra",
  title =        "A note on enumerative counting",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "215--219",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "92k:68026",
  MRreviewer =   "Joan Boyar",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "721; 723; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "approximation theory; Automata Theory ---
                 Computability and Decidability; complexity;
                 computational complexity; Computer Metatheory;
                 enumerative approximation; Enumerative Counting;
                 enumerative counting; polynomial-time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sakkinen:1991:SSC,
  author =       "Markku Sakkinen",
  title =        "Selftype is a special case",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "4",
  pages =        "221--224",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Jyvaskyla",
  affiliationaddress = "Jyvaskyla, Finland",
  classification = "723; C6110 (Systems analysis and programming);
                 C6140D (High level languages)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Syst., Jyvaskyla Univ.,
                 Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming Languages; high level languages;
                 object-oriented languages; object-oriented programming;
                 quasi-typename; quasi-variable; result type; self;
                 Selftype; selftype; static type checking",
  treatment =    "P Practical",
}

@Article{Rytter:1991:CRP,
  author =       "W. Rytter and A. Saoudi",
  title =        "On the complexity of the recognition of parallel
                 {$2$D}-image languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "225--229",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T10 (68Q25)",
  MRnumber =     "92c:68161",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Warsaw Univ",
  affiliationaddress = "Warsaw, Pol",
  classification = "721; 723; C1250 (Pattern recognition); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Context Free Grammars; Boolean
                 matrices; computational complexity; Computer Metatheory
                 --- Computational Complexity; Computer Systems, Digital
                 --- Parallel Processing; Context Free Image Grammars;
                 context-free grammars; context-free languages; image
                 complexity; Image Generation; Image Processing; image
                 recognition; Language Recognition; parallel 2D-image
                 languages; parallel algorithms; Parallel Context Free
                 Grammars; parallel context-free image grammars;
                 parallel random access machine; Parallel Random Access
                 Machines; Pattern Recognition; picture processing;
                 recognition complexity; sequential time complexity;
                 Time Complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hershberger:1991:NDS,
  author =       "John Hershberger",
  title =        "A new data structure for shortest path queries in a
                 simple polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "231--235",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68P05)",
  MRnumber =     "92c:68190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "DEC Systems Research Cent",
  affiliationaddress = "Palo Alto, CA, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "DEC Syst. Res. Center, Palo Alto, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "asymptotic performance; computational complexity;
                 Computational Geometry; computational geometry;
                 Computer Programming --- Algorithms; Data Processing;
                 data structure; Data Structures; data structures;
                 linear preprocessing; logarithmic query time;
                 Mathematical techniques --- Geometry; Query Processing;
                 Shortest Path Queries; shortest path queries; simple
                 polygon; triangulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lingas:1991:BCM,
  author =       "Andrzej Lingas",
  title =        "Bit complexity of matrix products",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "237--242",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "92e:68072",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lund Univ",
  affiliationaddress = "Lund, Swed",
  classification = "723; 921; C4140 (Linear algebra); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "approximate; Approximation Heuristics; arithmetic
                 operations; arithmetic product; Bit Complexity; bit
                 complexity; bit operations; Boolean Matrices; Boolean
                 matrix product; Computational Complexity; computational
                 complexity; Computer Metatheory; Computer Programming
                 --- Algorithms; integer division; integer
                 multiplication; ith logarithm; Mathematical Techniques
                 --- Matrix Algebra; matrix algebra; Matrix
                 Multiplication; matrix multiplication; Matrix Products;
                 matrix products; Mehlhorn estimate; min+product;
                 modular arithmetic; Romani algorithm; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1991:FDM,
  author =       "Myoung Ho Kim and Sakti Pramanik",
  title =        "The {FX} distribution method for parallel processing
                 of partial match queries",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "243--252",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, S Korea",
  classification = "723; C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and
                 Technol., Taejon, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; data
                 distribution; Data Distribution Methods; Database
                 Systems; database theory; FX distribution; FX
                 Distribution Method; optimal distribution; Parallel
                 Algorithms; parallel algorithms; Parallel Processing;
                 parallel processing; Partial Match Queries; partial
                 match queries; query languages; Query Processing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Woeginger:1991:MST,
  author =       "Gerhard Woeginger",
  title =        "On minimizing the sum of $k$ tardinesses",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "253--256",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B22 (68M20 68Q25)",
  MRnumber =     "92b:90097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ Graz",
  affiliationaddress = "Graz, Austria",
  classification = "723; 912; 913; 921; C1180 (Optimisation techniques);
                 C1290F (Industry); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Inst. f{\"u}r Math., Tech. Univ. Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Job Shop Scheduling; jobs; K Maximum
                 Tardiness; machine; Mathematical Techniques ---
                 Combinatorial Mathematics; maximum tardinesses;
                 minimisation; Minimization; Operations Research;
                 Optimization; Polynomial Complexity; polynomially
                 solvable; Scheduling; scheduling; sum minimization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hambrusch:1991:PAC,
  author =       "Susanne Hambrusch and Michael Luby",
  title =        "Parallel asynchronous connected components in a mesh",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "257--263",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10 (68Q25)",
  MRnumber =     "92c:68199",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "723; C1250 (Pattern recognition); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Asynchronous Algorithms; binary image; computational
                 complexity; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; connected components; Connected Components
                 Counting; Image Processing; mesh; Mesh Architectures;
                 Parallel Algorithms; parallel algorithms; parallel
                 asynchronous algorithm; picture processing; Synchronous
                 Algorithms; time bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kalamboukis:1991:TOD,
  author =       "T. Z. Kalamboukis and S. L. Mantzaris",
  title =        "Towards optimal distributed election on chordal
                 rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "265--270",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q25)",
  MRnumber =     "92c:68011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Athens Univ of Economics",
  affiliationaddress = "Athens, Greece",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Inf., Athens Univ. of Econ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "chordal rings; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; Computer
                 Systems, Digital; Distributed; Distributed Algorithms;
                 Distributed Election; distributed processing; election
                 algorithm; Election Algorithms; graph theory; leader;
                 Leader Election; Message Complexity; message
                 complexity; optimal distributed election;
                 Optimization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fotouhi:1991:PON,
  author =       "Farshad Fotouhi and Sakti Pramanik",
  title =        "Problem of optimizing the number of block accesses in
                 performing relational join is {NP}-hard",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "271--275",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q25)",
  MRnumber =     "92c:68024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Wayne State Univ",
  affiliationaddress = "Detroit, MI, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Wayne State Univ., Detroit, MI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Block Accesses; block accesses; Buffer Memories;
                 Computer Metatheory --- Computational Complexity;
                 Database Systems; database theory; disk accesses; graph
                 model; graph theory; joining tuples; lower bound;
                 Mathematical Models; Mathematical Techniques --- Graph
                 Theory; Memory Access; Memory Management; minimisation;
                 minimum buffer size; minimum main memory; NP Hard
                 Problems; NP-hard; optimisation; Optimization; ordered
                 list; Relational; relational databases; Relational
                 Join; relational join",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matousek:1991:CD,
  author =       "Jiri Matousek",
  title =        "Computing dominances in {$E^n$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "277--278",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Charles Univ",
  affiliationaddress = "Praha, Czech",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math., Charles Univ., Praha,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; computational
                 geometry; Computational Geometry; Computer Metatheory
                 --- Computational Complexity; Computer Programming;
                 dominance relation; dominances; Euclidean space;
                 Euclidean Space; Mathematical Techniques --- Geometry;
                 matrix multiplication; maximal points; partial
                 ordering; Partial Ordering; Time Complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Snyder:1991:CLB,
  author =       "Timothy Law Snyder",
  title =        "Corrigendum: {``Lower bounds for rectilinear {Steiner}
                 trees in bounded space''} {[Inform. Process. Lett. {\bf
                 37}(2), 31 January 1991, pp. 71--74]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "279--279",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "92b:68036b",
  bibdate =      "Sat Apr 11 12:24:18 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Snyder:1991:LBR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1991:CCG,
  author =       "Myung-Joon Lee and Kwang-Moo Choe",
  title =        "Corrigenda: {``{${\rm SLR}(k)$} covering for {${\rm
                 LR}(k)$} grammars''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "5",
  pages =        "281--281",
  day =          "14",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q50 (68Q52)",
  MRnumber =     "92d:68080b",
  bibdate =      "Sat Apr 11 12:24:18 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Lee:1991:CG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Danzig:1991:CGA,
  author =       "Peter B. Danzig",
  title =        "A cooperative game with applications to computer
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "283--289",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90D12 (68M10 94A05)",
  MRnumber =     "93d:90076",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southern California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "723; 922; B0240E (Game theory); B6210L (Computer
                 communications); C1140E (Game theory); C5620L (Local
                 area networks)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Southern California,
                 Los Angeles, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Broadcast Algorithms; broadcast algorithms; buffers;
                 Computer Networks --- Local Area Networks; Computer
                 Programming --- Algorithms; cooperative game theory;
                 Cooperative Games; Game Theory; game theory; local area
                 computer networks; local area networks; multicasting;
                 originator; Probability; random time; recipients",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Preparata:1991:IVM,
  author =       "Franco P. Preparata",
  title =        "Inverting a {Vandermonde} matrix in minimum parallel
                 time",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "291--294",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "723; 921; C4140 (Linear algebra); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arithmetic operations; computational complexity;
                 Computer Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; field;
                 Fourier transform; inverse; Mathematical Techniques;
                 Matrix Algebra; matrix algebra; Matrix Inversion;
                 matrix inversion; minimum parallel time; ordered
                 nonsingular Vandermonde matrix; Parallel Algorithms;
                 parallel algorithms; Vandermonde matrices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kennedy:1991:PCS,
  author =       "Robert Kennedy",
  title =        "Parallel cardinality stacks and an application",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "295--299",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "723; C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming ---
                 Multiprocessing Programs; Data Processing; Data
                 Structures; data structures; dynamic array; EREW PRAM;
                 EREW PRAM model; maximum flow; maximum-distance
                 discharge; parallel 2-3 tree; Parallel Algorithms;
                 parallel algorithms; parallel cardinality stack;
                 Parallel Cardinality Stacks; Parallel matching;
                 processors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Irani:1991:TRL,
  author =       "Sandy Irani",
  title =        "Two results on the list update problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "301--306",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20",
  MRnumber =     "92h:68024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California at Berkeley",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "723; 922; C4240 (Programming and algorithm theory)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; Linear Lists; List Update; list update
                 problem; move-to-front; Online Algorithms; optimal
                 competitive ratio; Probability --- Random Processes;
                 Randomized Algorithms; randomized on-line algorithm;
                 sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luo:1991:ODR,
  author =       "Kenneth Luo and William Klostermeyer and Yuan-Chieh
                 Chow and Richard Newman-Wolfe",
  title =        "Optimal deadlock resolutions in edge-disjoint
                 reducible wait-for graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "307--313",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Florida Univ.,
                 Gainesville, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Computer Systems, Digital; cycle breaking;
                 Database Systems --- Distributed; Deadlock Resolution;
                 deadlock resolutions; Distributed; distributed
                 processing; distributed system; edge-disjoint reducible
                 wait-for graphs; graph theory; interprocess state;
                 Mathematical Techniques --- Graph Theory; minimum abort
                 set; nodes; polynomial-time solvable; Reducible Graphs;
                 resource sharing; Wait For Graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Latifi:1991:DSI,
  author =       "Shahram Latifi",
  title =        "Distributed subcube identification algorithms for
                 reliable hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "315--321",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nevada",
  affiliationaddress = "Las Vegas, NV, USA",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4230
                 (Switching theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Nevada Univ., Las
                 Vegas, NV, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Computer Systems, Digital; Distributed
                 Algorithms; distributed subcube identification
                 algorithms; faulty nodes; graph theory; heuristic
                 identification algorithms; hypercube networks;
                 Hypercubes; Interconnection Networks; Multiprocessing;
                 NP-complete; operational subcubes; Parallel Algorithms;
                 parallel algorithms; reliable hypercubes; Subcube
                 Identification Algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nawrocki:1991:CDR,
  author =       "Jerzy R. Nawrocki",
  title =        "Conflict detection and resolution in a lexical
                 analyzer generator",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "323--328",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technical Univ of Poznan",
  affiliationaddress = "Poznan, Pol",
  classification = "721; 723; C4210 (Formal logic)",
  corpsource =   "Inst. of Comput. Sci., Tech. Univ. of Poznan, Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Context Free Grammars; automatic
                 left context uncovery; Compiler Compilers; Computer
                 Operating Systems; Conflict Detection; Conflict
                 Resolution; context-free grammar; context-free
                 grammars; LALR(1) parser state; lexical analyzer
                 generator; Lexical Analyzer Generators; lexical
                 conflict detection; lexical conflict resolution;
                 Program Compilers; syntax",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Herley:1991:NTD,
  author =       "Kieran T. Herley",
  title =        "A note on the token distribution problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "329--334",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "92f:68007",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bounded degree network; communication; Computer
                 Networks; Computer Programming --- Algorithms; Computer
                 Systems, Digital; Data Transmission --- Packet
                 Switching; Distributed; distributed packets; efficient;
                 graph theory; local computation; nodes; packet
                 redistribution; parallel algorithms; routing
                 algorithms; Token Distribution; token distribution
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zuckerman:1991:TTA,
  author =       "David Zuckerman",
  title =        "On the time to traverse all edges of a graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "335--337",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "92g:05172",
  MRreviewer =   "Mukkai S. Krishnamoorthy",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; edge traversal; expected
                 time; graph theory; random walk; regular graphs;
                 undirected graph; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zivkovic:1991:FAF,
  author =       "Dejan Zivkovic",
  title =        "A fast algorithm for finding the compact sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "38",
  number =       "6",
  pages =        "339--342",
  day =          "28",
  month =        jun,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "92d:05161",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., Wesleyan Univ., Middletown, CT, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "compact sets; complete graph; computational
                 complexity; fast algorithm; graph theory; set theory;
                 undirected graph; vertices; weighted graph; worst-case
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nieuwenhuis:1991:EDE,
  author =       "Robert Nieuwenhuis and Pilar Nivela",
  title =        "Efficient deduction in equality {Horn} logic by
                 {Horn-completion}",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "1--6",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "92m:68106",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Politecnica de Cataluna",
  affiliationaddress = "Barcelona, Spain",
  classification = "723; C4210 (Formal logic)",
  corpsource =   "Dept. Lenguajes y Sistemas Inf., Univ. Politecnica de
                 Cataluna, Barcelona, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Completion Procedure; Computer Metatheory; Computer
                 Programming --- Logic Programming; Computer Programming
                 Languages; efficient deduction; equality Horn logic;
                 Formal Logic; formal logic; Goal Clauses; goal clauses;
                 Horn axiom; Horn clauses; Horn Clauses with Equality;
                 Horn Logic; Horn-completion; proof of completeness;
                 refutationally complete; superpositions; Theorem
                 Proving; unconditional equations; unfailing completion
                 procedure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Book:1991:ROS,
  author =       "Ronald V. Book",
  title =        "On random oracle separations",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "7--10",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15)",
  MRnumber =     "92j:68028",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "721; 723; 922; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Math., California Univ., Santa Barbara, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; Complexity Classes; Computability and
                 Decidability; computational complexity; Computer
                 Metatheory --- Computational Complexity; Probability
                 --- Random Processes; Random Oracle Separations; random
                 oracle separations; Relativized Complexity Classes;
                 set; uniform witness",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Charron-Bost:1991:CSL,
  author =       "Bernadette Charron-Bost",
  title =        "Concerning the size of logical clocks in distributed
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "11--16",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "92k:68023",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Paris",
  affiliationaddress = "Paris, Fr",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "LITP, IBP, Paris Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Asynchronous Distributed Systems; causal ordering;
                 Causality; causality relation; classical theorems;
                 computational complexity; Computer Systems, Digital;
                 Distributed; distributed systems; formal logic; global
                 clock; Logical Clocks; logical clocks; Mathematical
                 Techniques --- Set Theory; parallel algorithms;
                 Partially Ordered Sets; partially ordered sets; set
                 theory; timestamped; Timestamps",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Apostolico:1991:OST,
  author =       "Alberto Apostolico and Martin Farach and Costas S.
                 Iliopoulos",
  title =        "Optimal superprimitivity testing for strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "17--20",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R15)",
  MRnumber =     "92i:68052",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial Mathematics; combinatorial mathematics;
                 computational complexity; Computer Programming ---
                 Algorithms; Mathematical Techniques; Strings; strings;
                 Superprimitivity Testing; superprimitivity testing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1991:NH,
  author =       "Jian-er Chen and Jim Cox and Bud Mishra",
  title =        "An {NL} hierarchy",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "21--26",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15)",
  MRnumber =     "92j:68029",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Texas A\&M Univ",
  affiliationaddress = "College Station, TX, USA",
  classification = "721; 723; 922; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Texas A and M Univ., College
                 Station, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2 kth level; Automata Theory; Computability and
                 Decidability; computational complexity; Computer
                 Metatheory --- Computational Complexity;
                 Immerman-Szelepcsenyi theorem; NL Hierarchy;
                 nondeterministic oracle model; Nondeterministic
                 Oracles; nontrivial NL-hierarchy; oracle sets;
                 Polynomial Time Hierarchy; polynomial-time hierarchy;
                 Probability --- Random Processes; Query Machines;
                 relativized worlds; Savitch theorem; Space Bounded
                 Computations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Olsson:1991:ASE,
  author =       "Ronald A. Olsson and Daniel T. Huang",
  title =        "Axiomatic semantics for `escape' statements",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "27--33",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6140D (High level languages)",
  corpsource =   "Div. of Comput. Sci., California Univ., Davis, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "axiomatic semantics; Axiomatic Semantics; Computer
                 Metatheory; Computer Programming --- Algorithms;
                 Computer Programming Languages; enclosing block; escape
                 statements; Escape Statements; high level languages;
                 loop exit; multiple-level exit statements; programming
                 theory; proof rules; Proof Rules",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tamassia:1991:LBP,
  author =       "Roberto Tamassia and Ioannis G. Tollis and Jeffrey
                 Scott Vitter",
  title =        "Lower bounds for planar orthogonal drawings of
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "35--40",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35 (68Q25 68R10)",
  MRnumber =     "92i:68067",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "713; 716; 717; 718; 723; 921; B0250 (Combinatorial
                 mathematics); C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "aesthetic graph drawing; bends; computational
                 complexity; Computer Programming --- Algorithms; edges;
                 Graph Algorithms; Graph Theory; graph theory;
                 Integrated Circuits, VLSI --- Computer Aided Design;
                 light communication; lower bounds; Mathematical
                 Techniques; Microwave Communication; microwave
                 communication; Optical Communication; optimal drawings;
                 Orthogonal Drawings; Planar Embedding; planar
                 orthogonal drawings; Telecommunication Systems;
                 vertices; VLSI Layout; VLSI layout",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stohr:1991:BBN,
  author =       "Elena St{\"o}hr",
  title =        "Broadcasting in the {Butterfly} network",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "41--43",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Karl-Weierstrass-Inst f{\"u}r Mathematik",
  affiliationaddress = "Berlin, Ger",
  classification = "722; 723; 921; B0250 (Combinatorial mathematics);
                 B6150 (Communication system theory); B6210
                 (Telecommunication applications)",
  corpsource =   "Karl-Weierstrass-Inst. f{\"u}r Math., Berlin,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "broadcast time; broadcasting; Broadcasting; Butterfly
                 graph; Butterfly network; Butterfly Networks;
                 communication network; Computer Systems, Digital;
                 Distributed; graph theory; Interconnection Networks;
                 Mathematical Techniques --- Combinatorial Mathematics;
                 message dissemination; message switching;
                 telecommunication networks; unidirected graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sistla:1991:PCR,
  author =       "A. P. Sistla",
  title =        "Proving correctness with respect to nondeterministic
                 safety specifications",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "45--49",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "GTE Lab",
  affiliationaddress = "Waltham, MA, USA",
  classification = "721; 722; 723; 922; C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "GTE Labs., Waltham, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "automata; Automata Theory; completeness proofs;
                 Computer Systems, Digital; Concurrent Systems;
                 correctness proving; Distributed; finite automata;
                 finite nondeterminism; formalism; history variables;
                 multi-valued mappings; Nondeterministic Automata;
                 nondeterministic safety specifications; Probability ---
                 Random Processes; program verification; Proof Systems;
                 soundness proofs; state transition systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luccio:1991:EAS,
  author =       "Fabrizio Luccio and Linda Pagli",
  title =        "An efficient algorithm for some tree matching
                 problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "51--57",
  day =          "12",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C85 68R05)",
  MRnumber =     "92i:68060",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Graph Algorithms; leaves; Mathematical
                 Techniques; Mathematical Techniques --- Combinatorial
                 Mathematics; node label; ordered h-ary trees; Ranked
                 Trees; ranked trees; sons; special label; subtree
                 distance; Tree Matching; tree matching problems; Trees;
                 trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shvartsman:1991:AOC,
  author =       "Alex A. Shvartsman",
  title =        "Achieving optimal {CRCW PRAM} fault-tolerance",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "59--66",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q22)",
  MRnumber =     "92g:68051",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; Computer Simulation; Computer Software ---
                 Reliability; Computer Systems Programming ---
                 Multiprocessing Programs; CRCW PRAM; dynamic fail-stop
                 processor errors; fault tolerant computing; Fault
                 Tolerant Software; fault-tolerant simulation; optimal
                 CRCW PRAM fault-tolerance; Parallel Algorithms;
                 parallel algorithms; Parallel Random Access Machines;
                 PRAM algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Newman:1991:PVC,
  author =       "Ilan Newman",
  title =        "Private vs. common random bits in communication
                 complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "67--71",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "92f:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hebrew Univ",
  affiliationaddress = "Jerusalem, Isr",
  classification = "723; 922; B6150 (Communication system theory); C4230
                 (Switching theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "common random bits; common random string model;
                 Communication Complexity; communication complexity;
                 Computational Complexity; computational complexity;
                 Computer Metatheory; private random bits; private
                 random string model; Probabilistic Protocols;
                 Probability --- Random Processes; protocols; Random
                 String Models; switching theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Omondi:1991:FOM,
  author =       "Amos Omondi",
  title =        "Fast one's-complement multiplication",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "73--79",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Delaware",
  affiliationaddress = "Newark, DE, USA",
  classification = "921; C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Delaware Univ.,
                 Newark, DE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Arithmetic; Digital Arithmetic; digital
                 arithmetic; direct multiplication; Mathematical
                 Techniques; Multiplication; One's Complement
                 Multiplication; one's-complement multiplication",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Grossi:1991:NSI,
  author =       "Roberto Grossi",
  title =        "A note on the subtree isomorphism for ordered trees
                 and related problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "81--84",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "93e:68101",
  MRreviewer =   "Charles J. Colbourn",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Pisa Corso Italia",
  affiliationaddress = "Pisa, Italy",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "codeword; computational complexity; Computer
                 Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; EREW PRAM;
                 exact string matching; Mathematical Techniques; Ordered
                 Trees; ordered trees; parallel algorithm; Parallel
                 Algorithms; parallel algorithms; sequential space;
                 sequential time; string coding; String Matching;
                 Subtree Isomorphism; subtree isomorphism; Trees; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Irani:1991:CSA,
  author =       "Sandy Irani and Ronitt Rubinfeld",
  title =        "A competitive $2$-server algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "85--91",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "92i:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California Berkeley",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; balance algorithm;
                 competitive 2-server algorithm; competitive rule;
                 Computer Programming; K Server Problem; metric space;
                 Mobile Servers; mobile servers; motion planning; online
                 algorithm; Online Algorithms; optimal off-line
                 algorithm; requests; Two Server Problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sheu:1991:FTP,
  author =       "Jang-Ping Sheu",
  title =        "Fault-tolerant parallel $k$ selection algorithm in
                 $n$-cube networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "93--97",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Chungli, Taiwan",
  classification = "723; C4230 (Switching theory); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Nat. Central Univ., Chungli,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming; Computer Systems Programming ---
                 Multiprocessing Programs; fault tolerant computing;
                 fault tolerant parallel k selection algorithm; Fault
                 Tolerant Software; K Selection Algorithm;
                 multiprocessor interconnection networks; n-cube
                 networks; N-Cubes; parallel algorithm; parallel
                 algorithms; Parallel Algorithms; time complexity; Time
                 Complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bataineh:1991:PBO,
  author =       "Abdulla Bataineh and F{\"u}sun {\"O}zg{\"u}ner and
                 Alok Sarwal",
  title =        "Parallel {Boolean} operations for information
                 retrieval",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "99--108",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "723; 903; C4210 (Formal logic); C4230 (Switching
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Ohio State Univ., Columbus, OH,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean functions; Boolean operations; Boolean Search;
                 commercial hypercubes; Computer Programming ---
                 Algorithms; Computer Systems Programming ---
                 Multiprocessing Programs; distributed memory
                 multiprocessors; hypercube networks; hypercube
                 topology; Hypercubes; Information Retrieval;
                 information retrieval; Information Science; parallel
                 algorithm; Parallel Algorithms; parallel algorithms;
                 Query Processing; query terms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fantechi:1991:CBN,
  author =       "Alessandro Fantechi and Stefania Gnesi and Gioia
                 Ristori",
  title =        "Compositionality and bisimulation. {A} negative
                 result",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "2",
  pages =        "109--114",
  day =          "31",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68Q55)",
  MRnumber =     "92k:68069",
  MRreviewer =   "Teruo Hikita",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ist di Elaborazione dell'Informazione C.N.R.",
  affiliationaddress = "Pisa, Italy",
  classification = "723; C4210 (Formal logic)",
  corpsource =   "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bisimulation; bisimulation equivalence; Calculus for
                 Communicating Systems; calculus for communicating
                 systems; CCS; Compositionality; compositionality;
                 Computer Metatheory --- Formal Logic; Computer
                 Programming Languages; CTL; equivalence relations;
                 formal logic; standard temporal logic; Temporal Logic;
                 temporal ordering of events; temporal semantics;
                 Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fraigniaud:1991:BHW,
  author =       "Pierre Fraigniaud and Claudine Peyrat",
  title =        "Broadcasting in a hypercube when some calls fail",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "115--119",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNRS",
  affiliationaddress = "Lyon, Fr",
  classification = "722; 723; C4230 (Switching theory); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "LIP-IMAG, ENS, Lyon, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "broadcasting; Computer Systems, Digital; Computer
                 Systems, Digital --- Fault Tolerant Capability;
                 Distributed; fault tolerance; fault tolerant computing;
                 faulty calls; hypercube networks; Hypercubes;
                 n-dimensional hypercube",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Keil:1991:SAD,
  author =       "M. Keil",
  title =        "A simple algorithm for determining the envelope of a
                 set of lines",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "121--124",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Saskatchewan",
  affiliationaddress = "Saskatoon, Sask, Can",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4290 (Other computer theory)",
  corpsource =   "Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon,
                 Sask., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 envelope of set of lines; Envelope Of The Set Of Lines;
                 linear time; Mathematical Techniques --- Geometry;
                 sorting; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Qiu:1991:DSG,
  author =       "K. Qiu and H. Meijer and S. Akl",
  title =        "Decomposing a star graph into disjoint cycles",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "125--129",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68M10 68Q22)",
  MRnumber =     "92g:68117",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4230
                 (Switching theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Computer Systems
                 Programming --- Multiprocessing Programs; Disjoint
                 Cycles; disjoint cycles; Graph Decomposition; Graph
                 Theory; graph theory; interconnecting processors;
                 Interconnection Networks; Mathematical Techniques;
                 multiprocessor interconnection networks; n-cube;
                 Parallel Algorithms; parallel algorithms; parallel
                 computer; Star Graph; star graph; vertex disjoint
                 cycles",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huang:1991:SSM,
  author =       "Bing-Chao Huang and Michael A. Langston",
  title =        "Stable set and multiset operations in optimal time and
                 space",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "131--136",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ESP Group Inc",
  affiliationaddress = "Fremont, CA, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "ESP Group Inc., Fremont, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Data Management; Data
                 Processing; file organisation; Multiset Operations;
                 multiset operations; optimal time; Set Operations; set
                 theory; sorted files; space complexity; stable set
                 operations; time complexity; time-space optimal
                 methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Simon:1991:VCD,
  author =       "Hans Ulrich Simon",
  title =        "The {Vapnik--Chervonenkis} dimension of decision trees
                 with bounded rank",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "137--141",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (06E30)",
  MRnumber =     "92i:68132",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "723; 921; C1240 (Adaptive system theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Fachbereich 10, Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean functions; boolean functions; boolean
                 variables; bounded rank; combinatorial problems;
                 computational complexity; Computer Metatheory ---
                 Boolean Functions; Computer Metatheory ---
                 Computational Complexity; concept learning; decision
                 trees; Decision Trees; learning systems; Learning
                 Systems; Mathematical Techniques --- Combinatorial
                 Mathematics; Mathematical Techniques --- Trees;
                 pac-learning; space complexity; trees (mathematics);
                 Vapnik--Chervonenkis dimension; Vapnik--Chervonenkis
                 Dimension",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ragde:1991:LSC,
  author =       "Prabhakar Ragde and Avi Wigderson",
  title =        "Linear-size constant-depth polylog-threshold
                 circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "143--146",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "92h:68034",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "721; 723; C4230B (Combinatorial switching theory);
                 C4240 (Programming and algorithm theory); C5210 (Logic
                 design methods)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "combinatorial switching; computational complexity;
                 Computer Metatheory --- Computational Complexity;
                 Constant Depth Circuits; constant-depth circuits;
                 explicit construction; Logic Circuits; Logic Devices
                 --- Threshold Elements; Polylog Threshold Circuits;
                 polylog-threshold circuits; threshold function;
                 threshold logic; Unbounded Fan-In Circuits; unbounded
                 fan-in circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1991:SSA,
  author =       "Nian Shing Chen and Hwey Pyng Yu and Shing Tsaan
                 Huang",
  title =        "A self-stabilizing algorithm for constructing spanning
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "147--151",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10",
  MRnumber =     "92g:68111",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Sun Yat-Sen Univ",
  affiliationaddress = "Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C5470 (Performance
                 evaluation and testing); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Inf. Manage., Nat. Sun Yat-Sen Univ.,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computer Programming;
                 connected graphs; Connected Graphs; error handling;
                 error recovery; Error Recovery; fault tolerance; fault
                 tolerant computing; graph theory; Mathematical
                 Techniques --- Graph Theory; Mathematical Techniques
                 --- Trees; self-stabilizing algorithm; spanning trees;
                 Spanning Trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Heffernan:1991:TSM,
  author =       "Paul J. Heffernan",
  title =        "The translation square map and approximate
                 congruence",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "153--159",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "92i:68179",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4290 (Other
                 computer theory)",
  corpsource =   "Sch. of Oper. Res. and Ind. Eng., Cornell Univ.,
                 Ithaca, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximate Congruence; approximate
                 congruence; computational complexity; Computational
                 Geometry; computational geometry; Computer Programming;
                 computer vision; epsilon-congruence; equal cardinality
                 sets; Mathematical Techniques --- Geometry; Point
                 Matching Problem; point matching problem; set theory;
                 time complexity; Translation Square Map; translation
                 square map",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jeffs:1991:OIN,
  author =       "Janice Jeffs",
  title =        "Order independent {NCE} grammars recognized in
                 polynomial time",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "161--164",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "St. Francis Xavier Univ",
  affiliationaddress = "Antigonish, NS, Can",
  classification = "721; 723; 921; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., St. Francis Xavier
                 Univ., Antigonish, NS, Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; computational complexity; Computer
                 Programming --- Algorithms; confluence; decidability;
                 formal languages; Grammars; grammars; Graph Grammars;
                 graph grammars; graph theory; Mathematical Techniques
                 --- Graph Theory; NCE Grammars; NCE grammars;
                 nonconfluent graph grammars; order independence;
                 polynomial time; terminally labelled graph; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Garg:1991:FPN,
  author =       "M. L. Garg and S. I. Ahson and P. V. Gupta",
  title =        "A fuzzy {Petri} net for knowledge representation and
                 reasoning",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "3",
  pages =        "165--171",
  day =          "16",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Thapar Inst of Engineering and Technology",
  affiliationaddress = "Patiala, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1230
                 (Artificial intelligence); C4210 (Formal logic)",
  corpsource =   "Dept. of Electr. Eng., Thapar Inst. of Eng. and
                 Technol., Patiala, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; consistency; data
                 integrity; Decision Support Systems; formal languages;
                 fuzzy knowledge base; Fuzzy Knowledge Bases; fuzzy
                 logic; fuzzy Petri net; Fuzzy Petri Nets; inference
                 mechanisms; Knowledge Representation; knowledge
                 representation; Mathematical Techniques; Mathematical
                 Techniques --- Fuzzy Sets; Petri Nets; Petri nets;
                 reasoning; Reduction Rules; reduction rules; refutation
                 method; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sen:1991:SOS,
  author =       "Sandeep Sen",
  title =        "Some observations on skip-lists",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "173--176",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "92g:68028",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "723; 922; C4240 (Programming and algorithm theory);
                 C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "balanced binary search trees; computational
                 complexity; Computer Programming --- Algorithms; Data
                 Processing; Data Structures; data structures; expected
                 values; keys; list processing; performance;
                 probability; Probability --- Random Processes;
                 randomization; Search Procedures; search time;
                 skip-list data-structure; Skip-Lists; space
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Motoki:1991:IIA,
  author =       "Tatsuya Motoki",
  title =        "Inductive inference from all positive and some
                 negative data",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "177--182",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Niigata Univ",
  affiliationaddress = "Niigata, Jpn",
  classification = "721; 723; 912; C1230 (Artificial intelligence);
                 C4210 (Formal logic)",
  corpsource =   "Coll. of Gen. Educ., Niigata Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory --- Formal Languages; Cognitive
                 Systems; formal languages; Inductive Inference;
                 inductive inference; inference mechanisms; intelligent
                 behavior; Learning Systems; negative data; negative
                 facts; positive data; positive facts; Systems Science
                 And Cybernetics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matousek:1991:ROA,
  author =       "Ji{\v{r}}{\'\i} Matou{\v{s}}ek",
  title =        "Randomized optimal algorithm for slope selection",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "183--187",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "92h:68086",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Charles Univ",
  affiliationaddress = "Praha, Czech",
  classification = "723; 921; 922; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Appl. Math., Charles Univ., Praha,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; computational geometry; Computer Metatheory
                 --- Computational Complexity; Computer Programming;
                 deterministic algorithm; expected running time;
                 integer; Mathematical Techniques --- Geometry; plane;
                 Probability --- Random Processes; Randomized Algorithm;
                 randomized optimal algorithm; Slope Selection; slope
                 selection; smallest slope",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vanBaronaigien:1991:LAG,
  author =       "D. Roelants {van Baronaigien}",
  title =        "A loopless algorithm for generating binary tree
                 sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "189--194",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68R05)",
  MRnumber =     "92g:68027",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Victoria",
  affiliationaddress = "Victoria, BC, Can",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Victoria Univ., BC, Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; binary tree sequences;
                 Binary Trees; Computer Programming; Generation
                 Algorithms; integer sequence representation; Loopless
                 Algorithms; loopless generation algorithm; Mathematical
                 Techniques --- Combinatorial Mathematics; Mathematical
                 Techniques --- Trees; ranking; trees (mathematics);
                 unranking",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carlsson:1991:OPA,
  author =       "Svante Carlsson and Jingsen Chen",
  title =        "An optimal parallel adaptive sorting algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "195--200",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q22)",
  MRnumber =     "92h:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lund Univ",
  affiliationaddress = "Lund, Swed",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Adaptive Algorithms; computational complexity;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming --- Algorithms; Computer Systems
                 Programming; cost optimal; EREW PRAM model; input
                 sequence; maximal ascending consecutive subsequences;
                 parallel adaptive sorting algorithm; parallel
                 algorithms; Parallel Random Access Machines; presorted
                 sequences; Runs; Sorting; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Turau:1991:FNN,
  author =       "Volker Turau",
  title =        "Fixed-radius near neighbors search",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "201--203",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "GMD-IPSI Integrated Publication and Information
                 Systems Inst",
  affiliationaddress = "Darmstadt, Ger",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "GMD, Integrated Publication and Inf. Syst., Darmstadt,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; Computer Metatheory --- Computational
                 Complexity; Computer Programming; fixed-radius near
                 neighbors search; Mathematical Techniques --- Geometry;
                 Near Neighbors Search; plane; points; preprocessing;
                 run time; search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Levcopoulos:1991:SAS,
  author =       "Christos Levcopoulos and Ola Petersson",
  title =        "Splitsort---an adaptive sorting algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "205--211",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10",
  MRnumber =     "92h:68018",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lund Univ",
  affiliationaddress = "Lund, Swed",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Adaptive Algorithms; adaptive sorting algorithm;
                 comparisons; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming --- Algorithms; Computer Systems
                 Programming; data structure; input sequence;
                 inversions; pointers; presortedness; Sorting; sorting;
                 Sorting Algorithms; Splitsort; worst case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morris:1991:SCI,
  author =       "Robert J. T. Morris and Wing Shing Wong",
  title =        "Systematic choice of initial points in local search.
                 Extensions and application to neural networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "213--217",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "723; C1230 (Artificial intelligence); C4240
                 (Programming and algorithm theory)",
  corpsource =   "IBM Almaden Res. Center, San Jose, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; continuous spaces; initial points; Local
                 Search; local search; neural nets; Neural Networks;
                 neural networks; probabilistic; random search methods;
                 search algorithm; Search Methods; search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hofmeister:1991:SNT,
  author =       "Thomas Hofmeister and Walter Hohberg and Susanne
                 K{\"o}hling",
  title =        "Some notes on threshold circuits, and multiplication
                 in depth $4$",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "219--225",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q22)",
  MRnumber =     "92j:68047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Dortmund",
  affiliationaddress = "Dortmund, Ger",
  classification = "721; B1265B (Logic circuits); C4210 (Formal logic);
                 C4240 (Programming and algorithm theory); C5120 (Logic
                 and switching circuits)",
  corpsource =   "Lehrstuhl Inf. II, Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computers, Digital ---
                 Multiplying Circuits; depth 4; gates; Logic Circuits;
                 Logic Devices; multiplication; n-bit numbers;
                 polynomial size circuits; Threshold Circuits; threshold
                 circuits; Threshold Elements; threshold logic; wires",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Spinrad:1991:FLH,
  author =       "Jeremy P. Spinrad",
  title =        "Finding large holes",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "4",
  pages =        "227--229",
  day =          "30",
  month =        aug,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10",
  MRnumber =     "92h:68072",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Vanderbilt Univ",
  affiliationaddress = "Nashville, TN, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Vanderbilt Univ., Nashville,
                 TN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Graph Theory; graph theory; Induced Paths;
                 large holes; Mathematical Techniques; matrices;
                 undirected graph; Undirected Graphs; Weakly
                 Triangulated Graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schweikard:1991:TPS,
  author =       "Achim Schweikard",
  title =        "Trigonometric polynomials with simple roots",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "231--236",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40 (42A05 65T10)",
  MRnumber =     "92i:68073",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ",
  affiliationaddress = "Berlin, Ger",
  classification = "723; 921; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Tech. Univ., Berlin, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic polynomials; computational complexity;
                 computer algebra; Computer Metatheory --- Computational
                 Complexity; Mathematical Techniques; Mathematical
                 Techniques --- Poles and Zeros; odd multiples; periodic
                 function; polynomial division; polynomial time;
                 Polynomials; polynomials; reduced representation;
                 Simple Roots; simple roots; Simple Zeros; square-free
                 decomposition; trigonometric polynomial; Trigonometric
                 Polynomials; zeros",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Parekh:1991:AGH,
  author =       "Abhay K. Parekh",
  title =        "Analysis of a greedy heuristic for finding small
                 dominating sets in graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "237--240",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "92i:68127",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "MIT",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Approximate Algorithms;
                 cardinality; Computer Programming; edges; graph theory;
                 greedy algorithm; greedy heuristic; Greedy Heuristic
                 Dominating Sets; Mathematical Techniques --- Graph
                 Theory; nodes; set theory; small dominating sets;
                 undirected graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tucci:1991:RNP,
  author =       "Maurizio Tucci and Gennaro Costagliola and Shi-Kuo
                 Chang",
  title =        "A remark on {NP}-completeness of picture matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "241--243",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pittsburgh",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "723; 903; C1250 (Pattern recognition); C4240
                 (Programming and algorithm theory); C4250 (Database
                 theory); C6160S (Spatial and pictorial databases)",
  corpsource =   "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2-D string representation; computational complexity;
                 computer graphics; Computer Metatheory ---
                 Computational Complexity; computerised pattern
                 recognition; computerised picture processing; database
                 management systems; Database Systems; database theory;
                 iconic indexing; image database systems; Image
                 Databases; image retrieval; Information Retrieval;
                 information retrieval; Information Science; NP
                 Completeness; NP-completeness; objects; orthogonal
                 projections; Picture Matching; picture matching;
                 picture queries; picture retrieval; spatial relations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kavadias:1991:CRC,
  author =       "Dimitris Kavadias and Lefteris M. Kirousis and Paul
                 Spirakis",
  title =        "The complexity of the reliable connectivity problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "245--252",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68M15 68Q25)",
  MRnumber =     "92i:68125",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Computer Technology Inst",
  affiliationaddress = "Patras, Greece",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Comput. Technol. Inst., Patras, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "acyclic graphs; co-NP-complete; computational
                 complexity; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; directed graphs; directed path; distinguished
                 nodes; failed edges; Graph Connectivity; Graph Theory;
                 incident edges; Mathematical Techniques; Mathematical
                 Techniques --- Combinatorial Mathematics; nonnegative
                 integer; P Completeness; P-complete; Parallel
                 Algorithms; parallel algorithms; parallel complexity;
                 reliable connectivity problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ragde:1991:AAP,
  author =       "Prabhakar Ragde",
  title =        "Analysis of an asynchronous {PRAM} algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "253--256",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "723; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; associative function; asynchronous PRAM
                 algorithm; asynchronous PRAM model; computational
                 complexity; Computer Metatheory --- Computational
                 Complexity; Computer Programming; Computer Systems
                 Programming --- Multiprocessing Programs; Parallel
                 Algorithms; parallel algorithms; Shared Memory
                 Multiprocessors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1991:IAR,
  author =       "D. Sreenivasa Rao and John D. Provence",
  title =        "An integrated approach to routing and via
                 minimization",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "257--263",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "713; 723; 921; B0250 (Combinatorial mathematics);
                 B0260 (Optimisation techniques); B1110 (Network
                 topology); B1130B (Computer-aided circuit analysis and
                 design); B2550F (Metallisation); B2570 (Semiconductor
                 integrated circuits); C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory); C7410D (Electronic
                 engineering)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; bend; circuit layout; circuit layout
                 CAD; Computational Geometry; Computer Aided Design;
                 Computer Programming --- Algorithms; corner points;
                 integrated circuit technology; Integrated Circuits,
                 VLSI; interconnection wire; layer; Mathematical
                 Techniques --- Geometry; Mathematical Techniques ---
                 Trees; metallisation; minimisation; optimal Steiner
                 trees; Routing; routing; Steiner points; trees
                 (mathematics); Via Minimization; via minimization;
                 VLSI",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vandeSnepscheut:1991:IRT,
  author =       "Jan L. A. {van de Snepscheut}",
  title =        "Inversion of a recursive tree traversal",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "265--267",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "California Inst of Technology",
  affiliationaddress = "Pasadena, CA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., California Inst. of Technol.,
                 Pasadena, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; binary tree; Binary Trees; Computer
                 Programming --- Algorithms; infix traversals;
                 inversion; Mathematical Techniques; prefix traversals;
                 Program Inversion; programming theory; recursive
                 algorithm; recursive tree traversal; Tree Traversal;
                 Trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bron:1991:SR,
  author =       "Coenraad Bron and Wim H. Hesselink",
  title =        "Smoothsort revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "269--276",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q25)",
  MRnumber =     "92h:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rijksuniversiteit Groningen",
  affiliationaddress = "Groningen, Neth",
  classification = "723; C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Rijksuniv., Groningen,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Array Sorting; array sorting algorithm; average case;
                 comparisons; complexity; computational complexity;
                 Computer Programming --- Algorithms; Computer Systems
                 Programming; correctness; Dijkstra; exchanges;
                 heapsort; invariants; performance; quicksort;
                 Smoothsort; Sorting; sorting; Sorting Algorithm;
                 worst-case behaviour",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsu:1991:FMV,
  author =       "Lih-Hsing Hsu and Rong-Hong Jan and Yu-Che Lee and
                 Chun-Nan Hung and Maw-Sheng Chern",
  title =        "Finding the most vital edge with respect to minimum
                 spanning tree in weighted graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "277--281",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; 922; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Inf. and Comput. Sci., Nat. Chiao Tung Univ.,
                 Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithms; computational complexity; Computer
                 Programming --- Algorithms; connected; graph theory;
                 Graph Theory; Mathematical Techniques; minimum spanning
                 tree; Minimum spanning Trees; most vital edge; network;
                 time complexities; trees (mathematics); weighted
                 graphs; Weighted Graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1991:SCQ,
  author =       "Jae Dong Yang and Yoon Joon Lee",
  key =          "Yang \& Lee",
  title =        "A sound and complete query evaluation for Implicit
                 Predicate which is a semantic descriptor of unknown
                 values",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "5",
  pages =        "283--289",
  day =          "13",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  abstract =     "none given",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Seoul, South Korea",
  classification = "723; 903; C1230 (Artificial intelligence); C4250
                 (Database theory); C6160D (Relational DBMS); C6160K
                 (Deductive databases); C7250 (Information storage and
                 retrieval)",
  corpsource =   "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and
                 Technol., Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Database Systems; database theory; deductive database
                 application environments; deductive databases;
                 Deductive Databases; implicit predicate; Implicit
                 Predicate; inapplicable values; inference mechanisms;
                 inferencing mechanism; information retrieval;
                 Information retrieval, unknown values, deductive
                 database; Information Science --- Information
                 Retrieval; logically formulated descriptor; null
                 values; query evaluation; Query Evaluation; relational;
                 relational databases; semantic descriptor; SLD
                 resolution; unknown values",
  owner =        "curtis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonStengel:1991:ACS,
  author =       "Bernhard {von Stengel}",
  title =        "An algebraic characterization of semantic
                 independence",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "291--296",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "92k:68064",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Armed Forces Univ Munich",
  affiliationaddress = "Neubiberg, Ger",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Info. 5, Federal Armed Forces Univ., Munich,
                 Neubiberg, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory; Computer Programming --- Theory;
                 Mathematical Techniques --- Algebra; Programming
                 Theory; programming theory; Relational Algebra;
                 Semantic Independence; semantic independence; set
                 theory; universal algebra",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crippa:1991:SCD,
  author =       "Davide Crippa",
  title =        "A special case of the dynamization problem for least
                 cost paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "297--302",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10",
  MRnumber =     "92g:68112",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ETH Zuerich",
  affiliationaddress = "Zurich, Switz",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Inst. for Theor. Comput. Sci., ETH Zurich,
                 Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Bellman-Ford Algorithm; Computer
                 Programming --- Algorithms; cost function; digraph;
                 Digraphs; Directed Graphs; directed graphs;
                 Dynamization Problem; dynamization problem; edge; Graph
                 Algorithms; Graph Theory; Least Cost Paths; least cost
                 paths; lower convex hull problem; lower envelope;
                 Mathematical Techniques; node; optimisation; ordered
                 points; origin; query",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1991:CPH,
  author =       "Jian-er Chen",
  title =        "Characterizing parallel hierarchies by
                 reducibilities",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "303--307",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15 68Q45)",
  MRnumber =     "92i:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Texas A\&M Univ",
  affiliationaddress = "College Station, TX, USA",
  classification = "723; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Texas A and M Univ., College
                 Station, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "AC; ac Hierarchy; computational complexity;
                 Computational Complexity; Computer Metatheory; Computer
                 Systems, Digital --- Multiprocessing; Computer Systems,
                 Digital --- Parallel Processing; NC; NC Hierarchy;
                 Oracle Circuits; parallel algorithms; parallel
                 hierarchies; Parallel Hierarchies; parallel time
                 bounded reducibility; Reducibility; structural
                 property",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Howell:1991:CPI,
  author =       "Rodney R. Howell",
  title =        "The complexity of problems involving structurally
                 bounded and conservative {Petri} nets",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "309--315",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q90 (68Q25)",
  MRnumber =     "92i:68116",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kansas State Univ",
  affiliationaddress = "Manhattan, KS, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Kansas State Univ.,
                 Manhattan, KS, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity; Computational Complexity; computational
                 complexity; Computer Metatheory; Concurrency;
                 conservative Petri nets; containment; Containment
                 Problem; Equivalence Problem; equivalence problems;
                 Linear Optimization; linear optimization; Mathematical
                 Techniques --- Petri Nets; Optimization; Petri nets;
                 pspace; PSPACE; reachability; Reachability Problem;
                 reachable marking; Savitch theorem; structurally
                 bounded Petri net; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baeza-Yates:1991:HBD,
  author =       "Ricardo A. Baeza-Yates",
  title =        "Height balance distribution of search trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "317--324",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20",
  MRnumber =     "92g:68037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad de Chile",
  affiliationaddress = "Santiago, Chile",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. de Ciencias de la Computacion, Chile Univ.,
                 Santiago, Chile",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; AVL trees; balance distribution;
                 binary search trees; comparisons; Data Processing; Data
                 Structures; Height Balance Distribution; height balance
                 distribution; heuristic; Heuristics; local balance;
                 locally balanced search trees; Mathematical Techniques
                 --- Trees; pointer; random keys; Search Trees;
                 successful searches; trees (mathematics); uniform keys;
                 unsuccessful searches; worst case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bijlsma:1991:DLP,
  author =       "A. Bijlsma",
  title =        "Derivation of logic programs by functional methods",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "325--332",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723; C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming); C6110L (Logic
                 programming)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean functions; Computer Metatheory --- Boolean
                 Functions; Computer Metatheory --- Programming Theory;
                 Computer Programming; Functional Programming;
                 functional programming; functional programs; Logic
                 Program Synthesis; Logic Programming; logic
                 programming; logic programs; predicates; Program
                 Derivation; programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Myoupo:1991:DPL,
  author =       "Jean Fr{\'e}d{\'e}ric Myoupo",
  title =        "Dynamic programming on linear pipelines",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "333--341",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (90C39)",
  MRnumber =     "92m:68037a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigenda \cite{Myoupo:1992:CDP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "CNRS",
  affiliationaddress = "Orsay, Fr",
  classification = "723; 921; C1180 (Optimisation techniques); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Univ. Paris-Sud, Orsay, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; cells; Computer Programming ---
                 Algorithms; Computer Systems Programming ---
                 Multiprocessing Programs; Computer Systems, Digital ---
                 Pipeline Processing; dynamic programming; linear
                 algorithm; linear pipelines; Mathematical Programming,
                 Dynamic; Parallel Algorithms; parallel algorithms;
                 Systolic Arrays; time steps",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Raynal:1991:COA,
  author =       "Michel Raynal and Andr{\'e} Schiper and Sam Toueg",
  title =        "The causal ordering abstraction and a simple way to
                 implement it",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "6",
  pages =        "343--350",
  day =          "27",
  month =        sep,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "92g:68050",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IRISA",
  affiliationaddress = "Rennes, Fr",
  classification = "722; 723; B6110 (Information theory); B6150C
                 (Switching theory); B6150M (Protocols); C4230
                 (Switching theory); C4240 (Programming and algorithm
                 theory); C5640 (Protocols)",
  corpsource =   "IRISA, Rennes, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithm Correctness; algorithm correctness proof;
                 asynchronous execution; Causal Ordering; causal
                 ordering abstraction; communication channels; Computer
                 Programming --- Algorithms; Computer Systems, Digital;
                 Distributed; Distributed Algorithms; distributed
                 systems control; Message Ordering; message ordering
                 relation; message sequence numbering; message
                 switching; nondeterminism; program verification;
                 protocols; switching theory; telecommunication
                 channels",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crescenzi:1991:NAM,
  author =       "P. Crescenzi and C. Fiorini and R. Silvestri",
  title =        "A note on the approximation of the {MAX CLIQUE}
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "1--5",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Matematica Pura ed Applicata, L'Aqulia
                 Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation theory; computational complexity; graph;
                 graph theory; MAX CLIQUE problem; MAX NP; maximum
                 complete subgraph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Heckmann:1991:LUP,
  author =       "Reinhold Heckmann",
  title =        "Lower and upper power domain constructions commute on
                 all cpos",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "7--11",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "06B35 (18C10 68Q55)",
  MRnumber =     "93a:06007",
  MRreviewer =   "Ana Pasztor",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Univ. des Saarlandes, Saarbrucken, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bounded complete algebraic cpos; free frame; power
                 domain constructions; set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huang:1991:CRA,
  author =       "Nen Fu Huang and Ching Ho Huang",
  title =        "Complexity of the repeaters allocating problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "13--20",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68M10 68Q25)",
  MRnumber =     "92j:68121",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation algorithms; approximation theory;
                 circles; complexity; computational complexity;
                 computational geometry; digraph; directed edge; graph
                 theory; NP-hard; plane; points; radius; repeaters
                 allocating problem; set; set covering problem; set
                 theory; strongly connected; vertex",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Diekert:1991:ICS,
  author =       "Volker Diekert and Ronald V. Book",
  title =        "On ``inherently context-sensitive'' languages---an
                 application of complexity cores",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "21--23",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (03D05 03D15 68Q15)",
  MRnumber =     "92h:68047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Inst. f{\"u}r Inf., Tech. Univ., Munchen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean algebra; Boolean closure; complexity cores;
                 computational complexity; context-free languages;
                 context-sensitive languages; inherently
                 context-sensitive language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jiang:1991:NSC,
  author =       "Tao Jiang and B. Ravikumar",
  title =        "A note on the space complexity of some decision
                 problems for finite automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "25--31",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q70 (03D05 03D15 68Q25)",
  MRnumber =     "92k:68079",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140E (Game theory); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Syst., McMaster Univ.,
                 Hamilton, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-way infinite automata; computational complexity;
                 decision problems; decision theory; equivalence; finite
                 automata; membership; nonemptiness; pebble; space
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pinotti:1991:PPQ,
  author =       "Maria Cristina Pinotti and Geppino Pucci",
  title =        "Parallel priority queues",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "33--40",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q65 (68Q25)",
  MRnumber =     "92i:68105",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Istituto di Elaborazione dell'Informazione, CNR, Pisa,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data type; computational complexity;
                 CREW-PRAM; data structures; deletion; insertion;
                 integer-valued items; n-bandwidth-heap;
                 n-bandwidth-leftist-heap; parallel algorithms; parallel
                 priority queue; parallel time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shermer:1991:CAD,
  author =       "Thomas Shermer",
  title =        "A counterexample to the algorithms for determining
                 opaque minimal forests",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "41--42",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "93e:68134",
  MRreviewer =   "Michael B. Dillencourt",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 convex polygon; edges; height; line segments; opaque
                 minimal forests; Steiner tree; trees (mathematics);
                 triangle; triangulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blair:1991:BEW,
  author =       "Jean R. S. Blair and Errol L. Lloyd",
  title =        "The benefits of external wires in single row routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "43--49",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35",
  MRnumber =     "92k:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1110 (Network topology); B1130B (Computer-aided
                 circuit analysis and design); B2210B (Printed circuit
                 layout and design); B2570 (Semiconductor integrated
                 circuits); C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C7410D (Electronic
                 engineering)",
  corpsource =   "Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circuit layout CAD; computational complexity; external
                 wires; NP-complete; PCB routing; printed circuit
                 design; signal points; single row routing; topological
                 structure; topology; two-two routings; VLSI; VLSI
                 routing; wire topologies",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hesselink:1991:RKU,
  author =       "Wim H. Hesselink",
  title =        "Repetitions, known or unknown?",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "1",
  pages =        "51--57",
  day =          "11",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "92i:68099",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rijksuniv., Groningen,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "imperative programming language; nondeterminacy;
                 program verification; programming theory; repetitions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Janardan:1991:DMM,
  author =       "Ravi Janardan",
  title =        "On the dynamic maintenance of maximal points in the
                 plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "59--64",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 computational geometry; Computer Programming ---
                 Algorithms; Contour Queries; contour query; Data
                 Processing; data structure; Data Structures; data
                 structures; dynamic maintenance; m-contour;
                 Mathematical Techniques --- Geometry; Maximal Points;
                 maximal points; online deletions; online insertions;
                 plane; staircase-shaped contour; vertical query line",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yodaiken:1991:MFC,
  author =       "Victor Yodaiken",
  title =        "Modal functions for concise definition of state
                 machines and products",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "65--72",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "92m:68077",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Massachusetts",
  affiliationaddress = "Amherst, MA, USA",
  classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. and Inf. Syst., Massachusetts Univ.,
                 Amherst, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "automata products; Automata Theory; Automata Theory
                 --- Formal Languages; complex control; computer
                 engineering; Finite Automata; finite automata; Finite
                 State Transition Systems; finite state transition
                 systems; formal languages; function composition;
                 generalized feedback product; modal extension; Modal
                 Functions; modal functions; Moore machine; Moore
                 Machines; past input signals; primitive recursive
                 functions; recursive functions; regular expressions;
                 rule; semigroups; state dependent extension; state
                 diagrams; state machines; state products; state sets;
                 state systems; wreath products",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bonnier:1991:SFP,
  author =       "S. Bonnier and U. Nilsson and T. N{\"a}slund",
  title =        "A simple fixed point characterization of three-valued
                 stable model semantics",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "73--78",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Fri Nov 13 11:09:16 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Link{\"o}ping Univ",
  affiliationaddress = "Link{\"o}ping, Sweden",
  classification = "723; C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory);
                 C6110L (Logic programming)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
                 Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory --- Programming Theory; Computer
                 Programming; fixed point characterization; Formal
                 Semantics; logic programming; Logic Programming; logic
                 programs; programming theory; Stable Model Semantics;
                 ternary logic; three-valued stable model semantics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pan:1991:PCM,
  author =       "V. Pan and J. Reif",
  title =        "The parallel computation of minimum cost paths in
                 graphs by stream contraction",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "79--83",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CUNY",
  affiliationaddress = "Bronx, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Lehman Coll., City
                 Univ. of New York, Bronx, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; Computer Systems Programming ---
                 Multiprocessing Programs; graph theory; Mathematical
                 Techniques --- Graph Theory; minimum cost path
                 computation; Minimum Cost Paths; n-vertex graph; order
                 relation; parallel algorithm; parallel algorithms;
                 Parallel Algorithms; path algebra computation; stream
                 contraction; Stream Contraction",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1991:NER,
  author =       "Yi Xian Yang",
  title =        "New enumeration results about the optical orthogonal
                 codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "85--87",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Beijing Univ of Posts and Telecommunications",
  affiliationaddress = "Beijing, China",
  classification = "723; B6120B (Codes); C1260 (Information theory)",
  corpsource =   "Dept. of Inf. Eng., Beijing Univ. of Posts and
                 Telecommun., China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "codes; Codes, Symbolic; exact value; information
                 theory; integral part; Optical Orthogonal Codes;
                 optical orthogonal codes; real number; Sequences",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Allender:1991:RRR,
  author =       "Eric Allender and Vivek Gore",
  title =        "Rudimentary reductions revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "89--95",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D05 03D15)",
  MRnumber =     "92m:68030",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rutgers Univ",
  affiliationaddress = "New Brunswick, NJ, USA",
  classification = "721; 723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
                 NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Formal Languages; circuit
                 complexity classes; complexity class; Computational
                 Complexity; computational complexity; Computer
                 Metatheory; Dlogtime-uniform AC/sup 0/ circuits; Jones;
                 log-bounded rudimentary predicates; recent years;
                 Rudimentary Reductions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Subramaniyam:1991:CSE,
  author =       "R. V. Subramaniyam and A. A. Diwan",
  title =        "A counterexample for the sufficiency of edge guards in
                 star polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "97--99",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "92m:68125",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Bombay, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Bombay, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Geometry; computational geometry;
                 Computer Metatheory; Edge Guards; edge guards;
                 Mathematical Techniques --- Geometry; Star Polygons;
                 star polygons; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1991:CEP,
  author =       "Xiaodong Wang",
  title =        "On the complexity of the extreme points decision
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "101--106",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "92m:68048",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Max-Planck-Institut f{\"u}r Informatik",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "723; 921; 922; C4240 (Programming and algorithm
                 theory); C4260 (Computational geometry)",
  corpsource =   "Max-Planck-Inst. f{\"u}r Inf., Saarbrucken, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebraic Decision Trees; Ben-Or theorem; complexity;
                 Computational Complexity; computational complexity;
                 Computational Geometry; computational geometry;
                 Computer Metatheory; convex hull; Decision Theory and
                 Analysis; edge; Extreme Points Decision Problem;
                 fixed-order algebraic-decision-tree model; lower-bound
                 proof; Mathematical Techniques --- Geometry;
                 Mathematical Techniques --- Trees; planar extreme
                 points decision problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1991:SSG,
  author =       "Ruay Shiung Chang",
  title =        "Single step graph search problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "107--111",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "93a:68054",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Chung Yuan Christian Univ",
  affiliationaddress = "Chung-Li, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Inf. and Comput. Eng., Chung Yuan Christian
                 Univ., Chung-Li, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; edge; fugitive; Graph Search; graph search
                 problem; graph theory; interval graph; Interval Graphs;
                 intractable; Mathematical Techniques --- Graph Theory;
                 search problems; searchers; single step; sufficient and
                 necessary condition; unbounded speed",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brandt:1991:ACH,
  author =       "Jonathan Brandt and Carlos Cabrelli and Ursula
                 Molter",
  title =        "An algorithm for the computation of the {Hutchinson}
                 distance",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "2",
  pages =        "113--117",
  day =          "25",
  month =        oct,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Brandt:1992:CAC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "UC Davis",
  affiliationaddress = "Davis, CA, USA",
  classification = "723; 922; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Div. of Comput. Sci., California Univ., Davis, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "absolute values; algorithm theory; Algorithms;
                 approximation theory; Computer Programming; finite
                 one-dimensional sequences; fractals; Hutchinson
                 distance; Hutchinson Metric; Hutchinson metric; input
                 measures; linear-time algorithm; partial sums;
                 pointwise difference; Probability; Probability
                 Measures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aggarwal:1991:DDS,
  author =       "Alok Aggarwal and Prabhakar Raghavan",
  title =        "Deferred data structure for the nearest neighbor
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "119--122",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "723; 921; C6120 (File organisation)",
  conferenceyear = "1991",
  corpsource =   "IBM Res. Div. Thomas. J. Watson Res. Center, Yorktown
                 Heights, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational Geometry; Computer
                 Programming; Data Processing --- Data Structures; data
                 structures; deferred data structure; Mathematical
                 Techniques --- Geometry; Nearest Neighbor Problem;
                 nearest neighbor problem; point queries",
  treatment =    "P Practical",
}

@Article{Hsu:1991:LTA,
  author =       "Wen-Lian Hsu and Kuo-Hui Tsai",
  title =        "Linear time algorithms on circular-arc graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "123--129",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "93a:68117",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Acad Sinica",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C6120 (File
                 organisation)",
  conferenceyear = "1991",
  corpsource =   "Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Circular Arc Graphs; circular-arc graphs;
                 combinatorial mathematics; combinatorial structures;
                 Computer Programming; data structures; linear time
                 algorithms; Mathematical Techniques --- Graph Theory;
                 Maximum Independent Set; maximum independent set;
                 Minimum Clique Cover; minimum clique cover;
                 optimization; unweighted version",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boyd:1991:SPP,
  author =       "Sylvia Boyd and Hasan Ural",
  title =        "The synchronization problem in protocol testing and
                 its complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "131--136",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Ottawa",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "721; 723; C4220 (Automata theory); C4240P (Parallel
                 programming and algorithm theory); C5640 (Protocols)",
  conferenceyear = "1991",
  corpsource =   "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Finite Automata; complexity;
                 computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Networks; finite
                 automata; heuristic techniques; minimum length
                 synchronizable test sequence; necessary and sufficient
                 condition; Protocol Testing; protocol testing;
                 Protocols; protocols; synchronisation; Synchronization
                 Problem; synchronization problem; Transition Tour",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mehta:1991:CIA,
  author =       "Shashank Mehta and Maharaj Mukherjee and George Nagy",
  title =        "Constrained integer approximation to planar line
                 intersection",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "137--139",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rensselaer Polytechnic Inst",
  affiliationaddress = "Troy, NY, USA",
  classification = "723; 921; C4130 (Interpolation and function
                 approximation); C4260 (Computational geometry)",
  conferenceyear = "1991",
  corpsource =   "Dept. of Electr., Comput. and Syst. Eng., Rensselaer
                 Polytech., Troy, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximation theory; Computational
                 Geometry; computational geometry; Computer Programming;
                 constant-time operations; Constrained Integer
                 Approximation; constrained integer approximation;
                 denominators; floor functions; integer division;
                 integer-valued coordinates; intercepts; intersecting
                 straight lines; largest integer; Mathematical
                 Techniques --- Geometry; numerators; Planar Line
                 Intersection; planar line intersection; quadrant;
                 rational slopes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Abadi:1991:PLC,
  author =       "M. Abadi and B. Alpern and K. R. Apt and N. Francez
                 and S. Katz and L. Lamport and F. B. Schneider",
  title =        "Preserving liveness: comments on {``Safety and
                 liveness from a methodological point of view''}
                 {[Inform. Process. Lett. {\bf 36}(1), 1 October 1990,
                 pp. 25--30]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "141--142",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Dederichs:1990:SLM,Dederichs:1991:RCM}.",
  acknowledgement = ack-nhfb,
  classification = "C6110B (Software engineering techniques)",
  corpsource =   "Digital Equipment Corp. Syst. Res. Center, Palo Alto,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "formal specification; liveness property; preserving
                 liveness; safety property; specifications",
  treatment =    "P Practical",
}

@Article{Dederichs:1991:RCM,
  author =       "Frank Dederichs and Rainer Weber",
  title =        "Reply to the comments by {M. Abadi et al.}",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "143--143",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Abadi:1991:PLC,Dederichs:1990:SLM}.",
  acknowledgement = ack-nhfb,
  classification = "C6110B (Software engineering techniques)",
  corpsource =   "Inst. f{\"u}r Inf. Tech. Univ. Munchen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract specification; compatibility; formal program
                 development; formal specification; stepwise
                 refinement",
  treatment =    "P Practical",
}

@Article{Chen:1991:COI,
  author =       "Wen-Huei Chen and Chuan Yi Tang",
  title =        "Computing the optimal {IO} sequences of a protocol in
                 polynomial time",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "145--148",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tsing-Hwa Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; C4220 (Automata theory); C5640 (Protocols);
                 C5670 (Network performance)",
  conferenceyear = "1991",
  corpsource =   "Inst. of Comput. Sci., Tsing-Hwa Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Networks --- Protocols; Computer
                 Programming; conformance testing; finite automata;
                 Optimal io Sequences; optimal IO sequences; polynomial
                 time; protocol; Protocol Testing; protocols; shortest
                 sequence; transitions",
  treatment =    "P Practical",
}

@Article{Brewster:1991:NRH,
  author =       "Richard Brewster and Gary MacGillivray",
  title =        "A note on restricted {$H$}-colouring",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "149--151",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Simon Fraser Univ",
  affiliationaddress = "Burnaby, BC, Can",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  conferenceyear = "1991",
  corpsource =   "Dept. of Mat. and Stat., Simon Fraser Univ., Burnaby,
                 BC, Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; decidability; decision
                 problem; Graph Coloring; graph colouring; Graph Theory;
                 homomorphism; Mathematical Techniques; NP-complete;
                 restricted H-colouring",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ghosh:1991:BSD,
  author =       "Sukumar Ghosh",
  title =        "Binary self-stabilization in distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "153--159",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Iowa",
  affiliationaddress = "Iowa City, IA, USA",
  classification = "722; 723; C4220 (Automata theory)",
  conferenceyear = "1991",
  corpsource =   "Dept. of Comput. Sci., Iowa Univ., IA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary Machines; binary machines; binary self
                 stabilization; Computer Systems, Digital; Distributed;
                 distributed processing; distributed systems; finite
                 automata; global convergence; local actions; Self
                 Stabilization; self-adjusting systems; two-state
                 machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wein:1991:VRA,
  author =       "Joel Wein",
  title =        "{Las Vegas RNC} algorithms for unary weighted perfect
                 matching and {$T$}-join problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "161--167",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  conferenceyear = "1991",
  corpsource =   "Dept. of Math., MIT, Cambridge, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bipartite Graph; bipartite graph;
                 combinatorial mathematics; computational complexity;
                 Computer Programming; graph; Las Vegas RNC Algorithms;
                 Las Vegas RNC algorithms; Mathematical Techniques ---
                 Graph Theory; minimum-weight perfect matching; Monte
                 Carlo randomized algorithm; optimality; parallel
                 algorithms; Perfect Matching; planar multicommodity
                 flow; T-Join; T-join problems; unary weighted perfect
                 matching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pelc:1991:BCN,
  author =       "Andrzej Pelc",
  title =        "Broadcasting in complete networks with faulty nodes
                 using unreliable calls",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "3",
  pages =        "169--174",
  day =          "8",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite du Quebec",
  affiliationaddress = "Quebec, Can",
  classification = "723; B6210 (Telecommunication applications); C5670
                 (Network performance)",
  conferenceyear = "1991",
  corpsource =   "Dept. d'Inf., Quebec Univ., Hull, Que., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Broadcast Networks; complete communication network;
                 complete networks; Computer Networks; constant
                 probability; expected logarithmic time; fault tolerant
                 computing; fault-free node; Faulty Networks; Faulty
                 Nodes; faulty nodes; performance evaluation;
                 telecommunication networks; Unreliable Calls;
                 unreliable calls",
  treatment =    "P Practical",
}

@Article{Uhlmann:1991:SGP,
  author =       "Jeffrey K. Uhlmann",
  title =        "Satisfying general proximity\slash similarity queries
                 with metric trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "175--179",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Naval Research Lab",
  affiliationaddress = "Washington, DC, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Inf. Technol. Div., Naval Res. Lab., Washington, DC,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; ball decompositions; Computational
                 Geometry; computational geometry; Computer Programming;
                 data structures; divide-and-conquer; Mathematical
                 Techniques --- Geometry; Metric Trees; metric trees;
                 network optimization; pattern recognition; Proximity
                 Queries; Search methods; search problems; trees
                 (mathematics); unit ball; worst-case performance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gonzalez:1991:CSP,
  author =       "Teofilo F. Gonzalez",
  title =        "Covering a set of points in multidimensional space",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "181--188",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (05B40)",
  MRnumber =     "92k:68093",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Utrecht Univ",
  affiliationaddress = "Utrecht, Netherlands",
  classification = "723; 921; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximation algorithm; approximation
                 theory; computational complexity; computational
                 geometry; Computer Programming; Covering Problems;
                 fixed-size orthogonal hyperrectangles; fixed-size
                 orthogonal hypersquares; hyperdiscs; Mathematical
                 Techniques --- Approximation Theory; multidimensional
                 space; points covering; polynomial-time approximation;
                 polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Halperin:1991:DCC,
  author =       "Dan Halperin and Micha Sharir",
  title =        "On disjoint concave chains in arrangements of (pseudo)
                 lines",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "189--192",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B55 (05D05 68U05)",
  MRnumber =     "92m:52029",
  MRreviewer =   "Franz Aurenhammer",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Halperin:1994:CDC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel-Aviv Univ",
  affiliationaddress = "Tel-Aviv, Israel",
  classification = "921; C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Tel-Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 computational geometry; concave polygonal chains;
                 edges; Geometry; Mathematical Techniques; Mathematical
                 Techniques --- Combinatorial Mathematics;
                 pairwise-disjoint; Polygonal Chains; pseudo lines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jiang:1991:DTG,
  author =       "Bin Jiang",
  title =        "{DFS}-traversing graphs in a paging environment, {LRU}
                 or {MRU}?",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "193--196",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ETH Zurich",
  affiliationaddress = "Zurich, Switzerland",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Inf. Syst. Databases, ETH
                 Zurich, Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; buffer replacement strategy; computational
                 complexity; Computer Programming; Depth First Search;
                 DFS-traversing graphs; graph theory; least recently
                 used; LRU; Mathematical Techniques --- Graph Theory;
                 most recently used; MRU; paging environment; Paging
                 Environments; Search methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ronn:1991:LER,
  author =       "Stefan Ronn",
  title =        "On the logarithmic evaluation of recurrence
                 relations",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "197--199",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Swedish Sch of Economics",
  affiliationaddress = "Helsinki, Finland",
  classification = "723; 921; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Stat. and Comput. Sci., Swedish Sch. of
                 Econ., Helsinki, Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Chebyshev approximation; Chebyshev
                 Polynomials; Chebyshev polynomials; complexity;
                 computational complexity; Computer Programming;
                 Fibonacci Numbers; Fibonacci numbers; homomorphism;
                 iterative algorithm; iterative methods; linear
                 homogeneous recurrence relation; Logarithmic
                 Algorithms; Mathematical Techniques --- Polynomials;
                 matrix; polynomials; program verification; Recurrence
                 Relations.",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1991:YAE,
  author =       "Do-Hyung Kim and Kwang-Moo Choe",
  title =        "Yet another efficient backward execution algorithm in
                 the {AND\slash OR} process model",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "201--211",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigenda \cite{Kim:1992:CYA}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "723; C4210 (Formal logic); C4240P (Parallel
                 programming and algorithm theory); C6110L (Logic
                 programming)",
  corpsource =   "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and
                 Technol., Taejon, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; AND/OR process model; and/or Process
                 Model; backward execution algorithm; Backward Execution
                 Algorithms; cancel messages; clauses; Computer
                 Programming; Computer Programming --- Logic
                 Programming; formal logic; independent redoing;
                 independent resetting; logic programming; logic
                 programs; parallel algorithms; parallel evaluation;
                 programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Massart:1991:ACS,
  author =       "T. Massart",
  title =        "An agent calculus with simple actions where the
                 enabling and disabling are derived operators",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "213--218",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Libre de Bruxelles",
  affiliationaddress = "Brussels, Belgium",
  classification = "723; C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Lab. d'Inf., Univ. Libre de Bruxelles, Belgium",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "agent calculus; Agent Calculus; choice; Computer
                 Metatheory; Computer Programming Languages; derived
                 operators; disabling; enabling; formal languages;
                 hiding; LOTOS; LOTOS Specification Language; parallel
                 composition; recursion; relabelling; sequence; simple
                 actions; specification language; specification
                 languages; Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cherief:1991:TFA,
  author =       "F. Cherief and Ph. Schnoebelen",
  title =        "$\tau$-Bisimulations and full abstraction for
                 refinement of actions",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "219--222",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNRS",
  affiliationaddress = "Grenoble, France",
  classification = "723; C1160 (Combinatorial mathematics); C4210
                 (Formal logic)",
  corpsource =   "Lab. d'Inf. Fondamentale et d'Intelligence
                 Artificielle, Inst. Imag-CNRS, Grenoble, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "action refinement; branching bisimulation; Computer
                 Metatheory; Concurrency; congruence; eta-bisimulation;
                 formal languages; full abstraction; graph theory;
                 process graphs; Refinement of Actions;
                 tau-bisimulation; tau-bisimulations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1991:FAL,
  author =       "Rong Lin",
  title =        "Fast algorithms for lowest common ancestors on a
                 processor array with reconfigurable buses",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "4",
  pages =        "223--230",
  day =          "25",
  month =        nov,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "SUNY at Geneseo",
  affiliationaddress = "Geneseo, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Geneseo, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Array Processing; computational
                 complexity; Computer Programming; Computer Systems
                 Programming --- Multiprocessing Programs; lowest common
                 ancestors; Lowest Common Ancestors; Mathematical
                 Techniques --- Trees; nodes; ordered trees; parallel
                 algorithms; Parallel Algorithms; processor array;
                 reconfigurable busses; trees (mathematics); unordered
                 trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pettersson:1991:LEC,
  author =       "Jimmi S. Pettersson",
  title =        "Letter to the Editor: Comments on {``Always-true is
                 not invariant''}: Assertional reasoning about
                 invariance {[Inform. Process. Lett. {\bf 35}(6), 15
                 September 1990, pp. 277--279]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "231--233",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Verjus:1987:PDA,VanGasteren:1990:CPD}.",
  acknowledgement = ack-nhfb,
  affiliation =  "TEL",
  affiliationaddress = "Horsholm, Den",
  classification = "723; 731; 922; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "TFL, Horsholm, Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Always-True; always-true; Assertional Reasoning;
                 assertional reasoning; Computer Metatheory ---
                 Programming Theory; Computer Programming --- Program
                 Debugging; Control Systems; formal logic; Hoare logic;
                 Invariance; invariance; Invariant; Mathematical Models
                 --- Theory; Program Composition; Program Correctness;
                 program correctness; program verification; programming
                 theory; Sanders' Theorem; UNITY reasoning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Domingo-Ferrer:1991:DUI,
  author =       "Josep Domingo-Ferrer",
  title =        "Distributed user identification by zero-knowledge
                 access rights proving",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "235--239",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Autonoma de Barcelona",
  affiliationaddress = "Barcelona, Spain",
  classification = "716; 717; 718; 722; 723; C4240 (Programming and
                 algorithm theory); C6130S (Data security)",
  corpsource =   "Dept. d'Inf., Univ. Autonoma de Barcelona, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Access Control; access control; certified list;
                 computational complexity; computer network; computer
                 networks; Computer Networks --- Protocols; Computer
                 Workstations; cryptography; Data Processing --- Data
                 Acquisition; Data Processing --- Security of Data;
                 Database Systems; Distributed; Distributed
                 Identification; Distributed Systems; distributed user
                 identification; rights granting; rights revocation;
                 secret information; Servers; servers; unshared rights;
                 User Portability; user registration; Zero Knowledge
                 Proofs; zero-knowledge access rights proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1991:RNA,
  author =       "Zhi-Zhong Chen",
  title =        "A randomized {NC} algorithm for the maximal tree cover
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "241--246",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Electro-Communications",
  affiliationaddress = "Chofu-shi, Jpn",
  classification = "723; 921; 922; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Electro-Commun.,
                 Tokyo, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Complexity;
                 Computer Metatheory; EREW PRAM; exclusive-read
                 exclusive-write random access machine; graph;
                 Mathematical Models --- Computation; Mathematical
                 Techniques --- Algorithms; Mathematical Techniques ---
                 Trees; Maximal Edge Induced Subgraph Problem (MEIS);
                 Maximal Independent Set Problem (MIS); Maximal Matching
                 Problem (mm); maximal subtrees; maximal tree cover
                 problem; Maximal Tree Cover Problem; Maximal Vertex
                 Induced Subgraph Problem (MVIS); parallel algorithms;
                 Parallel Algorithms; path separators; randomized NC
                 algorithm; simple paths; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Park:1991:SCV,
  author =       "James K. Park",
  title =        "A special case of the $n$-vertex traveling-salesman
                 problem that can be solved in ${O(n)}$ time",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "247--254",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sandia Natl Lab",
  affiliationaddress = "Albuquerque, NM, USA",
  classification = "723; 921; 922; C1160 (Combinatorial mathematics);
                 C1180 (Optimisation techniques); C1290 (Applications of
                 systems theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Sandia Nat. Labs., Albuquerque, NM, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Analysis of Algorithms; Combinatorial Problems;
                 computational complexity; Computer Programming ---
                 Algorithms; cost array; Demidenko conditions; Design of
                 Algorithms; directed graphs; dynamic programming;
                 Dynamic Programming; dynamic-programming algorithm;
                 Graph Theory; Mathematical Techniques; Mathematical
                 Techniques --- Mathematical Models; Monge arrays; Monge
                 Arrays; n-vertex traveling-salesman problem; NP-hard;
                 online searching; operations research; Optimization;
                 polynomial time; The Traveling Salesman Problem;
                 traveling-salesman tour",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grossi:1991:FCS,
  author =       "Roberto Grossi",
  title =        "Further comments on the subtree isomorphism for
                 ordered trees: {``On the subtree isomorphism problem
                 for ordered trees'' [Inform. Process. {Lett. \bf 32}
                 (1989), no. 5, 271--273; MR 90k:68139] by E.
                 {M{\"a}kinen}}",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "255--256",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C05 68P05 68Q25)",
  MRnumber =     "93c:68077",
  MRreviewer =   "Fabrizio Luccio",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Makinen:1989:SIP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "723; 731; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Binary Tree Representation; Codes,
                 Symbolic --- Coding Errors; coding; Computer Metatheory
                 --- Binary Sequences; Computer Programming ---
                 Algorithms; Design of Algorithms; Mathematical
                 Techniques; Mathematical Techniques --- Linear Algebra;
                 Ordered Trees; ordered trees; Subtree Isomorphism;
                 subtree isomorphism; Trees; trees (mathematics);
                 unordered rooted trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mahapatra:1991:MFP,
  author =       "Rabi N. Mahapatra and Harish Pareek",
  title =        "Modelling a fast parallel thinning algorithm for
                 shared memory {SIMD} computers",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "257--261",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kharagpur, India",
  classification = "721; 723; 741; 921; 922; C1250 (Pattern
                 recognition); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electron. and Electr. Commun. Eng., Indian
                 Inst. of Technol., Kharagpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 Programming; computerised pattern recognition;
                 computerised picture processing; cost performance;
                 Image Processing --- Analysis; Mathematical Models ---
                 Performance; Optimization --- Costs; Parallel
                 Algorithms; parallel algorithms; parallel thinning
                 algorithm; Shared Memory Computers; shared memory SIMD
                 computers; Thinning; time performance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stewart:1991:CPS,
  author =       "Iain A. Stewart",
  title =        "Complete problems for symmetric logspace involving
                 free groups",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "263--267",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15 03D40 20E05)",
  MRnumber =     "93e:68023",
  MRreviewer =   "Heinrich Seidel",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Newcastle upon Tyne",
  affiliationaddress = "Newcastle upon Tyne, Engl",
  classification = "723; 921; 922; C1110 (Algebra); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Comput. Lab., Newcastle upon Tyne Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Abstract Algebra; Complete Problems; Computational
                 Complexity; computational complexity; Computer
                 Metatheory; countably-generated free groups;
                 finitely-generated subgroups; Free Groups; generalized
                 word problem; Generalized Word Problems; group theory;
                 Mathematical Models --- Computation; Mathematical
                 Techniques; Symmetric Logspace; symmetric logspace",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chaochen:1991:CD,
  author =       "Zhou Chaochen and C. A. R. Hoare and Anders P. Ravn",
  title =        "A calculus of durations",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "269--276",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T27",
  MRnumber =     "92i:68162",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "722; 723; 921; 922; C4180 (Integral equations);
                 C4210 (Formal logic); C6110B (Software engineering
                 techniques)",
  corpsource =   "Oxford Univ. Comput. Lab., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "calculus of durations; Computer Metatheory --- Binary
                 Sequences; Computer Programming --- Logic Programming;
                 Computer Software --- Software Engineering; Computer
                 Systems, Digital; duration integrals; gas burner;
                 integral equations; interval temporal logic; leakage;
                 Mathematical Models; Mathematical Techniques; Real Time
                 Operation; Real Time Systems; real-time systems;
                 reasoning; software engineering; Specification
                 Languages; Temporal Logic; temporal logic;
                 time-critical systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Guha:1991:ETA,
  author =       "Sumanta Guha and Arunabha Sen",
  title =        "Expected time analysis of interpolation merge --- {A}
                 simple new merging algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "277--281",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin-Milwaukee",
  affiliationaddress = "Milwaukee, WI, USA",
  classification = "723; 921; 922; C4240 (Programming and algorithm
                 theory); C6130 (Data handling techniques)",
  corpsource =   "Wisconsin Univ., Milwaukee, WI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Analysis of Algorithms; array index; Binary Merge;
                 binary merge; binary search; computational complexity;
                 Computer Programming --- Analysis; Computer Systems
                 Programming --- Merging; expected behavior; expected
                 time analysis; incremental indexing; Interpolation;
                 Interpolation Merge; interpolation merge; Linear
                 Search; linear search; Mathematical Techniques;
                 Mathematical Techniques --- Algorithms; merging;
                 merging algorithm; Probability; search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsiao:1991:SSS,
  author =       "Ju Yuan Hsiao and Chuan Yi Tang and Ruay Shiung
                 Chang",
  title =        "Solving the single step graph searching problem by
                 solving the maximum two-independent set problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "283--287",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsin-Chu, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsin-Chu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Analysis; Design of an Algorithm; Graph Searching
                 Problem; graph theory; Graph Theory; Mathematical
                 Techniques; Mathematical Techniques --- Algorithms;
                 Mathematical Techniques --- Combinatorial Mathematics;
                 maximum two-independent set; search problems; set
                 theory; single step graph searching; Single Step Graph
                 Searching Problem; special graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bartha:1991:STM,
  author =       "Mikl{\'o}s Bartha and {\'E}va Gomb{\'a}s",
  title =        "A structure theorem for maximum internal matchings in
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "289--294",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C70 (05C35)",
  MRnumber =     "92m:05143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Memorial Univ of Newfoundland",
  affiliationaddress = "St. John's, Newfoundl, Can",
  classification = "921; C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Memorial Univ. of Newfoundland,
                 St. John's, Nfld., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "external vertices; Gallai-Edmonds structure theorem;
                 Graph Matching; Graph Theory; graph theory; graphs;
                 Mathematical Techniques; Maximum Internal Matching;
                 maximum internal matchings; Perfect Internal matching;
                 perfect internal matchings; Structure theorem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1991:RCR,
  author =       "Chang-Biau B. Yang",
  title =        "Reducing conflict resolution time for solving graph
                 problems in broadcast communications",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "295--302",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Sun Yat-sen Univ",
  affiliationaddress = "Kaohsiung, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math., Nat. Sun Yat-sen Univ.,
                 Kaohsiung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "average time complexity; breadth-first search problem;
                 broadcast communication model; broadcast conflicts;
                 Broadcast Conflicts; computational complexity; Computer
                 Programming --- Algorithms; Computer Systems, Digital
                 --- Multiprocessing; Conflict Resolution; connected
                 component problem; graph problems; Graph Problems;
                 graph theory; Graph Theory; Mathematical Techniques;
                 parallel algorithms; randomized conflict resolution;
                 search problems; Topological Ordering; topological
                 ordering problem; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barsi:1991:MAB,
  author =       "Ferruccio Barsi",
  title =        "Mod $m$ arithmetic in binary systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "303--309",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M07 (68Q35)",
  MRnumber =     "92m:68009",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNR",
  affiliationaddress = "Pisa, Italy",
  classification = "713; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C5230 (Digital
                 arithmetic methods)",
  corpsource =   "Istituto di Elaborazione dell'Informazione, CNR, Pisa,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary integers; binary systems; computational
                 complexity; conversion processes; digital arithmetic;
                 Digital Arithmetic; Integrated Circuits, VLSI;
                 large-moduli residue arithmetic; look-up tables;
                 Mathematical Techniques; mod m addition; mod m
                 arithmetic; Mod M Arithmetic; multiplication; number
                 theory; residue notation; table lookup; VLSI
                 implementations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kumar:1991:HAH,
  author =       "Akhil Kumar and Shun Yan Cheung",
  title =        "A high availability $\sqrt {N}$ hierarchical grid
                 algorithm for replicated data",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "311--316",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723; C4240 (Programming and algorithm theory); C4250
                 (Database theory); C6160B (Distributed DBMS)",
  corpsource =   "Graduate Sch. of Manage., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; correctness proof; Database Systems;
                 database theory; distributed databases; hierarchical
                 grid algorithm; Hierarchical Grid Algorithm;
                 hierarchical grid protocol; low availability;
                 protocols; quorum sizes; replicated data; Replicated
                 Data; Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Allison:1991:SPC,
  author =       "L. Allison and T. I. Dix and C. N. Yee",
  title =        "Shortest path and closure algorithms for banded
                 matrices",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "317--322",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Monash Univ",
  affiliationaddress = "Melbourne, Australia",
  classification = "723; 921; C1110 (Algebra); C1160 (Combinatorial
                 mathematics); C4140 (Linear algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Monash Univ., Melbourne, Vic.,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "all-pairs shortest paths problem; band-width; banded
                 matrices; Banded Matrices; closure algorithms; Closure
                 Algorithms; computational complexity; Computer
                 Programming --- Algorithms; graph theory; Mathematical
                 Techniques; matrix algebra; Matrix Algebra;
                 negative-cycle problem; path lengths; Shortest Path
                 Problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shen:1991:SH,
  author =       "Xiaojun Shen and Edward M. Reingold",
  title =        "Scheduling on a hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "323--328",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Missouri-Kansas City",
  affiliationaddress = "Kansas City, MO, USA",
  classification = "722; 723; C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Comput. Sci. Telecommun. Program, Missouri-Kansas City
                 Univ., MO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Computer Systems, Digital; Computer
                 Systems, Digital --- Scheduling; fixed dimension
                 hypercube; hypercube networks; hypercube scheduling;
                 Hypercubes; independent jobs; minimum finishing time;
                 Multiprocessing; parallel algorithms; preemptive
                 schedule; scheduling; worst-case-time algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chu:1991:ECF,
  author =       "Pai-Cheng C. Chu",
  title =        "Evaluating clustering factor approach to estimating
                 block selectivities",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "329--334",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "723; 903; C4250 (Database theory); C6160D
                 (Relational DBMS)",
  corpsource =   "Dept. of Accounting and Manage. Inf. Syst., Ohio State
                 Univ., Columbus, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "block accesses; block selectivity; Block Selectivity;
                 clustering factor; Clustering Factor Approach; Data
                 Management; Database Systems; database theory; distinct
                 attribute value classes; distinct page identifiers;
                 Information Science --- Information Retrieval; page
                 accesses; Query Processing; query selection; record
                 retrieval; relational databases; Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ghosh:1991:BHS,
  author =       "Subrata Ghosh and Ambuj Mahanti",
  title =        "Bidirectional heuristic search with limited
                 resources",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "335--340",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "723; C1230 (Artificial intelligence); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "15-puzzle; AI; algorithm theory; Algorithms; backward
                 search; bidirectional heuristic search algorithms;
                 Bidirectional Search; Computer Programming; execution
                 time; forward search; front-to-front algorithm;
                 Heuristic Search; limited resources; problem solving;
                 search fronts; search problems; solution quality; state
                 space problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ercal:1991:DEI,
  author =       "Fikret Ercal",
  title =        "Distributed evaluation of an iterative function for
                 all object pairs on an {SIMD} hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "6",
  pages =        "341--345",
  day =          "30",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bilkent Univ",
  affiliationaddress = "Ankara, Turkey",
  classification = "723; C4130 (Interpolation and function
                 approximation); C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Eng. and Inf. Sci., Bilkent Univ.,
                 Ankara, Turkey",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "C objects; Computer Programming --- Algorithms;
                 Computer Systems Programming; distributed algorithm;
                 hypercube networks; Hypercubes; iterative function;
                 Iterative Functions; iterative methods; local
                 interprocessor communication; Multiprocessing Programs;
                 object pairs; pairwise combinations; parallel
                 algorithms; SIMD hypercube; uniform load distribution",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DiBattista:1992:CVR,
  author =       "Giuseppe {Di Battista} and Roberto Tamassia and
                 Ioannis G. Tollis",
  title =        "Constrained visibility representations of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "1--7",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rome",
  affiliationaddress = "Rome, Italy",
  classification = "921; C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automatic Graph Drawing; Computational Geometry;
                 computational geometry; constrained visibility
                 representations; edges; entity relationship diagrams;
                 graph drawings; Graph Theory; graph theory; horizontal
                 segments; Mathematical Techniques; Mathematical
                 Techniques --- Geometry; planar graphs; query paths;
                 timed PERT diagrams; vertical segments; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jacob:1992:MRC,
  author =       "Jeremy Jacob",
  title =        "A model of reconfiguration in communicating sequential
                 processes with a notion of transactions",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "9--12",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "722; 723; C6110B (Software engineering techniques);
                 C6150J (Operating systems)",
  corpsource =   "Oxford Univ., Comput. Lab., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Communicating Sequential Processes; communicating
                 sequential processes; Computer Systems, Digital;
                 Distributed; formal specification; model of
                 reconfiguration; notion of transactions; orthogonality;
                 reasoning; Reconfigurable Systems; system structure;
                 transaction processing; transactions",
  treatment =    "P Practical",
}

@Article{Ancona:1992:OLK,
  author =       "Massimo Ancona and Claudia Fassino and Vittoria
                 Gianuzzi",
  title =        "Optimization of {LR(k)} ``Reduced parsers''",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "13--20",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Genova",
  affiliationaddress = "Genova, Italy",
  classification = "721; 723; 921; C1180 (Optimisation techniques);
                 C4210 (Formal logic)",
  corpsource =   "Dipartimento di Matematica, Genova Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; canonical LR tables; Computer
                 Programming --- Algorithms; corresponding algorithms;
                 Formal Languages; formal languages; grammar; grammars;
                 LR(k) tables; optimisation; Optimization; optimization
                 algorithms; Parsing Tables; programming languages;
                 reduced parsers; Reduced Tables; reduced tables;
                 sufficient condition",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Atkinson:1992:GBT,
  author =       "M. D. Atkinson and J. R. Sack",
  title =        "Generating binary trees at random",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "21--23",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (60C05 60J15 68Q25)",
  MRnumber =     "92m:68090",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "723; 921; 922; C1160 (Combinatorial mathematics);
                 C6120 (File organisation); C7310 (Mathematics)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary Trees; Chung-Feller theorem; Computer
                 Programming --- Algorithms; Data Processing; data
                 structures; Data Structures; generating random binary
                 trees; linear-time algorithm; Mathematical Techniques
                 --- Trees; n nodes; Probability --- Random Processes;
                 random number generation; trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Stotts:1992:PTN,
  author =       "P. David Stotts and Parke Godfrey",
  title =        "Place\slash transition nets with debit arcs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "25--33",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "721; 921; C1160 (Combinatorial mathematics); C4210
                 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Dept. of Comp. and Inf. Sci., Florida Univ.,
                 Gainesville, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "always true precondition; antitoken; automata;
                 Automata Theory; automata theory; Debit Arcs; debit
                 arcs; formal languages; graph colouring; Mathematical
                 Techniques; Petri Nets; Place/Transition Nets;
                 place/transition nets; tokens",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pachl:1992:SPC,
  author =       "Jan Pachl",
  title =        "A simple proof of a completeness result for {\em
                 leads-to\/} in the {UNITY} logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "35--38",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Pachl:1992:CSP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Canada Ltd",
  affiliationaddress = "North York, Ont, Can",
  classification = "723; C4210 (Formal logic); C4240P (Parallel
                 programming and algorithm theory); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "Centre for Adv. Studies, IBM Canada Ltd., North York,
                 Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "completeness result; Computer Metatheory; Computer
                 Metatheory --- Formal Logic; Computer Programming ---
                 Theory; direct proof; formal logic; leads-to;
                 predicate-transformer; Program Correctness; program
                 verification; Programming Theory; proof; temporal
                 logic; unity Logic; UNITY logic",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1992:BFT,
  author =       "Calvin C.-Y. Chen and Sajal K. Das",
  title =        "Breadth-first traversal of trees and integer sorting
                 in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "39--49",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q25)",
  MRnumber =     "93b:68013",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of North Texas",
  affiliationaddress = "Denton, TX, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., North Texas Univ., Denton, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "breadth-first traversal; computational complexity;
                 Computer Programming --- Algorithms; Computer Systems
                 Programming; Computer Systems Programming --- Sorting;
                 cost-optimal parallel algorithm; EREW PRAM; EREW PRAM
                 model; integer sorting; Mathematical Techniques ---
                 Trees; Multiprocessing Programs; parallel algorithms;
                 Parallel Algorithms; parentheses matching problem;
                 search problems; sorting; time complexity; trees; trees
                 (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Srimani:1992:ADA,
  author =       "Pradip K. Srimani and Rachamallu L. N. Reddy",
  title =        "Another distributed algorithm for multiple entries to
                 a critical section",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "51--57",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Colorado State Univ",
  affiliationaddress = "Ft. Collins, CO, USA",
  classification = "722; 723; C5620 (Computer networks and techniques);
                 C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Colorado State Univ., Ft.
                 Collins, CO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory --- Computational Complexity;
                 Computer Programming --- Algorithms; Computer Systems,
                 Digital; critical section; Distributed; distributed
                 algorithm; Distributed Algorithms; distributed
                 processing; distributed system; K simultaneous entries;
                 multiple entries; Mutual Exclusion Algorithms;
                 simplistic average case analysis",
  treatment =    "P Practical",
}

@Article{Misra:1992:CPS,
  author =       "Jayadev Misra",
  title =        "Corrigenda: {``Phase synchronization''} {[Inform.
                 Process. Lett. {\bf 38}(2), 26 April 1991, pp.
                 101--105]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "59--59",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Feb 01 15:19:23 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Misra:1991:PS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kobuchi:1992:OSF,
  author =       "Youichi Kobuchi",
  title =        "Order of state functions and logic functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "61--66",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "92B20 (68U05)",
  MRnumber =     "92m:92003",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ryukoku Univ",
  affiliationaddress = "Seta, Jpn",
  classification = "723; C4260 (Computational geometry)",
  corpsource =   "Dept. of Electron. and Inf., Fac. of Sci. and
                 Technol., Ryukoku Univ., Seta, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational geometry; Computer Metatheory --- Formal
                 Logic; graphical expression; Heaviside function; Logic
                 Functions; logic functions; minterm normal form; Neural
                 Networks; one to one correspondence; order; parity
                 function; Parity Functions; positive term normal form;
                 real numbers; State Functions; state functions;
                 Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pavlu:1992:EIL,
  author =       "Petr Pavlu",
  title =        "On efficient implementation of {LR}-attributed
                 grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "67--75",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Czech Technical Univ",
  affiliationaddress = "Prague, Czech",
  classification = "721; 921; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput., Czech Tech. Univ., Prague,
                 Czechoslovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "attribute evaluation; Attribute Grammars; attribute
                 grammars; Automata theory; Grammars; inherited
                 attributes; LR Parsing; LR parsing; LR-attributed
                 Grammars; LR-attributed grammars; LR-automaton;
                 Optimization; optimization; Semantic Expressions;
                 semantic expressions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Adams:1992:IAB,
  author =       "Carlisle M. Adams",
  title =        "On immunity against {Biham} and {Shamir}'s
                 ``differential cryptanalysis''",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "77--80",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bell-Northern Research Ltd",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "723; B6120B (Codes); C1260 (Information theory);
                 C4240 (Programming and algorithm theory); C6130S (Data
                 security)",
  corpsource =   "Bell-Northern Res. Ltd., Ottawa, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "8-round Lucifer; algorithm theory; bent function based
                 substitution boxes; cryptanalytic attack; Cryptography;
                 cryptography; cryptosystems; Data Encryption Standard;
                 data encryption standard; DES; DES-like ciphers;
                 differential cryptanalysis; n-round FEAL; s-boxes;
                 Substitution Boxes; substitution-permutation network;
                 Substitution-permutation Networks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{VonZurGathen:1992:PEE,
  author =       "Joachim {Von Zur Gathen}",
  title =        "Processor-efficient exponentiation in finite fields",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "81--86",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto",
  affiliationaddress = "Toronto, Ont, Can",
  classification = "723; B6120B (Codes); C1260 (Information theory);
                 C4240P (Parallel programming and algorithm theory);
                 C6130S (Data security)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Computer Systems
                 Programming; Cryptography; cryptography;
                 Exponentiation; exponentiation; Finite Fields; finite
                 fields; ground field; Multiprocessing Programs; normal
                 basis; Parallel Algorithms; parallel algorithms;
                 processor-efficiency",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leermakers:1992:RAE,
  author =       "Rene Leermakers",
  title =        "A recursive ascent {Earley} parser",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "87--91",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Philips Research Lab",
  affiliationaddress = "Eindhoven, Neth",
  classification = "721; 723; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Philips Res. Labs., Eindhoven, Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; computational complexity;
                 computational linguistics; Computer Programming ---
                 Algorithms; correctness proofs; Earley algorithm;
                 Formal Languages; grammars; LR Parsers; LR-parsers;
                 LR-parsing; recursive ascent Earley parser;
                 shift-reduce parser",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yao:1992:FAS,
  author =       "Xin Yao",
  title =        "Finding approximate solutions to {NP}-hard problems by
                 neural networks is hard",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "93--98",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "92B20 (68Q25 90C27)",
  MRnumber =     "92m:92005",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Australian Natl Univ",
  affiliationaddress = "Canberra, Aust",
  classification = "723; 921; C1180 (Optimisation techniques); C1230D
                 (Neural nets); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Res. Sch. of Phys. Sci. and Eng., Australian Nat.
                 Univ., Canberra, ACT, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Approximate Solutions; approximate solutions;
                 Combinatorial Optimization; computational complexity;
                 Computer Metatheory --- Computational Complexity; hard
                 combinatorial optimization problems; Mathematical
                 Techniques --- Combinatorial Mathematics; neural nets;
                 Neural Networks; neural networks; NP Hard Problems;
                 NP-hard problems; NP=co-NP; optimisation; Optimization;
                 polynomial size network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1992:FMS,
  author =       "R. C. Chang and H. S. Lee",
  title =        "Finding a maximum set of independent chords in a
                 circle",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "99--102",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "92m:68118",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Nat. Chiao Tung Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "chords; circle; computational complexity;
                 Computational Geometry; computational geometry;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming --- Algorithms; Geometry;
                 Independent Chords; Mathematical Techniques;
                 Mathematical Techniques --- Graph Theory; maximum
                 independent set; Maximum Independent Sets;
                 partitioning; Polygons; time complexity; uniformly
                 monotone polygons; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aurenhammer:1992:SSL,
  author =       "Franz Aurenhammer and Gerd St{\"o}ckl",
  title =        "Searching for segments with largest relative overlap",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "103--108",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Freie Univ",
  affiliationaddress = "Berlin, Ger",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Inst. f{\"u}r Inf., Fachbereich Math., Freie Univ.,
                 Berlin, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 computational geometry; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Data Processing --- Data Structures; data
                 structure; data structures; geometric searching;
                 Geometry; intersecting line segments; largest relative
                 overlap; Mathematical Techniques; Overlapping Segments;
                 query segment; search problems; segment searching;
                 x-axis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huang:1992:SSA,
  author =       "Shing Tsaan Huang and Nian Shing Chen",
  title =        "A self-stabilizing algorithm for constructing
                 breadth-first trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "2",
  pages =        "109--117",
  day =          "14",
  month =        feb,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15",
  MRnumber =     "93a:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "HsinChu, Taiwan",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. of Comput. Sci., Nat. Tsing Hua Univ., HsinChu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; bounded function; Breadth First
                 Trees; breadth-first trees; computation step; Computer
                 Programming --- Algorithms; Fault Tolerant Software;
                 Mathematical Techniques; rules; self-stabilizing
                 algorithm; Self-Stabilizing Algorithms; Trees; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gemignani:1992:FIH,
  author =       "Luca Gemignani",
  title =        "Fast inversion of {Hankel} and {Toeplitz} matrices",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "119--123",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Parma",
  affiliationaddress = "Parma, Italy",
  classification = "723; 921; B0290H (Linear algebra); C4140 (Linear
                 algebra)",
  corpsource =   "Dipartimento di Matematica, Parma Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Euclidean
                 Algorithm; Euclidean scheme; fast inversion; Hankel
                 matrices; Mathematical Techniques; Matrix Algebra;
                 matrix algebra; Matrix Inversion; polynomials; Toeplitz
                 matrices",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kirchherr:1992:KCR,
  author =       "W. W. Kirchherr",
  title =        "{Kolmogorov} complexity and random graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "125--130",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25 68Q30)",
  MRnumber =     "92m:68093",
  bibdate =      "Thu Oct 12 07:17:28 2000",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "San Jose State Univ",
  affiliationaddress = "San Jose, CA, USA",
  classification = "723; 921; 922; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., San Jose State Univ.,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; graph theory; Kolmogorov
                 Complexity; Kolmogorov complexity; labeled tree;
                 Mathematical Techniques; Mathematical Techniques ---
                 Combinatorial Mathematics; Probability --- Random
                 Processes; Random Graphs; random graphs; Random
                 Mappings; Trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Misra:1992:CPV,
  author =       "J. Misra and David Gries",
  title =        "A constructive proof of {Vizing}'s theorem",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "131--133",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "color incident; Computer Programming --- Algorithms;
                 constructive proof; edge incident; Graph Algorithms;
                 Graph Coloring; graph colouring; Graph Theory;
                 Mathematical Techniques; valid graph; Vizing's Theorem;
                 Vizing's theorem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shermer:1992:LAB,
  author =       "Thomas C. Shermer",
  title =        "A linear algorithm for bisecting a polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "135--140",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Simon Fraser Univ",
  affiliationaddress = "Burnaby, BC, Can",
  classification = "723; 921; C4260 (Computational geometry)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bisecting a polygon; Computational Geometry;
                 computational geometry; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Geometry; halfplanes; linear algorithm;
                 Linear Time Algorithms; Mathematical Techniques;
                 Polygon Bisection; prune-and-search",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Esselink:1992:OAA,
  author =       "Klaas Esselink",
  title =        "Order of {Appel}'s algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "141--147",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Koninklijke\slash Shell-Lab",
  affiliationaddress = "Amsterdam, Neth",
  classification = "723; 931; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Koninklijke/Shell-Lab., Amsterdam, Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Appel's Algorithm; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming --- Algorithms; Dynamics; Gravitation;
                 gravitational force field; many Body Problem; N
                 particles; simulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Aggarwal:1992:PCC,
  author =       "Alok Aggarwal",
  title =        "Parallel complexity of computing a maximal set of
                 disjoint paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "149--151",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Research Div",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown
                 Heights, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming ---
                 Multiprocessing Programs; Depth First Search;
                 depth-first search forest; directed graphs; Disjoint
                 Paths; Graph Theory; Mathematical Techniques; maximal
                 paths problem; maximal set of disjoint paths; Maximal
                 Sets; n-vertex graph; NC-reducible; Parallel
                 Algorithms; Parallel Complexity; parallel complexity;
                 Search Methods",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rajcani:1992:OPC,
  author =       "Peter Rajcani",
  title =        "Optimal parallel $3$-coloring algorithm for rooted
                 trees and its applications",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "153--156",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of South Carolina",
  affiliationaddress = "Columbia, SC, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., South Carolina Univ., Columbia,
                 SC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "7-coloring; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; CRCW PRAM; Graph Algorithms; Graph coloring;
                 graph colouring; Mathematical Techniques; Maximal
                 Independent Sets; optimal parallel 3-colouring
                 algorithm; parallel algorithms; Parallel Algorithms;
                 Planar Graphs; rooted trees; Tree Coloring; Trees;
                 trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Verma:1992:STP,
  author =       "Rakesh M. Verma",
  title =        "Strings, trees, and patterns",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "157--161",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Houston",
  affiliationaddress = "Houston, TX, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1250
                 (Pattern recognition); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; linear time algorithm; Linear Time
                 Algorithms; Mathematical Techniques; ordered subtree
                 isomorphism; pattern matching; pattern recognition;
                 patterns; Subtree Isomorphism; subtree isomorphism;
                 symbolic problems; Trees; trees; trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Larsen:1992:NFR,
  author =       "Kim S. Larsen and Michael I. Schwartzbach and Erik M.
                 Schmidt",
  key =          "Larsen et al.",
  title =        "A new formalism for relational algebra",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "163--168",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aarhus Univ",
  affiliationaddress = "Aarhus, Den",
  classification = "723; 921; C6160D (Relational DBMS)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "aggregate functions; arithmetic functions; Database
                 Systems; Database Systems --- Relational; Databases;
                 factorization of relations; FC Language; FC language;
                 formalism; Mathematical Techniques --- Algebra; query
                 analysis; Query Languages; query languages; relational
                 algebra; Relational Algebra; relational algebra;
                 relational databases; semantics",
  owner =        "bassili",
  treatment =    "P Practical",
}

@Article{Wada:1992:OFT,
  author =       "Koichi Wada and Yupin Luo and Kimio Kawaguchi",
  title =        "Optimal fault-tolerant routings for connected graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "3",
  pages =        "169--174",
  day =          "6",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C90 (68M10 68M15 90B12)",
  MRnumber =     "92m:05189",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Nagoya Inst of Technology",
  affiliationaddress = "Nagoya, Jpn",
  classification = "723; 921; C5620 (Computer networks and techniques);
                 C5670 (Network performance)",
  corpsource =   "Nagoya Inst. of Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "biconnected graph; Computer Programming ---
                 Algorithms; connected graphs; Digraphs; directed edge;
                 directed graph; Directed Graphs; distributed
                 processing; fault tolerant computing; Fault Tolerant
                 Routings; fault-tolerance measures; Graph Algorithms;
                 Graph Theory; Mathematical Techniques; nonfaulty nodes;
                 optimal fault tolerant routings; Routing; surviving
                 route graph",
  treatment =    "P Practical",
}

@Article{Szalas:1992:AFL,
  author =       "Andrzej Sza{\l}as",
  title =        "Axiomatizing fixpoint logics",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "175--180",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B70 (03B45 68Q60)",
  MRnumber =     "93a:03030",
  MRreviewer =   "Neculai Curteanu",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Warsaw",
  affiliationaddress = "Warsaw, Pol",
  classification = "723; C4210 (Formal logic)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory; fixpoint equations; Fixpoint
                 Logics; fixpoint logics; Formal Logic; infinitary proof
                 systems; many-valued logics; Multimodal Logics;
                 multimodal logics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gusfield:1992:EAA,
  author =       "Dan Gusfield and Gad M. Landau and Baruch Schieber",
  title =        "An efficient algorithm for the {All Pairs Suffix ---
                 Prefix Problem}",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "181--185",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California at Davis",
  affiliationaddress = "Davis, CA, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Div. of Comput. Sci., California Univ., Davis, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; all pairs suffix-prefix problem;
                 computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming; fixed
                 alphabet; longest suffix; programming theory; String
                 Matching; Suffix-Prefix Matching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wu:1992:SSP,
  author =       "L. C. Wu and C. Y. Tang",
  title =        "Solving the satisfiability problem by using randomized
                 approach",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "187--190",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723; 922; C1140G (Monte Carlo methods); C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computability; computational complexity;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming; conjunctive normal form; Monte
                 Carlo methods; polynomial average time; Probabilistic
                 Algorithms; Probability --- Random Processes;
                 probability of failure; randomized algorithm;
                 Randomized Algorithms; Satisfiability; satisfiability
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rote:1992:CCG,
  author =       "G{\"u}nter Rote and Gerhard Woeginger",
  title =        "Counting convex $k$-gons in planar point sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "191--194",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "93c:68108",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ Graz",
  affiliationaddress = "Graz, Austria",
  classification = "723; 921; C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Inst. f{\"u}r Math., Tech. Univ., Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational Geometry;
                 computational geometry; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Convex k-gons; convex k-gons; Geometry;
                 Mathematical Techniques; Mathematical Techniques ---
                 Combinatorial Mathematics; planar point sets; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kamin:1992:HSM,
  author =       "Samuel Kamin",
  title =        "Head-strictness is not a monotonic abstract property",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "195--198",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Urbana-Champaign",
  affiliationaddress = "Urbana, IL, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "abstract domain; Abstract Interpretation; Computer
                 Metatheory --- Programming Theory; Computer Programming
                 --- Theory; Computer Programming Languages; definable
                 by abstract interpretation; Functional Programming;
                 functional programming; Head Strictness;
                 head-strictness; language; lists; monotonic abstract
                 property; monotonic map; prefix; programming theory;
                 standard semantics; Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Buss:1992:GME,
  author =       "Samuel R. Buss",
  title =        "The graph of multiplication is equivalent to
                 counting",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "199--201",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "San Diego, CA, USA",
  classification = "721; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., California Univ., San Diego, La Jolla,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "AC/sup 0/-reducible; ACO reducible; Circuit
                 Complexity; computational complexity; Computer
                 Metatheory --- Computational Complexity; counting;
                 function form multiplication; graph of multiplication;
                 graph theory; Logic Circuits; Logic Devices ---
                 Threshold Elements; majority; Mathematical Techniques
                 --- Graph Theory; multiplication graph; Multiplication
                 Graphs; Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Radhakrishnan:1992:IBC,
  author =       "Jaikumar Radhakrishnan",
  title =        "Improved bounds for covering complete uniform
                 hypergraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "203--207",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C65 05C85)",
  MRnumber =     "92m:68095",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rutgers Univ",
  affiliationaddress = "New Brunswick, NJ, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
                 NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complete uniform hypergraphs; computational
                 complexity; Computer Metatheory --- Computational
                 Complexity; Computer Programming --- Algorithms;
                 covering bounds; Graph Algorithms; Graph Covering;
                 Graph Theory; graph theory; Hypergraphs; lower bounds;
                 Mathematical Techniques; Mathematical Techniques ---
                 Combinatorial Mathematics; perfect hash function;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoover:1992:DSS,
  author =       "Debra Hoover and Joseph Poole",
  title =        "A distributed self-stabilizing solution to the dining
                 philosophers problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "209--213",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "Baltimore, MD, USA",
  classification = "722; 723; C4240P (Parallel programming and algorithm
                 theory); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., Baltimore, MD,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "asymmetry; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; Computer Systems, Digital; Computer Systems,
                 Digital --- Fault Tolerant Capability; Concurrency;
                 concurrency control; Dining Philosophers Problem;
                 Distributed; parallel algorithms; self-stabilising
                 dining philosophers algorithm; Self-Stabilizing
                 Solutions; token",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arvind:1992:CDS,
  author =       "K. Arvind and C. Pandu Ragan",
  title =        "Connected domination and {Steiner} set on weighted
                 permutation graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "215--220",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "93b:68067",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol.,Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Dominating Sets; Graph Algorithms; Graph
                 Theory; graph theory; Mathematical Techniques;
                 minimum-cardinality connected dominating set;
                 minimum-weight connected dominating set; minimum-weight
                 Steiner subset; Permutation Graphs; set theory; Steiner
                 set; Steiner Sets; Weighted Permutation Graphs;
                 weighted permutation graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldmann:1992:SLB,
  author =       "Mikael Goldmann and Johan H{\aa}stad",
  title =        "A simple lower bound for monotone clique using a
                 communication game",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "221--226",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25 94C10)",
  MRnumber =     "93a:68115",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Royal Inst of Technology",
  affiliationaddress = "Stockholm, Swed",
  classification = "721; 723; 921; C1160 (Combinatorial mathematics);
                 C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., R. Inst. of Technol.,
                 Stockholm, Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean circuit; Boolean functions; communication
                 game; Communication Games; computational complexity;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming --- Algorithms; depth; Graph
                 Theory; graph theory; k-Clique Problem; Logic Circuits
                 --- Theory; lower bound; Mathematical Techniques;
                 monotone circuit; Monotone Circuits; monotone clique;
                 Monotone Cliques; n-vertex graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ma:1992:OED,
  author =       "Eva Ma and Bhagirath Narahari and Lixin Tao",
  title =        "Optimal embedding of $2${-D} torus into ring",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "4",
  pages =        "227--231",
  day =          "18",
  month =        mar,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C10 (05C35 68R10)",
  MRnumber =     "93e:05025",
  MRreviewer =   "J. Paredaens",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Glasgow Univ",
  affiliationaddress = "Glasgow, Scotl",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2-D torus; bijective embedding; column-major;
                 computational complexity; computational geometry;
                 Computer Programming --- Algorithms; Computer Systems,
                 Digital --- Distributed; dilation cost; Graph
                 Algorithms; Graph Embedding; graph theory; Graph
                 Theory; Mathematical Techniques; Mutual Exclusion;
                 Optimal Embedding; ring; row-major",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shoudai:1992:CLD,
  author =       "Takayoshi Shoudai",
  title =        "A ${P}$-complete language describable with iterated
                 shuffle",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "233--238",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q15 68Q20)",
  MRnumber =     "93i:68110",
  MRreviewer =   "Boles{\l}aw Miko{\l}ajczak",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kyushu Inst of Technology",
  affiliationaddress = "Iizuka, Japan",
  classification = "721; 723; C4210 (Formal logic); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Control Eng. and Sci., Kyushu Inst. of
                 Technol., Iizuka, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory; computational complexity; Computer
                 Metatheory --- Computational Complexity; concatenation;
                 finite alphabet; formal languages; Formal Languages;
                 intersection; iterated shuffle; Iterated Shuffle;
                 Kleene star; P-complete language; P-Complete Languages;
                 shuffle closure; shuffle operator; single expression;
                 union",
  treatment =    "P Practical",
}

@Article{Whaley:1992:ADC,
  author =       "Tom Whaley",
  title =        "Alternative developments of cyclic-permutation
                 algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "239--241",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05A05 (68Q20)",
  MRnumber =     "93b:05007",
  MRreviewer =   "H. L. Abbott",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Washington and Lee Univ",
  affiliationaddress = "Lexington, VA, USA",
  classification = "723; 921; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Lee Univ., Lexington, VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "array representation; Combinatorial Mathematics;
                 Computer Programming --- Algorithms; coordinate
                 transformation; Cyclic Permutation Algorithms;
                 cyclic-permutation algorithms; formal development;
                 Mathematical Techniques; programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1992:IPA,
  author =       "Guorong Wang",
  title =        "An improved parallel algorithm for computing the
                 generalized inverse {$A^+$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "243--251",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Shanghai Normal Univ",
  affiliationaddress = "Shanghai, China",
  classification = "723; 921; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Math. Sci., Shanghai Normal Univ., China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming ---
                 Multiprocessing Programs; computing the generalized
                 inverse; Mathematical Techniques; Matrix Algebra;
                 Matrix Inversion; parallel algorithm; parallel
                 algorithms; Parallel Algorithms; time complexity; Time
                 Complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rivin:1992:DPS,
  author =       "Igor Rivin and Ramin Zabih",
  title =        "A dynamic programming solution to the $n$-queens
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "253--256",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (90C39 90D40)",
  MRnumber =     "93a:90053",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "NEC Research Inst",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "723; 921; B0250 (Combinatorial mathematics); B0260
                 (Optimisation techniques); C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques)",
  corpsource =   "NEC Res. Inst., Princeton, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial Mathematics; Computer Metatheory ---
                 Computational Complexity; dynamic programming; dynamic
                 programming solution; game theory; low-order
                 polynomial; mathematical Programming, Dynamic;
                 Mathematical Techniques; N-Queens Problem; n-queens
                 problem; nontrivial upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Narayanaswami:1992:EIH,
  author =       "Chandrasekhar Narayanaswami and William Randolph
                 Franklin",
  title =        "Edge intersection on the hypercube computer",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "257--262",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rensselaer Polytechnic Inst",
  affiliationaddress = "Troy, NY, USA",
  classification = "723; 921; C4240P (Parallel programming and algorithm
                 theory); C4260 (Computational geometry)",
  corpsource =   "Dept. of Electr. Comput. and Syst. Eng., Rensselaer
                 Polytech. Inst., Troy, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Geometry; computational geometry;
                 Computer Graphics; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; edge intersection; geometric applications;
                 Geometry; hypercube computer; interference detection;
                 line segments; Mathematical Techniques; parallel
                 algorithm; Parallel Algorithms; parallel algorithms;
                 parallelisation; performance evaluation; polygons;
                 sequential algorithm; set operations; visible surface
                 determination",
  treatment =    "A Application; P Practical",
}

@Article{Ko:1992:GPB,
  author =       "Chun Wa Ko and Frank Ruskey",
  title =        "Generating permutations of a bag by interchanges",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "263--269",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Centrum voor Wiskunde en Informatica",
  affiliationaddress = "Amsterdam, Netherlands",
  classification = "723; 921; C5230 (Digital arithmetic methods); C7310
                 (Mathematics)",
  corpsource =   "Centrum voor Wiskunde en Inf., Amsterdam,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bag by interchanges; Bag Permutations; Combinatorial
                 Mathematics; Computer Programming --- Algorithms;
                 Mathematical Techniques; permutations generation;
                 random number generation; successive permutations; time
                 linear",
  treatment =    "P Practical",
}

@Article{Urrutia:1992:AFO,
  author =       "J. Urrutia and F. Gavril",
  title =        "An algorithm for fraternal orientation of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "271--274",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (05C85 68R10)",
  MRnumber =     "93d:05060",
  MRreviewer =   "Hortensia Galeana-S{\'a}nchez",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Ottawa",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; chordal; Computer Programming ---
                 Algorithms; Digraphs; directed graph; Directed Graphs;
                 forbidden subgraphs; Fraternal Orientation; fraternal
                 orientation of graphs; Graph Theory; graph theory;
                 Intersection Graphs; intersection graphs; Mathematical
                 Techniques; polynomial time algorithm; undirected
                 graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blazewicz:1992:SMT,
  author =       "J. Blazewicz and P. Dell'Olmo and M. Drozdowski and M.
                 G. Speranza",
  title =        "Scheduling multiprocessor tasks on three dedicated
                 processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "275--280",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Blazewicz:1994:CSM}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Politechnika Poznanska",
  affiliationaddress = "Poznan, Poland",
  classification = "722; 723; 913; C1180 (Optimisation techniques);
                 C4130 (Interpolation and function approximation);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Inst. Inf., Politech. Poznanska, Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "approximation algorithm; computational complexity;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming --- Algorithms; Computer Systems,
                 Digital; Dedicated Processors; dimensional processors;
                 makespan; minimisation; minimization; Multiprocessing;
                 multiprocessor tasks scheduling; NP-hard; Polynomial
                 Time Algorithms; polynomials; Processor Allocation;
                 scheduling; Scheduling; simultaneous availability",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dam:1992:GDB,
  author =       "Mads Dam",
  title =        "{$R$}-generability, and definability in branching time
                 logics",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "281--287",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B70 (03B45 68Q60)",
  MRnumber =     "93h:03032",
  MRreviewer =   "J.-J. Ch. Meyer",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "723; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Edinburgh Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "branching time logic; branching time logics; Branching
                 Time Logics; closure conditions; Computer Metatheory;
                 CTL*; definability; Definability; Formal Logic; fusion
                 closure; linear next-time operator; path
                 quantification; R-generability; R-Generability; suffice
                 closure; temporal logic; Temporal Logics; zig-zag
                 relation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Myoupo:1992:CDP,
  author =       "Jean Fr{\'e}d{\'e}ric Myoupo",
  title =        "Corrigenda: {``Dynamic programming on linear
                 pipelines''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "289--289",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (90C39)",
  MRnumber =     "92m:68037b",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Myoupo:1991:DPL}.",
  acknowledgement = ack-nhfb,
  classification = "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques)",
  corpsource =   "LRI, CNRS, Univ. Paris-Sud, Orsay, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "dynamic programming; linear pipelines",
  treatment =    "G General Review",
}

@Article{Clausen:1992:AAB,
  author =       "Michael Clausen",
  title =        "Almost all {Boolean} functions have no linear
                 symmetries",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "291--292",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (03G05 06E30 94C10)",
  MRnumber =     "93d:68022",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Bonn",
  affiliationaddress = "Bonn, Ger",
  classification = "721; 723; 921; C4210 (Formal logic)",
  corpsource =   "Inst. f{\"u}r Inf., Bonn Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "almost all Boolean functions; Automata Theory ---
                 Theorem Proving; Boolean Functions; Boolean functions;
                 Clote Kranakis Theorem; Computation Theory; Computer
                 Metatheory; Mathematical Techniques --- Linearization;
                 n-ary Boolean functions; Permutation Matrices;
                 stabilizer; Symmetry Group",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Muller:1992:CLC,
  author =       "Fritz M{\"u}ller",
  title =        "Confluence of the lambda calculus with left-linear
                 algebraic rewriting",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "293--299",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (03B40)",
  MRnumber =     "93f:68055",
  MRreviewer =   "Peter R. J. Asveld",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "921; C4210 (Formal logic); C6110 (Systems analysis
                 and programming)",
  corpsource =   "Saarlandes Univ., Saarbrucken, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic rewrite rules; Analysis; beta-reduction;
                 Church--Rosser Property; Church--Rosser theorem;
                 combined reduction relation; confluence; functional
                 programming; Lambda Calculus; lambda calculus;
                 left-linear algebraic rewriting; Mathematical
                 Programming; Mathematical Techniques --- Linearization;
                 Mathematical Techniques --- Set Theory; rewriting
                 systems; Term Rewriting System; untyped
                 lambda-calculus",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Erbas:1992:LCE,
  author =       "Cengiz Erbas and Murat M. Tanik and Zekeriya
                 Aliyazicioglu",
  title =        "Linear congruence equations for the solutions of the
                 {$N$}-queens problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "301--306",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05B99",
  MRnumber =     "93b:05040",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Southern Methodist Univ",
  affiliationaddress = "Dallas, TX, USA",
  classification = "921; B0240E (Game theory); B0290H (Linear algebra);
                 C1140E (Game theory); C4140 (Linear algebra)",
  corpsource =   "Southern Methodist Univ., Dallas, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial Mathematics; game theory; linear
                 algebra; Linear Congruence Equations; linear congruence
                 equations; Mathematical Programming --- Solubility;
                 Mathematical Techniques; Mathematical Techniques ---
                 Linear Algebra; N Queen's Problem; N-queens problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Miller:1992:GHA,
  author =       "L. L. Miller",
  title =        "Generating hinges from arbitrary subhypergraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "307--312",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Iowa State Univ",
  affiliationaddress = "Ames, IA, USA",
  classification = "723; C4250 (Database theory); C6160D (Relational
                 DBMS)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arbitrary subhypergraphs; database semantics; Database
                 Semantics; Database Systems; Database Systems ---
                 Design; Database Systems --- Query Languages; database
                 theory; Embedded Join Dependency; fd-hinge; functional
                 dependencies; Hinge; hinges generation; Hypergraph;
                 Mathematical Techniques --- Topology; Relational;
                 relational database theory; relational databases;
                 universal join dependence; Universal Relation
                 Interface",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Esparza:1992:SCP,
  author =       "Javier Esparza",
  title =        "A solution to the covering problem for $1$-bounded
                 conflict-free {Petri} nets using linear programming",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "313--319",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q90 (68Q25 90C05)",
  MRnumber =     "93g:68100",
  MRreviewer =   "Jean-Luc Lambert",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Hildesheim",
  affiliationaddress = "Hildesheim, Ger",
  classification = "921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4130 (Interpolation and
                 function approximation); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Inf., Hildesheim Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "1-bounded conflict-free Petri nets; computational
                 complexity; Concurrency; Covering Problem; covering
                 problem; linear programming; Mathematical Programming,
                 Linear --- Solutions; Mathematical Techniques;
                 Mathematical Techniques --- Algorithms; Petri Nets;
                 Petri nets; polynomially reducible; polynomials; PTIME;
                 Reachability Problem; reachable marking",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bshouty:1992:LBM,
  author =       "Nader H. Bshouty",
  title =        "A lower bound for the multiplication of polynomials
                 modulo a polynomial",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "321--326",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q40)",
  MRnumber =     "93j:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Calgary",
  affiliationaddress = "Calgary, Alberta, Can",
  classification = "721; 723; 921; C4130 (Interpolation and function
                 approximation); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Computability and Decidability;
                 Boundary Element Method; Coding Theory; computational
                 complexity; Computer Metatheory --- Computational
                 Complexity; Linear Codes; Lower Bound; lower bound;
                 Mathematical Techniques; Mathematical Techniques ---
                 Algorithms; multiplication; Multiplicative Complexity;
                 multiplicative complexity; polynomials; polynomials
                 modulo a polynomial; Quadratic Algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lozinskii:1992:CPM,
  author =       "Eliezer L. Lozinskii",
  title =        "Counting propositional models",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "327--332",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D15 (03B05 03B35 68Q25)",
  MRnumber =     "93a:03040",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "The Hebrew Univ",
  affiliationaddress = "Jerusalem, Isr",
  classification = "723; 921; C4250 (Database theory); C6110L (Logic
                 programming)",
  corpsource =   "Inst. of Math. and Comput. Sci., Hebrew Univ.,
                 Jerusalem, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computationally intractable; Computer Metatheory;
                 Counting Models; counting propositional models;
                 database theory; Inclusion-Exclusion Formula;
                 inclusion-exclusion formula; logic programming; Many
                 Valued Logics; Mathematical Models --- Computation;
                 Mathematical Techniques --- Algorithms; Mathematical
                 Techniques --- Approximation Theory; propositional CNF;
                 propositional DNF; Satisfiability; worst case",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jansen:1992:AAG,
  author =       "Klaus Jansen",
  title =        "An approximation algorithm for the general routing
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "333--339",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Trier",
  affiliationaddress = "Trier, Ger",
  classification = "722; 723; 921; B0250 (Combinatorial mathematics);
                 C1160 (Combinatorial mathematics); C1290 (Applications
                 of systems theory); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Trier Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximation algorithm; approximation
                 theory; Chinese Postman Problem (cpp); combinatorial
                 mathematics; Complexity Theory; Data Processing ---
                 Critical Path Analysis; general routing problem;
                 General Routing Problem (GRP); heuristic; Mathematical
                 Techniques; Mathematical Techniques --- Combinatorial
                 Mathematics; Mathematical Techniques --- Heuristic;
                 minimum cost cycle; operations research; Optimization;
                 scheduling; Traveling Salesman Problem (TSP); triangle
                 inequality",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carson:1992:DMT,
  author =       "S. D. Carson and V. Nirkhe and P. Vongsathorn",
  title =        "A discrete-state model of the two-headed disk",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "341--345",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "722; 723; 921; C1140Z (Other and miscellaneous);
                 C5320C (Storage on moving magnetic media)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Operating Systems; Computer Operating Systems
                 --- Optimization; Computer Operating Systems ---
                 Performance; data placement; discrete state Markov
                 model; discrete-state model; independently moving
                 read/write heads; magnetic heads; Markov Model; Markov
                 processes; Mathematical Techniques --- Approximation
                 Theory; Models; seek distance; seek time; Steady State
                 Joint Head Position; steady-state joint head position
                 density; Two Headed Disk; two-headed disk",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Brandt:1992:CAC,
  author =       "Jonathan Brandt and Carlos Cabrelli and Ursula
                 Molter",
  title =        "Corrigendum: {``An algorithm for the computation of
                 the {Hutchinson} distance''} {[Inform. Process. Lett.
                 {\bf 40}(2), 25 October 1991, pp. 113--117]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "6",
  pages =        "347--347",
  day =          "17",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Feb 01 15:22:43 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Brandt:1991:ACH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Makinen:1992:SGI,
  author =       "Erkki M{\"a}kinen",
  title =        "On the structural grammatical inference problem for
                 some classes of context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "1--5",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tampere",
  affiliationaddress = "Tampere, Finl",
  classification = "721.1; 723.1; 723.2; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Tampere Univ., Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational complexity; computational
                 complexity; Context free grammars; context-free
                 grammars; Data structures; data structures; derivation
                 trees; finite positive sample; Formal languages;
                 reversible context-free grammar; Sakakibara algorithm;
                 Sakakibara's algorithm; structural grammatical
                 inference; Structural grammatical inference problem;
                 time complexity; type invertible grammars; unlabelled
                 internal nodes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singh:1992:TUU,
  author =       "Ambuj K. Singh",
  title =        "Towards an understanding of unbounded variables in
                 asynchronous systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "7--17",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California at Santa Barbara",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "721; 722.3; 723.1; C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Asynchronous sequential logic; Asynchronous wait free
                 low atomicity systems; asynchronous wait-free
                 low-atomicity systems; atomic registers; Bounded
                 variables; bounded variables; Computability and
                 decidability; concurrency control; Constraint theory;
                 Data communication systems; Distinct copy problem;
                 Distinctness constraint; distributed processing;
                 Program derivation; Programming theory; unbounded
                 variables",
  treatment =    "P Practical",
}

@Article{Clark:1992:LTA,
  author =       "L. H. Clark and F. Shahrokhi and L. A. Sz{\'e}kely",
  title =        "A linear time algorithm for graph partition problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "19--24",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "93b:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of New Mexico",
  affiliationaddress = "Albuquerque, NM, USA",
  classification = "921.4; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Stat., New Mexico Univ.,
                 Albuquerque, NM, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation theory; bottleneck bipartite
                 number problem; computational complexity; edges; Graph
                 bisection problem; graph bisection problem; graph
                 partition; Graph partitioning algorithms; Graph theory;
                 graph theory; linear time algorithm; maximum cut
                 problem; NP-hard problems; undirected graph; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alt:1992:LBN,
  author =       "Helmut Alt and Viliam Geffert and Kurt Mehlhorn",
  title =        "A lower bound for the nondeterministic space
                 complexity of context-free recognition",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "25--27",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Freie Universitaet Berlin",
  affiliationaddress = "Berlin, Ger",
  classification = "721.1; 723; 921; C4210 (Formal logic); C4220
                 (Automata theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Fachbereich Math., Freie Univ., Berlin, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boundary element method; Computational complexity;
                 computational complexity; Context free languages;
                 context-free languages; context-free recognition; lower
                 bound; Nondeterministic space complexity;
                 nondeterministic space complexity; nondeterministic
                 Turing machine; nonregular deterministic context-free
                 language; Theorem proving; Turing machines; worktape",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fleischner:1992:DCT,
  author =       "Herbert Fleischner and Gerhard J. Woeginger",
  title =        "Detecting cycles through three fixed vertices in a
                 graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "29--33",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C38 (05C85 68R10)",
  MRnumber =     "92m:05110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Austrian Acad of Sciences",
  affiliationaddress = "Vienna, Austria",
  classification = "921.4; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. of Inf. Process., Austrian Acad. of Sci.,
                 Vienna, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Applications; Combinatorial mathematics;
                 common simple cycle; computational complexity; distinct
                 vertices; fixed vertices; Graph theory; graph theory;
                 linear time algorithm; Mathematical techniques;
                 Subgraph homeomorphism problem; Three vertex cycle
                 problem; three-vertex-cycle problem; undirected
                 graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Meijer:1992:CMW,
  author =       "Henk Meijer and David Rappaport",
  title =        "Computing the minimum weight triangulation of a set of
                 linearly ordered points",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "35--38",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "723; 921.4; C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Approximation theory; Combinatorial optimization;
                 Computational complexity; computational complexity;
                 computational geometry; contours; convex hull; Dynamic
                 programming; dynamic programming; edge lengths;
                 Geometry; legal path; linearly ordered points; minimum
                 weight triangulation; noncrossing straight line
                 segments; Optimization; plane; Set theory; Topology;
                 triangle; Triangulations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sen:1992:RPF,
  author =       "Arunabha Sen and Abhijit Sen Gupta and Subir
                 Bandyopadhyay",
  title =        "On the routing problem in faulty supercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "39--46",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "93e:68008",
  MRreviewer =   "M. Dal Cin",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Arizona State Univ",
  affiliationaddress = "Tempe, AZ, USA",
  classification = "703.1; 722.4; 723; 922; C4230M (Multiprocessor
                 interconnection); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computer applications;
                 connectivity; Electric network topology; Failure
                 analysis; fault diameter; Fault tolerant computer
                 systems; fault tolerant computing; faulty supercubes;
                 hypercube; hypercube networks; Node failures; node
                 failures; routing algorithm; Routing problem; routing
                 problem; Supercube network; supercube network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sarkar:1992:EUM,
  author =       "U. K. Sarkar and P. P. Chakrabarti and S. Ghose and S.
                 C. {De Sarkar}",
  title =        "Effective use of memory in iterative deepening
                 search",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "47--52",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kharagpur, India",
  classification = "723.1; 921.4; C1230 (Artificial intelligence); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Kharagpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation algorithm; approximation
                 scheme; approximation theory; Artificial intelligence;
                 Combinatorial mathematics; Flow shop scheduling
                 problem; flow-shop scheduling; Heuristic methods;
                 iterative deepening A*; iterative deepening search;
                 iterative methods; Iterative methods; memory; search
                 problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Megiddo:1992:NAL,
  author =       "Nimrod Megiddo",
  title =        "A note on approximate linear programming",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "53--53",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C05",
  MRnumber =     "93b:90042",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "723.1; 921; C1180 (Optimisation techniques); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory)",
  corpsource =   "IBM Res. Div., Almaden Res. Center, San Jose, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Analysis; approximate linear programming;
                 Approximation theory; approximation theory;
                 Computational complexity; computational complexity;
                 exact problem; Linear programming; linear programming;
                 log-space complete; P complete",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aggarwal:1992:OTB,
  author =       "Alok Aggarwal and Herbert Edelsbrunner and Prahakar
                 Raghavan and Prasoon Tiwari",
  title =        "Optimal time bounds for some proximity problems in the
                 plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "1",
  pages =        "55--60",
  day =          "27",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "93a:68147",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "921.4; C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown
                 Heights, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic decision tree model; Boundary element
                 method; Boundary value problems; closest neighbor;
                 closest pair; computational complexity; computational
                 geometry; Euclidean distance; Geometry; Integer element
                 uniqueness problem; plane; proximity problems; Set
                 theory; simple polygon; Simple polygons; time bounds;
                 Trees (mathematics); Upper and lower bounds; upper
                 bound; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Han:1992:SRT,
  author =       "Ching-Chih Han and Kwei-Jay Lin",
  title =        "Scheduling real-time computations with separation
                 constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "61--66",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B35 (05C85 68M20 68Q25 90B12)",
  MRnumber =     "93c:90037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Urbana-Champaign",
  affiliationaddress = "Urbana, IL, USA",
  classification = "722; 723; 731; 921; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ.,
                 Urbana-Champaign, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bandwidth Compression; Bandwidth Minimization Problem;
                 computational complexity; Computer Programming ---
                 Algorithms; Computer Systems, Digital --- Real Time
                 Operation; Control Systems --- Scheduling; directed
                 forest; earliest starting positions; graph; graph
                 theory; Information Theory; linear layout; Mathematical
                 Techniques --- Trees; Minimum Distance Constraint;
                 minimum distance constraints; positive integer; Real
                 Time Computations; real time job scheduling; real-time
                 computations; real-time systems; roots; scheduling;
                 separation constraints; Separation Problem; separation
                 problem; trees; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Trier:1992:AWS,
  author =       "Uwe Trier",
  title =        "Additive weights of a special class of nonuniformly
                 distributed backtrack trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "67--76",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C05 68R10)",
  MRnumber =     "93i:68094",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Johann Wolfgang Goethe Universitaet",
  affiliationaddress = "Frankfurt am Main, Ger",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Fachbereich 20 Inf. Johann Wolfgang Goethe Univ.,
                 Frankfurt am Main, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "additive weight; Additive Weights; Algorithms;
                 algorithms; average case analysis; average weight;
                 Backtrack Trees; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming; Computer Systems, Digital --- Distributed;
                 finite set; height; internal node; leaves; Mathematical
                 Techniques --- Trees; Node Degree; node degree;
                 nonuniformly distributed backtrack trees; probability;
                 trees (mathematics); weight functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rubinfeld:1992:BCA,
  author =       "Ronitt Rubinfeld",
  title =        "Batch checking with applications to linear functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "77--80",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "723; 731; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Batch Checking; batch checking; Batch Processing;
                 check programs; Computer Programming --- Algorithms;
                 Computer Programming --- Program Debugging; Computer
                 Programs --- Reliability; Data Processing; linear
                 functions; Program Correctness; program result
                 checking; program verification; programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burmester:1992:ARI,
  author =       "Mike Burmester",
  title =        "An almost-constant round interactive zero-knowledge
                 proof",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "81--87",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of London",
  affiliationaddress = "Surrey, Engl",
  classification = "723; 731; 922; C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., London Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "almost-constant; Arthur--Merlin black-box IZKP;
                 communication complexity; computational complexity;
                 Computer Metatheory --- Boolean Functions; Computer
                 Metatheory --- Computational Complexity; Computer
                 Networks; Data Processing --- Security of Data;
                 Information Theory --- Communication Channels;
                 Interactive Turing Machines; Interactive Zero Knowledge
                 Proofs (IZKP); interactive zero-knowledge proofs;
                 Probability; Protocols; running time; Turing machines;
                 unbounded function",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cho:1992:PCC,
  author =       "Sang Cho and D{\~u}ng T. H{\`u}ynh",
  title =        "The parallel complexity of coarsest set partition
                 problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "89--94",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  annote =       "The original paper has no accents on the second author
                 name, but MathSciNet does. Perhaps the journal
                 typesetting system lacked the needed accents.",
  classification = "721; 722; 723; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Comput. Sci. Program, Texas Univ. at Dallas,
                 Richardson, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata Theory --- Finite Automata; Coarsest Set
                 Partition; computational complexity; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming --- Algorithms; Computer Systems, Digital;
                 multi-function coarsest set partition; multi-relation;
                 P-complete; Parallel Algorithms; parallel algorithms;
                 parallel complexity; Parallel Processing; set theory;
                 single-function coarsest set partition;
                 single-relation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Plateau:1992:OTE,
  author =       "Brigitte Plateau and Denis Trystam",
  title =        "Optimal total exchange for a {3-D} torus of
                 processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "95--102",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    &