%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.27",
%%%     date            = "20 October 2023",
%%%     time            = "15:21:32 MDT",
%%%     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             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "18998 70375 286615 3060260",
%%%     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.27, 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|https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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 =    "https://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 =    "https://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 =    "https://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 =    "https://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 =    "https://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 =    "https://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 =    "https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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;
                 https://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 =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IMAG",
  affiliationaddress = "Grenoble, Fr",
  classification = "722; 723; 921; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "IMAG, Grenoble, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-D cubic torus; Computer Networks --- Applications;
                 Computer Systems Programming; Computer Systems,
                 Digital; Computer Systems, Digital --- Distributed;
                 direct neighbors; Mathematical Techniques --- Trees;
                 multiprocessor interconnection networks; multiprocessor
                 topologies; Optimal Total Exchange; optimal total
                 exchange algorithm; Optimization; parallel algorithms;
                 Parallel Processing; Three Dimensional Torus",
  treatment =    "T Theoretical or Mathematical",
}

@Article{VanDeSnepscheut:1992:LPE,
  author =       "Jan L. A. {Van De Snepscheut}",
  title =        "A {LISP} programming exercise",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "103--108",
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "California Inst of Technology",
  affiliationaddress = "Pasadena, CA, USA",
  classification = "723; C6110 (Systems analysis and programming);
                 C6140D (High level languages)",
  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 =     "Computer Metatheory --- Boolean Functions; Computer
                 Metatheory --- Computational Complexity; Computer
                 Programming --- Solutions; Computer Programming
                 Languages; equalities; Functional Programming;
                 functional programming; lisp; LISP; LISP programming;
                 Program Derivation; transformation steps",
  treatment =    "P Practical",
}

@Article{Chandru:1992:DEH,
  author =       "V. Chandru and J. N. Hooker",
  title =        "Detecting embedded {Horn} structure in propositional
                 logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "109--111",
  day =          "11",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (03B05 03D15)",
  MRnumber =     "93c:68039",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "723; 921; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Sch. of Ind. Eng, Purdue Univ., West Lafayette, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Complexity; computational complexity;
                 Computer Metatheory; Computer Programming ---
                 Algorithms; Computer Programming --- Logic Programming;
                 embedded Horn structure; formal logic; Horn Structure;
                 Mathematical Techniques --- Heuristic; maximum clique
                 problem; maximum renamable Horn problem; NP-hard;
                 propositional logic; Propositional Satisfiability;
                 propositional satisfiability; Renamable Horn Problems;
                 set packing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kamakoti:1992:OAR,
  author =       "V. Kamakoti and C. Pandu Rangan",
  title =        "An optimal algorithm for reconstructing a binary
                 tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "113--115",
  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;
                 https://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); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technology, Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; binary tree; Binary Tree; computational
                 complexity; Computer Metatheory --- Binary Sequences;
                 Computer Programming; Computer Systems, Digital ---
                 Parallel Processing; EREW PRAM model; inorder
                 traversals; Mathematical Techniques --- Trees; parallel
                 algorithm; Parallel Algorithm; parallel algorithms;
                 preorder traversals; Tree Traversal; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gabrani:1992:NRB,
  author =       "Naveen Gabrani and Priti Shankar",
  title =        "A note on the reconstruction of a binary tree from its
                 traversals",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "2",
  pages =        "117--119",
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel 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 =     "Algorithms; Binary Tree; binary tree; computational
                 complexity; Computer Metatheory --- Binary Sequences;
                 Computer Programming; Computer Systems, Digital ---
                 Parallel Processing; EREW PRAM model; inorder
                 traversals; linear-time sequential algorithm;
                 Mathematical Techniques --- Trees; nodes; Parallel
                 Algorithm; parallel algorithm; parallel algorithms;
                 preorder traversals; Tree Traversal; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Szymanski:1992:CCV,
  author =       "Boleslaw K. Szymanski and Balaram Sinharoy",
  title =        "Complexity of the closest vector problem in a lattice
                 generated by $(0,1)$-matrix",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "121--126",
  day =          "25",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "94c:68096",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigenda \cite{Szymanski:1992:CCC}.",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
                 Troy, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "(0,1matrix-); closest vector problem; compile-time
                 optimization; complexity; computational complexity;
                 data alignment problem; graphs; lattice; matrix
                 algebra; minimization problems; network incidence
                 matrix; norm; parallel algorithms; parallel processing;
                 SIMD architectures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huy:1992:WFM,
  author =       "Phan Trung Huy and Igor Livotsky and
                 {\Dbar}{\cftil{o}} Long V{\^a}n",
  title =        "Which finite monoids are syntactic monoids of rational
                 $\omega$-languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "127--132",
  day =          "25",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (20M35)",
  MRnumber =     "93f:68061",
  MRreviewer =   "Ludwig Staiger",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  annote =       "The original paper has no accents on the third author
                 name, but MathSciNet does. Perhaps the journal
                 typesetting system lacked the needed accents.",
  classification = "C1110 (Algebra); C4210 (Formal logic)",
  corpsource =   "Inst. of Math., Hanoi, Viet Nam",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Arnold syntactic monoid; decidability; decidable;
                 finite monoids; finite words; formal languages; group
                 theory; omega-rigid sets; omega-syntactic; rational
                 omega-languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1992:EDB,
  author =       "Kaizhong Zhang and Rick Statman and Dennis Shasha",
  title =        "On the editing distance between unordered labeled
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "133--139",
  day =          "25",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (68R10)",
  MRnumber =     "93e:68094",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Western Ontario Univ., London,
                 Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary trees; bounded number; computational
                 complexity; editing distance; label alphabet of size
                 two; leaves; NP-complete; polynomial-time algorithms;
                 string; trees (mathematics); unordered labeled trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Parker:1992:OVN,
  author =       "A. Parker and J. O. Hamblen",
  title =        "Optimal value for the {Newton--Raphson} division
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "141--144",
  day =          "25",
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Alabama Univ.,
                 Huntsville, AL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; fast division; floating
                 point numbers; floating-point arithmetic; iterative
                 algorithm; iterative methods; Newton--Raphson division
                 algorithm; optimal initial value",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Li:1992:ACC,
  author =       "Ming Li and P. M. B. Vitanyi",
  title =        "Average case complexity under the universal
                 distribution equals worst-case complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "145--149",
  day =          "25",
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "average complexity; computational complexity;
                 NP-complete problems; sorting; sorting algorithms;
                 space complexity; time complexity; universal
                 distribution; worst-case complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Salowe:1992:NLB,
  author =       "J. S. Salowe",
  title =        "A note on lower bounds for rectilinear {Steiner}
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "151--152",
  day =          "25",
  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 =    "https://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 =   "Dept. of Comput. Sci., Virginia Univ.,
                 Charlottesville, VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 lower bounds; minimal tree; rectilinear Steiner trees;
                 sphere-packing; traveling salesman problem; trees
                 (mathematics); worst-case length",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bui:1992:FGA,
  author =       "Thang Nguyen Bui and Curt Jones",
  title =        "Finding good approximate vertex and edge partitions is
                 {NP}-hard",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "153--159",
  day =          "25",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q15 68Q25)",
  MRnumber =     "93h:68111",
  MRreviewer =   "Etsuro Moriya",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://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 =   "Dept. of Comput. Sci., Pennsylvania State Univ.,
                 University Park, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation algorithm; approximation theory;
                 computational complexity; edge partitions; edge
                 separators; general graphs; graph theory; maximum
                 degree; NP-hard; vertex partitions; vertex separators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mowbray:1992:FLS,
  author =       "Miranda Mowbray",
  title =        "Finitary logics for some {CCS} observational
                 bisimulations",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "161--165",
  day =          "25",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B70 (68Q60)",
  MRnumber =     "93h:03034",
  MRreviewer =   "G. Mirkowska",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Hewlett Packard Pisa Sci. Centre, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "CCS; finitary associated modal logic; formal
                 languages; formal logic; internal structure;
                 observational bisimulations; parallel programming;
                 programming theory; top-level parallelism",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Groote:1992:SPD,
  author =       "Jan Friso Groote",
  title =        "A short proof of the decidability of bisimulation for
                 normed {BPA-processes}",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "167--171",
  day =          "25",
  month =        may,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (03B70)",
  MRnumber =     "93g:68036",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Software Technol., CWI, Amsterdam,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "basic process algebra; bisimulation; decidability;
                 formal languages; normed BPA-processes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sarkar:1992:SGA,
  author =       "U. K. Sarkar and P. P. Chakrabarti and S. Ghose and S.
                 C. {De Sarkar}",
  title =        "A simple $0.5$-bounded greedy algorithm for the $0/1$
                 knapsack problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "3",
  pages =        "173--177",
  day =          "25",
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See note \cite{Martello:1992:NGA}.",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1290 (Applications
                 of systems theory); 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/",
  keywords =     "0.5-bounded; 0/1 knapsack problem; computational
                 complexity; greedy algorithm; nonincreasing first fit;
                 operations research; optimisation; profit per unit
                 weight; tight bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hwang:1992:PGO,
  author =       "Tzonelih Hwang",
  title =        "Protocols for group oriented secret sharing",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "179--182",
  day =          "19",
  month =        jun,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Cheng Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "723; 921; B6120B (Codes); B6150M (Protocols); C1260
                 (Information theory); C6130S (Data security)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "authenticate; ciphertext; Communication Security;
                 Cryptography; cryptography; decryption keys; discrete
                 logarithm problem; encrypted message; encryption keys;
                 Group Oriented Cryptography; group oriented
                 cryptography; group oriented secret sharing;
                 information destination; information sender;
                 Mathematical Techniques --- Interpolation; Mathematical
                 Techniques --- Polynomials; message broadcast;
                 protocols; receiving group",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blum:1992:RDT,
  author =       "Avrim Blum",
  title =        "Rank-$r$ decision trees are a subclass of $r$-decision
                 lists",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "183--185",
  day =          "19",
  month =        jun,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "723; 921; 922; C1140E (Game theory); C1160
                 (Combinatorial mathematics); C1240 (Adaptive system
                 theory)",
  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 =     "Computer Programming --- Algorithms; concept class;
                 decision theory; Decision Theory and Analysis; Decision
                 Trees; learning systems; Mathematical Techniques ---
                 Trees; PAC model; polynomial time learnable; r-decision
                 lists; rank-r decision trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aykanat:1992:FHS,
  author =       "C. Aykanat and F. Ozguner",
  title =        "A fault-tolerant hexagonal systolic array",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "187--196",
  day =          "19",
  month =        jun,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bilkent Univ",
  affiliationaddress = "Ankara, Turkey",
  classification = "722; 723; C4110 (Error analysis in numerical
                 methods); C4140 (Linear algebra); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. 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 =     "band matrix multiplication; column; Computer Systems,
                 Digital; Computer Systems, Digital --- Multiprocessing;
                 concurrent error detecting systolic algorithm;
                 concurrent error detecting systolic design; error
                 analysis; error correcting design; error correction;
                 error detection; Error Detection; Fault Tolerant
                 Capability; fault tolerant computing; fault-tolerant
                 hexagonal systolic array; hexagonal systolic array;
                 matrix algebra; parallel algorithms; row; systolic
                 arrays; Systolic Arrays",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1992:OPT,
  author =       "Lin Chen",
  title =        "Optimal parallel time bounds for the maximum clique
                 problem on intervals",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "197--201",
  day =          "19",
  month =        jun,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q10 68Q22 68Q25)",
  MRnumber =     "93h:68047",
  MRreviewer =   "John Michael Robson",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm 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; clique number; computational complexity;
                 Computer Metatheory --- Computational Complexity;
                 Computer Programming; Computer Systems Programming ---
                 Multiprocessing Programs; graph theory; intervals;
                 maximum cardinality clique; maximum clique problem;
                 Maximum Clique Problem on Intervals; maximum weighted
                 clique; optimal parallel time bounds; Parallel
                 Algorithms; parallel algorithms; pram; real line; set
                 theory; Time Bounds; weights",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vaidyanathan:1992:SPR,
  author =       "Ramachandran Vaidyanathan",
  title =        "Sorting on {PRAMs} with reconfigurable buses",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "203--208",
  day =          "19",
  month =        jun,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "723; C4240P (Parallel programming and algorithm
                 theory); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Electr. and Comput. Eng., 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 =     "B-PRAM; computational complexity; Computer Metatheory
                 --- Computational Complexity; Computer Systems
                 Programming; Computer Systems Programming ---
                 Multiprocessing Programs; EREW B-PRAM; integer sorting;
                 OR; Parallel Algorithms; parallel algorithms; prams;
                 Reconfigurable Buses; reconfigurable buses; Sorting;
                 sorting; Time Bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liu:1992:INS,
  author =       "Zhiyong Liu and Jia-Huai You",
  title =        "An implementation of a nonlinear skewing scheme",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "209--215",
  day =          "19",
  month =        jun,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Alberta",
  affiliationaddress = "Edmonton, Alberta, Can",
  classification = "723; C4140 (Linear algebra); C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; Computer Systems
                 Programming --- Multiprocessing Programs; hypercube;
                 hypercube networks; Hypercubes; matrix; matrix algebra;
                 memory modules; Nonlinear Skewing; nonlinear skewing
                 scheme; parallel algorithms; Parallel Algorithms;
                 parallel processing system; routing algorithms; Routing
                 Algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vaidyanathan:1992:PVW,
  author =       "Ramachandran Vaidyanathan and Carlos R. P. Hartmann
                 and Pramod K. Varshney",
  title =        "{PRAMs} with variable word-size",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "217--222",
  day =          "19",
  month =        jun,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "723; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., 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 =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming ---
                 Multiprogramming; Computer Systems, Digital; concurrent
                 memory access; contiguous bits; fine memory
                 granularity; lower bounds; M-PRAM; Parallel Algorithms;
                 parallel algorithms; Parallel Processing; prams;
                 wordsize",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Colbourn:1992:PMI,
  author =       "C. J. Colbourn and D. R. Stinson and L. Teirlinck",
  title =        "A parallelization of {Miller}'s $n^{\log n}$
                 isomorphism technique",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "223--228",
  day =          "19",
  month =        jun,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05B07 68Q20 68Q40)",
  MRnumber =     "93f:68037",
  MRreviewer =   "Julian Padget",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://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 Combinatorics and Optimization, Waterloo
                 Univ., Ont., Canada",
  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; isomorphism; Isomorphisms;
                 Miller; parallel algorithm; parallel algorithms;
                 Parallel Algorithms; Steiner triple systems; Steiner
                 Triple Systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sprague:1992:OPA,
  author =       "Alan P. Sprague and K. H. Kulkarni",
  title =        "Optimal parallel algorithms for finding cut vertices
                 and bridges of interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "4",
  pages =        "229--234",
  day =          "19",
  month =        jun,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q25 68R10)",
  MRnumber =     "93c:68038",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Alabama at Birmingham",
  affiliationaddress = "Birmingham, AL, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm 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 =     "Algorithms; biconnected components; blocks; bridges;
                 computational complexity; Computer Programming;
                 Computer Systems Programming --- Multiprocessing
                 Programs; cut vertices; EREW PRAM model; graph theory;
                 Interval Graphs; interval graphs; interval model;
                 Mathematical Techniques --- Graph Theory; optimal sort;
                 Parallel Algorithms; parallel algorithms; parallel
                 prefix algorithm; pram; presorted ends",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Day:1992:AGC,
  author =       "Khaled Day and Anand Tripathi",
  title =        "Arrangement graphs: {A} class of generalized star
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "235--241",
  day =          "3",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68M10)",
  MRnumber =     "93e:68098",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arrangement graph; degree; design parameters;
                 diameter; edge symmetry; fault tolerance; fault
                 tolerant computing; graph theory; hierarchical
                 structure; interconnection topology; multiprocessor
                 interconnection networks; nodes; optimal routing;
                 simple routing; star graph topology; topology; vertex
                 symmetry",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1992:SPA,
  author =       "Zhi-Zhong Chen",
  title =        "A simple parallel algorithm for computing the
                 diameters of all vertices in a tree and its
                 application",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "243--248",
  day =          "3",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "93e:68096",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "computational complexity; correctness; diameters; EREW
                 PRAM; parallel algorithm; parallel algorithms; tree;
                 trees (mathematics); vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldberg:1992:NRS,
  author =       "Andrew V. Goldberg",
  title =        "A natural randomization strategy for multicommodity
                 flow and related algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "249--256",
  day =          "3",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B10 (68Q25)",
  MRnumber =     "93g:90032",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4130
                 (Interpolation and function approximation); 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/",
  keywords =     "approximation algorithm; approximation theory;
                 capacity constraints; commodity demands; commodity
                 supplies; computational complexity; concurrent flow;
                 feasible flow; maximize; multicommodity flow; natural
                 randomization strategy; network; optimisation;
                 optimization; satisfied demands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wismath:1992:CFV,
  author =       "S. K. Wismath",
  title =        "Computing the full visibility graph of a set of line
                 segments",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "257--261",
  day =          "3",
  month =        jul,
  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 =    "https://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 =   "Dept. of Math. and Comput. Sci., Lethbridge Univ.,
                 Alta., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry; edge
                 set; full visibility graph; graph theory;
                 nonintersecting line segments; plane; set theory;
                 vertices; visibility relation; worst case optimal
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Han:1992:BPB,
  author =       "Jiawei Han",
  title =        "Binding propagation beyond the reach of rule\slash
                 goal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "263--268",
  day =          "3",
  month =        jul,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4250 (Database theory); C6160K (Deductive
                 databases); C6170 (Expert systems)",
  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 =     "binding propagation; compilation technique; database
                 theory; deductive databases; graph theory; linear
                 recursions; magic rule rewriting; minimal magic sets;
                 recursive rule expansions; rewriting systems; rule/goal
                 graphs; simulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Litow:1992:IIP,
  author =       "Bruce Litow",
  title =        "On iterated integer product",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "269--272",
  day =          "3",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "93e:68034",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Div. of Comput. Services, Wisconsin Univ., Milwaukee,
                 WI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean circuit families; computational complexity;
                 iterated integer product; NC; NC/sup 1/ reducibility",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wrightson:1992:TTC,
  author =       "G. Wrightson and J. Coldwell",
  title =        "A truncation technique for clausal analytic tableaux",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "273--281",
  day =          "3",
  month =        jul,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Newcastle Univ., NSW,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "branch-merge; clausal analytic tableaux; formal logic;
                 leaf node; leftmost open branch; merging rule; modified
                 control structure; resolution theorem proving;
                 resolvent clauses; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singh:1992:ECL,
  author =       "S. Singh",
  title =        "Expected connectivity and leader election in
                 unreliable networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "283--285",
  day =          "3",
  month =        jul,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1210B
                 (Reliability theory); C5620 (Computer networks and
                 techniques)",
  corpsource =   "Dept. of Comput. Sci., South Carolina Univ., Columbia,
                 SC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "distinguished node; distributed processing; expected
                 connectivity; leader election; maximum reliability
                 path; network topology; path recomputations; random
                 link failures; reliability theory; topology; unreliable
                 links; unreliable networks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cameron:1992:NPL,
  author =       "Helen Cameron and Derick Wood",
  title =        "A note on the path length of red-black trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "5",
  pages =        "287--292",
  day =          "3",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C05 68R05)",
  MRnumber =     "93d:05066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); 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/",
  keywords =     "asymptotic tightness; computational complexity;
                 half-balanced binary tree; internal path length; nodes;
                 red-black trees; symmetric binary B-tree; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Manacher:1992:INV,
  author =       "Glenn K. Manacher and Terrance A. Mankus",
  title =        "Incorporating negative-weight vertices in certain
                 vertex-search graph algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "293--294",
  day =          "24",
  month =        jul,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois",
  affiliationaddress = "Chicago, IL, USA",
  classification = "723.1; 921.4; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory);
                 C4260 (Computational geometry)",
  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; computational complexity; computational
                 geometry; domination; Graph algorithms; Graph theory;
                 minimum-weight subset; Negative weight vertices;
                 negative-weight vertices; Search methods; search
                 problems; Vertex search; vertex-search graph
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Miltersen:1992:CDR,
  author =       "Peter Bro Miltersen",
  title =        "Circuit depth relative to a random oracle",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "295--298",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "94c:68070",
  MRreviewer =   "Gerhard Lischke",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aarhus Univ",
  affiliationaddress = "Aarhus, Den",
  classification = "721.1; 922.1; C4240P (Parallel programming and
                 algorithm theory)",
  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 =     "Circuit depth; circuit depth; Complexity classes;
                 complexity classes; Computational complexity;
                 computational complexity; Random oracle; random oracle;
                 Random processes; relativized circuit depth",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Woeginger:1992:ESS,
  author =       "Gerhard J. Woeginger and Zhong Liang Yu",
  title =        "On the equal-subset-sum problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "299--302",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "93e:68037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ Graz",
  affiliationaddress = "Graz, Austria",
  classification = "723.1; 921.1; 921.4; 921.5; 921.6; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Tech. Univ., Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation algorithm; approximation
                 algorithm; Approximation theory; combinatorial
                 mathematics; computational complexity; disjoint
                 nonempty subsets; Equal-subset-sum problem;
                 equal-subset-sum problem; NP completeness; NP-complete;
                 Optimization; optimization; Set theory; worst-case
                 ratio",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhu:1992:CSD,
  author =       "B. Zhu",
  title =        "Computing the shortest diagonal of a monotone polygon
                 in linear time",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "303--307",
  day =          "24",
  month =        jul,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry)",
  corpsource =   "Sch. of Comput. Sci.,McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; linear time; lower chain;
                 monotone polygon; shortest diagonal; upper chain;
                 X-monotone polygon",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dahlhaus:1992:EPA,
  author =       "Elias Dahlhaus and Marek Karpi{\'n}ski and Pierre
                 Kelsen",
  title =        "An efficient parallel algorithm for computing a
                 maximal independent set in a hypergraph of dimension
                 $3$",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "309--313",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q22)",
  MRnumber =     "93e:68097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Bonn",
  affiliationaddress = "Bonn, Ger",
  classification = "723.1; 921.4; C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Bonn Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; efficient
                 deterministic NC algorithm; EREW PRAM; Graph theory;
                 hypergraph of dimension 3; Hypergraphs; maximal
                 independent set; Maximal independent sets;
                 Multiprocessing programs; NC algorithm; parallel
                 algorithm; Parallel algorithms; parallel algorithms;
                 Parallel random access machines; polylogarithmic
                 factor",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stein:1992:AMC,
  author =       "Clifford Stein and Joel Wein",
  title =        "Approximating the minimum-cost maximum flow is
                 ${P}$-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "315--319",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "93e:68036",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "MIT",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "921.5; 921.6; C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Approximation theory; C polynomial; computational
                 complexity; maximum-flow problem; Minimax problems;
                 Minimum cost maximum flow; minimum-cost maximum flow
                 problem; NC algorithm; Optimization; P-complete;
                 P-complete problems; parallel complexity; RNC
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Khuller:1992:IST,
  author =       "Samir Khuller and Baruch Schieber",
  title =        "On independent spanning trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "321--323",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (68R10)",
  MRnumber =     "93f:05035",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "921.4; C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Inst. for Adv. Comput. Studies, Maryland Univ.,
                 College Park, MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational geometry; Graph theory; Independent
                 spanning trees; independent spanning trees; k-edge
                 connected graph; k-vertex connected graph; K-vertex
                 connected graphs; Spanning trees; Trees (mathematics);
                 trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morita:1992:CUO,
  author =       "Kenichi Morita",
  title =        "Computation-universality of one-dimensional one-way
                 reversible cellular automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "325--329",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q80",
  MRnumber =     "94e:68132",
  MRreviewer =   "John Pedersen",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Yamagata Univ",
  affiliationaddress = "Yonezawa, Jpn",
  classification = "721.1; C4220 (Automata theory)",
  corpsource =   "Fac. of Eng., Yamagata Univ., Yonezawa, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; Cellular automata; Computation
                 universality; computation universality;
                 computation-universal model; finite automata;
                 one-dimensional one-way reversible cellular automata;
                 Reversible cellular automata; three-neighbor; universal
                 Turing machine",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brogi:1992:IDM,
  author =       "Antonio Brogi and Anna Ciampolini and Evelina Lamma
                 and Paolo Mello",
  title =        "The implementation of a distributed model for logic
                 programming based on multiple-headed clauses",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "331--338",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17",
  MRnumber =     "93e:68011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "723.1; C6110L (Logic programming); C6110P (Parallel
                 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 =     "abstract machine; Abstract machines; Communication
                 model; communication model; Concurrent logic
                 programming; Distributed computer systems; distributed
                 model; Inter process communication; inter-process
                 communication; linear programming; Logic programming;
                 logic programming; Multiple headed clauses;
                 multiple-headed clauses; Multiprocessing programs;
                 parallel processing; parallel programming;
                 stream-parallel logic languages; STREAM-parallel logic
                 languages; Warren Abstract Machine",
  treatment =    "P Practical",
}

@Article{Goles:1992:ANO,
  author =       "Eric Goles and Servet Mart{\'\i}nez",
  title =        "Automata networks and optimization",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "339--343",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "92B20 (68T05)",
  MRnumber =     "93f:92007",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Chile",
  affiliationaddress = "Santiago, Chile",
  classification = "721.1; 723.4; 921.5; C1180 (Optimisation
                 techniques); C1230D (Neural nets); C4220 (Automata
                 theory); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Fac. de Ciencias Fisicas y Matematicas, Chile Univ.,
                 Santiago, Chile",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata networks; Automata theory; automata theory;
                 computational complexity; Constrained optimization;
                 dual optimization problems; equivalence; Hill climbing
                 strategy; hill-climbing strategy; neural nets; neural
                 network; Neural networks; optimisation; Optimization;
                 optimization problems; parallel dynamics; positive
                 automata networks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kinnersley:1992:VSN,
  author =       "Nancy G. Kinnersley",
  title =        "The vertex separation number of a graph equals its
                 path-width ({NP}-complete problem)",
  journal =      j-INFO-PROC-LETT,
  volume =       "42",
  number =       "6",
  pages =        "345--350",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "93d:05143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Kansas",
  affiliationaddress = "Lawrence, KS, USA",
  classification = "723.1; 921.4; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Kansas Univ.,Lawrence, KS,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; combinatorial mathematics; Computational
                 complexity; computational complexity; Decision
                 algorithms; fixed parameter variants; gate matrix
                 layout; Gate matrix layout problem; graph; Graph
                 theory; Node search number problems; node search number
                 problems; NP-complete problem; O(n/sup 2/) decision
                 algorithms; obstruction sets; Path width; path-width;
                 Tree obstructions; Vertex separation number; vertex
                 separation number",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Saluja:1992:NPV,
  author =       "Sanjeev Saluja",
  title =        "A note on the permanent value problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "1--5",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (15A15)",
  MRnumber =     "93m:68084",
  MRreviewer =   "Nigel B. Backhouse",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tata Inst of Fundamental Research",
  affiliationaddress = "Bombay, India",
  classification = "721.1; 921.1; C4140 (Linear algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., 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 =     "Complexity classes; Computability and decidability;
                 Computational complexity; computational complexity;
                 Counting classes; counting classes; Decision problems;
                 decision problems; GapP; Matrix algebra; matrix
                 algebra; matrix permanents; Permanent value problem;
                 permanent value problem; PP,C/sub =/P; product
                 reductions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bern:1992:DPD,
  author =       "Marshall Bern and John R. Gilbert",
  title =        "Drawing the planar dual",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "7--13",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "93i:68168",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Xerox Palo Alto Research Cent",
  affiliationaddress = "Palo Alto, CA, USA",
  classification = "721.1; 723.1; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Xerox Palo Alto Res. Center, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Computational complexity; computational
                 complexity; computational geometry; convex five-sided
                 faces; convex four-sided faces; drawing; dual graph;
                 Dual graphs; Dual vertices; dual vertices; duality
                 (mathematics); Graph theory; graph theory; Linear time
                 algorithms; linear-time algorithm; NP-hard; NP-hard
                 problems; planar dual; planar graph; Planar graphs;
                 primal edges; straight-line planar embedding",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chandra:1992:DRH,
  author =       "Barun Chandra",
  title =        "Does randomization help in on-line bin packing?",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "15--19",
  day =          "10",
  month =        aug,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Chicago",
  affiliationaddress = "Chicago, IL, USA",
  classification = "723.1; 921.4; 922.1; C1290 (Applications of systems
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Chicago Univ., IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; computational
                 complexity; lower bounds; on-line algorithms; on-line
                 bin packing; operations research; Probabilistic
                 algorithms; Random processes; randomization; Randomized
                 algorithms; randomized algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bachmair:1992:ACR,
  author =       "Leo Bachmair",
  title =        "Associative-commutative reduction orderings",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "21--27",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (68T15)",
  MRnumber =     "93i:68103",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York at Stony Brook",
  affiliationaddress = "Stony Brook, NY, USA",
  classification = "723.1; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York, Stony
                 Brook, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "associativity; Associativity; Automatic theorem
                 proving; commutativity; Commutativity; directed
                 equations; extended rewrite systems; lexicographic path
                 ordering; Lexicographic path ordering; normal form;
                 Programming theory; reduction orderings; Reduction
                 orderings; Rewrite systems; rewriting systems;
                 schematic rewrite system; subterms; termination;
                 Termination; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schirra:1992:ADA,
  author =       "Stefan Schirra",
  title =        "Approximate decision algorithms for approximate
                 congruence",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "29--34",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "94a:68136",
  MRreviewer =   "Michael S. Martin",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Max-Planck-Inst f{\"u}r Informatik",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "721.1; 723.5; 921; C4130 (Interpolation and function
                 approximation); 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 =     "Approximate congruence; approximate congruence;
                 approximate decision algorithms; approximation theory;
                 computational complexity; Computational geometry;
                 computational geometry; Computer vision; Decision
                 algorithms; Geometry; indecision interval; plane; Point
                 matching; point sets; tolerance value; translation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kern:1992:LCB,
  author =       "W. Kern",
  title =        "Learning convex bodies under uniform distribution",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "35--39",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05",
  MRnumber =     "93i:68150",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Twente",
  affiliationaddress = "Enschede, Neth",
  classification = "721.1; C1240 (Adaptive system theory); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Fac. of Appl. Math., Twente Univ., Enschede,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bounded region; computability; Computation theory;
                 Convex bodies; convex bodies; Learning by example;
                 Learning systems; learning systems; PAC-learnable;
                 target concept; uniform distribution",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tsai:1992:AFT,
  author =       "Li-Hui Tsai",
  title =        "An algorithm for flow time minimization and its
                 asymptotic makespan properties",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "41--46",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68Q25 90B35)",
  MRnumber =     "93i:68030",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "723.1; 912.3; 921.5; 922.1; C1180 (Optimisation
                 techniques); C1290F (Industry); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Decision 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 =     "absolute difference; Algorithms; asymptotic makespan
                 properties; asymptotic minimisation; computational
                 complexity; finite mean; flow time minimisation
                 algorithm; Flow time minimization; heuristic makespan;
                 identical machines; identically distributed random
                 variables; independent random variables; job
                 assignment; job processing times; Makespan properties;
                 mean flow time; minimisation; Operations research;
                 optimal makespan; Optimization; production control;
                 Random processes; scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singhal:1992:EIV,
  author =       "Mukesh Singhal and Ajay Kshemkalyani",
  title =        "An efficient implementation of vector clocks",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "47--52",
  day =          "10",
  month =        aug,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "721.1; 722.4; 723.1; C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed 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 =     "Algorithms; Distributed algorithms; distributed
                 algorithms; Distributed computer systems; distributed
                 processing; FIFO message delivery; graph theory;
                 message; parallel algorithms; programming theory;
                 reasoning; Theory; timestamp related information;
                 topology; Vector clocks; vector clocks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Koutsoupias:1992:GAS,
  author =       "Elias Koutsoupias and Christos H. Papadimitriou",
  title =        "On the greedy algorithm for satisfiability",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "53--55",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "93i:68087",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "San Diego, CA, USA",
  classification = "721.1; 723.1; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., California Univ., San
                 Diego, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3CNF formulas; Algorithms; computability; Computation
                 theory; computational complexity; Greedy algorithm;
                 greedy algorithm; local search heuristic; random truth
                 assignment; Satisfiability; satisfiability; satisfiable
                 3CNF formulae; satisfied clauses; Search heuristics;
                 search problems; Truth assignment",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Martelli:1992:NS,
  author =       "Maurizio Martelli and Chiara Tricomi",
  title =        "A new {SLDNF}-tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "57--62",
  day =          "24",
  month =        aug,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6150C (Compilers, interpreters and
                 other processors)",
  corpsource =   "Dipartimento di Inf. e Sci. dell'Inf., Genova Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computation rule; computational step; formal
                 languages; literal; program interpreters; programming
                 theory; proofs by induction; SLDNF-tree; theoretical
                 tool; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chee:1992:ACC,
  author =       "Yeow Meng Chee and Andrew Lim",
  title =        "The algorithmic complexity of colour switching",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "63--68",
  day =          "24",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "93g:68106",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B6150
                 (Communication system theory); B6250F (Mobile radio
                 systems); C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Nat. Comput. Board, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithmic complexity; bipartite graphs; cellular
                 radio; channel allocation problem; colour switching;
                 computational complexity; frequency allocation; graph
                 colouring; mobile cellular radio systems; time
                 complexity; weighted matching problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsu:1992:SSW,
  author =       "F. R. Hsu and R. C. T. Lee and R. C. Chang",
  title =        "Special subgraphs of weighted visibility graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "69--75",
  day =          "24",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25 68R10)",
  MRnumber =     "93g:68137",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://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 =   "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 edges; graph theory; subgraph; time complexity;
                 weighted visibility graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsu:1992:SSA,
  author =       "Su Chu Hsu and Shing Tsaan Huang",
  title =        "A self-stabilizing algorithm for maximal matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "77--81",
  day =          "24",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15",
  MRnumber =     "93g:68006",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5670
                 (Network performance)",
  corpsource =   "Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; correctness; distributed
                 networks; distributed processing; fault recovery; fault
                 tolerant computing; graph theory; local variables;
                 maximal matching; perturbations; self-stabilizing
                 algorithm; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hwang:1992:AOT,
  author =       "Tzonelih Hwang",
  title =        "Attacks on {Okamoto} and {Tanaka}'s one-way {ID}-based
                 key distribution system",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "83--86",
  day =          "24",
  month =        aug,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130S (Data security)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cryptography; data security; one-way ID-based key
                 distribution system; private communications",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sen:1992:GPP,
  author =       "Arunabha Sen and Haiyong Deng and Sumanta Guha",
  title =        "On a graph partition problem with application to
                 {VLSI} layout",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "87--94",
  day =          "24",
  month =        aug,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B1130B
                 (Computer-aided circuit analysis and design); C1160
                 (Combinatorial mathematics); C4230 (Switching theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Arizona State Univ.,
                 Tempe, AZ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circle graph; computational complexity; graph
                 partition problem; graph theory; integer linear
                 programming; minimisation of switching nets; NP-
                 complete; polynomial time; VLSI; VLSI layout",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Majster-Cederbaum:1992:EEB,
  author =       "Mila E. Majster-Cederbaum",
  title =        "Ensuring the existence of a {BCNF}-decomposition that
                 preserves functional dependencies in {$O(N^2)$} time",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "95--100",
  day =          "24",
  month =        aug,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160D (Relational DBMS)",
  corpsource =   "Fakultat f{\"u}r Math. und Inf., Mannheim Univ.,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "BCNF-decomposition; computational complexity; database
                 theory; functional dependencies; graphical
                 representation; lossless-join property; relation
                 scheme; relational database model; relational
                 databases; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheung:1992:MPR,
  author =       "Steven Cheung and Francis C. M. Lau",
  title =        "Mesh permutation routing with locality",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "101--105",
  day =          "24",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "93h:68006",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "buffer size; computational complexity; greedy
                 algorithm; k-k routing problem; locality; maximum
                 distance; mesh-connected arrays; MIMD; multiprocessor
                 interconnection networks; optimal algorithm; parallel
                 algorithms; permutation routing problem; sorting;
                 source-destination pair; space complexity; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Li:1992:OWF,
  author =       "Ming Li and Paul M. B. Vit{\'a}nyi",
  title =        "Optimality of wait-free atomic multiwriter variables",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "2",
  pages =        "107--112",
  day =          "24",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "93h:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "computational complexity; concurrent wait-free atomic
                 shared multiwriter variables; control bits; parallel
                 programming; programming theory; sequential time-stamp
                 systems; wait-free atomic multiwriter variables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{deMoor:1992:IDT,
  author =       "Oege {de Moor}",
  title =        "Inductive data types for predicate transformers",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "113--117",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q65 (68Q60)",
  MRnumber =     "93k:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Oxford Univ. Comput. Lab., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "catamorphisms; data structures; functional programming
                 languages; homomorphisms; inductive data types;
                 predicate transformers; program constructors;
                 programming theory; specification formalisms",
  treatment =    "P Practical",
}

@Article{Saluja:1992:PEC,
  author =       "Sanjeev Saluja and K. V. Subrahmanyam",
  title =        "On the power of enumerative counting",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "119--125",
  day =          "14",
  month =        sep,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Tata Inst. of Fundamental Res.,
                 Bombay, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; enumerative counting;
                 polynomially bounded counting functions; relativised
                 separations; Turing-computable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Woeginger:1992:FCE,
  author =       "Gerhard J. Woeginger",
  title =        "Finding the closest extreme vertex to a fixed point",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "127--128",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "93i:68186",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algebraic computation tree model; closest extreme
                 vertex; computational complexity; computational
                 geometry; fixed point; hull points; linear time
                 reduction; neighboring points; time complexity;
                 uniform-gap-on-a-circle problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liu:1992:EPS,
  author =       "Xiao Qing Liu and Junguk L. Kim",
  title =        "An efficient parallel sorting algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "129--133",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68P10)",
  MRnumber =     "93i:68079",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6130 (Data handling techniques)",
  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/",
  keywords =     "data accesses; EREW PRAM multiprocessor; linear
                 speedup; merge-based sorting; parallel algorithms;
                 parallel sorting algorithm; partition algorithm;
                 private caches; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Henzinger:1992:SST,
  author =       "Thomas A. Henzinger",
  title =        "Sooner is safer than later (reactive systems)",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "135--141",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68Q55)",
  MRnumber =     "93e:68071",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110B
                 (Software engineering techniques)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "programming theory; reactive systems; real-time
                 properties; real-time systems; safety-liveness
                 classification; software reliability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Galiev:1992:DDR,
  author =       "V. I. Galiev and A. F. Polupanov and I. E.
                 Shparlinski",
  title =        "Distances from differences of roots of polynomials to
                 the nearest integers",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "143--146",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (34A99 34E05 65Y20)",
  MRnumber =     "93j:68072",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4170 (Differential equations); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Inst. of Radioeng. and Electron., Russian Acad. of
                 Sci., Moscow, Russia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; differential equations;
                 discrete normed commutative ring; nonzero integers;
                 ODE; polynomials; roots of polynomials; tight bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Penczek:1992:UPT,
  author =       "Wojciech Penczek",
  title =        "On undecidability of propositional temporal logics on
                 trace systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "147--153",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B45 03B70 03D35)",
  MRnumber =     "93k:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw,
                 Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "concurrent computation tree logic; concurrent
                 programs; decidability; interleaving set temporal
                 logic; parallel algorithms; partial order logic;
                 propositional temporal logics; specification; temporal
                 logic; trace systems; undecidability; verification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boreale:1992:CSA,
  author =       "M. Boreale and P. Inverardi and M. Nesi",
  title =        "Complete sets of axioms for finite basic {LOTOS}
                 behavioural equivalences",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "155--160",
  day =          "14",
  month =        sep,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "IEI-CNR, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computer network; concurrent systems; finite basic
                 LOTOS behavioural equivalences; Open System
                 Interconnection; OSI; specification language;
                 specification languages",
  treatment =    "P Practical",
}

@Article{Dimitrov:1992:MRB,
  author =       "V. S. Dimitrov and T. V. Cooklev and B. D. Donevsky",
  title =        "On the multiplication of reduced biquaternions and
                 applications",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "161--164",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40",
  MRnumber =     "93i:68100",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5240
                 (Digital filters)",
  corpsource =   "Center for CAD, Tech. Univ. of Plovdiv, Bulgaria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; computational complexity; digital
                 filters; DSP; hypercomplex coefficients;
                 multiplication; reduced biquaternions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1992:CYA,
  author =       "Do-Hyung Kim and Kwang-Moo Choe",
  title =        "Corrigenda: {``Yet another efficient backward
                 execution algorithm in the {AND\slash OR} Process
                 Model''} {[Inform. Process. Lett. {\bf 40}(4), 25
                 November 1991, pp. 201--211]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "165--165",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 07:39:45 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Kim:1991:YAE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Szymanski:1992:CCC,
  author =       "Boleslaw K. Szymanski and Balaram Sinharoy",
  title =        "Corrigenda: {``Complexity of the closest vector
                 problem in a lattice generated by $(0,1)$-matrix''
                 [Inform. Process. Lett. {\bf 42} (1992), no. 3,
                 121--126; MR 94c:68096]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "3",
  pages =        "167--167",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "94f:68100",
  bibdate =      "Sat Apr 11 12:24:18 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Szymanski:1992:CCV}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gemmell:1992:HRC,
  author =       "Peter Gemmell and Madhu Sudan",
  title =        "Highly resilient correctors for polynomials",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "169--174",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40",
  MRnumber =     "93h:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "information theoretic optimum; large finite fields;
                 polynomials; program verification; programs
                 correctness",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Palsberg:1992:SAV,
  author =       "Jens Palsberg and Michael I. Schwartzbach",
  title =        "Safety analysis versus type inference for partial
                 types",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "175--180",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (03B40)",
  MRnumber =     "93g:68080",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4240 (Programming
                 and algorithm theory); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; inference mechanisms; partial types;
                 program verification; programming theory; safety
                 analysis; type inference; untyped lambda calculus",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kolountzakis:1992:FCE,
  author =       "Mihail N. Kolountzakis and Kiriakos N. Kutulakos",
  title =        "Fast computation of the {Euclidian} distance maps for
                 binary images",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "181--184",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q22 68T10)",
  MRnumber =     "93g:68140",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  annote =       "Yes, the title has `Euclidian' instead of
                 `Euclidean'.",
  classification = "C1250 (Pattern recognition); C4240 (Programming and
                 algorithm theory); C6130B (Graphics techniques)",
  corpsource =   "Dept. of Math., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary images; computer graphics; Euclidian distance
                 maps; fast computation; image processing; parallel
                 algorithms; parallel machine; pattern recognition;
                 running time",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Birget:1992:IUR,
  author =       "Jean-Camille Birget",
  title =        "Intersection and union of regular languages and state
                 complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "185--190",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q70)",
  MRnumber =     "93k:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; finite automata;
                 finite-state devices; formal languages; intersection;
                 natural complexity measure; nondeterministic finite
                 automata; regular languages; state complexity; union",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1992:FEP,
  author =       "Zhi-Zhong Chen",
  title =        "A fast and efficient parallel algorithm for finding a
                 satisfying truth assignment to a $2$-{${\rm CNF}$}
                 formula",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "191--193",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (03B05 03D15 68Q25)",
  MRnumber =     "93h:68054",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Inf. Eng., Mie Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-CNF formula; Boolean functions; computational
                 complexity; CRCW PRAM; EREW PRAM; parallel algorithm;
                 parallel algorithms; random-access storage; satisfying
                 truth assignment",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Takaoka:1992:NUB,
  author =       "Tadao Takaoka",
  title =        "A new upper bound on the complexity of the all pairs
                 shortest path problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "195--199",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q22)",
  MRnumber =     "93h:68061",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Ibaraki Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; all pairs shortest path problem;
                 complexity; computational complexity; parallel
                 algorithm; parallel algorithms; PRAM-EREW;
                 random-access storage; uniform cost RAM; upper bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Greenberg:1992:MSS,
  author =       "Ronald I. Greenberg and F. Miller Maley",
  title =        "Minimum separation for single-layer channel routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "201--205",
  day =          "28",
  month =        sep,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1130B (Computer-aided circuit analysis and design);
                 B2570 (Semiconductor integrated circuits); C7410D
                 (Electronic engineering)",
  corpsource =   "Dept. of Electr. Eng., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circuit layout CAD; linear-time algorithm; minimum
                 height; minimum separation; multiterminal nets;
                 single-layer channel routing; switchboxes; VLSI; VLSI
                 layout",
  treatment =    "P Practical",
}

@Article{Allison:1992:LDC,
  author =       "L. Allison",
  title =        "Lazy dynamic-programming can be eager",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "207--212",
  day =          "28",
  month =        sep,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "dynamic programming; edit-distance problem; functional
                 language; functional programming; lazy dynamic
                 programming",
  treatment =    "P Practical",
}

@Article{Bagchi:1992:SPE,
  author =       "A. Bagchi",
  title =        "On sorting in the presence of erroneous information",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "213--215",
  day =          "28",
  month =        sep,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Bellcore, Red Bank, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary comparisons; communication channel;
                 computational complexity; deliberate misinformation;
                 erroneous information; sorting; worst-case complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Huttenlocher:1992:VDR,
  author =       "Daniel P. Huttenlocher and Klara Kedem and Jon M.
                 Kleinberg",
  title =        "Vorono{\u{\i}} diagrams of rigidly moving sets of
                 points",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "217--223",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "93k:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial changes; computational geometry; rigidly
                 moving sets of points; upper bound; Voronoi diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Inoue:1992:RBN,
  author =       "Katsushi Inoue and Akira It\=o and Itsuo Takanami",
  title =        "A relationship between nondeterministic {Turing}
                 machines and $1$-inkdot {Turing} machines with small
                 space",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "4",
  pages =        "225--227",
  day =          "28",
  month =        sep,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D10 03D15 68Q05 68Q10)",
  MRnumber =     "93j:68061",
  MRreviewer =   "John Michael Robson",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Syst. Eng., Fac. of Eng.,
                 Yamaguchi Univ., Ube, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "1-inkdot Turing machines; computational complexity;
                 nondeterministic Turing machines; read-only input tape;
                 read-write worktape; small space; tape-cell; Turing
                 machines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hsiao:1992:EAF,
  author =       "Ju Yuan Hsiao and Chuan Yi Tang and Ruay Shiung
                 Chang",
  title =        "An efficient algorithm for finding a maximum weight
                 $2$-independent set on interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "229--235",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "93g:05130",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723.2; 921.4; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  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 =     "Algorithms; Combinatorial mathematics; Combinatorial
                 problems; computational complexity; Data handling; Data
                 structures; graph theory; Graph theory; interval
                 graphs; Interval graphs; interval representation;
                 Interval representation; linear algorithm; Linear
                 algorithm; maximum weight 2-independent set; Maximum
                 weight 2-independent set; Maximum weight independent
                 set problem; Maximum weight k-independent set; set
                 theory; Set theory; sorted endpoints list; Sorted
                 endpoints list; Sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schwabe:1992:EMT,
  author =       "Eric J. Schwabe",
  title =        "Embedding meshes of trees into {de Bruijn} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "237--240",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (05C85 68M10)",
  MRnumber =     "93h:05060",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "723.2; 921.4; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  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 =     "Algorithms; Bounded degree networks; butterfly
                 networks; computational complexity; Computational
                 methods; Data processing; deBruijn graph; deBruijn
                 graphs; embedding; Graph embeddings; Graph theory;
                 graph theory; hypercube; hypercube networks;
                 Hypercubes; Interconnection networks; Mathematical
                 models; Mesh of trees; mesh of trees network; Parallel
                 algorithms; parallel algorithms; shuffle-exchange
                 graph; Topology; Trees (mathematics); trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dawes:1992:SPE,
  author =       "Robin W. Dawes",
  title =        "Some pursuit-evasion problems on grids",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "241--247",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90D26 (90D35 90D43)",
  MRnumber =     "94a:90042",
  MRreviewer =   "Prabir Das",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "721.1; 723.1; 731.5; 922.1; C1140E (Game theory);
                 C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. 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 =     "Algorithms; computational complexity; cop; game
                 theory; Game theory; graph theory; grid column; grid
                 row; Logic programming; Probabilistic logics; Pursuit
                 evasion problems; pursuit-evasion game; pursuit-evasion
                 problems; rectangular grid; Rectangular grid; robber;
                 Robotics; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Satyanarayanan:1992:NRT,
  author =       "R. Satyanarayanan and D. R. Muthukrishnan",
  title =        "A note on {Raymond}'s tree based algorithm for
                 distributed mutual exclusion",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "249--255",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "93g:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Raymond:1989:DAM}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "721.1; 722.3; 723.1; 723.2; 921.4; C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  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; Computer systems programming; Concurrency;
                 Critical section; critical section execution; Data
                 communication systems; Data processing; distributed
                 algorithms; Distributed computer systems; distributed
                 mutual exclusion algorithms; Fairness; fairness
                 criterion; fairness property; least executed criterion;
                 lower bounds; message generation; Modification;
                 Multiprocessing systems; Mutual exclusion; Parallel
                 processing systems; Programming theory; Raymond
                 algorithm; Raymond's tree based algorithm; spanning
                 tree diameter; starvation freedom; tree based
                 algorithm; tree data structures; Trees (mathematics);
                 upper bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Czech:1992:OAG,
  author =       "Zbigniew J. Czech and George Havas and Bohdan S.
                 Majewski",
  title =        "An Optimal Algorithm for Generating Minimal Perfect
                 Hash Functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "257--264",
  day =          "5",
  month =        oct,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Silesia Univ of Technology",
  affiliationaddress = "Gliwice, Pol",
  classification = "721.1; 722.1; 723.1; 723.2; 921.4; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  corpsource =   "Inst. of Comput. Sci., Silesia Univ. of Technol.,
                 Gliwice, Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer systems
                 programming; Data handling; Data structures; expected
                 linear time; file organisation; Graph theory; graph
                 theory; Hashing; Minimal perfect hash functions;
                 minimal perfect hash functions; order preserving hash
                 functions; Perfect hash functions; probabilistic
                 algorithm; Probabilistic logics; random graph
                 generation; Random graphs; Random processes; Table
                 lookup; word representation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pombortsis:1992:AHB,
  author =       "A. S. Pombortsis",
  title =        "Analysis of hierarchical bus-based multicomputer
                 architectures",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "265--270",
  day =          "5",
  month =        oct,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aristotle Univ of Thessaloniki",
  affiliationaddress = "Thessaloniki, Greece",
  classification = "722.3; 722.4; 723.2; C1140C (Queueing theory);
                 C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Dept. of Inf., Aristotle Univ., Thessaloniki, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bus based multicomputer architectures; cluster
                 structure; Computer architecture; Computer networks;
                 Data communication systems; Distributed computer
                 systems; distributed processing; hierarchical bus-based
                 multicomputer architectures; hierarchical
                 interconnection networks; Hierarchical interconnection
                 networks; Hierarchical systems; message passing;
                 Multicomputer systems; Multiprocessing systems;
                 multiprocessor interconnection networks; Optimization;
                 parallel architectures; parallel processing; Parallel
                 processing systems; Performance; performance
                 evaluation; performance model; queueing theory;
                 underline communication network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ressler:1992:RLP,
  author =       "Eugene K. Ressler",
  title =        "Random list permutations in place",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "271--275",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q25)",
  MRnumber =     "93g:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "721.1; 723.1; 723.1.1; 723.2; 922.1; C4240
                 (Programming and algorithm theory); C6130 (Data
                 handling techniques)",
  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; Common Lisp; computational complexity;
                 Computational methods; constant-time random bit
                 generator; Data handling; Data structures; expected
                 time; Linked lists; lisp (programming language); list
                 processing; List processing languages; Permutations;
                 Probabilistic logics; Probability; Programming language
                 {Common Lisp}; RAM; Random bit generator; Random list
                 permutations; random list permutations; Random number
                 generation; Random processes; Recursive functions;
                 singly linked list; stack space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vanVliet:1992:ILB,
  author =       "Andr{\'e} {van Vliet}",
  title =        "An improved lower bound for on-line bin packing
                 algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "277--284",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R05 90C27)",
  MRnumber =     "93j:68077",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Erasmus Univ",
  affiliationaddress = "Rotterdam, Neth",
  classification = "723.1; 723.2; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C1290 (Applications of systems theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Tinbergen Inst., Erasmus Univ., Rotterdam,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Asymptotic worst case ratio; asymptotic
                 worst case ratio; Bin packing; Combinatorial
                 mathematics; combinatorial mathematics; Computational
                 complexity; computational complexity; Computational
                 methods; Data handling; List processing languages;
                 lower bound; Lower bounds; Online algorithms; online
                 bin packing algorithms; operations research; parametric
                 case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jerebic:1992:ORT,
  author =       "Izidor Jerebic and Roman Trobec",
  title =        "Optimal routing in toroidal networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "285--291",
  day =          "19",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q10)",
  MRnumber =     "93i:68020",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Jozef Stefan Inst",
  affiliationaddress = "Ljubljana, Slovenia",
  classification = "722.4; 723.1; 921.5; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Jozef Stefan Inst., Ljubljana, Slovenia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; edge-to-edge connections; Interconnection
                 networks; interconnection networks; Multiprocessing
                 systems; multiprocessor interconnection networks;
                 multiprocessors; n-dimensional rectangular mesh;
                 one-to-one communication; Optimal routing; optimal
                 routing; Optimization; parallel processing; Routing
                 algorithms; Toroidal networks; toroidal networks",
  treatment =    "P Practical",
}

@Article{Chang:1992:EAM,
  author =       "Maw-Shang Chang and Fu-Hsing Wang",
  title =        "Efficient algorithms for the maximum weight clique and
                 maximum weight independent set problems on permutation
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "293--295",
  day =          "19",
  month =        oct,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung Cheng Univ",
  affiliationaddress = "Chiayi, Taiwan",
  classification = "723.1; 921.4; C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Inst. of Comput. and Sci. and Inf. Eng., Nat. Chung
                 Cheng Univ., Chiaya, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithms; Algorithms; computational complexity;
                 graph theory; maximum weight clique; Maximum weight
                 clique; maximum weight independent set problems;
                 Maximum weight independent sets; O(n log log n)
                 algorithms; permutation graphs; Permutation graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Peng:1992:SLT,
  author =       "Shen Lung Peng and Maw Shang Chang",
  title =        "A simple linear time algorithm for the domatic
                 partition problem on strongly chordal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "297--300",
  day =          "19",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "93g:68108",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung Cheng Univ",
  affiliationaddress = "Chiayi, Taiwan",
  classification = "723.1; 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 =     "Algorithms; computational complexity; disjoint
                 dominating sets; Disjoint dominating sets; domatic
                 partition problem; Domatic partition problem; edges;
                 graph theory; Graph theory; greedy method; linear time
                 algorithm; Linear time algorithm; O(m+n) time
                 algorithm; strongly chordal graph; strongly chordal
                 graphs; Strongly chordal graphs; vertex set; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Scholefield:1992:WPS,
  author =       "D. Scholefield and H. S. M. Zedan",
  title =        "Weakest precondition semantics for time and
                 concurrency",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "301--308",
  day =          "19",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "93h:68081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of York",
  affiliationaddress = "Heslington, Engl",
  classification = "723.1.1; C4240 (Programming and algorithm theory);
                 C6140D (High level languages)",
  corpsource =   "Dept. of Comput. Sci., York Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer programming languages; concurrency;
                 Concurrent languages; parallel languages; Predicate
                 transformers; predicate transformers; program
                 verification; Real time concurrent language; Real time
                 systems; real-time concurrent language; Refinement
                 calculus; refinement calculus; Semantics; time;
                 verification; Weakest precondition semantics; weakest
                 precondition semantics",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Albacea:1992:PAE,
  author =       "Eliezer A. Albacea",
  title =        "A parallel algorithm for edge-coloring of graphs with
                 edge-disjoint cycles",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "309--314",
  day =          "19",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C05 05C15 68Q20 68R10)",
  MRnumber =     "93i:68076",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Australian Natl Univ",
  affiliationaddress = "Canberra, Aust",
  classification = "723.1; 921.4; C1160 (Combinatorial mathematics);
                 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 =     "Algorithms; Edge coloring; edge-coloring;
                 edge-disjoint cycles; EREW PRAM; graph colouring; Graph
                 theory; graphs; linear algorithm; Linear algorithms;
                 Multiprocessing programs; n/log n processors; O(log n)
                 time; parallel algorithm; Parallel algorithms; parallel
                 algorithms; Parallel random access machines;
                 parallelization; random-access storage; tree; Trees
                 (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1992:MVA,
  author =       "Cheeha Kim and Jong-Sung Kim",
  title =        "A mean value analysis of the {Ethernet} throughput",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "315--320",
  day =          "19",
  month =        oct,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "POSTECH",
  affiliationaddress = "Pohang, SOUTH KOREA",
  classification = "722.3; B6210L (Computer communications); C5620L
                 (Local area networks); C5670 (Network performance)",
  corpsource =   "Dept. of Comput. Sci., POSTECH, Pohang, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "collision probabilities; collision recovery; Computer
                 networks; durations; Ethernet throughput; Ethernets;
                 local area networks; mean value analysis; Mean value
                 analysis; node locations; Performance; performance
                 evaluation; space-time model; Space-time model;
                 Throughput",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1992:NTW,
  author =       "Jie Wang",
  title =        "A note on two-way probabilistic automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "321--326",
  day =          "19",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q75",
  MRnumber =     "93i:68139",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Wilkes Univ",
  affiliationaddress = "Wilkes-Barre, PA, USA",
  classification = "721.1; 922.1; C4210 (Formal logic); C4220 (Automata
                 theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Wilkes Univ.,
                 Wilkes-Barre, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Context free languages; context-free languages;
                 context-sensitive languages; Finite automata; finite
                 automata; finite state automata; Probabilistic
                 automata; Probability; Stochastic automata; Two-way
                 probabilistic automata; two-way probabilistic
                 automata",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1992:DAO,
  author =       "Hanxiong Chen and Xu Yu and Kazunori Yamaguchi and
                 Hiroyuki Kitagawa and Nobuo Ohbo and Yuzuru Fujiwara",
  title =        "Decomposition --- An approach for optimizing queries
                 including {ADT} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "327--333",
  day =          "19",
  month =        oct,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tsukuba",
  affiliationaddress = "Tsukuba, Jpn",
  classification = "723.3; C4250 (Database theory); C6110J
                 (Object-oriented programming)C7250 (Information storage
                 and retrieval); C6160J (Object-oriented databases)",
  corpsource =   "Tsukuba Univ., Ibaraki, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "abstract data types; adt functions; Database systems;
                 Decomposition; decomposition scheme; Optimization;
                 query optimisation; Query optimizing; query
                 processing",
  treatment =    "P Practical",
}

@Article{Hagerup:1992:CTR,
  author =       "Torben Hagerup",
  title =        "On a compaction theorem of {Ragde}",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "6",
  pages =        "335--340",
  day =          "19",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q22)",
  MRnumber =     "93g:68014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Max-Planck-Inst f{\"u}r Informatik",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "722.4; C4240P (Parallel programming and algorithm
                 theory)",
  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 =     "Compaction theorem; compaction theorem;
                 Multiprocessing systems; parallel algorithms; Parallel
                 random access machines; pram; PRAM",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chung:1992:IEH,
  author =       "Soon M. Chung",
  title =        "Indexed Extendible Hashing",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "1--6",
  day =          "9",
  month =        nov,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Wright State Univ",
  affiliationaddress = "Dayton, OH, USA",
  classification = "722.1; 723.2; 723.3; 903.1; 903.3; C4250 (Database
                 theory); C6120 (File organisation); C6160 (Database
                 management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci. and Eng., Wright State Univ.,
                 Dayton, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "concurrency; data block access; Data structures;
                 database management systems; Database systems; database
                 theory; Directory; directory; Extendible hashing; file
                 organisation; hashed attribute values; Hashing; Indexed
                 extendible hashing; indexed extendible hashing;
                 Indexing (of information); Information retrieval; Query
                 languages; query processing; Storage allocation
                 (computer); Storage utilization; storage utilization;
                 user queries; very large databases",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Masuyama:1992:DWG,
  author =       "Shigeru Masuyama and Shozo Naito",
  title =        "Deciding whether graph ${G}$ has page number one is in
                 {NC}",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "7--10",
  day =          "9",
  month =        nov,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Toyohashi Univ of Technology",
  affiliationaddress = "Toyohashi, Jpn",
  classification = "721.1; 731.1; 731.2; 921; 921.4; C1160
                 (Combinatorial mathematics); C4210 (Formal logic);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Knowledge-based Inf. Eng., Toyohashi Univ. of
                 Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Book embedding; Class NC; Computational
                 complexity; computational complexity; decidability;
                 edges; forbidden subgraph; Forbidden subgraphs
                 characterization; Graph theory; graph theory; linear
                 arrangement; NC; Numerical control systems; Page number
                 one; page number one; Parallel algorithms; parallel
                 algorithms; Polylog; polylog time algorithm;
                 Polynomials; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paschos:1992:AAM,
  author =       "V. Th. Paschos",
  title =        "A $({\Delta}/2)$-approximation algorithm for the
                 maximum independent set problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "11--13",
  day =          "9",
  month =        nov,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite de Paris XI - Orsay",
  affiliationaddress = "Orsay, Fr",
  classification = "721.1; 723.1; 921; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "LRI, Paris XI Univ., Orsay, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation algorithms; approximation
                 ratio; Approximation theory; Combinatorial mathematics;
                 Combinatorial problems; Computational complexity;
                 computational complexity; exposed vertices; Graph
                 theory; graph theory; greedy algorithm; Independent
                 set; maximal matching; maximum degree; maximum
                 independent set problem; Set theory; set theory;
                 Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yu:1992:OPA,
  author =       "Ming Shing Yu and Cheng-Hsing Yang",
  title =        "An optimal parallel algorithm for the domatic
                 partition problem on an interval graph given its sorted
                 model",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "15--22",
  day =          "9",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q22 68Q25)",
  MRnumber =     "93i:68145",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung-Hsing Univ",
  affiliationaddress = "Taichung, Taiwan",
  classification = "721.1; 723.1; 723.2; 921.4; C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Appl. Math., Nat. Chung-Hsing Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automata theory; Boolean algebra;
                 Combinatorial mathematics; Combinatorial problems;
                 computational complexity; Data structures; domatic
                 partition problem; Domatic partition problem; EREW PRAM
                 model; graph theory; Graph theory; Interval graph;
                 optimal parallel algorithm; Optimal parallel algorithm;
                 parallel algorithms; Program processors; Set theory;
                 sorted endpoints; sorted interval graph; sorted
                 intervals; sorting; time-processor product",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hammer:1992:HFT,
  author =       "Peter L. Hammer and Alexander Kogan",
  title =        "{Horn} functions and their {DNFs}",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "23--29",
  day =          "9",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03G05 (06E30)",
  MRnumber =     "94a:03094",
  MRreviewer =   "S. Rudeanu",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rutgers Univ",
  affiliationaddress = "New Brunswick, NJ, USA",
  classification = "721.1; 723.4.1; 921; 921.4; C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Rutgers Center for Operations Res., Rutgers Univ., New
                 Brunswick, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean functions; Combinatorial mathematics;
                 Computational complexity; computational complexity;
                 decomposition algorithm; Disjunctive normal forms;
                 Expert systems; Function evaluation; Horn clauses; Horn
                 formulae; Horn functions; irredundant prime disjunctive
                 normal forms; Knowledge based systems; knowledge based
                 systems; minimization; positive restriction; production
                 rule knowledge bases; Propositional expert systems;
                 propositional expert systems; pure Horn functions;
                 quadratic time; Systems analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hwang:1992:EIB,
  author =       "Tzonelih Hwang",
  title =        "Efficient {ID}-based key distribution with tamperfree
                 devices",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "31--34",
  day =          "9",
  month =        nov,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Cheng Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "716.1; 723.2; 731.2; B6120B (Codes); C6130S (Data
                 security)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Codes (symbols); Cryptography; cryptography; Data
                 processing; ID based cryptosystems; ID-based key
                 distribution; Identification (control systems); Key
                 distribution; message authentication; private-key
                 cryptosystems; Security of data; security scheme;
                 Security systems; Sender authentication; sender
                 authentication; supersecret keys; Tamperfree devices;
                 tamperfree devices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kapur:1992:ULL,
  author =       "Shyam Kapur and Gianfranco Bilardi",
  title =        "On uniform learnability of language families",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "35--38",
  day =          "9",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68T05)",
  MRnumber =     "93i:68109",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pennsylvania",
  affiliationaddress = "Philadelphia, PA, USA",
  classification = "721.1; 723.4.1; 731.2; 903.1; 921; C1230 (Artificial
                 intelligence); C4210 (Formal logic)",
  corpsource =   "Inst. for Res. in Cognitive Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; computational linguistics; Context
                 free languages; Context sensitive languages; Formal
                 languages; formal languages; Identification (control
                 systems); indexing; Indexing (of information);
                 inductive inference; Inductive inference machine (IIM);
                 Inference engines; inference mechanisms; Language
                 families; learning (artificial intelligence);
                 Mathematical models; Nonempty recursive languages;
                 Recursive functions; recursive language families;
                 Switching theory; Turing machines; Uniform
                 learnability; uniform learnability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Garg:1992:SOA,
  author =       "Vijay K. Garg",
  title =        "Some optimal algorithms for decomposed partially
                 ordered sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "39--43",
  day =          "9",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (06A07 68Q25)",
  MRnumber =     "93h:68109",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas",
  affiliationaddress = "Austin, TX, USA",
  classification = "722.4; 723.1; 921.4; 921.5; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  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 =     "Algorithms; anti-chain; Combinatorial mathematics;
                 computational complexity; decomposed partially ordered
                 sets; Distributed computer systems; Distributed
                 computing; Distributed debugging; distributed
                 debugging; distributed recovery; lower bound; optimal
                 algorithms; Optimization; Partially ordered sets;
                 Program debugging; Set theory; set theory; total order
                 poset",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Veeraraghavulu:1992:LAI,
  author =       "N. Ch. Veeraraghavulu and P. Sreenivasa Kumar and C.
                 E. Veni Madhavan",
  title =        "A linear-time algorithm for isomorphism of a subclass
                 of chordal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "45--49",
  day =          "9",
  month =        nov,
  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;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "721.1; 723.1; 921.3; 921.4; C1160 (Combinatorial
                 mathematics); 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 =     "Algorithms; Chordal graphs; computational complexity;
                 Design; graph isomorphism; Graph isomorphism problem;
                 Graph theory; graph theory; Hamiltonian 2-sep-chordal
                 graphs; Linear time isomorphism algorithm; linear-time
                 algorithm; Mathematical transformations; mops;
                 Recursive functions; Set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sharary:1992:SOP,
  author =       "Ahmad Sharary and Nejib Zaguia",
  title =        "On a setup optimization problem for interval orders",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "1",
  pages =        "51--55",
  day =          "9",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (06A07 68R10)",
  MRnumber =     "93h:68110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "King Saud Univ",
  affiliationaddress = "Riyadh, Saudi Arabia",
  classification = "721.1; 731.2; 921.4; 921.5; C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., Coll. of Sci., King Saud Univ.,
                 Riyadh, Saudi Arabia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Approximation theory; Combinatorial mathematics;
                 Combinatorial problems; computational complexity;
                 Constraint theory; graph class; Graph theory; graph
                 theory; Interval orders; interval orders; jump number
                 problem; Linear extension; Maximum clique; maximum
                 clique problem; optimisation; Optimization; Set theory;
                 setup optimization problem; Switching theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bousquet-Melou:1992:NMW,
  author =       "Mireille Bousquet-M{\'e}lou",
  title =        "The number of minimal word chains computing the
                 {Thue--Morse} word",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "57--64",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15",
  MRnumber =     "93m:68139",
  MRreviewer =   "Anton {\v{C}}ern\'y",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Bordeaux Univ., Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "alphabet; computational complexity; formal languages;
                 minimal word chains; morphism; Thue--Morse word",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gastin:1992:DSP,
  author =       "Paul Gastin and Edward Ochma{\'n}ski and Antoine Petit
                 and Brigitte Rozoy",
  title =        "Decidability of the {Star Problem} in {$A* \times
                 \{b\}*$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "65--71",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "93i:68108",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. Blaise Pascal, Paris 6 Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "decidability; formal languages; Recognizability
                 Problem; recognizable trace language; Star Problem;
                 trace monoids",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DeIaco:1992:FAP,
  author =       "Bettina {De Iaco} and Fabrizio Luccio",
  title =        "Finding all the palindromes in a binary tree in linear
                 time and space",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "73--77",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q25)",
  MRnumber =     "93m:68140",
  MRreviewer =   "Juhani Karhum{\"a}ki",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Istituto di Inf., Parma Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm design; algorithm theory; formal languages;
                 labelled binary trees; language theory; linear
                 algorithm; palindromes; palindromic subtrees; tree data
                 structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kao:1992:APD,
  author =       "Ming-Yang Kao and Fang Wan",
  title =        "Not all planar digraphs have small cycle separators",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "79--83",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20",
  MRnumber =     "93i:05070",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cycle separators; directed cycle separator; directed
                 graphs; planar digraphs; sublinear-size",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morii:1992:PSP,
  author =       "Masakatu Morii and Masao Kasahara",
  title =        "Perfect staircase profile of linear complexity for
                 finite sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "85--89",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30 (68P05 68P25 94A60)",
  MRnumber =     "93j:68081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Ehime Univ., Matsuyama, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; cryptology; linear
                 complexity; pseudo-random sequences; random number
                 generation; staircase profile; unpredictability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1992:NAP,
  author =       "Rong Jaye Chen and Yu Song Hou",
  title =        "Non-associative parallel prefix computation",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "91--94",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40 (08A02 68Q70)",
  MRnumber =     "93i:68099",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "associative binary operation; automata theory; binary
                 expression; binary operation; non-associative binary
                 operation; parallel algorithms; parallel prefix
                 computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mukhopadhyaya:1992:HGM,
  author =       "Krishnendu Mukhopadhyaya and Bhabani P. Sinha",
  title =        "Hamiltonian graphs with minimum number of edges for
                 fault-tolerant topologies",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "95--99",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C45 (68M15)",
  MRnumber =     "93k:05110",
  MRreviewer =   "Zden{\v{e}}k Ryj{\'a}{\v{c}}ek",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection)",
  corpsource =   "Indian Stat. Inst., Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "connection topology; fault tolerant computing;
                 fault-free situations; hamiltonian cycle;
                 interconnection structures; link failure;
                 multiprocessor interconnection networks; network
                 topologies; node failure; processing elements",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teo:1992:EOS,
  author =       "Kim-Heng Teo and Tai-Ching Tuan",
  title =        "An efficient one-side height minimization algorithm
                 for routing around a rectangle",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "101--105",
  day =          "19",
  month =        nov,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1130B (Computer-aided circuit analysis and design);
                 C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Kent Ridge, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circuit CAD; computational complexity; computational
                 geometry; height minimization; minimization algorithm;
                 network topology; rectangular module; two-layer
                 rectilinear wiring",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chien:1992:WCA,
  author =       "Been-Chian Chien and Wei-Pang Yang",
  title =        "The worst case analysis of algorithm on multiple
                 stacks manipulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "107--111",
  day =          "19",
  month =        nov,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; data structures; multiple
                 stacks; overflow; pushed data; reallocating memory;
                 worst case analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cadoli:1992:CMC,
  author =       "Marco Cadoli",
  title =        "The complexity of model checking for circumscriptive
                 formulae",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "113--118",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T27 (03B60 68Q25)",
  MRnumber =     "94c:68171",
  MRreviewer =   "Alexey P. Stolboushkin",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circumscriptive formulae; co-NP-complete;
                 co-NP-hardness; complexity; computational complexity;
                 logical relations; model checking; nonmonotonic
                 reasoning; polynomial; polynomials; propositional
                 circumscriptive formulae; tractability threshold",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bovet:1992:RLB,
  author =       "Daniel P. Bovet and Stefano Varricchio",
  title =        "On the regularity of languages on a binary alphabet
                 generated by copying systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "119--123",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "93j:68097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Rome Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary alphabet; copying systems; derivation relation;
                 formal languages; regularity of languages; semi-Thue
                 system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Makinen:1992:RSG,
  author =       "Erkki M{\"a}kinen",
  title =        "Remarks on the structural grammatical inference
                 problem for context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "125--127",
  day =          "30",
  month =        nov,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "context-free grammars; inference mechanisms; left
                 Szilard languages; positive structural data; production
                 labels; structural grammatical inference problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lobo:1992:RMM,
  author =       "Jorge Lobo and V. S. Subrahmanian",
  title =        "Relating minimal models and pre-requisite-free normal
                 defaults",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "129--133",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B70 (68N17 68T27)",
  MRnumber =     "93m:03051",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C6110L (Logic
                 programming)",
  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/",
  keywords =     "default logic schema; default logic theory;
                 disjunctive logic program; logic programming; minimal
                 Herbrand models; nonmonotonic reasoning; one-one
                 correspondence; pre-requisite-free normal defaults",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lu:1992:CGR,
  author =       "James J. Lu and Lawrence J. Henschen",
  title =        "The completeness of gp-resolution for annotated
                 logics",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "135--140",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B35 (03B50 68T15)",
  MRnumber =     "94e:03009",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Dept. of Comput. Sci., Bucknell Univ., Lewisburg, PA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "annotated logics; completeness; gp-resolution;
                 inference mechanisms; inference rule; merging
                 operation; p-resolution; reasoning; resolution style
                 proof procedure; semantics; syntax; theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Han:1992:MCT,
  author =       "Y. Han and B. Narahari and H.-A. Choi",
  title =        "Mapping a chain task to chained processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "141--148",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68M10 68Q25)",
  MRnumber =     "93j:68022",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel 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/",
  keywords =     "chain task; chained processors; computational
                 complexity; mapping; parallel algorithms; ring task;
                 scheduling; time complexity",
  treatment =    "P Practical",
}

@Article{Pan:1992:PDR,
  author =       "Victor Pan and Akimou Sadikou and Elliott Landowne",
  title =        "Polynomial division with a remainder by means of
                 evaluation and interpolation",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "149--153",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22",
  MRnumber =     "93m:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 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/",
  keywords =     "approximation error analysis; evaluation;
                 interpolation; parallel algorithms; parallel complexity
                 estimate; polynomial division; polynomials; remainder",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ghosh:1992:OPA,
  author =       "Subir Kumar Ghosh and Anil Maheshwari",
  title =        "An optimal parallel algorithm for computing furthest
                 neighbors in a tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "155--160",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "93j:68156",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Tata Inst. of Fundamental Res., Bombay, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computing furthest
                 neighbors; optimal parallel algorithm; parallel
                 algorithms; parallel RAM; tree; tree data structures;
                 vertex",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Woeginger:1992:CFA,
  author =       "Gerhard J. Woeginger",
  title =        "The complexity of finding arborescences in
                 hypergraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "161--164",
  day =          "30",
  month =        nov,
  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 =    "https://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 Grundlagen der Informationsverarbeitung,
                 Tech. Univ., Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arborescences; ASP; complexity; computational
                 complexity; graph theory; Greedy algorithm;
                 hypergraphs; learnability theory; matroid; NP-complete;
                 weight function",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bainbridge:1992:HMG,
  author =       "John Bainbridge",
  title =        "A heuristic method for generating large random
                 expressions",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "165--170",
  day =          "30",
  month =        nov,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Sch. of Comput., Inf. Syst. and Math., South Bank
                 Univ., London, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary operators; combinatorial mathematics;
                 generating large random expressions; graphical
                 representation; heuristic method; operands;
                 probability; syntax trees; trees (mathematics); unary",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pachl:1992:CSP,
  author =       "J. Pachl",
  title =        "Corrigendum: {``{A} simple proof of a completeness
                 result for {\em leads-to\/} in the {UNITY} logic''}
                 {[Inform. Process. Lett. {\bf 41}(1), 21 January 1992,
                 pp. 35--38]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "3",
  pages =        "171--171",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Jan 3 14:24:13 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Pachl:1992:SPC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dalal:1992:HTS,
  author =       "Mukesh Dalal and David W. Etherington",
  title =        "A hierarchy of tractable satisfiability problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "173--180",
  day =          "10",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D15 (03B05 03B35 68T25 68T27)",
  MRnumber =     "93m:03069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
                 NI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computability; computational complexity; conjunctive
                 normal form; Horn clause; Horn clauses; NP-complete
                 problem; propositional satisfiability; SAT; theorem
                 proving; time complexity; tractable satisfiability
                 problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1992:PNP,
  author =       "Louxin Zhang",
  title =        "The {pre-NTS} property is undecidable for context-free
                 grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "181--184",
  day =          "10",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q50 (68Q52)",
  MRnumber =     "94a:68081",
  MRreviewer =   "Michael Bauer",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "context-free grammars; context-free languages;
                 decidability; decidable equivalence problem; pre-NTS
                 property; string rewriting systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1992:PIC,
  author =       "Ke Wang and Li Yan Yuan",
  title =        "Preservation of integrity constraints in definite
                 {DATALOG} programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "185--193",
  day =          "10",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68N05)",
  MRnumber =     "93j:68051",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160K (Deductive
                 databases)",
  corpsource =   "Dept. of Inf. Syst. and Comp. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "data integrity; database; database theory; deductive
                 databases; definite DATALOG programs;
                 dependency-preserving database schemes; downward-closed
                 integrity constraints; efficient test algorithm;
                 integrity constraints; preservation; query processing;
                 single-rule programs; uniform implication problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jiang:1992:NSS,
  author =       "Tao Jiang and Ming Li and Ding Zhu Du",
  title =        "A note on shortest superstrings with flipping",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "195--199",
  day =          "10",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U15 (68R15 92D20)",
  MRnumber =     "93j:68225",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., McMaster Univ., Hamilton, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; approximation bound; DNA sequencing;
                 flipping; greedy algorithm; search problems; shortest
                 superstrings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1992:FTR,
  author =       "Hsun-Wen Chang and Kuo-Liang Chung",
  title =        "Fault-tolerant routing in unique-path multistage
                 {Omega} network",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "201--204",
  day =          "10",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "connecting links; fault tolerant computing;
                 fault-tolerant routing; multiprocessor interconnection
                 networks; one-pass packet-routing schemes; packet
                 switching; switching boxes; undirected network;
                 unique-path multistage Omega network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1992:CCF,
  author =       "Sanjay Gupta",
  title =        "On the closure of certain function classes under
                 integer division by polynomially-bounded functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "205--210",
  day =          "10",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "94h:68070",
  MRreviewer =   "William R. Nico",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240 (Programming and
                 algorithm 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/",
  keywords =     "addition; complexity theory; computational complexity;
                 function classes; integer division; intersection;
                 language classes; multiplication; polynomial-time
                 bounded nondeterministic Turing machines;
                 polynomially-bounded functions; Turing machines;
                 union",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tamura:1992:DCT,
  author =       "Akihisa Tamura and Yoshiko Tamura",
  title =        "Degree constrained tree embedding into points in the
                 plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "211--214",
  day =          "10",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C10 68R10)",
  MRnumber =     "93j:05151",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; degree constrained tree embedding;
                 line segments; polynomial algorithms; positive integral
                 n-vector; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lins:1992:CRC,
  author =       "Rafael D. Lins",
  title =        "Cyclic reference counting with lazy mark-scan",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "215--220",
  day =          "10",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors); C6150J (Operating systems)",
  corpsource =   "Dept. de Inf., Univ. Federal de Pernambuco, Recife,
                 Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "compilers; cyclic reference counting; functional
                 programming; garbage collection; lazy mark-scan; memory
                 management; performance figures; program compilers;
                 programming languages; shared cells; shared-memory
                 architectures; storage management",
  treatment =    "P Practical",
}

@Article{Martello:1992:NGA,
  author =       "Silvano Martello and Paolo Toth",
  title =        "A note on $0.5$-bounded greedy algorithms for the
                 $0/1$ knapsack problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "221--222",
  day =          "10",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Sarkar:1992:SGA}.",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Torino Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "0.5-bounded greedy algorithms; 0/1 knapsack problem;
                 algorithm theory; computational complexity; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shvartsman:1992:EWA,
  author =       "Alex A. Shvartsman",
  title =        "An efficient {Write-All} algorithm for fail-stop
                 {PRAM} without initialized memory",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "4",
  pages =        "223--231",
  day =          "10",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comp. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "auxiliary memory initialization; CRCW PRAM;
                 deterministic bootstrapping; fail-stop PRAM; fault
                 tolerant computing; fault-tolerant parallel algorithms;
                 initialized memory; parallel algorithms;
                 polylogarithmic parallel time algorithms; restartable
                 fail-stop processor simulations; write-all algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Amir:1992:TDD,
  author =       "Amihood Amir and Martin Farach",
  title =        "Two-dimensional dictionary matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "233--239",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U15",
  MRnumber =     "93k:68111",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6130D
                 (Document processing techniques)",
  corpsource =   "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
                 GA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; dictionary matching
                 algorithms; dictionary patterns; pattern matching
                 algorithms; pattern string; preprocessing; text
                 processing; two-dimensional dictionary problem;
                 two-dimensional patterns; word processing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wu:1992:THP,
  author =       "Jer Shyan Wu and Rong Jaye Chen",
  title =        "The {Towers} of {Hanoi} problem with parallel moves",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "241--243",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22",
  MRnumber =     "93k:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1290 (Applications
                 of systems theory); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circular move; consecutive move; exchange; operations
                 research; optimal algorithm; optimisation; parallel
                 algorithms; parallel moves; peg; single move; top disk;
                 towers of Hanoi problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1992:AAG,
  author =       "Jyh-Han Lin and Jeffrey Scott Vitter",
  title =        "Approximation algorithms for geometric median
                 problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "245--249",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10 68U05)",
  MRnumber =     "93m:05187",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4130
                 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Paging and Telepoint Syst. Lab., Motorola Inc.,
                 Boynton Beach, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; approximation algorithms;
                 approximation theory; computational geometry;
                 fixed-dimensional Euclidean spaces; geometric median
                 problems; integral solution; linear program relaxation;
                 linear programming; metric spaces",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bar-Noy:1992:GAO,
  author =       "Amotz Bar-Noy and Rajeev Motwani and Joseph Naor",
  title =        "The greedy algorithm is optimal for on-line edge
                 coloring",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "251--253",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C15 68Q10)",
  MRnumber =     "94f:68145",
  MRreviewer =   "T. R. S. Walsh",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; graph colouring; greedy
                 coloring algorithm; online algorithm; online edge
                 coloring; vertex coloring",
  treatment =    "T Theoretical or Mathematical",
}

@Article{dAmore:1992:OBP,
  author =       "Fabrizio d'Amore and Paolo Giulio Franciosa",
  title =        "On the optimal binary plane partition for sets of
                 isothetic rectangles",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "255--259",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "93k:68098",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Roma Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary plane partition; binary space partition
                 algorithm; computational complexity; computational
                 geometry; disjoint isothetic rectangles; isothetic
                 cutting lines; isothetic line segments; worst case
                 time; worst-case space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Overmars:1992:PLF,
  author =       "Mark H. Overmars",
  title =        "Point location in fat subdivisions",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "261--265",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "93k:68106",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Utretcht Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cell complexity; computational complexity;
                 computational geometry; data structure; fat
                 subdivisions; linear storage; point location queries;
                 query time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rossmanith:1992:OTP,
  author =       "Peter Rossmanith and Wojciech Rytter",
  title =        "Observations on $\log(n)$ time parallel recognition of
                 unambiguous {CFL}'s",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "267--272",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q22)",
  MRnumber =     "94a:68074",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel 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 =     "computational complexity; context-free languages; CREW
                 PRAMs; parallel algorithms; parallel computations;
                 parallel recognition; unambiguous context-free
                 languages; unambiguous decomposition; unique paths;
                 write conflicts",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1992:DPE,
  author =       "Gopal Gupta",
  title =        "Dynamic parallel evaluation of the cross-product set
                 using time-stamps",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "273--280",
  day =          "21",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 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/",
  keywords =     "Cartesian product; cross-product set; database joins;
                 dynamic generation; dynamic parallel evaluation;
                 nested-loop algorithms; parallel algorithms; Sequent
                 Symmetry multiprocessor; set theory; shared memory
                 machines; time-stamps",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Greenberg:1992:DMC,
  author =       "Ronald Greenberg and Joseph J{\'a}J{\'a} and Sridhar
                 Krishnamurthy",
  title =        "On the difficulty of {Manhattan} channel routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "281--284",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35 (68Q25)",
  MRnumber =     "93k:68049",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1130B (Computer-aided circuit analysis and design);
                 B2570 (Semiconductor integrated circuits); C4240
                 (Programming and algorithm theory); C7410D (Electronic
                 engineering)",
  corpsource =   "Maryland Univ., College Park, MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circuit layout CAD; computational complexity; dogleg-
                 free routing; existential lower bound; Manhattan
                 channel routing; network routing; NP-complete;
                 single-sided nets; tracks; VLSI",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dekel:1992:OAF,
  author =       "Eliezer Dekel and Jie Hu and Wen Ouyang",
  title =        "An optimal algorithm for finding compact sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "5",
  pages =        "285--289",
  day =          "21",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "93h:05151",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. Texas Univ., Dallas, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "adjacency matrix; compact sets; computational
                 complexity; graph theory; input graph; optimal
                 algorithm; set theory; weighted undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Engelfriet:1992:EPD,
  author =       "Joost Engelfriet",
  title =        "An elementary proof of {Double Greibach Normal Form}",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "291--293",
  day =          "28",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Leiden Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "context-free grammars; Double Greibach Normal Form;
                 elementary correctness proof; formal languages;
                 Greibach Normal Form",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Feige:1992:CFR,
  author =       "Uriel Feige",
  title =        "On the complexity of finite random functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "295--296",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30",
  MRnumber =     "93j:68079",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math., Weizmann Inst., Rehovot,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; finite random
                 functions; lower bound; noisy Boolean decision trees;
                 random functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vishwanathan:1992:AAA,
  author =       "Sundar Vishwanathan",
  title =        "An approximation algorithm for the asymmetric
                 travelling salesman problem with distances one and
                 two",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "297--302",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10 90B10)",
  MRnumber =     "93h:68063",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. Chicago, Univ., IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; approximation algorithm; asymmetric
                 travelling salesman problem; graph theory;
                 optimisation; performance ratio",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fortnow:1992:PTL,
  author =       "Lance Fortnow and M{\'a}ri{\'o} Szegedy",
  title =        "On the power of two-local random reductions",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "303--306",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15 68Q45)",
  MRnumber =     "93k:68032",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://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., Chicago Univ., IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; formal
                 languages; language; random reductions; target
                 functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cohen:1992:RDO,
  author =       "D. A. Cohen and E. A. Scott",
  title =        "Rationality of division orderings",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "307--311",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15",
  MRnumber =     "93k:68082",
  MRreviewer =   "Ursula Martin",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., R. Holloway and Bedford New
                 Coll. Egham, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "automatic theorem proving; division orderings;
                 ordering; program correctness; rewriting systems;
                 termination; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pascoletti:1992:OAP,
  author =       "Adriano Pascoletti",
  title =        "An optimal algorithm for the period of a strongly
                 connected digraph",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "313--316",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C20)",
  MRnumber =     "94a:05194",
  MRreviewer =   "Fabrizio Luccio",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Matematica e Inf. Udine Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; breadth-first search; digraph;
                 directed graphs; optimal algorithm; search problems;
                 single-source shortest paths problem;
                 strongly-connected digraphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Acharya:1992:RDS,
  author =       "Arup Acharya and B. R. Badrinath",
  title =        "Recording distributed snapshots based on causal order
                 of message delivery",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "317--321",
  day =          "28",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci. Rutgers Univ., New Brunswick,
                 NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "causal order; distributed processing; distributed
                 snapshots; global snapshot; message delivery",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Simonson:1992:CTE,
  author =       "Shai Simonson and I. Hal Sudborough",
  title =        "On the complexity of tree embedding problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "323--328",
  day =          "28",
  month =        dec,
  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 =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Maths. and Comput. Sci., Stonehill Coll.
                 North Easton, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Alternating TM; complexity; computational complexity;
                 O(log n) space; polynomial time algorithms; tree data
                 structures; tree embedding",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leung:1992:NFA,
  author =       "Hing Leung",
  title =        "A note on finitely ambiguous distance automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "329--331",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q70",
  MRnumber =     "94a:68091",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Fachbereich Inf. Johann Wolfgang Goethe-Univ.,
                 Frankfurt am Main, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "ambiguity; distance automata; finite automata;
                 finitely ambiguous; finitely ambiguous distance
                 automata",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luo:1992:FET,
  author =       "Gang Luo and Gregor v. Bochmann and Anindya Das and
                 Cheng Wu",
  title =        "Failure-equivalent transformation of transition
                 systems to avoid internal actions",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "333--343",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68Q90)",
  MRnumber =     "93h:68088",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  annote =       "Second author is `v. Bochmann', NOT `V. Bochmann'.",
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. d'Inf. et de Recherche Oper. Montreal Univ.,
                 Que., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "concurrency control; deadlock properties;
                 failure-equivalent; labelled transition systems;
                 specification languages; testing; transition systems;
                 verification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Breslauer:1992:LSS,
  author =       "Dany Breslauer",
  title =        "An on-line string superprimitivity test",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "6",
  pages =        "345--347",
  day =          "28",
  month =        dec,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q25 68U15)",
  MRnumber =     "93j:68160",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "algorithm theory; computational complexity;
                 linear-time algorithm; string superprimitivity test;
                 superprimitive",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Palsberg:1993:NFP,
  author =       "Jens Palsberg",
  title =        "Normal forms have partial types",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "1--3",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (68N05)",
  MRnumber =     "1 207 008",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aarhus Univ",
  affiliationaddress = "Aarhus, Den",
  classification = "721.1; C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110 (Systems analysis and
                 programming)",
  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 =     "Computation theory; cubic time; Functional
                 programming; functional programming; intersection
                 types; Lambda calculus; lambda calculus; lambda-terms;
                 normal form; Normal forms; Partial types; partial
                 types; Programming theory; programming theory; pure
                 lambda-calculus; type inference; type theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dillenburg:1993:IED,
  author =       "John F. Dillenburg and Peter C. Nelson",
  title =        "Improving the efficiency of depth-first search by
                 cycle elimination",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "5--10",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois",
  affiliationaddress = "Chicago, IL, USA",
  classification = "723.1; 921.4; C1160 (Combinatorial mathematics);
                 C1230 (Artificial intelligence); C4240 (Programming and
                 algorithm theory)",
  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 =     "algorithm theory; Algorithms; Cycle elimination; cycle
                 elimination; Depth first search; depth-first search;
                 full cycle checking; Graph theory; graph theory;
                 graphs; grid search; heuristic depth-first iterative
                 deepening algorithm; Heuristic methods; IDA/sup */
                 search; Iterative methods; parent cycle checking; route
                 planning; Search methods; search path; search
                 problems",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Fischetti:1993:IPO,
  author =       "Vincent A. Fischetti and Gad M. Landau and Peter H.
                 Sellers and Jeanette P. Schmidt",
  title =        "Identifying periodic occurrences of a template with
                 applications to protein structure",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "11--18",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U15 (92D20)",
  MRnumber =     "94b:68126a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Fischetti:1993:CIP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Rockefeller Univ",
  affiliationaddress = "New York City, NY, USA",
  classification = "461.2; 723.1; A3620 (Macromolecules and polymer
                 molecules); A8715 (Molecular biophysics); C4240
                 (Programming and algorithm theory); C7330 (Biology and
                 medicine)",
  corpsource =   "Rockefeller Univ., New York, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; biology computing; computational
                 complexity; molecular biophysics; Periodic occurrences;
                 periodic occurrences; protein structure; Proteins;
                 proteins; String matching; template character;
                 Templates; text substring",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Halldorsson:1993:SBP,
  author =       "Magn{\'u}s M. Halld{\'o}rsson",
  title =        "A still better performance guarantee for approximate
                 graph coloring",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "19--23",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C15 68Q25 68R10)",
  MRnumber =     "93j:05146",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Japan Advanced Inst of Science and Technology",
  affiliationaddress = "Ishikawa, Jpn",
  classification = "723.1; 921.4; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Sch. of Inf. Sci., Japan Adv. Inst. of Sci. and
                 Technol., Ishikawa, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximate coloring algorithm;
                 approximate graph coloring; Approximation algorithms;
                 color classes; computational complexity; Graph
                 coloring; graph colouring; Graph theory; independent
                 set problem; NP-hard; performance guarantee; polynomial
                 time algorithms; undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1993:MVE,
  author =       "Kao Ch{\^e}ng Lin and Maw Sheng Chern",
  title =        "The most vital edges in the minimum spanning tree
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "25--31",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25 90B25)",
  MRnumber =     "93m:68136",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Taiwan, China",
  classification = "721.1; 723.1; 921.4; C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Ind. Eng., 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; available budget; branch and bound
                 algorithm; Branch and bound algorithms; Computation
                 theory; computational complexity; connected network;
                 edge removal; edge set; minimisation; minimum spanning
                 tree; Minimum spanning tree problem; most vital edges;
                 node set; NP hard problems; NP-hard; removal cost;
                 trees (mathematics); Trees (mathematics); undirected
                 network; weighted network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1993:MPM,
  author =       "Jeong Uk Kim and Ho Chang and Tag Gon Kim",
  title =        "Multidisk partial match file design with known access
                 pattern",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "33--39",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, SOUTH KOREA",
  classification = "721.1; 722.1; C4240 (Programming and algorithm
                 theory); C4250 (Database theory); C6160 (Database
                 management systems (DBMS))",
  corpsource =   "Dept. of Electr. Eng., 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 =     "access patterns; access time; binary Cartesian product
                 files; computational complexity; database management
                 systems; database theory; disk access concurrency; File
                 allocation; File organization; Magnetic disk storage;
                 Multidisk partial match file design; multidisk partial
                 match files; NP hard problems; Storage allocation
                 (computer)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schoenmakers:1993:SAS,
  author =       "Berry Schoenmakers",
  title =        "A systematic analysis of splaying",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "41--50",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q25)",
  MRnumber =     "94a:68023",
  MRreviewer =   "Leh-Sheng Tang",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "721.1; 921.4; C4240 (Programming and algorithm
                 theory); C6110 (Systems analysis and programming);
                 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 =     "amortized analysis; amortized cost; Computational
                 complexity; Data structures; data structures;
                 functional program; Functional programming; functional
                 programming; minimal bound; Pairing heaps; pairing
                 heaps; Path reversal; path reversal; potential
                 function; Potential functions; Programming theory;
                 programming theory; Splay trees; splay trees; splaying;
                 sum of logs potentials; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baeza-Yates:1993:FTP,
  author =       "Ricardo Baeza-Yates and Mireille Regnier",
  title =        "Fast two-dimensional pattern matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "1",
  pages =        "51--57",
  day =          "25",
  month =        jan,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad de Chile",
  affiliationaddress = "Santiago, Chile",
  classification = "723.1; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. de Ciencias de la Comput., Chile Univ.,
                 Santiago, Chile",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; alphabet-independent algorithm;
                 computational complexity; multiple string matching;
                 Pattern matching; Pattern recognition; search problems;
                 searching algorithm; String matching; text rows; two
                 dimensional text; two-dimensional pattern matching;
                 worst case",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Foster:1993:GOH,
  author =       "James A. Foster",
  title =        "The generic oracle hypothesis is false",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "59--62",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D15 (03D55 68Q15)",
  MRnumber =     "94c:03053",
  MRreviewer =   "Bruno Poizat",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Idaho",
  affiliationaddress = "Moscow, ID, USA",
  classification = "721.1; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "1-generic oracle; 1-generic sets; Algorithms;
                 Complexity classes; Computational complexity;
                 computational complexity; Generic oracle hypothesis;
                 generic oracle hypothesis; Generic sets; Set theory;
                 set theory; unrelativized Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cross:1993:RNC,
  author =       "David Cross and Reinhard Drefenstedt and Jorg Keller",
  title =        "Reduction of network cost and wiring in {Ranade}'s
                 butterfly routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "63--67",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "722.4; 723.1; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electr. Eng. and 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; Butterfly networks; butterfly networks;
                 Computer architecture; Interconnection networks;
                 multiprocessor interconnection networks; network chips;
                 network cost; network nodes; network wiring; Packet
                 switching; parallel algorithms; Parallel processing
                 systems; Ranade butterfly routing algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chin:1993:PBP,
  author =       "Andrew Chin",
  title =        "Permutations on the {Block PRAM}",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "69--73",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M07)",
  MRnumber =     "1 209 740",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Texas A\&M Univ",
  affiliationaddress = "College Station, TX, USA",
  classification = "722.4; 921.4; C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Math., 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 =     "block PRAM; Combinational mathematics; Computational
                 complexity; computational complexity; data items
                 permutations complexity; parallel algorithms; parallel
                 computers; parallel machines; Parallel processing
                 systems; Parallel random access machines; pram; Random
                 access storage; shared memory; Shared memory computers;
                 shared memory systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jifeng:1993:AOS,
  author =       "He Jifeng and C. A. R. Hoare",
  title =        "From algebra to operational semantics",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "75--80",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68N05 68N15 68Q55)",
  MRnumber =     "94i:68182",
  MRreviewer =   "E. Ray Lucas",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "721.1; 723.1.1; 921.1; C4210 (Formal logic)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; algebraic reasoning; Algebraic semantics;
                 communicating sequential processes; Computer
                 programming languages; CSP; Dijkstra Language;
                 Dijkstra's language; formal languages; formal
                 semantics; inequation; Occam; operational semantics;
                 Operational semantics; programming language;
                 Programming language theory; transition relation;
                 transputer language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pilarski:1993:SBC,
  author =       "S{\l}awomir Pilarski and Tiko Kameda",
  title =        "Simple bounds on the convergence rate of an ergodic
                 {Markov} chain",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "81--87",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "60J10 (68Q25)",
  MRnumber =     "93k:60169",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Simon Fraser Univ",
  affiliationaddress = "Burnaby, BC, Can",
  classification = "721.1; 922.1; C1140Z (Other and miscellaneous);
                 C4140 (Linear algebra); 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 =     "Computational complexity; computational complexity;
                 convergence of numerical methods; Convergence rate;
                 convergence rate; doubly stochastic matrix; ergodic
                 Markov chain; Ergodic Markov chains; linear complexity;
                 Markov chains; Markov processes; matrix algebra; matrix
                 multiplications; polynomial complexity; Probability;
                 simple bounds; transition probability matrix",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Drewes:1993:NCC,
  author =       "Frank Drewes",
  title =        "{NP}-completeness of $k$-connected
                 hyperedge-replacement languages of order $k$",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "89--94",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q50 (68R10)",
  MRnumber =     "93k:68058",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Bremen",
  affiliationaddress = "Bremen, Ger",
  classification = "721.1; 921.4; C1160 (Combinatorial mathematics);
                 C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Bremen Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computability; Computational complexity; computational
                 complexity; Computational grammars; cubic time
                 solvability; Formal languages; formal languages;
                 grammars; Graph theory; graph theory; Hyperedge
                 replacement languages; hyperedge-replacement grammars;
                 hyperedge-replacement languages; hyperedges;
                 Hypergraphs; hypergraphs; k-connected graphs; NP
                 completeness; NP-complete sets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bern:1993:ACP,
  author =       "Marshall Bern",
  title =        "Approximate closest-point queries in high dimensions",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "95--99",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68P05 68P20)",
  MRnumber =     "93m:68162",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Xerox Corp",
  affiliationaddress = "Palo Alto, CA, USA",
  classification = "721.1; 921.4; C4240 (Programming and algorithm
                 theory); C4260 (Computational geometry); C6120 (File
                 organisation)",
  corpsource =   "Palo Alto Res. Center, Xerox Corp., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "approximate closest point queries; Closest point
                 queries; computational complexity; computational
                 geometry; data structure; Data structures; quadtrees;
                 Quadtrees; query point; tree data structures; Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fischer:1993:SAC,
  author =       "Michael J. Fischer and Shlomo Moran and Gadi
                 Taubenfeld",
  title =        "Space-efficient asynchronous consensus without shared
                 memory initialization",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "101--105",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Yale Univ",
  affiliationaddress = "New Haven, CT, USA",
  classification = "722.4; C4240P (Parallel programming and algorithm
                 theory); C6150N (Distributed systems)",
  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 consensus; asynchronous consensus;
                 consensus protocol; Data storage equipment; distributed
                 algorithms; fault tolerant computing; Parallel
                 processing systems; protocols; Shared memory computers;
                 shared memory model; shared memory systems; shared
                 register",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kimbrel:1993:PAV,
  author =       "Tracy Kimbrel and Rakesh Kumar Sinha",
  title =        "A probabilistic algorithm for verifying matrix
                 products using {$O(n^2)$} time and {$\log_2 n + O(1)$}
                 random bits",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "107--110",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "15-04 (65-04 65F99 68Q25)",
  MRnumber =     "1 209 745",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington",
  affiliationaddress = "Seattle, WA, USA",
  classification = "723.1; 921.1; 922.1; C4140 (Linear algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comp. 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; bit complexity; computational complexity;
                 error probability; integer matrices; Matrix algebra;
                 matrix algebra; matrix products verification;
                 Probabilistic algorithm; probabilistic algorithm;
                 Probability; program verification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jiang:1993:COR,
  author =       "Bin Jiang",
  title =        "{I/O}- and {CPU}-optimal recognition of strongly
                 connected components",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "111--115",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dep of Computer Science",
  affiliationaddress = "Zurich, Switz",
  classification = "721.1; 723.2; 921.4; 921.5; C4240 (Programming and
                 algorithm theory)",
  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 =     "algorithm design; algorithm theory; Algorithms;
                 Computational complexity; CPU-optimal algorithm;
                 depth-first search; Graph theory; graph theory; Graph
                 traversal strategies; graph traverser; I/O complexity;
                 I/O optimal algorithm; Optimization; Pattern
                 recognition; strongly connected components; Strongly
                 connected components recognition",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ranjan:1993:TAM,
  author =       "Desh Ranjan and Daniela Rus",
  title =        "A tool for the analysis of manipulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "117--121",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "93j:68215",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "723.2; 731.5; 921; C3390 (Robotics); C4260
                 (Computational geometry)",
  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; Computational geometry; computational
                 geometry; Dexterous manipulation protocols; finger
                 tracking; Finger tracking paradigm; geometrical tool;
                 Geometry; Grippers; Manipulators; manipulators; planar
                 dexterous manipulation; Reorientation algorithm;
                 Robotics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Day:1993:USG,
  author =       "Khaled Day and Anand Tripathi",
  title =        "Unidirectional star graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "123--129",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C85 68R10)",
  MRnumber =     "94a:68003",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Bahrain",
  affiliationaddress = "Isa Town, Bahrain",
  classification = "722.4; 723.2; 921.4; C1160 (Combinatorial
                 mathematics); C4230M (Multiprocessor interconnection);
                 C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Bahrain Univ., Isa Town,
                 Bahrain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial mathematics; Computer networks; Directed
                 graphs; Distributed computer systems; Distributed
                 computing; distributed processing; Distributed routing;
                 distributed routing; Graph theory; graph theory;
                 Interconnection networks; interconnection networks;
                 multiprocessor interconnection networks; n-star graph;
                 polarity functions; unidirectional star graph;
                 Unidirectional star graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1993:CCS,
  author =       "Cheng Chia Chen and I P'{\^e}ng Lin",
  title =        "The computational complexity of satisfiability of
                 temporal {Horn} formulas in propositional linear-time
                 temporal logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "131--136",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B45 (03D15)",
  MRnumber =     "94k:03018",
  MRreviewer =   "Alessandro Berarducci",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "721.1; 723.1; 723.1.1; C4210 (Formal logic); 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 =     "complexity results; computational complexity;
                 Computational complexity; linear-time; Linear-time
                 temporal logic; Logic programming; Prolog (programming
                 language); satisfiability; Satisfiability; Temporal
                 Horn formula; temporal Horn fragments; temporal logic;
                 Temporal logic programming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Merritt:1993:SLF,
  author =       "Michael Merritt and Gadi Taubenfeld",
  title =        "Speeding {Lamport}'s fast mutual exclusion algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "137--142",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "721.1; 723.2; 921.5; C4240P (Parallel programming
                 and algorithm theory)",
  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 =     "Algorithms; Computational complexity; computational
                 complexity; Computer systems programming; Concurrency;
                 concurrency; Contention sensitive mutual exclusion;
                 data structures; Fast mutual exclusion algorithm;
                 linked list; mutual exclusion; Optimization;
                 optimization; parallel algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liskiewicz:1993:RBD,
  author =       "Maciej Li{\'s}kiewicz",
  title =        "On the relationship between deterministic time and
                 deterministic reversal",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "143--146",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "93m:68053",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Uniwersytet Wroclawski",
  affiliationaddress = "Wroclaw, Pol",
  classification = "721.1; 723; C4220 (Automata theory)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., TH Darmstadt, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; computational complexity;
                 deterministic automata; Deterministic reversal;
                 Deterministic time; deterministic Turing machines;
                 reversal complexity; Time complexity; time complexity;
                 Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Amato:1993:IPB,
  author =       "Nancy Amato",
  title =        "Improved processor bounds for parallel algorithms for
                 weighted directed graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "147--152",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q10)",
  MRnumber =     "1 208 611",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://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.4; 723.2; 921.1; 921.4; C1160 (Combinatorial
                 mathematics); C4240P (Parallel 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 =     "Algorithms; computational complexity; digraph
                 problems; directed graphs; EREW PRAM; exclusive-read
                 exclusive-write; Graph theory; Matrix algebra; Matrix
                 multiplication; parallel algorithm; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems; Parallel random access machine; parallel
                 random access machine; processor bounds; single-source
                 shortest path problem; Single-source shortest paths;
                 time complexity; Weighted directed graph; weighted
                 directed graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsu:1993:OBS,
  author =       "Suchen H. Hsu and Richard Snodgrass",
  title =        "Optimal block size for set-valued attributes",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "153--158",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Arizona",
  affiliationaddress = "Tucson, AZ, USA",
  classification = "722.4; 921.5; C4250 (Database theory); C6160D
                 (Relational DBMS)",
  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 =     "block size; database theory; Non-first normal form
                 database; Optimal block size; optimal block size;
                 Optimization; Relational database systems; relational
                 databases; set-valued attributes; space utilization;
                 Temporal database; temporal databases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Suraweera:1993:PAM,
  author =       "Francis Suraweera and Prabir Bhattacharya",
  title =        "An {$O(\log m)$} parallel algorithm for the minimum
                 spanning tree problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "3",
  pages =        "159--163",
  day =          "8",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q20 68Q25 68R10)",
  MRnumber =     "1 208 612",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nebraska",
  affiliationaddress = "Lincoln, NE, USA",
  classification = "722.4; 723.1; 723.2; C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational complexity; computational
                 complexity; Graph theory; Minimum spanning tree;
                 minimum spanning tree; Non-numerical algorithms;
                 parallel algorithm; Parallel algorithms; parallel
                 algorithms; Parallel processing systems; SIMD machine;
                 Sorting; space complexity; time complexity; tree data
                 structures; Trees (mathematics); undirected graph;
                 Undirected graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Raczunas:1993:RES,
  author =       "Marek Raczunas",
  title =        "Remarks on the equivalence of $c$-$e$ structures and
                 {Petri} nets",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "165--169",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q90)",
  MRnumber =     "94d:68035",
  MRreviewer =   "Jetty Kleijn",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. of Math., Gdansk Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bijections; cause-effect structures; concurrent
                 systems; equivalence of c-e structures; Petri nets;
                 postsets",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ihler:1993:MHG,
  author =       "Edmund Ihler and Dorothea Wagner and Frank Wagner",
  title =        "Modeling hypergraphs by graphs with the same mincut
                 properties",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "171--175",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C65 (68Q35)",
  MRnumber =     "93k:05122",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B1130 (General
                 analysis and synthesis methods); B2570 (Semiconductor
                 integrated circuits)",
  corpsource =   "Theor. Informatik, Eidgenossische Tech. Hochschule
                 Zurich, Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bipartition; circuit layout; dummy vertices;
                 edge-weighted graph; graph partitioning algorithms;
                 graph theory; hypergraphs; mincut properties; VLSI;
                 VLSI layout",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1993:CMS,
  author =       "Feng Hsu Wang and Ferng-Ching Lin",
  title =        "On constructing multiple spanning trees in a
                 hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "177--183",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C05 68R10)",
  MRnumber =     "93k:68011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture); 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/",
  keywords =     "binary tree algorithms; constructing multiple spanning
                 trees; edge-disjointness; embedding method; fault
                 tolerance; fault tolerant computing; hypercube;
                 hypercube networks; inorder spanning trees; load
                 congestion; routing strategy; tree data structures",
  treatment =    "P Practical",
}

@Article{Liang:1993:FMM,
  author =       "Y. Daniel Liang and Chongkye Rhee",
  title =        "Finding a maximum matching in a circular-arc graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "185--190",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C70 (05C85 68Q25 68R10)",
  MRnumber =     "93k:05132",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Indiana Purdue Univ., Fort
                 Wayne, IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circular-arc graph; graph theory; maximum matching;
                 O(n \log n) algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Analyti:1993:PAM,
  author =       "Anastasia Analyti and Sakti Pramanik",
  title =        "Performance Analysis of a Main Memory Multi-directory
                 Hashing Technique",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "191--197",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20",
  MRnumber =     "93k:68026",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib;
                 UnCover library database",
  note =         "See also comment \cite{Prodinger:1994:ACP}.",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6120 (File
                 organisation); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "database management systems; databases; directory
                 utilization; extendible root multi-directory hashing;
                 file organisation; main memory multi-directory hashing;
                 optimal search; performance analysis; search problems",
  treatment =    "P Practical",
}

@Article{Shen:1993:SGS,
  author =       "Xiaojun Shen and Qing Hu and Bin Cong and Hal
                 Sudborough and Mike Girou and Said Bettayeb",
  title =        "The $4$-star graph is not a subgraph of any
                 hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "199--203",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C10 (68Q10 68R10)",
  MRnumber =     "93k:05054",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Missouri Univ., Kansas City, MO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "4-star graph; algebraic structure; Cayley graphs;
                 graph theory; hypercube; hypercube networks; star
                 interconnection networks",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chor:1993:CPT,
  author =       "Benny Chor and Eyal Kushilevitz",
  title =        "A communication-privacy tradeoff for modular
                 addition",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "205--210",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M10 94A60)",
  MRnumber =     "93m:68070",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6150M (Protocols); C4240P (Parallel programming and
                 algorithm theory); C5640 (Protocols)",
  corpsource =   "Dept. of Comput. Sci., Technion, Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "communication complexity; communication-privacy
                 tradeoff; modular addition; protocol; protocols; t-
                 privately; tight lower bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rosenblueth:1993:EMN,
  author =       "David A. Rosenblueth",
  title =        "An execution mechanism for nondeterministic,
                 state-oriented programs based on a chart parser",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "4",
  pages =        "211--217",
  day =          "22",
  month =        mar,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory); C6110L (Logic programming);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "IIMAS, Univ. Nacional Autonoma de Mexico City,
                 Mexico",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "chart parser; destructive assignments; execution
                 mechanism; flowcharts; formal grammars; formal
                 languages; grammars; logic programming;
                 nondeterministic programs; program verification;
                 programs; state-oriented programs",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Buro:1993:MLH,
  author =       "Michael Buro",
  title =        "On the maximum length of {Huffman} codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "219--223",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A29",
  MRnumber =     "93m:94014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat-Gesamthochschule",
  affiliationaddress = "Paderborn, Ger",
  classification = "723.1; 922.1; B0250 (Combinatorial mathematics);
                 B6120B (Codes); C1160 (Combinatorial mathematics);
                 C1260 (Information theory)",
  corpsource =   "FB 17 Math.-Inf., Univ.-Gesamthochschule, Paderborn,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary codes; Code length; codes; Codes (symbols);
                 encoded symbols; Encoding (symbols); full binary trees;
                 Huffman codes; lowest probabilities; maximum length;
                 Probability; Probability distribution; Trees
                 (mathematics); trees (mathematics); upper bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cheung:1993:LBP,
  author =       "S. Cheung and F. C. M. Lau",
  title =        "A lower bound for permutation routing on
                 two-dimensional bused meshes",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "225--228",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "93k:68007",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "721.3; 723.1; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. 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; Data communication systems; lower bound;
                 Lower bounds; Mesh connected computers; MIMD
                 architecture; Multiprocessing systems; multiprocessor
                 interconnection networks; Packet routing; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems; Permutation routing; permutation routing;
                 propagation delay; two-dimensional bused meshes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Spinrad:1993:DLO,
  author =       "Jeremy P. Spinrad",
  title =        "Doubly lexical ordering of dense $0$-$1$ matrices",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "229--235",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C85)",
  MRnumber =     "93m:68085",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Vanderbilt Univ",
  affiliationaddress = "Nashville, TN, USA",
  classification = "723.1; 921.4; C1160 (Combinatorial mathematics);
                 C4140 (Linear algebra); 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 =     "Algorithm complexity; Algorithms; Balanced matrix;
                 chordal bipartite; Chordal graphs; Combinatorial
                 problems; Computation theory; Computational complexity;
                 computational complexity; Computer algorithms; dense
                 0-1 matrices; dense graph; double lexical ordering;
                 Doubly lexical ordering; Graph theory; graph theory;
                 Matrix algebra; matrix algebra; strongly chordal; time
                 bounds",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hanschke:1993:SSB,
  author =       "Philipp Hanschke and J{\"o}rg W{\"u}rtz",
  title =        "Satisfiability of the smallest binary program",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "237--241",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N05",
  MRnumber =     "94b:68031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "DFKI",
  affiliationaddress = "Kaiserslautern, Ger",
  classification = "723.1; 723.4; C4210 (Formal logic); C4240
                 (Programming and algorithm theory); C6110L (Logic
                 programming)",
  corpsource =   "DFKI, Kaiserslautern, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "binary Horn clause; Binary programs; Binary sequences;
                 Computability and decidability; Computation theory;
                 decidability; Horn clauses; Logic programming; logic
                 programming; Post Correspondence Problem; Programming
                 theory; programming theory; Recursivity; recursivity;
                 Satisfiability; satisfiability; smallest binary
                 program",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bijlsma:1993:QBE,
  author =       "A. Bijlsma",
  title =        "Quasi-{Boolean} equivalence",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "243--247",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (68N05)",
  MRnumber =     "94e:68106",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723.1; 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 =     "Boolean functions; cand; Computation theory;
                 conditional connectives; Conditional connectives; cor;
                 Formal logic; Formal semantics; Program derivation;
                 program derivations; programming theory; Programming
                 theory; Propositional calculus; quasi-boolean
                 equivalence; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DePrisco:1993:BST,
  author =       "Roberto {De Prisco} and Alfredo {De Santis}",
  title =        "On binary search trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "249--253",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68R10)",
  MRnumber =     "93k:68023",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Columbia Univ",
  affiliationaddress = "New York City, NY, USA",
  classification = "723.1; 921.6; 922.1; C6120 (File organisation)",
  corpsource =   "Dept. of Comp. 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 =     "Algorithms; Binary search trees; binary search trees;
                 Binary sequences; Data structures; Heuristic methods;
                 Linear time heuristics; linear-time heuristic;
                 Optimization; Probability; Programming theory; Search
                 algorithms; tree data structures; Trees (mathematics);
                 upper bound; Upper bounds",
  treatment =    "P Practical",
}

@Article{Lu:1993:PMA,
  author =       "Jian Lu",
  title =        "Parallelizing {Mallat} algorithm for {$2$-D} wavelet
                 transforms",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "255--259",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dartmouth Coll",
  affiliationaddress = "Hanover, NH, USA",
  classification = "723.1; 921.6; C4190 (Other numerical methods);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Thayer Sch. of Eng., Dartmouth Coll., Hanover, NH,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2-D convolutions; 2-D wavelet transforms; Algorithms;
                 Computation theory; Computational complexity; hypercube
                 networks; Mallat algorithm parallelizing; Mathematical
                 transformations; mesh; optimized parallelization;
                 Parallel algorithms; parallel algorithms; Parallel
                 processing systems; pyramid; Two-dimensional
                 convolution; Wavelet transform; wavelet transforms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1993:APQ,
  author =       "D. T. Lee and E. Papadopoulou",
  title =        "The all-pairs quickest path problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "261--267",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B12",
  MRnumber =     "94b:90024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Northwest Univ",
  affiliationaddress = "Evanston, IL, USA",
  classification = "723.1; 921.6; C6120 (File organisation)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Northwestern
                 Univ., Evanston, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; all-pairs quickest path problem;
                 Communication networks; Computational complexity; Data
                 communication systems; data structures; Data
                 structures; Directed graphs; Graph algorithms; Graph
                 theory; O(rn/sup 2/) space data structure; Shortest
                 paths",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dickerson:1993:SAE,
  author =       "Matthew T. Dickerson and Jason Shugart",
  title =        "A simple algorithm for enumerating longest distances
                 in the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "5",
  pages =        "269--274",
  day =          "2",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 211 539",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Middlebury Coll",
  affiliationaddress = "Middlebury, VT, USA",
  classification = "723.1; 921.6; C4260 (Computational geometry)",
  corpsource =   "Dept. of Math. and Comput. Sci., Middlebury Coll., VT,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithmic complexity; Algorithms; Computation
                 theory; Computational complexity; Computational
                 geometry; computational geometry; Computer algorithms;
                 deterministic algorithm; enumerating longest distances;
                 expected-case running time; Geometry; L/sub p/ distance
                 metrics; Proximity problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1993:HIS,
  author =       "Jie Wang and Jay Belanger",
  title =        "Honest iteration schemes of randomizing algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "275--278",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25)",
  MRnumber =     "94e:68064",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Wilkes Univ., Barre,
                 PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; iteration schemes; iterative
                 methods; randomizing algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cai:1993:RUT,
  author =       "Leizhen Cai",
  title =        "The recognition of union trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "279--283",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "94b:68054",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; disjoint-set union
                 operations; f-union trees; linear-time implementation;
                 polynomial-time algorithm; polynomial-time computable
                 monotone function; rank; rooted trees; size; tree data
                 structures; union rule; union trees recognition",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gavril:1993:ESG,
  author =       "F{\u{a}}nic{\u{a}} Gavril",
  title =        "An efficiently solvable graph partition problem to
                 which many problems are reducible",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "285--290",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q22 68R10)",
  MRnumber =     "94a:05188",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "CEMA, Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-CNFSAT; 2-colors graph partition problem; 2-QBF
                 truth; bipartite graphs; CRCW PRAM; graph colouring;
                 graph partition problem; log-space complete; log-space
                 reducible; NLOGSPACE; parallel algorithm; parallel
                 algorithms; recognition problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Korsh:1993:CRG,
  author =       "James F. Korsh",
  title =        "Counting and randomly generating binary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "291--294",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10",
  MRnumber =     "1 216 938",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C5230 (Digital
                 arithmetic methods); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. and Info. Sci., Temple Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "counting; random number generation; randomly
                 generating binary trees; recurrence relations; tree
                 data structures",
  treatment =    "P Practical",
}

@Article{Schwabe:1993:CSS,
  author =       "Eric J. Schwabe",
  title =        "Constant-slowdown simulations of normal hypercube
                 algorithms on the butterfly network",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "295--301",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q10)",
  MRnumber =     "93m:68021",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture)",
  corpsource =   "Northwestern Univ., Evanston, IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bounded-degree networks; butterfly network;
                 computational model; constant-slowdown simulations;
                 hypercube networks; interconnection scheme; logarithmic
                 node degree; normal hypercube algorithms; parallel
                 algorithms; parallel computation; shuffle-exchange
                 graph",
  treatment =    "P Practical",
}

@Article{Razborov:1993:LBS,
  author =       "Alexander Razborov and Avi Wigderson",
  title =        "{$n^{\Omega(\log n)}$} lower bounds on the size of
                 depth-$3$ threshold circuits with {AND} gates at the
                 bottom",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "303--307",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "94c:68075",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1265B (Logic circuits); C4240 (Programming and
                 algorithm theory); C5120 (Logic and switching
                 circuits)C4210 (Formal logic)",
  corpsource =   "Steklov Math. Inst., Moscow, Russia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "ACC/sup 0/; AND gates; computational complexity;
                 depth-3 threshold circuits; logic circuits; lower
                 bounds; threshold logic",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1993:NSN,
  author =       "Wen Tsuen Chen and Kuen Rong Hsieh",
  title =        "A neural sorting network with {$O(1)$} time
                 complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "309--313",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (92B20)",
  MRnumber =     "1 216 941",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230D (Neural nets); C4240 (Programming and
                 algorithm theory); C6130 (Data handling techniques)",
  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 =     "computational complexity; feedforward neural nets;
                 multilayer feedforward neural network; neural sorting
                 network; NP-complete problems; O(1) time complexity;
                 parallel sorting algorithms; sorting",
  treatment =    "P Practical",
}

@Article{Gargano:1993:FTR,
  author =       "L. Gargano and U. Vaccaro and A. Vozella",
  title =        "Fault tolerant routing in the star and pancake
                 interconnection networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "315--320",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M15 68M20)",
  MRnumber =     "94j:68013",
  MRreviewer =   "Hans Daduna",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture); C5470 (Performance evaluation
                 and testing)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "fault tolerant computing; fault tolerant routing;
                 minimal length routing; multiprocessor interconnection
                 networks; n-pancake graph; n-star graph; pancake
                 interconnection networks",
  treatment =    "P Practical",
}

@Article{Ravindran:1993:DED,
  author =       "Somasundaram Ravindran and Alan Gibbons",
  title =        "Dense edge-disjoint embedding of complete binary trees
                 in the hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "321--325",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68M10 68R10)",
  MRnumber =     "94a:68045",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complete binary trees; dense edge-disjoint embedding;
                 hypercube; hypercube networks; P-RAM algorithms;
                 parallel algorithms; trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wu:1993:THP,
  author =       "Jer Shyan Wu and Rong Jaye Chen",
  title =        "The {Towers} of {Hanoi} problem with cyclic parallel
                 moves",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "1--6",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (05A99 68Q25)",
  MRnumber =     "94a:68043",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao-Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cyclic parallel moves; data structures; parallel
                 algorithms; towers of Hanoi problem",
  treatment =    "P Practical",
}

@Article{Yu:1993:SPA,
  author =       "Ming Shing Yu and Lin Yu Tseng and Shoe Jane Chang",
  title =        "Sequential and parallel algorithms for the
                 maximum-weight independent set problem on permutation
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "7--11",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q22 68R10)",
  MRnumber =     "93m:05191",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Dept. of Appl. Maths., Nat. Chung-Hsing Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry; CREW
                 PRAM model; maximum-weight independent set problem;
                 parallel algorithms; permutation graphs; sequential
                 algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Megson:1993:SPA,
  author =       "G. M. Megson",
  title =        "Systolic partitioning algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "13--18",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q15)",
  MRnumber =     "94h:68077",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci., Newcastle-Upon-Tyne Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; conditional uniform
                 recurrence equations; dynamic programming; partition;
                 regular array synthesis; systolic arrays; systolic
                 partitioning algorithms",
  treatment =    "P Practical",
}

@Article{Lins:1993:GCR,
  author =       "Rafael D. Lins",
  title =        "Generational cyclic reference counting",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "19--20",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6120
                 (File organisation); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. de Inf., Univ. Federal de Pernambuco, Recife,
                 Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "data structures; functional programming; garbage
                 cells; generational cyclic reference counting;
                 mark-scan; program compilers; storage management",
  treatment =    "P Practical",
}

@Article{Lai:1993:EHP,
  author =       "Ten Hwang Lai and Shu-Shang Wei",
  title =        "The {Edge Hamiltonian Path Problem} is {NP}-complete
                 for bipartite graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "21--26",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C45 05C85 90B10)",
  MRnumber =     "94a:68051",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm 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/",
  keywords =     "bipartite; bipartite graphs; computational complexity;
                 edge Hamiltonian path problem; graph theory;
                 NP-complete",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yang:1993:NBS,
  author =       "Yi Xian Yang",
  title =        "New binary sequences with perfect staircase profile of
                 linear complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "27--29",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A55 (68Q30)",
  MRnumber =     "94e:94011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  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/",
  keywords =     "binary sequences; computational complexity; data
                 structures; linear complexity; perfect staircase
                 profile; random number generation",
  treatment =    "P Practical",
}

@Article{Vaidyanathan:1993:RAD,
  author =       "Ramachandran Vaidyanathan and Carlos R. P. Hartmann
                 and Pramod K. Varshney",
  title =        "Running {ASCEND}, {DESCEND} and {PIPELINE} algorithms
                 in parallel using small processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "31--36",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "ASCEND; DESCEND; parallel algorithms; PIPELINE",
  treatment =    "P Practical",
}

@Article{Kobayashi:1993:CPP,
  author =       "Kojiro Kobayashi",
  title =        "{$\Sigma^0_n$}-complete properties of programs and
                 {Martin-L{\"o}f} randomness",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "37--42",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N05",
  MRnumber =     "94a:68014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary representation; computational complexity;
                 Martin-Lof randomness; probability; randomly selected
                 program; Sigma /sub n//sup 0/-complete properties of
                 programs",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cha:1993:CMC,
  author =       "Shin Cha and In Sang Chung and Yong Rae Kwon",
  title =        "Complexity measures for concurrent programs based on
                 information-theoretic metrics",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "43--50",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30 (68Q10)",
  MRnumber =     "1 216 044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110B
                 (Software engineering techniques); C6110P (Parallel
                 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/",
  keywords =     "complexity; computational complexity; concurrent
                 programs; information content; information-theoretic
                 metrics; intertasking activity; parallel programming;
                 risk ratio; software metrics",
  treatment =    "P Practical",
}

@Article{Oh:1993:AEK,
  author =       "Sang Bong Oh",
  title =        "An analytical evidence for {Kal{\'e}}'s heuristic for
                 the {$N$} queens problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "51--54",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05",
  MRnumber =     "94a:68098",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0250 (Combinatorial
                 mathematics); C1140E (Game theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Korea Telecom Res. Center, Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "almost perfect heuristic; analytical evidence;
                 combinatorial mathematics; combinatorial problems; game
                 theory; Kale's heuristic; middle-out instantiation; N
                 queens problem; search problems; search techniques;
                 value-ordering heuristic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ho-Stuart:1993:CWB,
  author =       "Chris Ho-Stuart and H. S. M. Zedan and Ming Fang",
  title =        "Congruent weak bisimulation with dense real-time",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "55--61",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q65",
  MRnumber =     "94b:68081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "York Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "congruent weak bisimulation; connectives; dense real-
                 time; formal logic; path bisimulation; real-time
                 process algebra; step bisimulation",
  treatment =    "P Practical",
}

@Article{Ohtsuka:1993:PSL,
  author =       "Hiroshi Ohtsuka",
  title =        "A proof of the substitution lemma in {de Bruijn}'s
                 notation",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "63--66",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "1 219 844",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Kyushu Univ., Fukuoka, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Church--Rosser theorem; de Bruijn's notation; lambda
                 calculus; lambda-calculus; substitution lemma; theorem
                 prover; theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hoory:1993:UTS,
  author =       "Shlomo Hoory and Avi Wigderson",
  title =        "Universal traversal sequences for expander graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "67--69",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (05C85 68R10)",
  MRnumber =     "94h:68071",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "computational complexity; consistent labeling;
                 expander graphs; logarithmic space complexity;
                 polynomial length universal sequence; symmetric
                 labeling; universal traversal sequences",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Moffat:1993:SRA,
  author =       "Alistair Moffat and Justin Zobel",
  title =        "Supporting random access in files of variable length
                 records",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "71--77",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "94a:68022",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "data structures; file organisation; random access
                 index; static file; variable length records",
  treatment =    "P Practical",
}

@Article{Zelikovsky:1993:FAA,
  author =       "Alexander Z. Zelikovsky",
  title =        "A faster approximation algorithm for the {Steiner}
                 tree problem in graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "79--83",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C05 68Q25 68R10)",
  MRnumber =     "94b:05187",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://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 =   "Inst. of Math., Acad. of Sci., Kishinev, Moldova",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "all-pairs-shortest-paths problem; approximation
                 theory; computational complexity; computational
                 geometry; faster approximation algorithm; graphs;
                 heuristics; runtime; shortest tree; Steiner tree
                 problem; time complexity; trees (mathematics); vertex
                 subset",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wegener:1993:OLB,
  author =       "Ingo Wegener",
  title =        "Optimal lower bounds on the depth of polynomial-size
                 threshold circuits for some arithmetic functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "85--87",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "94b:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C5120 (Logic and switching
                 circuits); C5230 (Digital arithmetic methods)",
  corpsource =   "Fachbereich Inf., Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arithmetic functions; computational complexity; depth
                 3; depth of polynomial-size threshold circuits; digital
                 arithmetic; division; inversion; optimal lower bounds;
                 powering; squaring; threshold logic",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Thangavel:1993:PAA,
  author =       "P. Thangavel and V. P. Muthuswamy",
  title =        "Parallel algorithms for addition and multiplication on
                 processor arrays with reconfigurable bus systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "89--94",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68M07 68Q35)",
  MRnumber =     "94a:68046",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B2570 (Semiconductor integrated circuits); C4240P
                 (Parallel programming and algorithm theory); C5230
                 (Digital arithmetic methods)",
  corpsource =   "Dept. of Math., Bharathidasan Univ., Tiruchirapalli,
                 India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "adder; adders; addition; complexity; digital
                 arithmetic; multiplication; multiplier circuit;
                 multiplying circuits; parallel algorithms; processor
                 arrays with reconfigurable bus systems; VLSI; VLSI
                 technology",
  treatment =    "P Practical",
}

@Article{Longpre:1993:SIO,
  author =       "Luc Longpr{\'e} and Sarah Mocas",
  title =        "Symmetry of information and one-way functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "95--100",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30 (68Q15)",
  MRnumber =     "94g:68051",
  MRreviewer =   "M. I. Dekhtyar",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; Kolmogorov complexity;
                 one-way functions; resource bounded environments; space
                 bounded environments; symmetry of information",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shen:1993:NMV,
  author =       "Xiaojun Shen and Qing Hu",
  title =        "A note on: {``Minimal visibility graphs'' [Inform.
                 Process. Lett. {\bf 37} (1991), no. 1, 49--53; MR
                 91m:68160] by D. Campbell and J. C. Higgins}",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "101--101",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (05C38)",
  MRnumber =     "94b:68122",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Campbell:1991:MVG}.",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry)",
  corpsource =   "Comput. Sci., Telecommun. Program, Missouri Univ.,
                 Kansas City, MO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; minimal visibility graphs",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Makedon:1993:SLT,
  author =       "Fillia Makedon and Dafna Sheinwald and Yaron
                 Wolfsthal",
  title =        "A simple linear-time algorithm for the recognition of
                 bandwidth-$2$ biconnected graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "2",
  pages =        "103--107",
  day =          "17",
  month =        may,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "93m:05188",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B1130 (General
                 analysis and synthesis methods); B2570 (Semiconductor
                 integrated circuits); C1160 (Combinatorial
                 mathematics); C4260 (Computational geometry)",
  corpsource =   "Dept. of Math. and Comput. Sci., Dartmouth Coll.,
                 Hanover, NH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bandwidth-2 biconnected graphs; biconnected graph;
                 circuit layout; computational geometry; data
                 structures; graph recognition; linear-time algorithm;
                 matrix processing; memory management; vertices; VLSI;
                 VLSI layout",
  treatment =    "P Practical",
}

@Article{Bianco:1993:PSM,
  author =       "L. Bianco and J. Blazewicz and P. Dell'Olmo and M.
                 Drozdowski",
  title =        "Preemptive scheduling of multiprocessor tasks on the
                 dedicated processor system subject to minimal
                 lateness",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "109--113",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "C.N.R.",
  affiliationaddress = "Italy",
  classification = "722.4; 723.1; C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  corpsource =   "Istituto di Analisi dei Sistemi ed Informatica, CNR,
                 Roma, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; alternative sets of processors; dedicated
                 processor system; Dedicated processor system; minimal
                 lateness; Minimal lateness; multiprocessing systems;
                 Multiprocessing systems; multiprocessor tasks; Parallel
                 processing systems; Polynomial time algorithms;
                 preemptive scheduling; scheduling; Scheduling; set of
                 processors; Time sharing programs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fischer:1993:AMP,
  author =       "Ted Fischer and Andrew V. Goldberg and David J. Haglin
                 and Serge Plotkin",
  title =        "Approximating matchings in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "115--118",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q25)",
  MRnumber =     "94e:68071",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "721.1; 722.4; 921.4; C1160 (Combinatorial
                 mathematics); C4240P (Parallel 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; Approximation theory; arbitrary graph;
                 computational complexity; graph theory; Graphic
                 methods; Matching; maximum matchings; NC algorithm;
                 O(k/sup 4/log/sup 3/n) time; O(kn/sup 2k+2/)
                 processors; parallel algorithms; Parallel computation;
                 Parallel processing systems; space complexity; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gavalda:1993:PRP,
  author =       "Ricard Gavald{\`a}",
  title =        "A positive relativization of polynomial time versus
                 polylog space",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "119--123",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "94f:68084",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Politecnica de Catalunya",
  affiliationaddress = "Barcelona, Spain",
  classification = "921.1; 921.6; C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Software, 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; Computation theory; Computational
                 complexity; computational complexity; equivalence
                 classes; equivalent; Large scale systems; oracle
                 machine; polylog space; Polylog space [plog];
                 polynomial time; Polynomial time [P]; Polynomials;
                 positive relativization; PSPACE; Relativity;
                 translation arguments; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1993:QPP,
  author =       "Gen Huey Chen and Yung Chen Hung",
  title =        "On the quickest path problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "125--128",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B10 (68Q25)",
  MRnumber =     "94b:90023",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "723.2; 921.4; 921.5; 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 =     "algorithm theory; Algorithms; all-pairs quickest
                 paths; Combinatorial mathematics; Combinatorial
                 problems; Computation theory; Data processing; Design;
                 graph theory; O(logm) time; O(mn/sup 2/) preprocessing
                 time; O(mn/sup 2/) time algorithm; quickest path
                 problem; Quickest path problem; Scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liu:1993:ACO,
  author =       "Lung-Tien Liu and Gen-Huey Chen and Kwei-Jay Lin",
  title =        "An algorithm for coalescing operations with precedence
                 constraints in real-time systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "129--133",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Telecommunication Laboratories",
  affiliationaddress = "Chung-Li, Taiwan",
  classification = "723.1; 921.5; 921.6; C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Telecommun. Labs., Chung-Li, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; coalescence schedule; Coalescing
                 operations; computational complexity; constraint
                 handling; Constraint theory; dynamic programming;
                 Dynamic programming; k periodic jobs; Maximum weighted
                 compatible matching; O(k/sup 2/n/sup k/); O(n/sup 2/)
                 time; periodic job; precedence constraints; Real time
                 computations; Real time systems; real-time systems;
                 scheduling; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Davis:1993:ELS,
  author =       "Robert Davis and Armand Prieditis",
  title =        "The expected length of a shortest path",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "135--141",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B10",
  MRnumber =     "94e:90037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "723.2; 921.4; 921.5; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. 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 =     "algorithm theory; Algorithms; arc lengths; closed-form
                 approximation; completeness; Data processing; exact
                 summation formula; Expected length; expected length;
                 graph theory; Graphic methods; Operations research;
                 Optimization; Queueing theory; recursive equations;
                 shortest path; Shortest path problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Latifi:1993:FDS,
  author =       "Shahram Latifi",
  title =        "On the fault-diameter of the star graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "143--150",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15 (05C99)",
  MRnumber =     "94e:68029",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nevada",
  affiliationaddress = "Las Vegas, NV, USA",
  classification = "722.4; 921.4; C1160 (Combinatorial mathematics);
                 C4230M (Multiprocessor interconnection)",
  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 =     "Cartesian product of graphs; Combinatorial
                 mathematics; combinatorial method; Disjoint path; Fault
                 diameter; Fault tolerant computer systems; fault
                 tolerant computing; fault-diameter; fault-free star
                 graph; faulty nodes; graph theory; Graph theory;
                 multiprocessor interconnection networks; node-disjoint
                 paths; Permutation; star graph; Star graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sato:1993:DSP,
  author =       "Tadakazu Sato",
  title =        "Decidability for some problems of linear cellular
                 automata over finite commutative rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "151--155",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q80",
  MRnumber =     "94h:68165",
  MRreviewer =   "J{\'a}nos Bagyinszki",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Toyo Univ",
  affiliationaddress = "Saitama, Jpn",
  classification = "721.1; 921.4; C4220 (Automata theory)",
  corpsource =   "Dept. of Inf. and Comput. Sci., Tokyo Univ., Saitama,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automata theory; Cellular arrays; cellular
                 automata; Commutative rings; Computability and
                 decidability; decidability; finite commutative rings;
                 finite orderedness; infinite orderedness; injectivity;
                 Linear cellular automata; linear cellular automata;
                 Local map; local maps; maximal ideals; neighbour
                 frames; non-surjectivity; Parallel map; Set theory;
                 surjectivity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fischetti:1993:CIP,
  author =       "Vincent A. Fischetti and Gad M. Landau and Jeanette P.
                 Schmidt and Peter H. Sellers",
  title =        "Corrigendum: {``Identifying periodic occurrences of a
                 template with applications to protein structure''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "3",
  pages =        "157--157",
  day =          "11",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U15 (92D20)",
  MRnumber =     "94b:68126b",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Fischetti:1993:IPO}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Crochemore:1993:TDP,
  author =       "Maxime Crochemore and Leszek G{\polhk{a}}sieniec and
                 Wojciech Rytter",
  title =        "Two-dimensional pattern matching by sampling",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "159--162",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T10",
  MRnumber =     "1 229 203",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst Gaspard Monge",
  affiliationaddress = "Noisy-le-Grand, Fr",
  classification = "721.1; 723.1; 723.2; 922.1; C1250 (Pattern
                 recognition); C5260B (Computer vision and picture
                 processing)",
  corpsource =   "Inst. Gaspard Monge, Noisy-le-Grand, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational linguistics; Data
                 processing; deterministic sampling; linear sequential
                 time; logarithmic deterministic sample; One dimensional
                 string matching problem; pattern recognition; Pattern
                 recognition; sampling; Sampling; Two dimensional
                 pattern matching problem; two-dimensional pattern
                 matching",
  treatment =    "P Practical",
}

@Article{Kuncheva:1993:GAF,
  author =       "Ludmila Kuncheva",
  title =        "Genetic algorithm for feature selection for parallel
                 classifiers",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "163--168",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bulgarian Acad of Sciences",
  affiliationaddress = "Sofia, Bulg",
  classification = "721.1; 722.4; 723.1; 723.2; 903.1; 921.4; C1250
                 (Pattern recognition); C4240P (Parallel programming and
                 algorithm theory); C5260B (Computer vision and picture
                 processing)",
  corpsource =   "Central Lab. of Bioinstrumentation and Autom.,
                 Bulgarian Acad. of Sci., Sofia, Bulgaria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automata theory; aviation medicine;
                 Classification (of information); Combinatorial
                 mathematics; feature selection; feature subsets;
                 Genetic algorithms; genetic algorithms; modified
                 fitness function; neonatal; parallel algorithms;
                 Parallel classifiers; parallel classifiers; Parallel
                 processing systems; Pattern recognition; pattern
                 recognition",
  treatment =    "P Practical",
}

@Article{Halldorsson:1993:AMM,
  author =       "Magn{\'u}s M. Halld{\'o}rsson",
  title =        "Approximating the minimum maximal independence
                 number",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "169--172",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C85)",
  MRnumber =     "94b:05109",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Japan Advanced Inst of Science and Technology",
  affiliationaddress = "Ishikawa, Jpn",
  classification = "721.1; 723.1; 921.4; C4130 (Interpolation and
                 function approximation); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Sch. of Inf. Sci., Japan Adv. Inst. of Sci. and
                 Technol., Ishikawa, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation algorithms; Approximation
                 theory; approximation theory; Computational complexity;
                 computational complexity; Graph theory; lower bound;
                 minimum dominating independence number; minimum maximal
                 independence number; Minimum maximal independence
                 number (mmin); minimum nonextendible independent set;
                 polynomial-time approximation; Polynomials;
                 polynomials; Set theory; unweighted NP-complete graph
                 problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mazurkiewicz:1993:DDM,
  author =       "Antoni Mazurkiewicz",
  title =        "Distributed Disassembly of Mosaics",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "173--178",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85",
  MRnumber =     "94b:05185",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Polish Acad of Sciences",
  affiliationaddress = "Warsaw, Pol",
  classification = "722.4; 723.1; 921.4; 932.1; 933.3; C4210 (Formal
                 logic); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw,
                 Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm correctness; Algorithms; communicating
                 sequential processes; connected sets of holes;
                 distributed algorithm; distributed algorithms;
                 Distributed computer systems; distributed disassembly;
                 Distributed systems; Electron energy levels; Electron
                 problem; Electron transport properties; Electrons;
                 empty places; Error correction; Graph theory; holes;
                 Mosaics; mosaics; nonnegative integers; planar graphs;
                 positive integers",
  treatment =    "P Practical",
}

@Article{Demetrovics:1993:SPC,
  author =       "J{\'a}nos Demetrovics and Vu Duc Thi",
  title =        "Some problems concerning keys for relation schemes and
                 relations in the relational datamodel",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "179--184",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "94f:68071",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hungarian Acad of Sciences",
  affiliationaddress = "Budapest, Hung",
  classification = "721.1; 723.1; 723.2; 723.3; 921; C4240 (Programming
                 and algorithm theory); C6160D (Relational DBMS)",
  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 =     "Algorithms; Antikey; Armstrong relation;
                 co-NP-complete; Computational complexity; computational
                 complexity; Computational methods; Data structures;
                 Keys; keys; Minimal key; polynomial time; Polynomials;
                 relation schemes; Relational database systems;
                 relational databases; Relational datamodel; relational
                 datamodel; relations; time complexity",
  treatment =    "P Practical",
}

@Article{vanKreveld:1993:PPP,
  author =       "Marc {van Kreveld}",
  title =        "The power of parallel projection (computational
                 geometry)",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "185--191",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "94h:68225",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Utrecht",
  affiliationaddress = "Utrecht, Neth",
  classification = "722.4; 723.1; 723.2; 921; 921.4; C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry); C6120 (File organisation)",
  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; axis-parallel boxes; Computational
                 geometry; computational geometry; Computational
                 methods; d-dimensional space; Data structures; data
                 structures; Geometry; j-flat; k-dimensional simplex
                 searching; k-flat; Mathematical models; Multilayer data
                 structures; parallel algorithms; Parallel processing
                 systems; Parallel projection; power of parallel
                 projection; ray shooting; Set theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Tsay:1993:EIP,
  author =       "Jyh Jong Tsay",
  title =        "An efficient implementation of priority queues using
                 fixed-sized systolic coprocessors",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "193--198",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "1 229 208",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung Cheng Univ",
  affiliationaddress = "Chiayi, Taiwan",
  classification = "722.1; 722.4; 723.1; 723.2; C5220P (Parallel
                 architecture); C6120 (File organisation)",
  corpsource =   "Dept. 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 =     "data elements; Data handling; data structures; Data
                 structures; fixed-sized systolic coprocessors; linear
                 systolic array; Parallel processing systems; priority
                 queues; Priority queues; processing elements; Program
                 processors; random access machine; Random access
                 storage; systolic arrays; Systolic arrays",
  treatment =    "P Practical",
}

@Article{Chakraborty:1993:URA,
  author =       "Uday Kumar Chakraborty and D. Ghosh Dastidar",
  title =        "Using reliability analysis to estimate the number of
                 generations to convergence in genetic algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "4",
  pages =        "199--209",
  day =          "25",
  month =        jun,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (65C99)",
  MRnumber =     "95a:68059",
  MRreviewer =   "Bruno Betr{\`o}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Jadavpur Univ",
  affiliationaddress = "Calcutta, India",
  classification = "723.1; 921; 921.6; 922.1; C1140Z (Other and
                 miscellaneous); C1180 (Optimisation techniques); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Jadavpur Univ.,
                 Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-bit strings; Algorithms; Computational methods;
                 convergence; Convergence of numerical methods;
                 Estimation; Genetic algorithms; genetic algorithms;
                 hyperplane; Implicit parallelism; Numerical analysis;
                 parallel algorithms; Reliability; reliability analysis;
                 Schema processing; schema processing; similarity
                 template; stochastic processes; stochastic reliability
                 model",
  treatment =    "P Practical",
}

@Article{Bijlsma:1993:CPC,
  author =       "A. Bijlsma",
  title =        "Calculating with procedure calls",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "211--217",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (68N05)",
  MRnumber =     "1 228 790",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723.4; C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110B (Software engineering
                 techniques)",
  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 =     "Calculational program construction; calculational
                 program construction; Computational grammars; Computer
                 programming; formal languages; formal specification;
                 normal specifications; Precondition semantics;
                 procedure calls; Procedure calls calculation; Program
                 compilers; program correctness; program verification;
                 proof rule; Proof rules; specification; weakest
                 precondition semantics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stamoulis:1993:EAM,
  author =       "George D. Stamoulis and John N. Tsitsiklis",
  title =        "An efficient algorithm for multiple simultaneous
                 broadcasts in the hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "219--224",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (90B12)",
  MRnumber =     "1 228 791",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Institute of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "723; 921; 921.5; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel 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 =     "Algorithms; communication complexity; distributed
                 algorithm; hypercube; hypercube networks; Hypercube
                 nodes; Multinode broadcast task; multinode broadcast
                 task; multiple simultaneous broadcasts; Optimization;
                 packet; packet switching; parallel algorithms; Parallel
                 processing systems; routing algorithms; Simple
                 distributed algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Muller:1993:PTA,
  author =       "Haiko M{\"u}ller and Falk Nicolai",
  title =        "Polynomial time algorithms for {Hamiltonian} problems
                 on bipartite distance-hereditary graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "225--230",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C45 05C85 68Q70)",
  MRnumber =     "94e:68141",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Friedrich Schiller Univ",
  affiliationaddress = "Jena, Ger",
  classification = "921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Math. Fakultat, Friedrich Schiller Univ., Jena,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; bipartite distance-hereditary graphs;
                 Bipartite graphs; computational complexity;
                 computational geometry; graph theory; Hamiltonian
                 circuit; Hamiltonian path; Last pendant vertex; last
                 pendant vertex; one vertex extension-sequence;
                 polynomial time algorithms; Polynomials; time
                 complexity; Vertex extension-sequence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1993:DDS,
  author =       "S. C. Chang and M. W. Du",
  title =        "Diamond deque: {A} simple data structure for priority
                 deques",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "231--237",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lab Incorporated",
  affiliationaddress = "Waltham, MA, USA",
  classification = "723; 921; C6120 (File organisation)",
  corpsource =   "Comput. and Intelligent Syst. Lab., GTE Labs. Inc.,
                 Waltham, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "data structure; Data structures; data structures;
                 Design; diamond deque; Hasse diagram; interface
                 relations; linear array; max-heap; min-heap;
                 parent-child relationship; pointer-free data structure;
                 priority deques; Priority deques data structure; Simple
                 pointer-free data structure",
  treatment =    "P Practical",
}

@Article{Schoning:1993:RRS,
  author =       "Uwe Schoning",
  title =        "On random reductions from sparse sets to tally sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "239--241",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Ulm",
  affiliationaddress = "Ulm, Ger",
  classification = "921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Abteilung Theor. Inf., Ulm Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; polynomial time
                 reduction; Polynomials; random reductions; set theory;
                 Sparse set random reductions; sparse sets; tally sets;
                 Tally sets random reductions; time complexity;
                 Truth-tables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wise:1993:SOR,
  author =       "David S. Wise",
  title =        "Stop-and-copy and one-bit reference counting",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "243--249",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indiana Univ",
  affiliationaddress = "Bloomington, IN, USA",
  classification = "723; 921; C6120 (File organisation); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; cheap recovery; conservatively stuck
                 counters; Conventional collection algorithm; Data
                 processing; faster recopying; Generation scavenging;
                 generation scavenging; One-bit reference counting;
                 one-bit reference counting; Stop and copy algorithm;
                 Stop-and-copy garbage collector; stop-and-copy garbage
                 collector; storage management; Storage management
                 algorithm; uncounted references",
  treatment =    "P Practical",
}

@Article{Kim:1993:AFO,
  author =       "Myoung Ho Kim and Joon Ho Lee and Yoon Joon Lee",
  title =        "Analysis of fuzzy operators for high quality
                 information retrieval",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "251--256",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20 (04A72)",
  MRnumber =     "1 228 793",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "723; 921; C4210 (Formal logic); C7250 (Information
                 storage and retrieval)",
  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 =     "Boolean functions; Compensatory operators;
                 Conventional fuzzy set model; Data processing; document
                 rankings; Extended boolean model; fuzzy logic; Fuzzy
                 operators; fuzzy operators; fuzzy set model based;
                 Fuzzy sets; high quality information retrieval;
                 Information retrieval; information retrieval;
                 Information retrieval system; Information retrieval
                 systems; positively compensatory operators; retrieval
                 effectiveness",
  treatment =    "P Practical",
}

@Article{Snyder:1993:CRP,
  author =       "Wayne Snyder",
  title =        "On the complexity of recursive path orderings",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "5",
  pages =        "257--262",
  day =          "9",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "1 228 794",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Boston Univ",
  affiliationaddress = "Boston, MA, USA",
  classification = "723; 921; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Boston Univ., MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automatic theorem proving; complexity;
                 computational complexity; Computer science; exponential
                 behavior; lpo; Order-theoretic properties; recursive
                 definition; recursive functions; Recursive path
                 orderings; recursive path orderings; rewriting systems;
                 rpo; term rewriting; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Thirunarayan:1993:LIN,
  author =       "Krishnaprasad Thirunarayan",
  title =        "Locality in inheritance networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "263--268",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T30 (68Q55)",
  MRnumber =     "94h:68205",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Wright State Univ",
  affiliationaddress = "Dayton, OH, USA",
  classification = "721.1; 723.1; 903.1; C1230D (Neural nets); C6120
                 (File organisation); C6170 (Expert systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Wright State Univ.,
                 Dayton, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Data processing; ground local semantics;
                 Information analysis; Information science; inheritance;
                 inheritance networks; local theories of inheritance;
                 Locality; locality; nonmonotonic reasoning; Reasoning;
                 Semantics",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hoffgen:1993:CLT,
  author =       "Klaus-Uwe H{\"o}ffgen",
  title =        "Computational limitations on training sigmoid neural
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "269--274",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (92B20)",
  MRnumber =     "95c:68189",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Dortmund",
  affiliationaddress = "Dortmund, Ger",
  classification = "723.2; 723.4; 921.6; C1230D (Neural nets); C1240
                 (Adaptive system theory); C4130 (Interpolation and
                 function approximation); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation theory; Computational
                 complexity; computational complexity; computational
                 limitations; feedforward neural nets; function
                 approximation; function interpolation; Interpolation;
                 interpolation; learning (artificial intelligence);
                 Learning systems; Neural networks; NP-complete; Sigmoid
                 neural networks; training sigmoid neural networks",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chedid:1993:NVH,
  author =       "Fouad B. Chedid and Riad B. Chedid",
  title =        "A new variation on hypercubes with smaller diameter",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "275--280",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "94f:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Temple Univ Japan",
  affiliationaddress = "Hachioji, Jpn",
  classification = "721.3; 723.1; 903.1; C1160 (Combinatorial
                 mathematics); C5220P (Parallel architecture)",
  corpsource =   "Fac. of Comput. Sci., Temple Univ. Japan, Tokyo,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complete binary tree; Complete binary trees; Computer
                 architecture; Connectivity; generalized twisted cube;
                 Graph theory; Hamiltonian; hypercube networks;
                 Hypercubes; hypercubes; Information analysis; routing
                 algorithm; smaller diameter; trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Middendorf:1993:MBT,
  author =       "Martin Middendorf",
  title =        "Minimum broadcast time is {NP}-complete for
                 $3$-regular planar graphs and deadline $2$",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "281--287",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "94f:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Karlsruhe",
  affiliationaddress = "Karlsruhe, Ger",
  classification = "721.1; 723.1; 903.3; 922.2; C1180 (Optimisation
                 techniques); C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Angewandet Inf. und Formale
                 Beschreibungsverfahren, Karlsruhe Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-regular planar graphs; Algorithms; Combinatorial
                 mathematics; computational complexity; deadline 2;
                 Graph theory; Information dissemination; Information
                 theory; Minimum broadcast time; minimum broadcast time;
                 NP-complete; optimisation; Optimization; source nodes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bolognesi:1993:DGR,
  author =       "T. Bolognesi",
  title =        "Deriving graphical representations of process networks
                 from algebraic expressions",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "289--294",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q65 (68Q60)",
  MRnumber =     "94h:68148",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "C.N.R.",
  affiliationaddress = "Pisa, Italy",
  classification = "722.4; 723.1; 903.1; C4210 (Formal logic); C6110B
                 (Software engineering techniques); C6140D (High level
                 languages)",
  corpsource =   "CNUCE, CNR, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic expressions; communicating sequential
                 processes; Computer programming languages;
                 computer-aided software engineering; Distributed
                 computer systems; Formal semantics; formal semantics;
                 formal specification; Graphic methods; graphical
                 representations derivation; Information analysis;
                 interacting components; interconnection patterns;
                 parallel operators; Process algebras; process algebras;
                 process networks; Software engineering; Specification
                 languages; specification languages",
  treatment =    "P Practical",
}

@Article{Andersson:1993:IBT,
  author =       "Arne Andersson and Stefan Nilsson",
  title =        "Improved behaviour of tries by adaptive branching",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "295--300",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68R10)",
  MRnumber =     "94f:68062",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lund Univ",
  affiliationaddress = "Lund, Sweden",
  classification = "723.1; 723.2; 903.1; 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 =     "Adaptive branching; adaptive branching; branching
                 factors; Data processing; Data structures; Digital
                 search trees; Information analysis; Level compressed
                 tries; level-compressed trie; search cost; search
                 problems; tree data structures; tries",
  treatment =    "P Practical",
}

@Article{Clarke:1993:UAS,
  author =       "E. M. Clarke and I. A. Draghicescu and R. P. Kurshan",
  title =        "A unified approach for showing language inclusion and
                 equivalence between various types of
                 $\omega$-automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "301--308",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q70",
  MRnumber =     "94f:68137",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "723.1; 731.1; 903; C4210 (Formal logic); C4220
                 (Automata theory)",
  corpsource =   "Dept. 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 =     "automata theory; Automata theory; Buchi automaton;
                 complexity; computation tree logic; Computer
                 programming languages; equivalence; formal languages;
                 Formal logic; Information analysis; language inclusion;
                 Language inclusion; Model checking; model checking
                 procedure; omega-automata; reasoning; temporal logic;
                 Temporal logic; Tree logic; unified approach",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Prodinger:1993:NBR,
  author =       "Helmut Prodinger and Wojciech Szpankowski",
  title =        "A note on binomial recurrences arising in the analysis
                 of algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "6",
  pages =        "309--311",
  day =          "26",
  month =        jul,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "1 231 833",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  abstract =     "Letter to the editor.",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Algebra and Discrete Math., Tech. Univ. of
                 Vienna, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "analysis of algorithms; binomial recurrences;
                 computational complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Toledo:1993:APS,
  author =       "Sivan Toledo",
  title =        "Approximate parametric searching",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "1--4",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C30 (65K05)",
  MRnumber =     "94c:90097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "721; 723; 921; C1180 (Optimisation techniques);
                 C4240 (Programming and algorithm theory)",
  conferenceyear = "1993",
  corpsource =   "Lab. for Comput. Sci., 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; Approximation
                 algorithms; approximation algorithms; computational
                 complexity; Concave functions; concave functions;
                 Design; design of algorithms; Information science; NP
                 complete; Online searching; optimisation; Parametric
                 devices; Parametric searching; parametric searching;
                 polynomial-time approximation; search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teia:1993:LBR,
  author =       "Boris Teia",
  title =        "A lower bound for randomized list update algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "5--9",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20 (68Q25)",
  MRnumber =     "94c:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "721; 723; 921; C4240 (Programming and algorithm
                 theory); C4250 (Database theory)",
  conferenceyear = "1993",
  corpsource =   "Graduiertenkolleg Inf., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Analysis of algorithms;
                 computational complexity; Computer science; cost
                 complexity; database theory; deterministic on-line
                 algorithm; Information science; Lower bound; lower
                 bound; Mathematical models; Randomized list update;
                 randomized list update algorithms; randomized request
                 sequence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crescenzi:1993:NDC,
  author =       "Pierluigi Crescenzi and Riccardo Silvestri",
  title =        "A note on the descriptive complexity of maximization
                 problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "11--15",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "94m:68058",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Roma ``La Sapienza''",
  affiliationaddress = "Roma, Italy",
  classification = "721; 723; 921; C1180 (Optimisation techniques);
                 C4240 (Programming and algorithm theory)",
  conferenceyear = "1993",
  corpsource =   "Dipartimento de Sci. dell'Inf., Rome Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; approximation;
                 Combinatorial problems; combinatorial problems;
                 Computational complexity; computational complexity;
                 Computer science; Descriptive complexity; descriptive
                 complexity; MAX CLIQUE problem; Maximization problems;
                 maximization problems; Maximum principle;
                 MAXNP-hardness; NP-complete problems; optimisation;
                 Optimization; optimization problems; RMAX(k) classes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Owolabi:1993:EPS,
  author =       "Olumide Owolabi",
  title =        "Efficient pattern searching over large dictionaries",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "17--21",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Port Harcourt",
  affiliationaddress = "Port Harcourt, Nigeria",
  classification = "721; 723; C1250 (Pattern recognition); C4250
                 (Database theory)",
  conferenceyear = "1993",
  corpsource =   "Dept. of Math. and Comput. Sci., Port Harcourt Univ.,
                 Nigeria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; algorithms; Boyer--Moore pattern matching
                 algorithm; Computational complexity; computational
                 complexity; Computer science; database theory;
                 glossaries; Information science; Large dictionaries;
                 large dictionaries; N-gram method; online query term
                 expansion; Online searching; Pattern recognition;
                 pattern recognition; Pattern searching; pattern
                 searching; query processing; similarity matching;
                 Stemming; stemming; String similarity; strings
                 similarity; very large databases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hershberger:1993:FAT,
  author =       "John Hershberger",
  title =        "A faster algorithm for the two-center decision
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "23--29",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "94f:68180",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "DEC systems research center",
  affiliationaddress = "Palo Alto, CA, USA",
  classification = "721; 723; 912.3; C4240 (Programming and algorithm
                 theory); C4260 (Computational geometry)",
  conferenceyear = "1993",
  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 =     "Algorithms; Clustering; clustering; computational
                 complexity; Computational geometry; computational
                 geometry; Decision theory; decision theory; fast
                 algorithm; k center problem; K-center problem;
                 Operations research; operations research; planar
                 two-center decision problem; Two-center decision
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Meskes:1993:GSM,
  author =       "Michael Meskes and J{\"o}rg Noack",
  title =        "The generalized supplementary magic-sets
                 transformation for stratified {Datalog}",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "31--41",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 232 577",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "RWTH Aachen",
  affiliationaddress = "Aachen, Ger",
  classification = "721; 723; C4250 (Database theory); C6110L (Logic
                 programming); C6160K (Deductive databases)",
  conferenceyear = "1993",
  corpsource =   "Lehrstuhl f{\"u}r Angewandte Math. Insbesondere Inf.,
                 RWTH Aachen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; Computer
                 programming; Computer science; Database systems;
                 database theory; Deductive databases; deductive
                 databases; function free Horn logic; generalized
                 supplementary magic-sets transformation; GSMS
                 algorithm; logic programming; Magic sets
                 transformation; query languages; Stratified datalog;
                 stratified Datalog",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1993:BDA,
  author =       "Wen Huei Chen and Chuan Yi Tang",
  title =        "A {$2\cdot{}\vert E\vert$}-bit distributed algorithm
                 for the directed {Euler} trail problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "43--49",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C45 68Q25 68R10)",
  MRnumber =     "94e:05231",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Tsing-Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721; 723; 921; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  conferenceyear = "1993",
  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 =     "Algorithms; Computer science; Digraph; directed Euler
                 trail; Directed Euler trail problem; directed graphs;
                 distributed algorithm; distributed algorithms;
                 Distributed algorithms; distributed Euler trail
                 algorithm; distributed graph problems; Euler digraph;
                 Euler trail; Graph theory; strongly-connected digraph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Breslauer:1993:TCB,
  author =       "Dany Breslauer and Livio Colussi and Laura Toniolo",
  title =        "Tight comparison bounds for the string prefix-matching
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "1",
  pages =        "51--57",
  day =          "9",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68U15)",
  MRnumber =     "94g:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Centrum voor Wiskunde and Informatica",
  affiliationaddress = "Amsterdam, Neth",
  classification = "721; 723; 921; C4240 (Programming and algorithm
                 theory)",
  conferenceyear = "1993",
  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 =     "Algorithms; Comparison model; complexity;
                 computational complexity; Computer science;
                 deterministic sequential comparison model; Exact
                 complexity; Failure function; Knuth-Morris-Pratt string
                 matching algorithm; linear-time string prefix-matching
                 algorithms; Mathematical models; Mathematical
                 techniques; Pattern recognition; pattern recognition;
                 pattern string; self-prefix problem; String matching;
                 string prefix-matching problem; Tight comparison
                 bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dassow:1993:UL,
  author =       "J{\"u}rgen Dassow and Gheorghe P{\u{a}}un and Arto
                 Salomaa",
  title =        "On the union of {0L} languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "59--63",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "95c:68128",
  MRreviewer =   "Matti Linna",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Magdeburg Univ of Technology",
  affiliationaddress = "Magdeburg, Ger",
  classification = "721.1; 723.1.1; C4210 (Formal logic)",
  corpsource =   "Fac. of Comput. Sci., Magdeburg Univ. of Technol.,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "0L languages; AFL-operation; closure properties;
                 Computer programming languages; Decidability problems;
                 family of languages; formal language; Formal languages;
                 formal languages; L systems; Theory; union",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nieuwenhuis:1993:SLC,
  author =       "Robert Nieuwenhuis",
  title =        "Simple {LPO} constraint solving methods",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "65--69",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T15 (03B70)",
  MRnumber =     "94j:68272",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technical Univ of Catalonia",
  affiliationaddress = "Barcelona, Spain",
  classification = "721.1; 921; C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Tech. Univ. of Catalonia, Barcelona, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automatic theorem proving; Computation
                 theory; computational complexity; constraint handling;
                 extended signatures; Lexicographic path ordering (LPO);
                 lexicographic path ordering constraints; LPO constraint
                 solving methods; Mathematical techniques; NP
                 algorithms; NP-complete; satisfiability; Semantics;
                 theorem proving; Theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Frederickson:1993:SPC,
  author =       "Greg N. Frederickson and Susanne E. Hambrusch and Hung
                 Yi Tu",
  title =        "Shortest path computations in source-deplanarized
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "71--75",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35 (05C85 05C90)",
  MRnumber =     "94e:68080",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "714.2; 721.1; 921.4; B0250 (Combinatorial
                 mathematics); B2570 (Semiconductor integrated
                 circuits); C1160 (Combinatorial mathematics); C7410D
                 (Electronic engineering)",
  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; circuit layout CAD; Graph theory; graph
                 theory; Layout compaction; nonplanar graphs; Planar
                 graphs; shortest path problems; Shortest paths;
                 source-deplanarized graphs; VLSI; VLSI circuits; VLSI
                 layout; VLSI layout compaction",
  treatment =    "P Practical",
}

@Article{Tardos:1993:IBM,
  author =       "{\'E}va Tardos and Vijay V. Vazirani",
  title =        "Improved bounds for the max-flow min-multicut ratio
                 for planar and {$K_{r,r}$}-free graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "77--80",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C35 (05C90 68Q25)",
  MRnumber =     "94g:90161",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "912; 921.4; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Sch. of Operations 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; Analysis of algorithms; Computational
                 complexity; computational complexity; Graph theory;
                 graph theory; K/sub r,r/-free graphs; max-flow
                 min-multicut ratio; multicommodity flow problem;
                 network decomposition; Operations research; Planar
                 graphs; planar graphs; Theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jain:1993:NMI,
  author =       "Sanjay Jain and Arun Sharma",
  title =        "On the non-existence of maximal inference degrees for
                 language identification",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "81--88",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (03D05 03D15)",
  MRnumber =     "94j:68252",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of New South Wales",
  affiliationaddress = "Sydney, Aust",
  classification = "716.1; 723.2; 921; C1230 (Artificial intelligence);
                 C4210 (Formal logic)",
  corpsource =   "Inst. of Syst. Sci., Nat. Univ. of Singapore,
                 Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Data processing; formal languages;
                 grammars identification; Inductive interference;
                 inference mechanisms; Information science; language
                 identification; learning (artificial intelligence);
                 Learning systems; learning theory; Machine learning;
                 Mathematical techniques; Maximal inference degree;
                 maximal inference degrees; membership oracle; positive
                 data; Recursion theory; recursively enumerable
                 languages; Theory of computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yu:1993:TAM,
  author =       "Ming Shing Yu and Cheng-Hsing Yang",
  title =        "An ${O(n)}$ time algorithm for maximum matching on
                 cographs",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "89--93",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "94c:68150",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung-Hsing Univ",
  affiliationaddress = "Taichung, Taiwan",
  classification = "723.2; 921; 921.4; C4240 (Programming and algorithm
                 theory); C6120 (File organisation)",
  corpsource =   "Dept. of Appl. Math., Nat. Chung-Hsing Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Cograph; cographs; computational
                 complexity; Data processing; Data structures; Graph
                 theory; Matching problem; maximum matching; O(n) time
                 algorithm; parse tree; Parse tree; sequential
                 algorithm; time complexity; tree data structures",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hancart:1993:SSS,
  author =       "Christophe Hancart",
  title =        "On {Simon}'s string searching algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "95--99",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25 68U15)",
  MRnumber =     "94j:68096",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Paris",
  affiliationaddress = "Paris, Fr",
  classification = "716.1; 921; C1160 (Combinatorial mathematics); C4220
                 (Automata theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Inst. Blaise Pascal, Paris 7 Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; automata theory;
                 automaton; Computational complexity; computational
                 complexity; Finite automata; Information science;
                 search problems; String matching; string searching
                 algorithm; time complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1993:SPE,
  author =       "Sang Ho Lee and Lawrence J. Henschen",
  title =        "Semantics and properties of existential quantifiers in
                 deductive databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "101--108",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68T15)",
  MRnumber =     "94h:68047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Soong Sil Univ",
  affiliationaddress = "Seoul, South Korea",
  classification = "716.1; 721.1; 723.3; 921; C4210 (Formal logic);
                 C6160K (Deductive databases); C6170 (Expert systems)",
  corpsource =   "Dept. of Artificial Intelligence, Soong Sil Univ.,
                 Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automatic theorem proving; Computation theory;
                 Database systems; Deductive databases; deductive
                 databases; domain closure axiom; equality axiom;
                 Existential quantifiers; existential quantifiers;
                 extensional databases; Horn databases; Information
                 science; intentional databases; Mathematical
                 techniques; necessary and sufficient condition;
                 proof-theoretic view; Semantics; semantics; theorem
                 proving; unique name axiom",
  treatment =    "P Practical",
}

@Article{Park:1993:TOA,
  author =       "Heonchul Park and Hyoung Joong Kim and Viktor K.
                 Prasanna",
  title =        "An {$O(1)$} time optimal algorithm for multiplying
                 matrices on reconfigurable mesh",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "2",
  pages =        "109--113",
  day =          "20",
  month =        aug,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65F30",
  MRnumber =     "1 234 563",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southern California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "714.2; 721.1; 921.1; C4240 (Programming and
                 algorithm theory); C5220 (Computer architecture)",
  corpsource =   "Dept. of Electr. Eng.-Syst., 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 =     "Algorithms; Area time complexity; computational
                 complexity; Computer architecture; Matrix algebra;
                 Matrix multiplication; multiplying matrices; N*N matrix
                 multiplication; O(1) time optimal algorithm; Parallel
                 processing systems; reconfigurable architectures;
                 reconfigurable mesh; Time optimal algorithm; VLSI
                 circuits",
  treatment =    "P Practical",
}

@Article{Katz:1993:OSS,
  author =       "Matthew J. Katz and Micha Sharir",
  title =        "Optimal slope selection via expanders",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "115--122",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "94h:68222",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel-Aviv Univ",
  affiliationaddress = "Tel-Aviv, Isr",
  classification = "723.5; 921.1; 921.4; 921.5; C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Algorithms; Computational geometry;
                 computational geometry; Computational methods; Expander
                 graphs; expander graphs; expanders; Geometry; Graph
                 theory; optimal algorithms; Optimal deterministic
                 solutions; Optimization; parallel algorithms; Slope
                 selection; slope selection",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shin:1993:IPG,
  author =       "Heung-Chul Shin and Kwang-Moo Choe",
  title =        "An improved {${\rm LALR}(k)$} parser generation for
                 regular right part grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "123--129",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q52 (68Q55)",
  MRnumber =     "1 237 288",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "721.1; 921.6; C4210 (Formal logic); C4220 (Automata
                 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 =     "Algorithms; Computational linguistics; Context free
                 grammars; Descriptive power; deterministic automata;
                 Extended LALR(k) parser; Extended LR(0) automaton;
                 Finite automata; finite automata; Formal languages;
                 grammars; Kernel items; kernel items; LALR(k) parser
                 generation; Nondeterministic finite automata;
                 nondeterministic finite automata; Parser generation;
                 Parser states; Regular right part grammars; regular
                 right part grammars; Space requirements; Stacking
                 conflicts; stacking conflicts; State space methods",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Durand:1993:CET,
  author =       "Ir{\'e}ne Durand and Bruno Salinier",
  title =        "Constructor equivalent term rewriting systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "131--137",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "94j:68134",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite de Bordeaux",
  affiliationaddress = "Talence, Fr",
  classification = "721.1; 723.1; 921.4; C4210 (Formal logic)",
  corpsource =   "Lab. Bordelais de Recherche en Inf., Bordeaux I Univ.,
                 Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational grammars; Computational linguistics;
                 Computer programming; Constructor equivalent systems;
                 constructor equivalent term rewriting systems;
                 Equational programming; Equivalence classes; Formal
                 languages; Formal semantics; forward branching; Forward
                 branching systems; left-linear constructor system;
                 nonconstructor class; orthogonality; Program
                 processors; rewriting systems; Set theory; strong
                 sequentiality; Strongly sequential constructor systems;
                 Term rewriting systems; Thatte's transformation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gopalakrishnan:1993:NCC,
  author =       "K. Gopalakrishnan and D. G. Hoffman and D. R.
                 Stinson",
  title =        "A note on a conjecture concerning symmetric resilient
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "139--143",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "94k:94009",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nebraska-Lincoln",
  affiliationaddress = "Lincoln, NE, USA",
  classification = "716.1; 721.1; 723.2; 921.1; B6120B (Codes); C4200
                 (Computer theory); C6130S (Data security)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Arithmetic properties; arithmetic properties; Binomial
                 coefficients; binomial coefficients; bit extraction
                 problem; Boolean algebra; Boolean functions;
                 Computation theory; computation theory; Cryptography;
                 cryptography; Set theory; Subset sum; subset sum;
                 Symmetric resilient functions; symmetric resilient
                 functions; t-resilient functions; theory of
                 computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luchetti:1993:SCB,
  author =       "Carlo Luchetti and M. Cristina Pinotti",
  title =        "Some comments on building heaps in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "145--148",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "721.1; 722.4; 723.2; 921.4; 921.5; C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  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 =     "Algorithms; Complete binary tree; Computational
                 complexity; Computational methods; Data structures;
                 data structures; Disjoint segments; EREW PRAM model of
                 computation; EREW-PRAM computation model; Heap shape
                 property; Makeheap; Mathematical models; Max ordering
                 property; Optimization; parallel algorithms; Parallel
                 processing systems; Parallel work optimal heap
                 construction; parallel work-optimal heap construction
                 algorithm; random-access storage; Theorem proving;
                 Trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Chang:1993:EBE,
  author =       "Byeong-Mo Chang and Kwang-Moo Choe and Taisook Han",
  title =        "Efficient bottom-up execution of logic programs using
                 abstract interpretation",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "149--157",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17",
  MRnumber =     "1 237 291",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "721.1; 723.1; 723.2; 723.3; 921.4; 921.5; C4250
                 (Database theory); C6110L (Logic programming); C6160K
                 (Deductive databases)",
  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 =     "abstract filter; Abstract filters; abstract
                 interpretation; Abstraction depth; Applicative
                 programming; Automata theory; Bottom up logic program
                 execution; Bottom up phase; bottom-up execution;
                 Computational linguistics; Computational methods; Data
                 processing; Database systems; deductive databases;
                 Graph theory; Logic programming; logic programming;
                 logic programs; Optimization; Program processors; Query
                 languages; query optimization strategy; query
                 processing; seminaive evaluation; Set theory; System
                 graphs; Theorem proving; Top down phase; Trees
                 (mathematics); Two phase abstract interpretation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bright:1993:RRM,
  author =       "Jonathan D. Bright",
  title =        "Range-restricted mergeable priority queues",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "159--164",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "94h:68037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Johns Hopkins Univ",
  affiliationaddress = "Baltimore, MD, USA",
  classification = "721.1; 723.2; 922.1; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore,
                 MD, 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 methods; Data handling; Data
                 structures; data structures; H-heaps; heaps; mergeable;
                 Mergeable heaps; mergeable heaps; Merging; Online
                 operation sequence; Priority queues; priority queues;
                 Queueing theory; queueing theory; range restricted;
                 Range restricted case; Sorting; Subroutines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Steiner:1993:NSU,
  author =       "George Steiner and Scott Yeomans",
  title =        "A note on: {``Scheduling unit-time tasks with integer
                 release times and deadlines'' [Inform. Process. Lett.
                 {\bf 16} (1983), no. 4, 171--173; MR 84m:68030] by G.
                 Frederickson}",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "3",
  pages =        "165--166",
  day =          "14",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (90B35)",
  MRnumber =     "94g:68018",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Frederickson:1983:SUT}.",
  acknowledgement = ack-nhfb,
  affiliation =  "McMaster Univ",
  affiliationaddress = "Hamilton, Ont, Can",
  classification = "721.1; 722.4; 723.2; 921.6; C4240P (Parallel
                 programming and algorithm theory); C6150N (Distributed
                 systems)",
  corpsource =   "Fac. of Bus., McMaster Univ., Hamilton, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithm linearity; Algorithms; Computational
                 complexity; computational complexity; Data processing;
                 Data structures; Deadlines; deadlines; integer release
                 times; Multiprocessing systems; multiprocessing
                 systems; O(n) time; Release times; release times;
                 Scheduling; scheduling; Unit time tasks; unit-time
                 tasks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lim:1993:SJM,
  author =       "Andrew Lim and Yeow Meng Chee and Siu Wing Cheng",
  title =        "Single jog minimum area joining of compacted cells",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "167--172",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35",
  MRnumber =     "1 238 386",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Information Technology Inst",
  affiliationaddress = "Singapore",
  classification = "714.2; 723.1; B1130B (Computer-aided circuit
                 analysis and design); B2570 (Semiconductor integrated
                 circuits); C7410D (Electronic engineering)",
  corpsource =   "Inf. Technol. Inst., National Computed Board,
                 Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Cell joining; circuit layout CAD;
                 Compacted cells; compacted cells; Integrated circuit
                 manufacture; manufacturing yield; O(n/sup 2/) time
                 algorithm; reliability; River routing; Single jog;
                 single jog minimum area joining; vertical segment;
                 VLSI; VLSI circuits; VLSI design",
  treatment =    "P Practical",
}

@Article{Luby:1993:OSV,
  author =       "Michael Luby and Alistair Sinclair and David
                 Zuckerman",
  title =        "Optimal speedup of {Las Vegas} algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "173--180",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "94h:68093",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "723.1; 921.5; 922.2; C4210 (Formal logic)",
  corpsource =   "Int. Comput. Sci. Inst., Berkeley, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Las Vegas algorithms; Los Vegas algorithm;
                 optimal speedup; Optimization; Random processes;
                 randomized algorithm; theorem proving; universal
                 strategy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Xu:1993:OPL,
  author =       "C.- Z. Xu and F. C. M. Lau",
  title =        "Optimal parameters for load balancing using the
                 diffusion method in $k$-ary $n$-cube networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "181--187",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M20)",
  MRnumber =     "94d:68014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Hong Kong",
  affiliationaddress = "Hong Kong",
  classification = "722.3; 722.4; C4230M (Multiprocessor
                 interconnection); C5220 (Computer architecture); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer networks; diffusion method; Diffusion method;
                 diffusion parameter; Distributed computer systems;
                 distributed memory message-passing multiprocessors;
                 distributed memory systems; hypercube networks; k-ary
                 n-cube networks; load balancing; Load balancing;
                 message passing; Multiprocessing systems; n-dimensional
                 torus; optimal parameters; Parallel processing systems;
                 Scheduling",
  treatment =    "P Practical",
}

@Article{Yun:1993:SER,
  author =       "In Sig Yun and Kwang Moo Choe and Taisook Han",
  title =        "Syntactic error repair using repair patterns",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "189--196",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N05",
  MRnumber =     "1 238 389",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "722.4; 723.1; C6150C (Compilers, interpreters and
                 other processors); C6150G (Diagnostic, testing,
                 debugging and evaluating systems); C6150J (Operating
                 systems)",
  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 =     "Error correction; grammar symbols; LR-based
                 implementation; partial function; program compilers;
                 Program compilers; Repair; repair patterns; Repair
                 patterns; syntactic error repair; Syntactic error
                 repair; system recovery",
  treatment =    "P Practical",
}

@Article{Lin:1993:PTS,
  author =       "Yi-Bing Lin",
  title =        "Parallel trace-driven simulation of packet-switched
                 multiplexer under priority scheduling policy",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "197--201",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bell Communications Research",
  affiliationaddress = "Morristown, NJ, USA",
  classification = "716.3; 722.3; 722.4; 723.1; B6150C (Switching
                 theory); B6230 (Switching centres and equipment);
                 C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Bell Commun. Res. Morristown, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer simulation; Multiplexing;
                 multiplexing; packet loss; Packet switching; packet
                 switching; packet-switched multiplexer; parallel
                 algorithms; Parallel processing systems; parallel trace
                 driven simulation; Priority scheduling policies;
                 priority scheduling policy; Scheduling; scheduling",
  treatment =    "P Practical",
}

@Article{Bax:1993:IEA,
  author =       "Eric T. Bax",
  title =        "Inclusion and exclusion algorithm for the
                 {Hamiltonian} Path Problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "203--207",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C45 68Q25)",
  MRnumber =     "94e:05229",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Furman Univ",
  affiliationaddress = "Greensville, SC, USA",
  classification = "721.1; 723.1; 921.6; 922.1; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Furman Univ., Greenville, SC,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; Computational
                 complexity; computational complexity; ending vertex;
                 exclusion algorithm; Graph theory; graph theory;
                 Hamiltonian path problem; inclusion algorithm;
                 Information theory; NP problem; Probability; starting
                 vertex; time complexity; upper bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bhattacharya:1993:FAS,
  author =       "Subir Bhattacharya and A. Bagchi",
  title =        "A faster alternative to {SSS}* with extension to
                 variable memory",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "209--214",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Management Calcutta",
  affiliationaddress = "Calcutta, India",
  classification = "722.1; 723.1; 922.1; C1140E (Game theory); C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C1230 (Artificial intelligence)",
  corpsource =   "Indian Inst. of Manage., Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Alpha-beta; Alpha-Beta; artificial
                 intelligence; Digital storage; Game theory; game
                 theory; game trees; minimax search methods; minimax
                 techniques; Performance; problem solving; RecSSS*;
                 recursive algorithm; runtime performance; search
                 problems; SSS*; trees (mathematics); Variable memory;
                 variable memory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hirschberg:1993:BTT,
  author =       "D. S. Hirschberg and S. S. Seiden",
  title =        "A bounded-space tree traversal algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "4",
  pages =        "215--219",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "723.1; 723.2; 921.6; C6120 (File organisation)",
  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 =     "Algorithms; Binary trees; bounded-space tree traversal
                 algorithm; constant extra space; cyclic list
                 structures; Cyclic list structures; Data structures;
                 Lindstrom scanning; linear time; N-lists; N-trees;
                 Robson traversal; tree data structures; Trees
                 (mathematics)",
  treatment =    "P Practical",
}

@Article{Kim:1993:AAC,
  author =       "Myung Soo Kim and Jae-Woo Ahn and Soon-Bum Lim",
  title =        "An algebraic algorithm to compute the exact general
                 sweep boundary of a $2${D} curved object",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "221--229",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (65D17)",
  MRnumber =     "94h:68223",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "POSTECH",
  affiliationaddress = "Pohang, South Korea",
  classification = "723.5; 921.1; 921.6; C4260 (Computational geometry);
                 C6130B (Graphics techniques)",
  corpsource =   "Dept. of Comput. Sci., Pohang Inst. of Sci. and
                 Technol., South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2D curved object; Algebra; algebraic algorithm;
                 algebraic curve segments; Algebraic curves; Algorithms;
                 brush stroke design; Brush stroke design; computational
                 geometry; Computational geometry; Computational
                 methods; computer graphics; Computer graphics; curve
                 tracing; Curve tracing; Exact general sweep boundaries;
                 exact general sweep boundary; general sweep boundary;
                 Geometry; parametric curve trajectory; plane sweep
                 algorithm; Plane sweep algorithms; resultant curve
                 tracing; Two dimensional curved objects",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1993:SPC,
  author =       "Nageswara S. V. Rao and Ching Luo",
  title =        "On similarity of polynomial configurations",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "231--236",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "94j:68303",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "721.1; 723.5; 921.1; 921.3; C4130 (Interpolation and
                 function approximation); C4190 (Other numerical
                 methods); 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 =     "Affine transformations; affine transformations;
                 Algorithms; Bezier polygons; Computational complexity;
                 computational complexity; Computational methods;
                 equivalence; Fast Fourier transforms; fast Fourier
                 transforms; Geometry; mirror reflection; Polynomial
                 configurations; polynomial configurations; Polynomial
                 curves; polynomial curves; Polynomial manipulations;
                 polynomial manipulations; Polynomials; polynomials;
                 rotation; scaling; translation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1993:SFS,
  author =       "Byeong-Mo Chang and Kwang-Moo Choe and Taisook Han",
  title =        "Static filtering on stratified programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "237--244",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N05",
  MRnumber =     "1 245 140",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "721.1; 723.1; 723.3; 921.3; 921.4; 921.5; C6110L
                 (Logic programming); C6160 (Database management systems
                 (DBMS)); 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 =     "Computational complexity; Computational linguistics;
                 Computational methods; database management systems;
                 Database systems; Graph theory; Iterated fixed point
                 semantics; iterated fixed point semantics; least fixed
                 point; Least fixed points; Logic programming; logic
                 programming; Mathematical transformations;
                 Optimization; Program processors; Query languages;
                 Query optimization; query optimization strategy; query
                 processing; seminaive evaluation; Static filtering;
                 static filtering; Stratified programs; stratified
                 programs; System graphs",
  treatment =    "P Practical",
}

@Article{Park:1993:RP,
  author =       "Woo-Jun Park and Myung-Joon Lee and Kwang-Moo Choe",
  title =        "On the reduction of {${\rm LR}(k)$} parsers",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "245--251",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q52",
  MRnumber =     "1 245 141",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "721.1; 921.5; C4210 (Formal logic)",
  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 =     "Computational grammars; Computational linguistics;
                 Formal languages; formal languages; grammars; Locally
                 optimal reduction; LR(k) parsers; optimal reduction;
                 Optimization; optimization; reduction; Static merging;
                 static merging; Well defined reduction",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alonso:1993:DM,
  author =       "Laurent Alonso and Edward M. Reingold and Ren{\'e}
                 Schott",
  title =        "Determining the majority",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "253--255",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "94i:68105",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite de Nancy",
  affiliationaddress = "Paris, Fr",
  classification = "741.1; 921.4; 922.1; C1140E (Game theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "CRIN, Nancy I Univ., Vandoeuvre, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; analysis of algorithms;
                 binary representation; Binary sequences; Colored
                 graphs; colour comparisons; Decision theory; decision
                 theory; Decision trees; decision trees; Graph theory;
                 lower bound; Lower bounds; majority; majority color;
                 Majority color determination; Pairwise equal/not equal
                 color comparison; Set theory; Theorem proving; Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{deAlmeida:1993:SMA,
  author =       "Nalvo F. {{de Almeida}, Jr.} and Valmir C. Barbosa",
  title =        "A string-matching algorithm for the {CREW PRAM}",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "257--259",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T10",
  MRnumber =     "1 245 143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "UFMS",
  affiliationaddress = "Campo Grande, Braz",
  classification = "721.1; 722.4; 723.2; 723.5; 921.5; C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. de Comput. e Estatistica, Univ. Federal de Minas
                 Gerais, Campo Grande, Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computational complexity; computational
                 complexity; Computational methods; crew pram; CREW
                 PRAM; Data processing; Data structures; fixed alphabet;
                 O(log m) time; O(n/log m) processors; Optimization;
                 parallel algorithms; Parallel processing systems;
                 Parallel random access machines; Pattern matching;
                 pattern matching; Pattern recognition; String matching;
                 string matching; string matching algorithm; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gurla:1993:LOC,
  author =       "Himabindu Gurla",
  title =        "Leftmost one computation on meshes with row
                 broadcasting",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "261--266",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "721.1; 722.4; 723.5; 741.2; 921.1; C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry); C5260B (Computer vision and picture
                 processing); C6130B (Graphics techniques)",
  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; Computational complexity; computational
                 geometry; Computational methods; Computer graphics;
                 computer graphics; Digitized geometry; digitized
                 geometry; Geometry; Image processing; image processing;
                 leftmost one computation; Leftmost one computations;
                 leftmost one problem; Matrix algebra; Meshes with row
                 broadcasting; Parallel algorithms; parallel algorithms;
                 Parallel processing systems; row broadcasting;
                 unbounded memory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vaidyanathan:1993:OSM,
  author =       "Ramachandran Vaidyanathan and Jerry L. Trahan",
  title =        "Optimal simulation of multidimensional reconfigurable
                 meshes by two-dimensional reconfigurable meshes",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "5",
  pages =        "267--273",
  day =          "8",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35",
  MRnumber =     "1 245 144",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "714.2; 722.4; 921.5; 921.6; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., 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; Bus automation; Computational methods;
                 Integrated circuit layout; Mathematical models;
                 multidimensional mesh; Multidimensional reconfigurable
                 meshes; multidimensional reconfigurable meshes;
                 multiprocessor interconnection networks; optimal
                 simulation; Optimization; parallel algorithms; Parallel
                 processing systems; Parallel random access machines;
                 Polymorphic torus; PRAM; Processor array with a
                 reconfigurable bus system; Reconfigurable bus systems;
                 reconfigurable mesh; simulation; two-dimensional
                 reconfigurable meshes; VLSI; VLSI circuits; VLSI
                 layout",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arkin:1993:ATT,
  author =       "Esther M. Arkin and Magn{\'u}s M. Halld{\'o}rsson and
                 Refael Hassin",
  title =        "Approximating the tree and tour covers of a graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "275--282",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C05 68Q25 68R10)",
  MRnumber =     "94j:05113",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York at Stony Brook",
  affiliationaddress = "Stony Brook, NY, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math. and Stat., State Univ. of New
                 York, Stony Brook, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; Approximation
                 theory; closed walk; Combinatorial problems;
                 computational complexity; constant factor
                 approximation; edge-weighted graph; graph theory;
                 minimum weight tree; NP-hard; Steiner tree problems;
                 strongly polynomial time; Subroutines; Tour covers;
                 tour covers; traveling salesman; Tree; tree cover
                 problems; trees (mathematics); vertex cover; weighted
                 vertex cover",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Krizanc:1993:ISM,
  author =       "Danny Krizanc",
  title =        "Integer sorting on a mesh-connected array of
                 processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "283--289",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68M10)",
  MRnumber =     "94m:68031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "714.2; 723; 921; C4240P (Parallel programming and
                 algorithm theory); C6130 (Data handling techniques)",
  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 =     "2n + o(n) steps; Algorithms; computational complexity;
                 Data handling; deterministic algorithm; Integer
                 sorting; integer sorting; Mathematical models; Mesh
                 connected array; mesh-connected array; parallel
                 algorithm; parallel algorithms; Polynomial size range;
                 Processors; Sorting; sorting; VLSI circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gumm:1993:AGA,
  author =       "H. Peter Gumm",
  title =        "Another glance at the {Alpern-Schneider}
                 characterization of safety and liveness in concurrent
                 executions",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "291--294",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q55)",
  MRnumber =     "94i:68081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Marburg",
  affiliationaddress = "Marburg, Ger",
  classification = "721; 723; 921; C4210 (Formal logic); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "FB Math., Marburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Alpern Schneider characterization; Alpern-Schneider
                 characterization; Boolean algebra; complete Boolean
                 algebras; Computation theory; Computer programming;
                 concurrency; concurrency control; concurrent
                 executions; concurrent program; Liveness; liveness;
                 parallel algorithms; Progress; progress; Safety;
                 safety; Safety factor; Semantics; semantics; transition
                 system; transition systems; UNITY; UNITY-style logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shen:1993:SBA,
  author =       "Zhizhang Shen",
  title =        "Static behavior analysis of a mesh system",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "295--299",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Plymouth State Coll",
  affiliationaddress = "Plymouth, USA",
  classification = "722; 723; 921; C4230M (Multiprocessor
                 interconnection)",
  corpsource =   "Dept. of Comput. Sci., Plymouth State Coll., NH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; average time; bounded mesh architecture;
                 Combinatorial problems; Computer architecture;
                 Distributed systems; interprocessor communication;
                 Mathematical models; mesh system; multiprocessor
                 interconnection networks; parallel processing systems;
                 Performance evaluation; preferred paths; Processors;
                 routing algorithm; shortest path",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Haastad:1993:WCA,
  author =       "Johan H{\aa}stad and Steven Phillips and Shmuel
                 Safra",
  title =        "A well-characterized approximation problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "301--305",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25)",
  MRnumber =     "94i:68096",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "The Royal Inst of Technology",
  affiliationaddress = "Stockholm, Sweden",
  classification = "721; 723; 921; C1180 (Optimisation techniques);
                 C4130 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Numerical Anal. and 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 =     "Algorithms; Approximation algorithms; approximation
                 problem; Approximation theory; approximation theory;
                 Computation theory; Computational complexity;
                 computational complexity; nontrivial equations; NP
                 optimization; optimisation; Optimization; polynomial
                 time; Polynomials; polynomials; quadratic equations;
                 rational numbers; root; theory of computation; time
                 complexity; Variables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Udink:1993:UPS,
  author =       "R. T. Udink and J. N. Kok",
  title =        "Unity properties and sequences of states, some
                 observations",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "307--311",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Utrecht Univ",
  affiliationaddress = "Utrecht, Neth",
  classification = "721; 732; 921; C4210 (Formal logic); C4240
                 (Programming and algorithm theory); C6110L (Logic
                 programming)",
  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 =     "Computation theory; Computer programming; Computer
                 science; execution sequences; leads to; logic
                 programming; Mathematical models; program refinement;
                 program specification; Program specification;
                 programming theory; property preserving; stepwise
                 refinement; Stepwise refinement; unity; Unity programs;
                 Unity properties; unless",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huhne:1993:LSD,
  author =       "Martin H{\"u}hne",
  title =        "Linear speed-up does not hold on {Turing} machines
                 with tree storages",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "313--318",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05",
  MRnumber =     "95c:68070",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Dortmund",
  affiliationaddress = "Dortmund, Ger",
  classification = "721; 723; 921; C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lehrstuhl f{\"u}r Inf. II, Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; Computation theory; computation time;
                 Computational complexity; computational complexity;
                 Computer science; Formal logic; Kolmogorov complexity;
                 Lower bounds; lower bounds; speed-up; time complexity;
                 Tree storage; tree storage; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eades:1993:FEH,
  author =       "Peter Eades and Xuemin Lin and W. F. Smyth",
  title =        "A fast and effective heuristic for the feedback arc
                 set problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "319--323",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "94j:05119",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Newcastle",
  affiliationaddress = "Callaghan, Aust",
  classification = "721; 723; 921; C4240 (Programming and algorithm
                 theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Newcastle Univ., NSW,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; analysis of
                 algorithms; asymptotic performance bound; Berger-Shor
                 algorithm; Combinatorial problems; combinatorial
                 problems; computational complexity; Computer science;
                 Data structures; data structures; Digraphs; digraphs;
                 directed graph; directed graphs; FAS problem; Feedback
                 arc set; feedback arc set problem; graph drawing; Graph
                 theory; heuristic; running time; Subroutines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1993:TSP,
  author =       "Danny Z. Chen and Sumantha Guha",
  title =        "Testing a simple polygon for monotonicity optimally in
                 parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "47",
  number =       "6",
  pages =        "325--331",
  day =          "18",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q22 68Q25)",
  MRnumber =     "94i:68282",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Notre Dame",
  affiliationaddress = "Notre Dame, IN, USA",
  classification = "721; 723; 921; C4240P (Parallel programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Notre Dame Univ., IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computation theory; computational
                 complexity; Computational geometry; computational
                 geometry; geometry; Monotonicity; monotonicity; O(log
                 n) time; O(n/log n) EREW PRAM processors; optimal
                 parallel algorithms; parallel algorithm; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems; simple polygon; Simple polygons; triangulating
                 polygons",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hall:1993:UOE,
  author =       "C. V. Hall",
  title =        "Using overloading to express distinctions between
                 evaluators",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "1--8",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data types; abstract interpretations;
                 abstract semantics; appropriate version execution;
                 concrete semantics; debugging information; evaluators;
                 flat domains; functional programming; Haskell type
                 system; high level languages; implementation;
                 interpreters; language paradigms; meaning; overloading;
                 program interpreters; programming languages; safety
                 conditions verification; strictness analysis; type
                 classes; type signature",
  treatment =    "P Practical",
}

@Article{Buchsbaum:1993:DUC,
  author =       "Adam L. Buchsbaum and Martin C. Carlisle",
  title =        "Determining uni-connectivity in directed graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "9--12",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (05C40 05C85 68Q25)",
  MRnumber =     "95a:05044",
  MRreviewer =   "Kathryn Fraughnaugh",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "721.1; 723.1; 921.4; C1160 (Combinatorial
                 mathematics); 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 =     "algorithm design; Algorithms; arcs; chords; Chords;
                 computational complexity; Computational complexity;
                 connectivity; contraction; Contraction; Critical path
                 analysis; depth-first searches; directed graphs;
                 Directed graphs; graph algorithms; Graph connectivity;
                 Graph theory; search problems; simple paths;
                 uniconnectivity; vertex pair",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hachem:1993:AAP,
  author =       "Nabil I. Hachem",
  title =        "An Approximate Analysis of the Performance of
                 Extendible Hashing with Elastic Buckets",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "13--20",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  affiliation =  "Worcester Polytechnic Inst",
  affiliationaddress = "Worcester, MA, USA",
  classification = "723.1; 723.2; 921; C4240 (Programming and algorithm
                 theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Worcester Polytech. Inst., MA,
                 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 analysis; Approximation theory; Data
                 handling; data management; Data structures; data
                 structures; elastic buckets; Extendible hashing;
                 extendible hashing; file organisation; file structures;
                 fixed bucket capacities; Performance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ahuja:1993:AAP,
  author =       "Mohan Ahuja",
  title =        "Assertions about past and future in {{\em Highways}}:
                 {Global} flush broadcast and flush-vector-time",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "21--28",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See erratum \cite{Ahuja:1996:AAP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "La Jolla, CA, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 912.2; 921; C6115
                 (Programming support); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., 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 =     "Algorithms; Asynchronous distributed systems;
                 broadcast primitives; Broadcasting; broadcasting;
                 Computational complexity; Computer programming;
                 Computer software; Data communication systems;
                 Distributed computer systems; distributed processing;
                 distributed-programming toolkit; Flush vector time;
                 flush-vector time; GFBCASTs; Global flush broadcast;
                 Highways; Message broadcast primitives; Multimedia;
                 Software toolkit Highways; software tools;
                 Synchronization; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yellin:1993:FES,
  author =       "Daniel M. Yellin and Charanjit S. Jutla",
  title =        "Finding extremal sets in less than quadratic time",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "29--34",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "95a:68053",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "721.1; 723.1; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "IBM 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; algorithms; Computational complexity;
                 computational complexity; expected time; Extremal sets;
                 extremal sets; maximal sets; minimal sets; Set theory;
                 set theory; worst case complexity; worst case time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hwang:1993:SSD,
  author =       "Tzonelih Hwang",
  title =        "Scheme for secure digital mobile communications based
                 on symmetric key cryptography",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "35--37",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Cheng Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "716.3; 722.2; 722.3; 723.2; B6120B (Codes); B6250F
                 (Mobile radio systems)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer networks; Cryptography; cryptography; Data
                 processing; Digital communication systems; digital
                 mobile communications; hardware-limited terminals; Key
                 distribution; key distribution; Keys (for locks);
                 mobile communication systems; mobile communications;
                 Mobile telecommunication systems; secure digital mobile
                 communications; Security of data; Smart cards;
                 Symmetric key cryptography; symmetric key cryptography;
                 symmetric key cryptosystems; User authentication; user
                 authentication",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Santos:1993:RMS,
  author =       "J. Santos and J. Orozco",
  title =        "Rate monotonic scheduling in hard real-time systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "39--45",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "1 256 790",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad Nacional del Sur",
  affiliationaddress = "Bahia Blanca, Argent",
  classification = "722.4; 723.1; 912.2; 921.5; C6150N (Distributed
                 systems)",
  corpsource =   "Univ. Nacional del Sur, Bahia Blanca, Argentina",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "coarse granularity; Computer architecture; isomorphic
                 system; LANs; local area networks; message
                 communications; Multiple tasks single processor (MTSP)
                 architecture; Multiprogramming; network scheduling;
                 Optimization; priority levels; processor scheduling;
                 Rate monotonic scheduling; rate monotonic scheduling;
                 Real time systems; Real-Time Multiple Tasks-Single
                 Processor; real-time systems; resource allocation;
                 schedulability bound given; Scheduling; scheduling;
                 task allocation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yu:1993:SOP,
  author =       "Ming Shing Yu and Cheng Hsing Yang",
  title =        "A simple optimal parallel algorithm for the minimum
                 coloring problem on interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "1",
  pages =        "47--51",
  day =          "29",
  month =        oct,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C15 68Q25 68R10)",
  MRnumber =     "94i:05100",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung-Hsing Univ",
  affiliationaddress = "Taichung, Taiwan",
  classification = "721.1; 722.4; 723.1; 921.4; C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Dept. of Applied Math., Nat. Chung-Hsing Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 complexity; computational geometry; EREW PRAM model;
                 graph colouring; Graph theory; interval graphs;
                 Interval graphs; minimum coloring problem; Minimum
                 coloring problem; optimal parallel algorithm; parallel
                 algorithms; Parallel algorithms; Parallel processing
                 systems; Parallel random access machine (pram)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Karloff:1993:FAA,
  author =       "Howard Karloff",
  title =        "Fast algorithms for approximately counting
                 mismatches",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "53--60",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25 68U15)",
  MRnumber =     "94i:68110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Institute of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "721; 901.3; 921; C1250 (Pattern recognition); C4240
                 (Programming and algorithm theory); C5260B (Computer
                 vision and picture processing)",
  corpsource =   "Coll. of Comput., 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 =     "Algorithms; approximately counting mismatches;
                 Approximation Theory; computational complexity;
                 Deterministic algorithms; deterministic algorithms;
                 Fast algorithms; fast algorithms; mismatches; Pattern
                 recognition; pattern recognition; pattern string;
                 Random number generation; randomized algorithms; text
                 string; worst-case time",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pretolani:1993:LTA,
  author =       "Daniele Pretolani",
  title =        "A linear time algorithm for unique {Horn}
                 satisfiability",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "61--66",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (03B05 03D15)",
  MRnumber =     "95d:68064",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "721; 721.1; 921.4; C1160 (Combinatorial
                 mathematics); C4210 (Formal logic); 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 =     "Algorithms; co-NP complete; Computational complexity;
                 computational complexity; directed graphs; Directed
                 hypergraphs; directed hypergraphs; Disjoint set union;
                 disjoint set union problem; Horn clauses; Horn
                 formulas; hypergraph transformation technique; linear
                 amortized time algorithms; linear time algorithm;
                 NP-complete; polynomial time; polynomially solvable
                 SAT; Polynomials; Satisfiability; Set theory; Time
                 algorithm; unique Horn satisfiability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1993:ILP,
  author =       "Wuu Yang",
  title =        "An incremental {LL(1)} parsing algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "67--72",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Chiao-Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 921.4; C1160 (Combinatorial mathematics);
                 C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. and Inf. 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 =     "Algorithmic languages; Algorithms; break-point table;
                 Computational grammars; formal languages; grammar;
                 grammars; incremental LL(1) parsing algorithm;
                 Incremental parsing; Language based; parse tree;
                 Program processors; reusable subtrees; sentence; trees
                 (mathematics); Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Atkinson:1993:EWT,
  author =       "M. D. Atkinson and Louise Walker",
  title =        "Enumerating $k$-way trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "73--75",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (05C05 68R05)",
  MRnumber =     "1 256 794",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "921.4; C1160 (Combinatorial mathematics); C6120
                 (File organisation)",
  corpsource =   "Dept. of Math. and Comput. Sci., St. Andrews Univ.,
                 UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Cayley's enumeration formula; Combinatorial
                 mathematics; combinatorial mathematics; Enumeration;
                 enumeration of trees; k-way trees; labelled trees;
                 Problems; root node; Set theory; software systems; tree
                 data structures; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Steel:1993:KTT,
  author =       "Mike Steel and Tandy Warnow",
  title =        "{Kaikoura} tree theorems: Computing the maximum
                 agreement subtree",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "77--82",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R05 92B10 92D15)",
  MRnumber =     "95d:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massey Univ",
  affiliationaddress = "Palmerston, New Zealand",
  classification = "921.4; 921.6; C1160 (Combinatorial mathematics);
                 C1180 (Optimisation techniques); C4240 (Programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Dept. of Math., Massey Univ., Palmerston North, New
                 Zealand",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis; Combinatorial mathematics;
                 Combinatorial problems; computational complexity;
                 computational geometry; evolutionary tree construction;
                 Kaikoura tree theorems; maximum agreement subtree;
                 maximum cardinality subset; Search problem; search
                 problems; Set theory; set theory; Subtree;
                 superpolynomial time algorithm; Trees (mathematics);
                 trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gartner:1993:RRL,
  author =       "Stefan G{\"a}rtner",
  title =        "A remark on the regulation of $k${lETOL} systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "83--85",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "94k:68109",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Univ Braunschweig",
  affiliationaddress = "Postfach, Ger",
  classification = "721; 901.3; 921; C4210 (Formal logic)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., Tech. Univ. Braunschweig,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Formal Languages; formal languages; k-limited ET0L
                 systems; k1ET0L systems; Limited ETOL systems;
                 Mechanisms; regular control; regulated k-limited ET0L
                 systems; Regulated Rewriting; regulated rewriting;
                 regulation; rewriting systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chinn:1993:BSS,
  author =       "Donald D. Chinn and Rakesh K. Sinha",
  title =        "Bounds on sample space size for matrix product
                 verification",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "87--91",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "95c:68103",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington",
  affiliationaddress = "Seattle, WA, USA",
  classification = "721; 901.3; 921; C1140 (Probability and statistics);
                 C4140 (Linear algebra); 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 =     "algorithm theory; Algorithms; Analysis;
                 Characterization; computational complexity; Matrix
                 algebra; matrix algebra; Matrix product; matrix product
                 verification; Probabilistic algorithms; probabilistic
                 algorithms; probabilistic matrix product verification
                 algorithm; probability; time-randomness tradeoff",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1993:BPO,
  author =       "Sanjay Gupta",
  title =        "On bounded-probability operators and {${\rm C}_={\rm
                 P}$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "93--98",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "95a:68041",
  MRreviewer =   "Mark R. Jerrum",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "The Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "721; 901.3; 921; C1140 (Probability and statistics);
                 C4130 (Interpolation and function approximation); C4240
                 (Programming and algorithm 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 =     "bounded-probability operators; computational
                 complexity; Computational methods; counting complexity;
                 Large scale systems; Polynomial time hierarchy;
                 polynomial time hierarchy; Polynomials; polynomials;
                 Probabilistic classes; Probability; probability;
                 probability classes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Voss:1993:WCP,
  author =       "Stefan Voss",
  title =        "Worst-case performance of some heuristics for
                 {Steiner}'s problem in directed graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "99--105",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (05C20 05C85 68Q25)",
  MRnumber =     "94j:05042",
  MRreviewer =   "Ding Zhu Du",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Hochschule Darmstadt",
  affiliationaddress = "Dermstadt, Ger",
  classification = "721; 901.3; 921; 921.4; B0250 (Combinatorial
                 mathematics); B0260 (Optimisation techniques); C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4240 (Programming and algorithm theory)",
  corpsource =   "Tech. Hochschule Darmstadt, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; approximate solutions; directed
                 graphs; Graph theory; Graphic methods; Heuristic
                 programming; heuristics; minimisation; minimum-cost
                 subgraph; NP-hardness; set theory; Steiner's problem;
                 Worst case performance; worst-case performance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tscha:1993:RNC,
  author =       "Yeonghwan Tscha and Yanghee Choi and Kyoon Ha Lee",
  title =        "Rearrangeable nonblocking condition for
                 multi-{$\log_2N$} multiconnection networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "107--112",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Seoul National Univ",
  affiliationaddress = "Seoul, South Korea",
  classification = "721.1; 722.4; 903; C1160 (Combinatorial
                 mathematics); C4230M (Multiprocessor interconnection);
                 C5220 (Computer architecture)",
  corpsource =   "Comput. Network Res. Center, Seoul Nat. Univ., South
                 Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bipartite multigraph; Bipartite multigraph; broadband
                 networks; computer architecture; Computer architecture;
                 Edge coloring; edge-coloring algorithm; graph
                 colouring; high-speed multicast switches; Information
                 science; multi-log/sub 2/N multiconnection networks;
                 Multiconnection network; multiprocessor interconnection
                 networks; necessary and sufficient condition; Networks
                 (circuits); Nonblocking condition; Parallel processing
                 systems",
  treatment =    "P Practical",
}

@Article{Shah:1993:PAC,
  author =       "Nimish R. Shah",
  title =        "A parallel algorithm for constructing projection
                 polyhedra",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "113--119",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q22 68Q25)",
  MRnumber =     "94i:68302",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Urbana Champaign",
  affiliationaddress = "Urbana, IL, USA",
  classification = "721.1; 722.4; 921.6; C4240P (Parallel programming
                 and algorithm theory); C4260 (Computational geometry)",
  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 =     "Algorithms; boundary complex; computational
                 complexity; Computational geometry; computational
                 geometry; Computational methods; convex polyhedron;
                 CREW PRAM model; data structure; Geometry; Mathematical
                 models; Parallel algorithm; parallel algorithm;
                 parallel algorithms; polytopical; Projection polyhedra;
                 projection polyhedra construction; random-access
                 storage; Simple cell complexes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chang:1993:MLP,
  author =       "Ee-Chien Chang and Weiguo Wang and Mohan S.
                 Kankanhalli",
  title =        "Multidimensional on-line bin-packing: an algorithm and
                 its average-case analysis",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "121--125",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68P20 68Q25)",
  MRnumber =     "94j:68094",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Univ of Singapore",
  affiliationaddress = "Kent Ridge, Singapore",
  classification = "721.1; 722.4; 903; 921.4; C1290 (Applications of
                 systems theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Inst. of Syst. Sci., Nat. Univ. of Singapore,
                 Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis; Average case analysis;
                 average-case analysis; Bin packing; computational
                 complexity; Computer aided analysis; Information
                 science; linear time; multidimensional online bin
                 packing; Online algorithms; operations research",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fujita:1993:FGS,
  author =       "Satoshi Fujita and Masafumi Yamashita",
  title =        "Fast gossiping on square mesh computers",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "127--130",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q22)",
  MRnumber =     "1 256 802",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hiroshima Univ",
  affiliationaddress = "Higashi-Hiroshima, Jpn",
  classification = "721.1; 722.4; 723.1; 921.4; C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Hiroshima Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer science; Computers; fast
                 gossiping; Gossiping; half-duplex; Mesh computers;
                 Optimal time bounds; Parallel algorithms; parallel
                 algorithms; Parallel processing systems; square mesh
                 computers",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hensgen:1993:FBA,
  author =       "Debra A. Hensgen and David L. Sims and David Charley",
  title =        "A fair {Banker's Algorithm} for read and write locks",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "131--137",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Cincinnati",
  affiliationaddress = "Cincinnati, OH, USA",
  classification = "721.1; 722.4; 723.1; C6150J (Operating systems);
                 C6150N (Distributed systems)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Cincinnati Univ.,
                 OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Banker's algorithm; Bankers algorithm;
                 Computer operating systems; Computer science;
                 concurrency control; Deadlock avoidance; Fairness;
                 fairness; liberal deadlock avoidance algorithm;
                 nonpreemptable resources; Resource allocation; resource
                 allocation; system recovery",
  treatment =    "P Practical",
}

@Article{Sieling:1993:ROL,
  author =       "Detlef Sieling and Ingo Wegener",
  title =        "Reduction of {OBDDs} in linear time",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "139--144",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "1 256 803",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Dortmund",
  affiliationaddress = "Dortmund, Ger",
  classification = "721.1; 722.4; 732.1; 921.4; C4210 (Formal logic);
                 C6120 (File organisation)",
  corpsource =   "FB Inf., Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary decision diagram; Boolean
                 functions; CAD tools; Circuit theory; data structure;
                 Data structures; data structures; Decision theory;
                 Digital arithmetic; linear time; Logic programming;
                 logical synthesis process; optimal linear time; Ordered
                 binary decision diagram (OBDD); ordered binary decision
                 diagrams reduction; reduction algorithm; test pattern
                 generation; verification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ramarao:1993:LBD,
  author =       "K. V. S. Ramarao and S. Venkatesan",
  title =        "The lower bounds on distributed shortest paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "145--149",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Southwestern Bell Company",
  affiliationaddress = "St. Louis, MO, USA",
  classification = "721.1; 722.4; 723.1; 921.6; C4230 (Switching
                 theory); C4240P (Parallel programming and algorithm
                 theory); C5620 (Computer networks and techniques)",
  corpsource =   "Technol. Resources, Southwestern Bell Co., St. Louis,
                 MO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis; communication complexity;
                 Distributed computer systems; distributed processing;
                 distributed shortest paths; lower bounds; Lower bounds;
                 Mathematical techniques; message complexities; Message
                 complexity; Numerical analysis; Shortest paths;
                 verification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bennaceur:1993:EAC,
  author =       "Hachemi Bennaceur and G{\'e}rard Plateau",
  title =        "An exact algorithm for the constraint satisfaction
                 problem: application to logical inference",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "3",
  pages =        "151--158",
  day =          "19",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (03B05 03B35 03D15 68T15)",
  MRnumber =     "95c:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Paris XIII",
  affiliationaddress = "Villetaneuse, Fr",
  classification = "721.1; 723.1; 732; 921.4; C1180 (Optimisation
                 techniques); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory); C6110L (Logic programming);
                 C6170 (Expert systems)",
  corpsource =   "Lab. d'Inf. de Paris-Nord, XIII Univ., Villetaneuse,
                 France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-SAT; 4-SAT; Algorithms; Artificial intelligence;
                 artificial intelligence; Automata theory; computational
                 complexity; constraint handling; Constraint
                 satisfaction; constraint satisfaction problem;
                 Constraint theory; CSP instances; exact algorithm;
                 generalized covering type; inference mechanisms;
                 integer programming; Logic programming; Logical
                 inference; logical inference; operational research;
                 Operations research; propositional logic; system expert
                 type instances; theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Khoong:1993:OPC,
  author =       "C. M. Khoong",
  title =        "Optimal parallel construction of heaps",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "159--161",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Information Technology Inst",
  affiliationaddress = "Singapore",
  classification = "723.1; 723.2; 903.1; C4240P (Parallel programming
                 and algorithm theory); C6120 (File organisation)",
  corpsource =   "Inf. Technol. Inst., Nat. Comput. Board, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "abstract data types; Algorithms; Data processing;
                 Heaps; Information science; optimal parallel
                 construction of heaps; Optimization; parallel
                 algorithms; Parallel algorithms; parallel comparison
                 tree model; parallel lower bound; Parallel processing
                 systems; processor-time product; sequential lower
                 bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1993:DDB,
  author =       "DongGill Lee and Kwang-Moo Choe and Taisook Han",
  title =        "A description of dynamic behavior for compilers based
                 on object oriented modeling",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "163--170",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Electronics and Telecommunications Research Inst",
  affiliationaddress = "Daejon, South Korea",
  classification = "723.1; 723.2; 903.1; C6110B (Software engineering
                 techniques); C6110J (Object-oriented programming);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Software Dev. Environ. Sect., Electron. Telecommin.
                 Res. Inst., Daejon, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Attribute states; Compilers; compilers; Data
                 processing; dynamic behavior; Finite automata;
                 Information science; Language semantics; object
                 oriented modeling; Object oriented programming;
                 object-oriented methods; program compilers; software
                 engineering; software modularity; software
                 reusability",
  treatment =    "P Practical",
}

@Article{Reichwein:1993:MSA,
  author =       "Georg Reichwein and Jos{\'e} Luiz Fiadeiro",
  title =        "Models for the substitution axiom of {UNITY} logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "171--176",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B70",
  MRnumber =     "94k:03037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "INESC",
  affiliationaddress = "Lisboa, Port",
  classification = "721.1; 723.1.1; 903.1; C6110P (Parallel
                 programming); C6140D (High level languages)",
  corpsource =   "INESC, Lisbon, Portugal",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer programming languages; Information science;
                 Logic design; meta-logical character; parallel
                 languages; parallel programming; program design
                 language; Program modularity; substitution axiom;
                 Substitution axioms; Unity logic; UNITY logic",
  treatment =    "P Practical",
}

@Article{Tsai:1993:CRA,
  author =       "Ying Teh Tsai and Chuan Yi Tang",
  title =        "The competitiveness of randomized algorithms for
                 on-line {Steiner} tree and on-line spanning tree
                 problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "177--182",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20",
  MRnumber =     "1 266 939",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "722.4; 723.1; 903.1; 922.2; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  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 =     "Algorithm R(m); algorithm theory; Algorithms;
                 computational complexity; deterministic greedy
                 algorithm; Euclidean space; Online spanning tree;
                 online spanning tree problems; Online Steiner tree;
                 online Steiner tree; Online systems; Random processes;
                 randomized algorithms; tree data structures",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fulop:1993:IDT,
  author =       "Z. F{\"u}l{\"o}p and P. Gyenizse",
  title =        "On injectivity of deterministic top-down tree
                 transducers",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "183--188",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q70 (03D35)",
  MRnumber =     "94k:68142",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Szeged",
  affiliationaddress = "Szeged, Hungary",
  classification = "723.1; 723.2; 903.1; 922.2; C4210 (Formal logic);
                 C4220 (Automata theory)",
  corpsource =   "Dept. of Appl. Comput. Sci., Univ. of Szeged,
                 Hungary",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Codes (symbols); Data processing; decidability;
                 Decision theory; deterministic automata; deterministic
                 top-down tree transducers; homomorphism tree
                 transducers; Information science; injectivity; Theory
                 of computation; Topdown tree transducers; Tree codes;
                 Undecidability",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Tan:1993:RSM,
  author =       "Kian-Lee Tan and Hongium Lu",
  title =        "On resource scheduling of multi-join queries in
                 parallel database systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "189--195",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Univ of Singapore",
  affiliationaddress = "Singapore",
  classification = "722.4; 723.2; 723.3; C6150J (Operating systems);
                 C6160D (Relational DBMS); C7250 (Information storage
                 and retrieval)",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm FlexiShelf; algorithm MaxShelf; algorithm
                 MinShelf; Database systems; Hash join; Management;
                 Multi joint queries; multi-join queries; parallel
                 database systems; parallel processing; Parallel
                 processing systems; Pipelining; Query languages; query
                 processing; relational databases; resource allocation;
                 resource scheduling; Scheduling; scheduling; two-phase
                 optimization approach",
  treatment =    "P Practical",
}

@Article{Paterson:1993:SPD,
  author =       "Michael S. Paterson and Heiko Schr{\"o}der and Ondrej
                 S\'ykora and Imrich V{\v{r}}{\soft{t}}o",
  title =        "A short proof of the dilation of a toroidal mesh in a
                 path",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "197--199",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C90 68Q35)",
  MRnumber =     "94k:68163",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Warwick",
  affiliationaddress = "Coventry, Engl",
  classification = "721.3; 723.2; 903.1; 921.6; C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Warwick, Coventry,
                 UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational geometry; Computer architecture; Data
                 processing; Dilation; dilation; Embedding; Information
                 science; mn-vertex path; Parallel processing systems;
                 Toroidal mesh; toroidal mesh; VLSI circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Buhrman:1993:TQS,
  author =       "Harry Buhrman and Leen Torenvliet and Peter {van Emde
                 Boas}",
  title =        "Twenty questions to a $p$-selector",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "201--204",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D15 (68Q15)",
  MRnumber =     "1 266 942",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Amsterdam",
  affiliationaddress = "Amsterdam, Neth",
  classification = "721.1; 723.1; 903.1; 921.6; C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Amsterdam Univ.,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; computational complexity;
                 Information science; many-one reducible; p-selective
                 set; Polynomials; positive Turing reducible; Turing
                 machines; Wheel selector",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1993:PAW,
  author =       "Maw Shang Chang and Yi Chang Liu",
  title =        "Polynomial algorithms for the weighted perfect
                 domination problems on chordal graphs and split
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "4",
  pages =        "205--210",
  day =          "29",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25)",
  MRnumber =     "94k:05181",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chung Cheng Univ",
  affiliationaddress = "Chiayi, Taiwan",
  classification = "723.1; 723.2; 903.1; 921.6; B0250 (Combinatorial
                 mathematics); B0290F (Interpolation and function
                 approximation); C1160 (Combinatorial mathematics);
                 C4130 (Interpolation and function approximation); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. 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 =     "algorithm theory; chordal graphs; Chordal graphs;
                 computational geometry; Data processing; graph theory;
                 Graph theory; independent domination problem;
                 Information science; linear algorithms; NP-complete;
                 Perfect domination; polynomial algorithms; polynomials;
                 split graphs; Split graphs; weighted perfect domination
                 problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Iwano:1993:EAF,
  author =       "Kazuo Iwano and Naoki Katoh",
  title =        "Efficient algorithms for finding the most vital edge
                 of a minimum spanning tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "211--213",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C05 68Q25 68R10)",
  MRnumber =     "95b:05190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Japan",
  affiliationaddress = "Tokyo, Jpn",
  classification = "716; 723.2; 921; C1160 (Combinatorial mathematics);
                 C4260 (Computational geometry)",
  conferenceyear = "1993",
  corpsource =   "Tokyo Res. Lab., IBM Japan, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis; computational geometry; Data
                 processing; Design; Information science; Mathematical
                 techniques; minimum spanning tree; Minimum spanning
                 trees; Most vita edges; most vital edge; trees
                 (mathematics); undirected graph; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Johnson:1993:SCP,
  author =       "Theodore Johnson and Krishna Harathi",
  title =        "A simple correctness proof of the {MCS}
                 contention-free lock",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "215--220",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "721.1; 722.1; 921; C4240 (Programming and algorithm
                 theory); C6120 (File organisation); C6150G (Diagnostic,
                 testing, debugging and evaluating systems); C6150J
                 (Operating systems)",
  conferenceyear = "1993",
  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 =     "Algorithms; Concurrency; concurrency control;
                 Correctness proof; correctness proof; critical section
                 solution; Data processing; Data structures; data
                 structures; decisive instruction; Information science;
                 local memory locations; lock-free queue; MCS
                 contention-free lock; MCS lock; Mutual exclusion;
                 network contention; Parallel processing systems;
                 program verification; programming theory; Queueing
                 theory; Spin lock; spin-lock",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Grinstead:1993:EED,
  author =       "Dana L. Grinstead and Peter J. Slater and Naveed A.
                 Sherwani and Nancy D. Holmes",
  title =        "Efficient edge domination problems in graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "221--228",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C35 05C85 68M20 68Q25)",
  MRnumber =     "94k:68161",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Alabama",
  affiliationaddress = "Hunstville, AL, USA",
  classification = "716.1; 721.1; 921.1; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  conferenceyear = "1993",
  corpsource =   "Dept. of Math. and Stat., Alabama Univ., Huntsville,
                 AL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; complexity;
                 computational complexity; computational geometry; Edge
                 domination; edge domination problems; Encoding theory;
                 Graph theory; graph theory; Information theory;
                 Mathematical techniques; NP-complete; Parallel
                 processing systems; resource allocation;
                 series-parallel graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kavraki:1993:CAP,
  author =       "Lydia Kavraki and Jean-Claude Latombe and Randall H.
                 Wilson",
  title =        "On the complexity of assembly partitioning",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "229--235",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "716.1; 723.2; 921.1; C3355F (Assembling); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  conferenceyear = "1993",
  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 =     "assembling; Assembly; Assembly partitioning; assembly
                 partitioning problem; complexity; Computational
                 complexity; computational complexity; Computational
                 geometry; computational geometry; Data processing;
                 Geometry; Mathematical techniques; Motion planning;
                 nonoverlapping polygons; NP-complete; Planning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sheu:1993:BAS,
  author =       "Jang Ping Sheu and Wen Hwa Liaw and Tzung Shi Chen",
  title =        "A broadcasting algorithm in star graph interconnection
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "237--241",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "1 266 946",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Chung-Li, Taiwan",
  classification = "716.1; 721.1; 723.2; 921.1; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  conferenceyear = "1993",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Central
                 Univ., Chung-Li, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; broadcasting algorithm; Broadcasting
                 algorithm; computational complexity; Computer networks;
                 Data processing; distributed algorithms; distributed
                 broadcasting algorithm; Graphic methods; Information
                 science; Interconnection networks; multiprocessor
                 interconnection networks; Parallel processing systems;
                 receiving node; star graph interconnection networks;
                 Star graphs; time complexity; time step",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rouskov:1993:FDS,
  author =       "Yordan Rouskov and Pradip K. Srimani",
  title =        "Fault diameter of star graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "243--251",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "94k:68011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Colorado State Univ",
  affiliationaddress = "Fort Collins, CO, USA",
  classification = "721.1; 723.2; 921.1; C4230M (Multiprocessor
                 interconnection); C5470 (Performance evaluation and
                 testing)",
  conferenceyear = "1993",
  corpsource =   "Dept. of Comput. Sci., Colorado State Univ., Fort
                 Collins, CO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Distributed computer systems; Fault
                 diameter; fault diameter; Fault tolerant computer
                 systems; fault tolerant computing; Graphic methods;
                 Hypercubes; hypercubes; Interconnection network;
                 multiprocessor interconnection networks; Star graphs;
                 star graphs; vertex connectivity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Golin:1993:Q,
  author =       "Mordecia J. Golin and Robert Sedgewick",
  title =        "Queue-mergesort",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "253--259",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hong Kong Univ of Science and Technology",
  affiliationaddress = "Kowloon, Hong Kong",
  classification = "721.1; 723.2; B6120B (Codes); C1160 (Combinatorial
                 mathematics); C6130 (Data handling techniques)",
  conferenceyear = "1993",
  corpsource =   "Hong Kong Univ. of Sci. and Technol., Kowloon, Hong
                 Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary trees; Computer science; Data
                 processing; encoding; Hoffman encoding; merging; Queue
                 mergesort; queue-mergesort; Queueing theory; sorting;
                 top-down mergesort",
  treatment =    "P Practical",
}

@Article{Billionnet:1993:PMC,
  author =       "Alain Billionnet",
  title =        "Partitioning multiple-chain-like task across a host-
                 satellite system",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "5",
  pages =        "261--266",
  day =          "10",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CEDRIC",
  affiliationaddress = "Evry, Fr",
  classification = "721.1; 723.1; 921; C1180 (Optimisation techniques);
                 C4240 (Programming and algorithm theory); C5470
                 (Performance evaluation and testing); C6150J (Operating
                 systems)",
  conferenceyear = "1993",
  corpsource =   "CEDRIC, Inst. d'Inf. d'Entreprise, Evry, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Complexity; computational complexity;
                 dynamic programming; Dynamic programming; Host
                 satellite systems; host-satellite system;
                 multiple-chain-like task partitioning; Multiprocessing
                 systems; performance evaluation; Pipeline processing
                 systems; resource allocation; Task allocation; time
                 complexity; Time complexity",
  treatment =    "P Practical",
}

@Article{Culik:1993:PRS,
  author =       "Karel {Culik, II} and Jarkko Kari",
  title =        "Parametrized recurrent systems for image generation",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "267--274",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10",
  MRnumber =     "94m:68195",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of South Carolina",
  affiliationaddress = "Columbia, SC, USA",
  classification = "723.2; 741; 921; C4260 (Computational geometry);
                 C5260B (Computer vision and picture processing)",
  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 =     "Attractor; Computational geometry; computational
                 geometry; Computer graphics; fractals; Image design;
                 Image generation; image generation; image processing;
                 Imaging techniques; Mutually recursive function
                 systems; parameterized recurrent systems; Parametrized
                 recurrent systems; Recursive functions; variable
                 transformations",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rodrigues:1993:ESC,
  author =       "Marion Rodrigues and Hasan Ural",
  title =        "Exact solutions for the construction of optimal length
                 test sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "275--280",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15",
  MRnumber =     "94m:68019",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ.",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "601.1; 921; B1265B (Logic circuits); C4220 (Automata
                 theory); C5210 (Logic design methods)",
  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 design; Algorithms; Design; exact solutions;
                 finite state machine; Finite state machines; finite
                 state machines; logic testing; lower bounds; Machinery;
                 optimal length test sequences; Optimization;
                 polynomial-time algorithms; Polynomials; Test
                 sequences; Testing; Unique input output sequences;
                 unique input output sequences",
  treatment =    "P Practical",
}

@Article{Vincent:1993:NRS,
  author =       "Millist W. Vincent and Bala Srinivasan",
  title =        "A note on relation schemes which are in {$3$NF} but
                 not in {BCNF}",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "281--283",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 259 637",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of South Australia",
  affiliationaddress = "Adelaide, Aust",
  classification = "723.2; 723.3; C4250 (Database theory); C6160D
                 (Relational DBMS)",
  corpsource =   "School of Comput. and Inf. Sci., South Australia
                 Univ., Adelaide, SA, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3NF; Boyce-Codd normal form; candidate keys; Data
                 structures; Database systems; database theory; Design;
                 Normalization; Relation schemes; relation schemes;
                 Relational databases; relational databases; Third
                 normal form; third normal form",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Inoue:1993:NMI,
  author =       "Katsushi Inoue and Akira It\=o and Itsuo Takanami and
                 Tsunehiro Yoshinaga",
  title =        "A note on multi-inkdot nondeterministic {Turing}
                 machines with small space",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "285--288",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05",
  MRnumber =     "1 259 638",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Yamaguchi Univ.",
  affiliationaddress = "Ube, Jpn",
  classification = "721.1; 721.3; 722.4; 723.2; C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Syst. Eng., Yamaguchi Univ.,
                 Ube, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computational complexity; Computational complexity;
                 Data processing; Digital computers; Multi-inkdot;
                 multi-inkdot Turing machine; Nondeterministic machines;
                 nondeterministic Turing machines; Read-write worktape;
                 Readout systems; small space; Space bounded
                 computations; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pillaipakkamnatt:1993:LTE,
  author =       "Krishnan Pillaipakkamnatt and Vijay Raghavan",
  title =        "A linear time equivalence test for read-twice {DNF}
                 formulas",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "289--295",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 259 639",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Vanderbilt Univ.",
  affiliationaddress = "Nashville, TN, USA",
  classification = "723.2; 921; C4210 (Formal logic)",
  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 =     "Algebraic structures; Algorithms; Boolean functions;
                 Boolean variable; Data processing; Disjunctive Normal
                 Form formulas; disjunctive normal forms; Efficiency;
                 Equivalence testing; learning theory; linear time
                 equivalence test; Mathematical techniques; Read twice
                 formulas; read-twice DNF formulas",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fraigniaud:1993:FTS,
  author =       "Pierre Fraigniaud and Claire Kenyon and Andrzej Pelc",
  title =        "Finding a target subnetwork in sparse networks with
                 random faults",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "297--303",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C80 (68M15 68R10)",
  MRnumber =     "94k:05173",
  MRreviewer =   "Andrzej Ruci{\'n}ski",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNRS",
  affiliationaddress = "Lyon, Fr",
  classification = "703.1; 723.3; 922.1; C5470 (Performance evaluation
                 and testing)",
  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 =     "Design; Fault tolerant computer systems; fault
                 tolerant computing; Fault trees; fault-free isomorphic
                 copy; Isomorphic copy; Network components; Nodes;
                 Probability; Random faults; random faults; Random
                 processes; sparse extensions; Sparse faults; sparse
                 networks; target subnetwork",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Goldschmidt:1993:MGH,
  author =       "Olivier Goldschmidt and Dorit S. Hochbaum and Gang
                 Yu",
  title =        "A modified greedy heuristic for the {Set Covering}
                 problem with improved worst case bound",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "305--310",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (68Q25)",
  MRnumber =     "95a:68086",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "921; C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Mech. Eng., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis; Boundary value problems;
                 Calculations; Combinatorial mathematics; Computational
                 complexity; computational complexity; computational
                 geometry; Design; Modified greedy heuristic; modified
                 greedy heuristic; NP-complete problem; Set covering;
                 set covering problem; Set theory; Worst case bound;
                 worst case bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dankelmann:1993:CAD,
  author =       "Peter Dankelmann",
  title =        "Computing the average distance of an interval graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "311--314",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C12 (05C85 68Q20 68R10)",
  MRnumber =     "94j:05051",
  MRreviewer =   "J. E. Graver",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "RWTH",
  affiliationaddress = "Aachen, Ger",
  classification = "723.2; 921; C4260 (Computational geometry)",
  corpsource =   "Lehrstuhl II f{\"u}r Math, RWTH, Aachen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Average distance; average distance
                 computing; Calculations; computational geometry;
                 Computer aided analysis; Graph algorithms; interval
                 graph; Interval graphs; O(m)-algorithm; tree; Trees
                 (mathematics); weighted edges",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ho:1993:CST,
  author =       "Kevin I.-J. Ho and Joseph Y.-T. Leung and W.-D. Wei",
  title =        "Complexity of scheduling tasks with time-dependent
                 execution times",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "6",
  pages =        "315--320",
  day =          "20",
  month =        dec,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68Q25 90B35)",
  MRnumber =     "94j:68024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of Nebraska-Lincoln",
  affiliationaddress = "Lincoln, NE, USA",
  classification = "716.1; 913.1; 921; C4240 (Programming and algorithm
                 theory); C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; complexity; computational complexity;
                 Deadline; Feasibility problem; feasibility problem;
                 Feasible schedule; Mathematical models; Military
                 applications; Nonpreemptive schedules; NP-complete;
                 Polynomials; Release time; Scheduling; scheduling;
                 scheduling tasks complexity; sharp boundary; Single
                 processor; Time varying networks; time-dependent
                 execution times",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gianuzzi:1994:DTD,
  author =       "Vittoria Gianuzzi",
  title =        "Distributed termination detection in reducible
                 communication graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "1--8",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "1 264 917",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Genova",
  affiliationaddress = "Genova, Italy",
  classification = "721.1; 722.2; 921; 921.1; C4240 (Programming and
                 algorithm theory); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  conferenceyear = "1994",
  corpsource =   "Dipartimento di Inf. e Scienze dell'Inf., Genova
                 Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Communication graph; Computer networks;
                 Distributed computer systems; distributed processing;
                 distributed termination detection; Graphic methods;
                 Mathematical models; program verification; reducible
                 communication graphs; Reducible graphs; Termination
                 detection",
  treatment =    "P Practical",
}

@Article{Nuutila:1994:FSC,
  author =       "Esko Nuutila and Eljas Soisalon-Soininen",
  title =        "On finding the strongly connected components in a
                 directed graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "9--14",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "94k:05191",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Helsinki Univ of Technology",
  affiliationaddress = "Espoo, Finl",
  classification = "921; 921.1; C4240 (Programming and algorithm
                 theory); C6120 (File organisation)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Helsinki Univ. of Technol.,
                 Espoo, Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; data structures; Design;
                 directed graph; Directed graphs; Graphic methods;
                 Mathematical models; sparse graphs; Strongly connected
                 components; strongly connected components; Tarjan's
                 algorithm; Transitive closure; transitive closure
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldmann:1994:ATH,
  author =       "Mikael Goldmann and Per Grape and Johan H{\aa}stad",
  title =        "On average time hierarchies (Turing machines)",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "15--20",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q05 68Q25)",
  MRnumber =     "95c:68086",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Royal Inst of Technology",
  affiliationaddress = "Stockholm, Sweden",
  classification = "721.1; 921; C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  conferenceyear = "1994",
  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 =     "Average time complexity; average time hierarchies;
                 complicated diagonalization; Computation theory;
                 Computational complexity; computational complexity;
                 explicit language; Hierarchical systems; Hierarchy
                 theorems; time-constructible function; Turing machine;
                 Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kanchanasut:1994:SPA,
  author =       "Kanchana Kanchanasut",
  title =        "A shortest-path algorithm for {Manhattan} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "21--25",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "94k:05187",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Asian Inst of Technology",
  affiliationaddress = "Bangkok, Thail",
  classification = "721.1; 921; 921.1; C4260 (Computational geometry)",
  conferenceyear = "1994",
  corpsource =   "Comput. Sci. Program, Asian Inst. of Technol.,
                 Bangkok, Thailand",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational geometry; Computer science;
                 Graph algorithms; Graphic methods; Manhattan distance;
                 Manhattan graphs; Mathematical models; Mathematical
                 techniques; Shortest path; shortest-path algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Belbaraka:1994:GTC,
  author =       "Mounir Belbaraka and Ivan Stojmenovi{\'c}",
  title =        "On generating {$B$}-trees with constant average delay
                 and in lexicographic order",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "27--32",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68R05)",
  MRnumber =     "94m:68026",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Ottawa",
  affiliationaddress = "Otawwa, Ont, Can",
  classification = "721.1; 921; C6120 (File organisation)",
  conferenceyear = "1994",
  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 =     "2-3 trees; Algorithms; B tree; Computation theory;
                 Computer science; Constant average delay; constant
                 average delay; Design; generating B-trees; Generating
                 combinatorial objects; Lexicographic order;
                 lexicographic order; tree data structures",
  treatment =    "P Practical",
}

@Article{Veljan:1994:CVP,
  author =       "D. Veljan",
  title =        "Computing values of a polynomial with only few
                 multiplications",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "33--37",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65D20",
  MRnumber =     "1 264 922",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Zagreb",
  affiliationaddress = "Zagreb, Croatia",
  classification = "721.1; 921; C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Math., Zagreb Univ., Croatia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Arithmetic progression;
                 arithmetic progression; Computation theory; equidistant
                 points; Mathematical techniques; Multiplications;
                 polynomial; Polynomials; polynomials; Stirling
                 numbers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ting:1994:RAF,
  author =       "Hing F. Ting and Andrew C. Yao",
  title =        "A randomized algorithm for finding maximum with
                 {$O((\log n)^2)$} polynomial tests",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "39--43",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q20)",
  MRnumber =     "94k:68090",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Chinese Univ of Hong Kong",
  affiliationaddress = "Shatin, Hong Kong",
  classification = "721.1; 921; B0240E (Game theory); B0290F
                 (Interpolation and function approximation); C1140E
                 (Game theory); C4130 (Interpolation and function
                 approximation)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., 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 =     "Algorithms; Computability and decidability; decision
                 theory; Decision trees; distinct real numbers; error
                 probability; Mathematical techniques; n-1 polynomial
                 tests; O((log n)/sup 2/) polynomial tests; Parity
                 tests; polynomials; randomized algorithm; Randomized
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rhee:1994:EAF,
  author =       "C. Rhee and Y. Daniel Liang and S. K. Dhall and S.
                 Lakshmivarahan",
  title =        "Efficient algorithms for finding depth-first and
                 breadth-first search trees in permutation graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "45--50",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "94k:05193",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eastern Kuntucky Univ",
  affiliationaddress = "Richmond, KY, USA",
  classification = "721.1; 921; 921.1; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Math. and Comput. Sci., Eastern Kentucky
                 Univ., Richmond, KY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; algorithms; Breadth first search;
                 breadth-first search trees; Combinatorial mathematics;
                 Computer science; Depth first search; depth-first;
                 Graphic methods; O(n log log n) time algorithm;
                 permutation graphs; Permutation search; search
                 problems; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kaplan:1994:DNP,
  author =       "Haim Kaplan and Ron Shamir",
  title =        "The domatic number problem on some perfect graph
                 families",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "1",
  pages =        "51--56",
  day =          "14",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q15 68R10)",
  MRnumber =     "94k:05188",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel Aviv Univ",
  affiliationaddress = "Ramat-Aviv, Isr",
  classification = "721.1; 921.1; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Sch. of Math. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bipartite graphs; bipartite graphs;
                 Chordal graphs; Computational complexity; computational
                 complexity; Domatic number; domatic number problem;
                 Domatic partition; domatic partition; graph theory;
                 Graphic methods; linear time algorithm; NP-complete;
                 perfect graph families; Perfect graphs; Strongly
                 chordal graphs; strongly chordal graphs; Totally
                 balanced hypergraphs; totally balanced hypergraphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singh:1994:RTL,
  author =       "Gurdip Singh",
  title =        "Real-time leader election",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "57--61",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kansas State Univ",
  affiliationaddress = "Manhattan, KS, USA",
  classification = "722.3; 722.4; 723.1; B6150M (Protocols); C5220P
                 (Parallel architecture); C5640 (Protocols)",
  conferenceyear = "1994",
  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 =     "Computer system recovery; Distributed computer
                 systems; Distributed computing; distributed processing;
                 Models; Network protocols; Program processors;
                 protocol; protocols; Real time leader election; Real
                 time systems; real-time leader election; real-time
                 systems; shared memory environment; shared memory
                 systems; upper bound",
  treatment =    "P Practical",
}

@Article{Jung:1994:ECR,
  author =       "Min-Soo Jung and Kwang-Moo Choe and Taisook Han",
  title =        "An efficient computation of right context for
                 {LR}-based error repair",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "63--71",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "721.1; 723.1; 903.1; C4210 (Formal logic)",
  conferenceyear = "1994",
  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 =     "Computation theory; Computational grammars;
                 Computational methods; Error correction; error
                 correction; formal languages; grammars; Kernel item;
                 Left context; left context; LR based error repair; LR
                 based parsing; LR-based error repair; LR-based parsing;
                 Program compilers; redundancies; Redundancy; Right
                 context; right context; Syntax error repair; Vocabulary
                 control; Vocabulary strings; vocabulary strings",
  treatment =    "P Practical",
}

@Article{Saxena:1994:TCL,
  author =       "Sanjeev Saxena",
  title =        "Two-coloring linked lists is {${\rm NC}^1$}-complete
                 for logarithmic space",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "73--76",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "1 266 948",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kanpur, India",
  classification = "721.1; 722.4; 723.1; 723.1.1; 731.1; 921.1; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Kanpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computational
                 complexity; Connected components; data structures; Data
                 structures; graph colouring; List processing languages;
                 logarithmic space; Logarithmic space; NC/sup
                 1/-complete; Numerical control systems; parallel
                 algorithms; Parallel algorithms; Parallel processing
                 systems; Polynomials; Program processors; Two coloring
                 linked list; two-colouring linked lists",
  treatment =    "P Practical",
}

@Article{Gemmell:1994:TBE,
  author =       "Peter Gemmell and Mor Harchol",
  title =        "Tight bounds on expected time to add correctly and add
                 mostly correctly",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "77--83",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "721.2; 721.3; 723.1; 731.1; C4240 (Programming and
                 algorithm theory); C5120 (Logic and switching
                 circuits)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., California-Berkeley Univ., CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "adder; Adders; adders; Addition; algorithm theory;
                 Algorithms; AND; Binary sequences; Computer simulation;
                 fan-in two; Fast adder; Logic gates; Near adder; NOT
                 gates; Optimal control systems; OR; Random processes;
                 Running time; Two n-bit numbers; worst-case adder",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Steinbach:1994:GPO,
  author =       "Joachim Steinbach",
  title =        "Generating polynomial orderings",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "85--93",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Kaiserslautern",
  affiliationaddress = "Kaiserslautern, Ger",
  classification = "721.1; 723.1; 921.1; 921.3; 921.5; 921.6; C4130
                 (Interpolation and function approximation); C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  conferenceyear = "1994",
  corpsource =   "Kaiserslautern Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; Computation theory;
                 Conformal mapping; Interpretation; Linear programming;
                 Mathematical operators; Polynomial orderings;
                 Polynomials; polynomials; program verification; proving
                 termination; Reduction orderings; reduction orderings;
                 rewriting systems; Simplex method; simplex method; Term
                 rewriting systems; term rewriting systems;
                 Termination",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mairson:1994:GWC,
  author =       "Harry G. Mairson",
  title =        "Generating words in a context-free language uniformly
                 at random",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "95--99",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "94m:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brandeis Univ",
  affiliationaddress = "Waltham, MA, USA",
  classification = "721.1; 723.1; 921.6; 922.1; C4210 (Formal logic);
                 C4240 (Programming and algorithm theory); C6120 (File
                 organisation)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximation scheme; Approximation
                 theory; Bit complexity; bit complexity; Computational
                 complexity; computational complexity; Context free
                 grammars; Context free languages; context-free
                 grammars; context-free language; context-free
                 languages; context-grammar; data structure; Data
                 structures; data structures; integer; Logarithmic cost
                 measure; logarithmic-cost measure; Mathematical models;
                 Preprocessing stage; preprocessing stage; Probabilistic
                 logics; Probability; Random processes; Space bound;
                 Unit cost model; unit-cost model; weighted
                 probabilistic choice; words generation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Klop:1994:MCS,
  author =       "Jan Willem Klop and Aart Middeldorp and Yoshihito
                 Toyama and Roel {de Vrijer}",
  title =        "Modularity of confluence: {A} simplified proof",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "101--109",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "94k:68101",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CWI",
  affiliationaddress = "Amsterdam, Neth",
  classification = "721.1; 921.1; C4210 (Formal logic)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Software Technol., Amsterdam, Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Computation theory; Confluence; confluent
                 term rewriting; disjoint union; Modularity; rewriting
                 systems; Term rewriting systems; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Amir:1994:ADP,
  author =       "Amihood Amir and Martin Farach and S. Muthukrishnan",
  title =        "Alphabet dependence in parameterized matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "111--115",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "721.1; 721.2; 723.5; 741.1; C1250 (Pattern
                 recognition); C6110B (Software engineering
                 techniques)",
  corpsource =   "Coll. of Comput., 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 =     "Algorithms; Computation theory; Computer software;
                 Image processing; Logic design; parameterized matching;
                 Parameterized string matching; pattern matching
                 paradigm; Pattern model; pattern recognition; pattern
                 string; Program fragments; Software maintenance;
                 software maintenance; String matching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1994:RCM,
  author =       "Sung Kwon Kim",
  title =        "The range co-minima problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "117--121",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68P05)",
  MRnumber =     "94m:68083",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kyungsung Univ",
  affiliationaddress = "Pusan, South Korea",
  classification = "721.1; 721.2; 723.3; 921.6; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Kyungsung Univ., Pusan, South
                 Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computation theory; Data
                 processing; data structures; Efficient solution;
                 integer array; Least positive integer; least positive
                 integer; preprocessing time; Query; Query indices;
                 query indices; query time; range co-minima problem;
                 Range minima problem; Set theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ladermann:1994:NLD,
  author =       "M. Ladermann and H. Petersen",
  title =        "Notes on looping deterministic two-way pushdown
                 automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "123--127",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q70",
  MRnumber =     "95a:68079",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Hamburg",
  affiliationaddress = "Hamburg, Ger",
  classification = "721.1; 721.2; 723.5; 921.4; C4210 (Formal logic);
                 C4220 (Automata theory)",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; Computation theory; deterministic
                 automata; Filler technique; formal languages; Formal
                 logic; k-head two-way pushdown automata; Logic design;
                 looping deterministic two-way pushdown automata;
                 nondeterministic automaton; Nondeterministic class;
                 Open problem; Pushdown automata theory; Reversed
                 simulation; Set theory; weak counter",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Li:1994:AEF,
  author =       "Tze Fen Li and Sung Wu Chang",
  title =        "An algorithm to estimate the fraction defective and
                 the exponential mean life using unlabeled samples",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "129--133",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Chung Hsing Univ",
  affiliationaddress = "Taichung, Taiwan",
  classification = "723.4; 723.5; 913.1; 921.6; B0240G (Monte Carlo
                 methods); C1140G (Monte Carlo methods); C1230
                 (Artificial intelligence); C1250 (Pattern
                 recognition)",
  corpsource =   "Dept. of Appl. Math., Nat. Chung Hsing Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Estimation; Expert systems; Exponential
                 density function; exponential mean life; fraction
                 defective estimation; manufacturing processes; maximum
                 likelihood estimation; Maximum likelihood estimation;
                 Mean life time; Mixture distribution; Monte Carlo
                 methods; Monte Carlo study; pattern recognition;
                 Pattern recognition; Quality control; unlabeled
                 samples; unsupervised learning",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shibata:1994:CCW,
  author =       "Yukio Shibata and Miyuki Shirahata and Shingo Osawa",
  title =        "Counting closed walks in generalized {de Bruijn}
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "135--138",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (94A55)",
  MRnumber =     "95a:05048",
  MRreviewer =   "Qing De Kang",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Gunma Univ",
  affiliationaddress = "Kiryu, Jpn",
  classification = "721.2; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci., Gunma Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Analysis; Bruijn graph; Closed walk; Combinatorial
                 mathematics; Congruential equations; counting closed
                 walks; generalized de Bruijn graphs; graph theory;
                 hypercube networks; Logic; Mapping; Numerical analysis;
                 Survey",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Panda:1994:RAI,
  author =       "B. S. Panda and S. P. Mohanty",
  title =        "Recognition algorithm for intersection graphs of edge
                 disjoint paths in a tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "139--143",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q22)",
  MRnumber =     "94k:05192",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kanpur, India",
  classification = "721.2; 723.4; 723.5; 921.4; C1160 (Combinatorial
                 mathematics); C1250 (Pattern recognition); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Math., Indian Inst. of Technol., Kanpur,
                 India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Chordal graphs; Computational complexity;
                 computational complexity; Computer graphics; edge
                 disjoint paths; Edge-disjoint path; Intersection
                 graphs; intersection graphs; intersection model
                 construction; linear time sequential algorithm;
                 parallel algorithms; parallel NC algorithm; Parallel
                 processing systems; Pattern recognition; pattern
                 recognition; recognition algorithm; Set theory; Subtree
                 graphs; Time sequential algorithm; tree; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jovanovic:1994:FTS,
  author =       "Zoran Jovanovi{\'c} and Jelena Mi{\v{s}}i{\'c}",
  title =        "Fault tolerance of the star graph interconnection
                 network",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "145--150",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C35 68M15)",
  MRnumber =     "95a:68013",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Belgrade",
  affiliationaddress = "Belgrade, Yugosl",
  classification = "721.1; 721.2; 723.5; C1160 (Combinatorial
                 mathematics); C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci., Belgrade Univ., Serbia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer architecture; computer architecture; Computer
                 graphics; Computer networks; Defects; Estimation;
                 failure analysis; Fault diameter; fault diameter; fault
                 tolerance; fault tolerant computing; Graph
                 interconnection network; graph theory; Logic design;
                 Multicomputers; multicomputers; multiprocessor
                 interconnection networks; node deletion; Star graph;
                 star graph interconnection network; vertex
                 connectivity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bonet:1994:SDT,
  author =       "Maria Luisa Bonet and Samuel R. Buss",
  title =        "Size-depth tradeoffs for {Boolean} formulae",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "151--155",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "94m:68079",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pennsylvania",
  affiliationaddress = "Philadelphia, PA, USA",
  classification = "721.1; 721.2; 921.6; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., Pennsylvania Univ., Philadelphia, PA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Asymptotic size; Boolean algebra; Boolean
                 formulae; Brent/Spira restructuring; computation
                 theory; computational complexity; formula complexity;
                 Formula complexity; log depth formula; Logic design;
                 Mathematical models; Size-depth tradeoff; size-depth
                 tradeoffs; Theory of computation; Transformation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1994:PEM,
  author =       "S. B. Yang and S. K. Dhall and S. Lakshmivarahan",
  title =        "A processor efficient {MIS} algorithm on random
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "3",
  pages =        "157--163",
  day =          "11",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C80 68Q22 68Q25)",
  MRnumber =     "94k:05197",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oklahoma",
  affiliationaddress = "Norman, OK, USA",
  classification = "721.1; 721.2; 723.1; C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory)",
  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 =     "algorithm analysis; Algorithms; computational
                 complexity; Computer aided analysis; Computer graphics;
                 Deterministic algorithm; edges; EREW PRAM model;
                 Estimation; expected time; Graph algorithms; graph
                 algorithms; graph theory; Logic design; Maximal
                 independent set; maximal independent set; parallel
                 algorithms; probability; processor-efficient algorithm;
                 random graphs; Randomized parallel algorithm;
                 randomized parallel algorithm; set theory; Time
                 complexity; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1994:NRA,
  author =       "Chien-Min M. Wang",
  title =        "A new routing algorithm for cyclic shifts on {BRGC}
                 hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "165--169",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst of Information Science",
  affiliationaddress = "Taipei, Taiwan",
  classification = "721.1; 722.4; 723.1; 723.2; 723.4; 723.5; B6120B
                 (Codes); C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture)",
  conferenceyear = "1994",
  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; binary reflected Gray code; Binary
                 reflected gray code; BRGC hypercubes; Cellular arrays;
                 codes; Computation theory; Computer simulation;
                 Critical path analysis; Cyclic shift; cyclic shifted
                 sink node; cyclic shifts; Data communication systems;
                 Data processing; Data reduction; Data structures;
                 Disjoint link algorithm; Distributed memory parallel
                 computer; divide-and-conquer approach; Embedding;
                 Encoding (symbols); hypercube networks; Hypercubes;
                 message passing; Neural networks; Parallel computation;
                 Parallel processing systems; routing algorithm; Routing
                 algorithm",
  treatment =    "P Practical",
}

@Article{Huang:1994:SAS,
  author =       "Nen-Fu F. Huang and Ching-Ho H. Huang and Yue-Li L.
                 Wang",
  title =        "A sweepline algorithm to solve the two-center
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "171--177",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "1 266 713",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 723.1; 723.2; 921.4; 921.6; C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  conferenceyear = "1994",
  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; Automata theory; Average case performance;
                 Computation theory; computational complexity;
                 Computational complexity; computational geometry;
                 Computational geometry; Computational methods; convex
                 polygon; Data processing; Diameter circle; Drezner's
                 algorithm; Geometric location problem; Geometry; On
                 line one center; One center problem; Set theory;
                 sweepline algorithm; Sweepline algorithm; time
                 complexity; Two center problem; two-center problem;
                 Voronoi diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{deLuca:1994:BFT,
  author =       "Aldo {de Luca} and Licia Mione",
  title =        "On bispecial factors of the {Thue--Morse} word",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "179--183",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q45)",
  MRnumber =     "94m:68156",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dipartimento di Matematica dell'Universita di Roma `La
                 Sapienza'",
  affiliationaddress = "Roma, Italy",
  classification = "721.1; 723.2; 921.4; 921.6; C4210 (Formal logic)",
  conferenceyear = "1994",
  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 =     "Bispecial factors; bispecial factors; Codes (symbols);
                 Combinatorial mathematics; Combinatorics on words;
                 enumeration function; Formal languages; formal
                 languages; Function evaluation; Iterative methods;
                 Overlap free word; overlap-free words; Set theory;
                 Special factors; Thue--Morse word; Word processing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leuchner:1994:NES,
  author =       "John H. Leuchner and Les Miller and Giora Slutzki",
  title =        "A note on the equivalence of a set of egds to a set of
                 {FDs}",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "185--188",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 266 715",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Iowa State Univ",
  affiliationaddress = "Ames, IA, USA",
  classification = "721.1; 723.1; 723.2; 723.3; 921.4; C4250 (Database
                 theory); C6160D (Relational DBMS)",
  conferenceyear = "1994",
  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; Analysis of algorithms; computational
                 complexity; Data processing; Data reduction; Database
                 theory; database theory; edge labeled graphs; Equality
                 generating dependency (EGD); equality-generating
                 dependency; equivalence; Equivalence classes;
                 Functional dependencies; functional dependencies; Graph
                 theory; Information theory; Polynomial time; polynomial
                 time; Polynomials; Relational database systems;
                 relational database theory; relational databases; Set
                 theory; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Calvert:1994:EDL,
  author =       "Ken Calvert",
  title =        "Eliminating disjunctions of leads-to properties
                 (temporal logic)",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "189--194",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B45 03B70 68T27)",
  MRnumber =     "1 266 716",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "716.1; 721.1; 723.1.1; 723.2; C4210 (Formal logic);
                 C4250 (Database theory); C6110B (Software engineering
                 techniques)",
  conferenceyear = "1994",
  corpsource =   "Coll. of Comput., 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 =     "Binary sequences; boolean connectives; Boolean
                 functions; Computational linguistics; Computer hardware
                 description languages; Concurrency; Data processing;
                 disjunctions; Formal logic; Formal semantics; formal
                 specification; Information theory; Linear temporal
                 logic; linear temporal logic; Natural number generator;
                 predicate; Propositional logic; propositional logic;
                 Random bit generator; specification formalisms; State
                 assignment; temporal logic; Temporal property; temporal
                 property; Theorem proving; unity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Neiger:1994:DCR,
  author =       "Gil Neiger",
  title =        "{Distributed Consensus} revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "195--201",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "716.1; 721.1; 722.4; 723.1; 723.5; 921.6; C4240P
                 (Parallel programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Coll. of Comput., 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 =     "Algorithms; Arbitrary failure; Byzantine agreement;
                 Computational methods; consensus algorithms; Data
                 processing; distributed algorithms; Distributed
                 computer systems; Distributed computing; Distributed
                 consensus; distributed consensus; Failure analysis;
                 Fault tolerant computer systems; Function evaluation;
                 Information theory; Program processors;
                 Synchronization; Synchronous systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1994:TWD,
  author =       "Dongseung Kim and Joonyoung Park",
  title =        "Two-way dominant sequence clustering for processor
                 scheduling",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "203--208",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pohang Inst of Science and Technology",
  affiliationaddress = "Pohang, South Korea",
  classification = "721.1; 722.4; 723.1; 723.5; 921.4; 921.5; C4240
                 (Programming and algorithm theory); C6150J (Operating
                 systems); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci. and Eng., Pohang Inst. of Sci.
                 and Technol., South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation theory; Binary sequences;
                 compilers; computational complexity; Computational
                 complexity; Computer operating systems; dominant
                 sequence clustering; Dominant sequence clustering; Edge
                 zeroing; Graph theory; heuristic; Heuristic
                 programming; Linear scheduling; operating systems;
                 Optimization; Parallel computers; parallel processing;
                 Parallel processing systems; parallel time; Parallel
                 time; processor scheduling; Processor scheduling;
                 Program compilers; resource allocation; scheduling;
                 Scheduling; Scheduling heuristic; sequence clustering;
                 task scheduling; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1994:FAC,
  author =       "Eddie Cheng and William H. Cunningham",
  title =        "A faster algorithm for computing the strength of a
                 network",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "209--212",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "721.1; 723.1; 723.4; 921.1; 921.5; 921.6; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Combinatorics and Optimization, Waterloo
                 Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Attack problem; computational complexity;
                 Computer networks; faster algorithm; Graph theory;
                 graph theory; Minimization of switching nets; Network
                 survivability; network survivability; Neural networks;
                 non-negative edge weights; Optimization; Ratio
                 minimization; ratio minimization; strength of a
                 network; Strength of edge; time O(n/sup 4/); Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kakugawa:1994:DME,
  author =       "Hirotsugu Kakugawa and Satoshi Fujita and Masafumi
                 Yamashita and Tadashi Ae",
  title =        "A distributed $k$-mutual exclusion algorithm using
                 $k$-coterie",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "213--218",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hiroshima Univ",
  affiliationaddress = "Higashi-Hiroshima, Jpn",
  classification = "721.1; 722.4; 723.1; 723.2; C4230 (Switching
                 theory); C4240P (Parallel programming and algorithm
                 theory); C5220P (Parallel architecture)",
  conferenceyear = "1994",
  corpsource =   "Fac. of Eng., Hiroshima Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; communication complexity; Computational
                 complexity; Computer system recovery; Critical path
                 analysis; Critical section; Data processing; Data
                 reduction; Distributed computer systems; distributed
                 k-mutual exclusion algorithm; distributed processing;
                 k-coterie; k-mutual; Message complexity; message
                 complexity; Mutual exclusion; Permission based
                 algorithm; Process control; Quorum; Token based
                 algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Khardon:1994:UFT,
  author =       "Roni Khardon",
  title =        "On using the {Fourier} transform to learn Disjoint
                 {DNF}",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "219--222",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Harvard Univ",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "723.1; 903.1; 921.3; C1130 (Integral transforms);
                 C1230 (Artificial intelligence)",
  conferenceyear = "1994",
  corpsource =   "Aiken Comput. Lab., Harvard Univ., Cambridge, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational learning; decision theory;
                 decision trees; disjoint DNF; DNF expressions; Fourier
                 spectrum; Fourier transform; Fourier transforms;
                 learnability; learning (artificial intelligence);
                 Learning systems; Membership queries; membership
                 queries; Polynomials; Probability; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paul:1994:NBS,
  author =       "Wolfgang J. Paul",
  title =        "A note on bitonic sorting",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "223--225",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q22)",
  MRnumber =     "1 266 717",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "721.1; 722.4; 723.2; 921.6; C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory); C6130 (Data handling techniques)",
  conferenceyear = "1994",
  corpsource =   "Fachbereich Inf., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bitonic sorting; bitonic sorting;
                 comparator network; Numerical analysis; parallel
                 algorithms; parallel computers; Parallel processing
                 systems; Parallel sorting; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vanWezel:1994:APR,
  author =       "Michiel C. {Van Wezel} and Gerard Tel",
  title =        "An assertional proof of {Rana}'s algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "227--233",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "1 266 718",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Utrecht",
  affiliationaddress = "Utrecht, Neth",
  classification = "722.4; 723.1; C4240 (Programming and algorithm
                 theory); C6150N (Distributed systems)",
  conferenceyear = "1994",
  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; analysis of algorithms; assertional proof;
                 Computer programming; correctness proof; Distributed
                 computer systems; Distributed computing; distributed
                 computing; distributed processing; liveness; Norm
                 functions; program correctness; program verification;
                 programming theory; Rana algorithm; Rana's algorithm;
                 Real time systems; reasoning with invariants; safety;
                 termination detection algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Breslauer:1994:TSS,
  author =       "Dany Breslauer",
  title =        "Testing string superprimitivity in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "235--241",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q22)",
  MRnumber =     "94m:68070",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNR",
  affiliationaddress = "Pisa, Italy",
  classification = "723.1; 723.2; 921.6; C4240P (Parallel programming
                 and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Centre of Nat. Res., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Computer
                 software; CRCW-PRAM algorithm; optimal algorithm;
                 Optimization; parallel; parallel algorithms; Parallel
                 processing systems; periods; Quasiperiods;
                 quasiperiods; String matching; string matching; String
                 superprimitivity; superprimitivity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tiwari:1994:DVS,
  author =       "Prasoon Tiwari and Martin Tompa",
  title =        "A direct version of {Shamir} and {Snir}'s lower bounds
                 on monotone circuit depth",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "243--248",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "95c:68112",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin-Madison",
  affiliationaddress = "Madison, WI, USA",
  classification = "723.1; 723.2; 921.6; C4240P (Parallel programming
                 and algorithm theory); C5230 (Digital arithmetic
                 methods)",
  conferenceyear = "1994",
  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 circuits; arithmetic circuits;
                 computational complexity; digital arithmetic; direct
                 proofs; formula depth; lower bound; lower bounds;
                 Matrix algebra; monotone arithmetic circuits; Monotone
                 circuit depth; monotone circuit depth; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1994:SMS,
  author =       "Kaizhong Zhang and Tao Jiang",
  title =        "Some {MAX SNP}-hard results concerning unordered
                 labeled trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "249--254",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "95b:68053",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  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/",
  keywords =     "computational complexity; edit distance; largest
                 common sub-tree; MAX SNP-hard; polynomial time
                 approximation scheme; trees; trees (mathematics);
                 unordered labeled trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kolountzakis:1994:SLS,
  author =       "Mihail N. Kolountzakis",
  title =        "Selection of a large sum-free subset in polynomial
                 time",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "255--256",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11Y16 (68R05)",
  MRnumber =     "95h:11143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "721.1; 723.1; 921.6; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Math., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Adders; Additive number theory; algorithm; algorithm
                 theory; Algorithms; Combinatorial mathematics;
                 combinatorial mathematics; Integers; large sum-free
                 subset; polynomial time; Polynomials; Summing
                 circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wuu:1994:IAU,
  author =       "Lih-Chyau Wuu and Shing-Tsaan Huang",
  title =        "Identity assignment in uniform synchronous rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "257--262",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Hsing Tua Univ",
  affiliationaddress = "HsinChu, Taiwan",
  classification = "722.4; 723.1; B6150M (Protocols); C4240P (Parallel
                 programming and algorithm theory); C5640 (Protocols)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Nat. Hsing Tua Univ., Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; distributed algorithms; Distributed
                 computer systems; Fault tolerant computer systems;
                 Identification (control systems); identity assignment;
                 Identity assignment; leader election; protocols; Self
                 stabilization; self-stabilizing algorithm; Synchronous
                 rings; uniform synchronous rings",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pemmaraju:1994:AWC,
  author =       "Sriram V. Pemmaraju and Clifford A. Shaffer",
  title =        "Analysis of the worst case space complexity of a {PR}
                 quadtree",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "263--267",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "1 266 723",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Virginia Polytechnic Inst and State Univ",
  affiliationaddress = "Blacksburg, VA, USA",
  classification = "723.2; 921.6; 922.2; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  conferenceyear = "1994",
  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 =     "Algorithms; computational complexity; Data structures;
                 Estimation; Hierarchical systems; Point data; PR
                 Quadtree; resolution-r PR quadtree; spatial data
                 structures; tree data structures; Worst case analysis;
                 worst case space complexity; worst case space
                 requirement",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Blazewicz:1994:CSM,
  author =       "J. B{\l}a\.zewicz and P. Dell'Olmo and M. Drozdowski
                 and M. G. Speranza",
  title =        "Corrigendum: {``Scheduling multiprocessor tasks on
                 three dedicated processors'' [Inform. Process. Lett.
                 {\bf 41} (1992), no. 5, 275--280]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "5",
  pages =        "269--270",
  day =          "11",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "1 266 724",
  bibdate =      "Wed Nov 11 07:52:35 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Blazewicz:1992:SMT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tel:1994:MMS,
  author =       "Gerard Tel",
  title =        "Maximal matching stabilizes in quadratic time",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "271--272",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Utrecht",
  affiliationaddress = "Utrecht, Neth",
  classification = "723; 921; C4120 (Functional analysis); C4240
                 (Programming and algorithm theory); C6150N (Distributed
                 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; Alternative variant function; bound;
                 computational complexity; Distributed parameter
                 networks; distributed processing; distributed systems;
                 functional analysis; Improved upper bound; maximal
                 matching; Maximal matching stabilization; Quadratic
                 time; quadratic time; self-stabilizing algorithm;
                 stability; time complexity; variant function",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Libkin:1994:CNR,
  author =       "Leonid Libkin and Limsoon Wong",
  title =        "Conservativity of nested relational calculi with
                 internal generic functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "273--280",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68P20)",
  MRnumber =     "94m:68034",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pen",
  affiliationaddress = "Philadelphia, PA, USA",
  classification = "723; 921; C4250 (Database theory); C6160D
                 (Relational DBMS)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Aggregate functions; aggregate functions;
                 conservativity; depth of set nesting; intermediate
                 data; internal generic family of functions;
                 Mathematical techniques; Nested relational calculus;
                 nested relational calculus; relational algebra;
                 Relational database systems; relational databases; Set
                 nesting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chepoi:1994:CMP,
  author =       "Victor Chepoi and Feodor Dragan",
  title =        "Computing a median point of a simple rectilinear
                 polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "281--285",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "94m:68185",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Moldova State Univ",
  affiliationaddress = "Chisinau, Moldova",
  classification = "921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Math. and Cybern., Moldova State Univ.,
                 Chisinau, Moldova",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm; computational geometry; Geometry; median
                 point; Median point computation; minimisation; positive
                 weights; Rectilinear metric; rectilinear metric;
                 rectilinear polygon; Rectilinear polygon median points;
                 running time; total weighted distances",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Borchers:1994:EQI,
  author =       "Al Borchers and Prosenjit Gupta",
  title =        "Extending the quadrangle inequality to speed-up
                 dynamic programming",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "287--290",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C39",
  MRnumber =     "1 266 953",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Mineapolis, MN, USA",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  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 =     "Algorithms; algorithms analysis; combinatorial
                 analysis; combinatorial mathematics; Combinatorial
                 problems; computational complexity; Dynamic
                 programming; dynamic programming; dynamic programming
                 algorithm; Dynamic programming algorithms; generalized
                 function; multi-peg Tower of Hanoi problem; O(n/sup
                 2/); O(n/sup 2/p); quadrangle inequality; Quadrangle
                 inequality extension; Rectilinear Steiner Minimal
                 Arborescence; Rectilinear Steuber Nubunak Arbirescence
                 (rsma); weighted disks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rajsbaum:1994:ULB,
  author =       "Sergio Rajsbaum",
  title =        "Upper and lower bounds for stochastic marked graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "291--295",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q90 (05C20)",
  MRnumber =     "1 266 954",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Natl Autonoma de Mexico",
  affiliationaddress = "Temixco, Mex",
  classification = "723; 921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory); C5470 (Performance evaluation
                 and testing); C6150N (Distributed systems)",
  corpsource =   "Inst. de Matematicas, Univ. Nacional Autonoma de
                 Mexico, Mexico City, Mexico",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "6 degree graphs; bounded degree graphs; computational
                 complexity; Decision Free Petri Nets; directed graphs;
                 Distributed computing; distributed computing;
                 efficiently computable bounds; lower bounds;
                 multiprocessing systems; Parallel processing systems;
                 performance evaluation; Petri nets; recurrence
                 relations; Stochastic marked graphs; stochastic marked
                 graphs; stochastic programming; tokens per edge; upper
                 bounds; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Collin:1994:SSD,
  author =       "Zeev Collin and Shlomi Dolev",
  title =        "Self-stabilizing depth-first search",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "297--301",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "The Technion",
  affiliationaddress = "Haifa, Israel",
  classification = "921; C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory)",
  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 =     "Algorithms; communication graph; Depth-First Search;
                 Depth-first search (DFS) spanning tree algorithm;
                 distributed algorithm; distributed algorithms; Fault
                 tolerance; global state; search problems;
                 self-stabilizing; Self-stabilizing distributed
                 algorithm; spanning tree algorithm; tree data
                 structures; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sajith:1994:OPA,
  author =       "G. Sajith and Sanjeev Saxena",
  title =        "Optimal parallel algorithms for coloring bounded
                 degree graphs and finding maximal independent sets in
                 rooted trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "303--308",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C15 05C85 68Q25 68R10)",
  MRnumber =     "95a:68058",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Sajith:1995:COP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kanpur, India",
  classification = "921; 921.5; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Kanpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-coloring; Algorithms; alpha-degree rooted tree;
                 arbitrary CRCW PRAM; coloring bounded degree graphs;
                 computational complexity; CREW PRAM; EREW PRAM; Graph
                 coloring; graph coloring; graph colouring;
                 Graph-theoretic problems; maximal independent sets;
                 optimal algorithm; Optimal algorithms; Optimal parallel
                 algorithms; Optimization; parallel algorithm; parallel
                 algorithms; rooted trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kann:1994:MBM,
  author =       "Viggo Kann",
  title =        "Maximum bounded {$H$}-matching is {Max SNP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "309--318",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (05C85)",
  MRnumber =     "95a:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Royal Inst of Technology",
  affiliationaddress = "Stockholm, Sweden",
  classification = "921.5; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Numerical Anal. and 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 =     "Combinatorial problems; computational complexity;
                 fixed graph; graph theory; MAX SNP-complete; Max
                 SNP-complete problems; Maximum bounded H-matchings;
                 maximum H-matching; node-disjoint copies; Optimization;
                 variable graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Reddy:1994:ASL,
  author =       "H. N. Reddy and E. L. Leiss",
  title =        "An {$O(\log N)$} algorithm to solve linear recurrences
                 on hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "319--325",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "95a:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "Roanoke, TX, USA",
  classification = "723; C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Westlake Programming Lab., IBM Corp., Roanoke, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; collision-free algorithm; Collision-free
                 algorithms; computational complexity; Fast parallel
                 algorithms; fast parallel algorithms; Hypercube
                 multiprocessors; hypercube networks; hypercubes;
                 interconnection networks; linear recurrences; N-node
                 hypercube; N-node hypercube network; O(log N)
                 algorithm; parallel algorithms; parallel processing;
                 Parallel processing systems; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Prodinger:1994:ACP,
  author =       "Helmut Prodinger",
  title =        "An asymptotic comment on a paper by {A. Analyti} and
                 {S. Pramanik}: {``Performance analysis of a main memory
                 multi-directory hashing technique'' [Inform. Process.
                 Lett. {\bf 45} (1993), no. 4, 191--197; MR
                 93k:68026]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "6",
  pages =        "327--328",
  day =          "22",
  month =        mar,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20",
  MRnumber =     "1 266 958",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Analyti:1993:PAM}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Technical Univ of Vienna",
  affiliationaddress = "Vienna, Austria",
  classification = "921; C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.
                 Wien, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "asymptotic; asymptotic evaluation; file organisation;
                 Information retrieval; main memory; Mathematical
                 transformations; Mellin transform; multi-directory
                 hashing; performance analysis; Performance evaluation;
                 performance evaluation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barsi:1994:FPA,
  author =       "Ferruccio Barsi and M. Cristina Pinotti",
  title =        "A fully parallel algorithm for residue to binary
                 conversion",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "1--8",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also addendum \cite{Barsi:1995:AFP} and erratum
                 \cite{Barsi:1995:EAF}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Perugia",
  affiliationaddress = "Perugia, Italy",
  classification = "714.2; 721.1; 722.4; 723.2; 723.5; 921.6; C4240P
                 (Parallel programming and algorithm theory); C5230
                 (Digital arithmetic methods)",
  corpsource =   "Dipartimento di Matematica, Perugia Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analog to digital conversion; Binary
                 conversion; Chinese remainder theorem; Chinese
                 Remainder Theorem; Computation theory; Computational
                 complexity; computational complexity; Computer
                 architecture; Computer arithmetic; Data processing;
                 Data structures; Digital arithmetic; digital
                 arithmetic; Mathematical models; Mixed radix
                 conversion; Number theory; Parallel algorithm; parallel
                 algorithm; parallel algorithms; Parallel processing
                 systems; Polynomials; Residue number system; residue
                 number system; residue to binary conversion; RNS to
                 binary conversion; VLSI architectures; VLSI circuits;
                 VLSI complexity; VLSI implementation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Azar:1994:PAN,
  author =       "Y. Azar and A. Z. Broder and A. M. Frieze",
  title =        "On the problem of approximating the number of bases of
                 a matroid",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "9--11",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05B35 (68Q25 68R05)",
  MRnumber =     "95i:05045",
  MRreviewer =   "Ji{\v{r}}{\'\i} T\.uma",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel-Aviv Univ",
  affiliationaddress = "Tel-Aviv, Isr",
  classification = "721.1; 921.1; 921.4; 921.6; 922.1; 922.2; C1110
                 (Algebra); C4140 (Linear algebra); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximating counting; Approximation
                 theory; bases; Computation theory; Computational
                 complexity; computational complexity; convex body;
                 deterministic polynomial time; graph reliability;
                 Graphic methods; Markov chain; Mathematical models;
                 Matrix algebra; matrix algebra; matroid; Matroid bases;
                 Matroid oracle algorithm; matroid oracle algorithms;
                 matroids; Membership oracle; Number theory; P-hard
                 problem; Polynomial time; Polynomials; Random
                 processes; Randomized algorithm; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1994:DGP,
  author =       "Yi-Bing Lin",
  title =        "Determining the global progress of parallel simulation
                 with {FIFO} communication property",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "13--17",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bellcore",
  affiliationaddress = "Morristown, NJ, USA",
  classification = "716.1; 721.1; 722.4; 723.5; 921.6; C4240P (Parallel
                 programming and algorithm theory); C6185 (Simulation
                 techniques)",
  corpsource =   "Bellcore, Morristown, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "accuracy; Algorithms; Communication delay; complexity;
                 computational complexity; Computational complexity;
                 Computer simulation; Constraint theory; digital
                 simulation; distributed environment; FIFO
                 communication; FIFO communication delays; First in
                 first out communication property; global progress;
                 Global progress; global virtual time; Global virtual
                 time; GVT; Information theory; Numerical analysis;
                 optimistic parallel simulation; Parallel algorithm;
                 parallel algorithms; Parallel processing systems;
                 parallel simulation; Parallel simulation; Queueing
                 theory; State assignment; Subsystem; Synchronization;
                 Time warp synchronization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Demange:1994:ARM,
  author =       "Marc Demange and Pascal Grisoni and Vangelis Th.
                 Paschos",
  title =        "Approximation results for the minimum graph coloring
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "19--23",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C15 (05C85 68Q25 68R10)",
  MRnumber =     "96f:05076",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Paris-Dauphine",
  affiliationaddress = "Paris, Fr",
  classification = "721.1; 921.1; 921.4; 921.5; 921.6; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "LAMSADE, Paris-Dauphine Univ., France",
  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 solution; approximation algorithm;
                 Approximation theory; Combinatorial mathematics;
                 combinatorial problems; Computational complexity;
                 computational complexity; Constraint theory; Edge
                 vertex incidence matrix; Estimation; Graph coloring
                 problem; graph coloring problem; graph colouring; Graph
                 theory; Linear programming; Matrix algebra; minimum
                 graph coloring problem; Numerical analysis; Polynomial
                 approximation; polynomial approximation; Polynomials;
                 Stability constraint; Theorem proving; Vectors;
                 Vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fraenkel:1994:EMD,
  author =       "Aviezri S. Fraenkel and Edward M. Reingold and
                 Prashant Saxena",
  title =        "Efficient management of dynamic tables",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "25--30",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pennsylvania",
  affiliationaddress = "Philadelphia, PA, USA",
  classification = "721.1; 722.1; 723.1; 723.1.1; 723.2; 922.2; C6120
                 (File organisation)",
  corpsource =   "Dept. of Math., Pennsylvania Univ., Philadelphia, PA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Amortized analysis; Computer programming; Computer
                 programming languages; cost; Data acquisition; Data
                 reduction; Data structures; data structures; Decision
                 tables; deletion; Dynamic table; dynamic table
                 management; file organisation; Hashing function;
                 Hierarchical systems; insertion; k dynamic tables;
                 Paired stacks; paired stacks; Program compilers;
                 sequential memory segment; storage allocation; Storage
                 allocation (computer); Subroutines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Collette:1994:EPC,
  author =       "Pierre Collette",
  title =        "An explanatory presentation of composition rules for
                 assumption-commitment specifications",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "31--35",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Catholique de Louvain",
  affiliationaddress = "Louvain-la-Neuve, Belgium",
  classification = "721.1; 723.1; 723.5; 921.6; C4210 (Formal logic);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Unite d'Inf., Katholieke Univ., Leuven, Belgium",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Assumption commitment specification; assumption
                 property; assumption-commitment specifications;
                 Composition rule; composition rules; Compositional
                 method; compositional methods; Computational
                 linguistics; Computer hardware description languages;
                 Computer simulation; Concurrency; concurrent system
                 development; formal specification; liveness
                 commitments; Mathematical models; multiprocessing
                 programs; open system; programming theory;
                 realizability; Safety property; Semantic model; Set
                 theory; State assignment; State transition; Switching
                 theory; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Seberry:1994:ISA,
  author =       "Jennifer Seberry and Xian Mo Zhang and Yuliang Zheng",
  title =        "Improving the strict avalanche characteristics of
                 cryptographic functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "37--41",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "95a:94008",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wollongong",
  affiliationaddress = "Wollongong, Aust",
  classification = "721.1; 722.4; 723.2; 921.1; 921.3; B6120B (Codes);
                 C4210 (Formal logic); C6130S (Data security)",
  corpsource =   "Centre for Comput. Security Res., Wollongong Univ.,
                 NSW, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Boolean function transformation; Boolean
                 functions; common key block encryption algorithms;
                 Computer systems; Cryptographic function; cryptographic
                 functions; Cryptographically strong function;
                 cryptographically strong function design; Cryptography;
                 cryptography; Mathematical transformations; Propagation
                 criterion; S-boxes; security; Security of data; State
                 assignment; Strict avalanche criterion; strict
                 avalanche criterion; Substitution boxes; substitution
                 boxes; theorem proving; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1994:OSA,
  author =       "Yong-Seok Kim",
  title =        "An optimal scheduling algorithm for preemptable
                 real-time tasks",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "43--48",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Acad of Industrial Technology",
  affiliationaddress = "Seoul, South Korea",
  classification = "721.1; 722.4; 723.1; 912.3; 921.5; 921.6; C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory); C6150J (Operating systems)",
  corpsource =   "Electron. and Inf. Syst. Center, Korea Acad. of Ind.
                 Technol., Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; arbitrary ready times; computational
                 complexity; Computational complexity; Constraint
                 theory; Data processing; Deadline; deadlines; lower
                 bound; Maximum execution time; optimal scheduling
                 algorithm; Optimal scheduling algorithm; optimisation;
                 Optimization; preemptable real-time tasks; Program
                 processors; Ready time; Real time systems; Real time
                 task; real-time systems; scheduling; Scheduling; Single
                 processor system; single processor systems; time
                 complexity; Time complexity; Timing constraint;
                 worst-case time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Khuller:1994:DMC,
  author =       "Samir Khuller and Balaji Raghavachari and Neal Young",
  title =        "Designing multi-commodity flow trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "1",
  pages =        "49--55",
  day =          "8",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "721.1; 722.3; 722.4; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C1290D (Economics and
                 business)",
  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 =     "Algorithms; approximation algorithm; Approximation
                 factor; Approximation theory; Balanced separator
                 method; Combinatorial mathematics; commodities;
                 commodity trading; Computer networks; Congestion;
                 Constraint theory; economic cybernetics; flow network;
                 Graph theory; minimum-weight balanced-separator
                 problem; Multi commodity flow trees; multicommodity
                 flow trees; Network design; Network flow; Numerical
                 analysis; Performance; Response time (computer
                 systems); trees (mathematics); Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maire:1994:PPG,
  author =       "Fr{\'e}d{\'e}ric Maire",
  title =        "Polyominos and perfect graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "57--61",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05B50 (05C15 68U05)",
  MRnumber =     "95h:05045",
  MRreviewer =   "Chinh T. Hoang",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Pierre et Marie Curie",
  affiliationaddress = "Paris, Fr",
  classification = "721.1; 921.1; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  conferenceyear = "1994",
  corpsource =   "Equipe Combinatoire, Univ. Pierre et Marie Curie,
                 Paris, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; Combinatorial
                 problems; Computational complexity; computational
                 complexity; Computational geometry; computational
                 geometry; Computational methods; Geometry; Graph
                 theory; graph theory; NP-problems; Perfect graphs;
                 perfect graphs; Polynomials; Polyominos; polyominos;
                 Set theory; Visibility; Visibility graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ferragina:1994:SDP,
  author =       "P. Ferragina",
  title =        "Static and dynamic parallel computation of connected
                 components",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "63--68",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C40 05C85 68R10)",
  MRnumber =     "95c:68105",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "721.1; 722.4; 723.1; 723.2; 723.5; 921.4; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  conferenceyear = "1994",
  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 =     "Algorithms; Computational methods; Computer
                 simulation; Connected components; connected components;
                 Data structures; dynamic algorithm; dynamic parallel
                 computation; Equivalence classes; EREW model; Graph
                 theory; graph theory; Optimal systems; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems; Program processors; Sparsification;
                 sparsification technique; static parallel computation;
                 tree data structure; tree data structures; Trees
                 (mathematics); Undirected graph; undirected graph; Work
                 optimality",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1994:MCH,
  author =       "Her-Kun Chang and Shyan-Ming Yuan",
  title =        "Message complexity of hierarchical quorum consensus
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "69--73",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 722.4; 723.1; 723.2; C4240P (Parallel
                 programming and algorithm theory); C6160B (Distributed
                 DBMS)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. and Inf. Sci., National Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; communication
                 complexity; Computational complexity; Copying; Data
                 processing; Distributed computer systems; distributed
                 databases; Hierarchical quorum consensus; hierarchical
                 quorum consensus algorithm; Hierarchical systems;
                 message complexity; Message complexity; Quorum size;
                 Read and write operations; Replica control; replicated
                 data; Replicated data; standard quorum consensus
                 algorithm; Synchronization",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Roy:1994:NMS,
  author =       "T. Sony Roy and G. Athithan and M. S. Ganagi and A.
                 Sivasankara Reddy",
  title =        "A new method to solve non-linear equations",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "75--79",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65H05",
  MRnumber =     "95e:65051",
  MRreviewer =   "W. Govaerts",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "96/C (LIGH)",
  affiliationaddress = "Hyderabad, India",
  classification = "921.3; 921.6; B0290F (Interpolation and function
                 approximation); B0290K (Nonlinear and functional
                 equations); C4130 (Interpolation and function
                 approximation); C4150 (Nonlinear and functional
                 equations)",
  conferenceyear = "1994",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Approximation theory; Convergence of
                 numerical methods; Function evaluation; iterative
                 method; iterative methods; Iterative methods; linear
                 convergence; Linear convergence; Mathematical
                 transformations; nonlinear equations; Nonlinear
                 equations; Numerical analysis; quadratic convergence;
                 Quadratic convergence; real roots; Roots; Single
                 variable function",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Deo:1994:OPA,
  author =       "Narsingh Deo and Amit Jain and Muralidhar Medidi",
  title =        "An optimal parallel algorithm for merging using
                 multiselection",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "81--87",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Central Florida",
  affiliationaddress = "Orlando, FL, USA",
  classification = "721.1; 722.4; 723.1; 723.2; C4240P (Parallel
                 programming and algorithm theory); C6130 (Data handling
                 techniques)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Univ. of Central Florida,
                 Orlando, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Arrays; EREW PRAM; Exclusive read,
                 exclusive write parallel random access machine; Median;
                 Merging; merging; Multiselection; multiselection;
                 optimal parallel algorithm; Optimal systems; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems; parallel random access machine; Program
                 processors; random-access storage; Selection; sorted
                 arrays; Sorting; Theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1994:FQS,
  author =       "Y. L. Chen",
  title =        "Finding the $k$ quickest simple paths in a network",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "89--92",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85",
  MRnumber =     "95b:05188",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Chung-Li, Taiwan",
  classification = "721.1; 723.3; 921.4; 921.5; 921.6; C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Inf. Manage., Nat. Central Univ., Chung,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; Combinatorial
                 optimization; complexity; Computational complexity;
                 computational complexity; computational geometry;
                 Computer networks; Data communication systems; Design;
                 Design of algorithms; k quickest simple paths; network;
                 Optimization; quickest path problem; routing path;
                 Shortest and quickest path",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DiCrescenzo:1994:ROP,
  author =       "Giovanni {Di Crescenzo} and Giuseppe Persiano",
  title =        "Round-optimal perfect zero-knowledge proofs",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "93--99",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68P25 94A60)",
  MRnumber =     "95i:68047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Salerno",
  affiliationaddress = "Baronissi, Italy",
  classification = "721.1; 723.1; 723.1.1; 921.1; C6130S (Data
                 security)",
  conferenceyear = "1994",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Baronissi, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Communication complexity; Computational
                 complexity; Computer programming languages;
                 cryptography; Hierarchical systems; membership;
                 number-theoretic languages; Optimal systems;
                 Polynomials; Prover; q-residuosity; round optimal
                 perfect zero-knowledge proofs; Security of data;
                 Verifier; Zero-knowledge proofs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Siromoney:1994:ILW,
  author =       "Rani Siromoney and Lisa Mathew and V. R. Dare and K.
                 G. Subramanian",
  title =        "Infinite {Lyndon} words",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "101--104",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68R15)",
  MRnumber =     "95f:68129",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Madras Christian Coll",
  affiliationaddress = "Madras, India",
  classification = "721.1; 723.1; 921.4; 922.1; C4210 (Formal logic);
                 C4220 (Automata theory)",
  conferenceyear = "1994",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automata theory; automata theory; Cantor
                 space; Factorization; Formal languages; formal
                 languages; Homeomorphism; homeomorphism; infinite
                 Lyndon word; Infinite words; Lyndon words; Pattern
                 matching; Pattern recognition; prefix preserving Lyndon
                 words; Queue automata; queue automaton; Queueing
                 theory; Set theory; topological properties; Topology",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Simha:1994:LLU,
  author =       "Rahul Simha and Amitava Majumdar",
  title =        "On lookahead in the list update problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "105--110",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Coll of William \& Mary",
  affiliationaddress = "Williamsburg, VA, USA",
  classification = "723.1; 723.2; 723.5; C6120 (File organisation)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Coll. of William and Mary
                 Williamsburg, VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; Batch data
                 processing; Computer operating procedures; Computer
                 program listings; Computer simulation; Costs;
                 counter-intuitive observation; Data structures; data
                 structures; list processing; List update problem; list
                 update problem; Lookahead; lookahead; Move-to-Front
                 algorithm; optimal strategy; Self-adjusting data
                 structures; self-adjusting data structures; Sequence of
                 operations; singly-linked list",
  treatment =    "P Practical",
}

@Article{Gurla:1994:LOC,
  author =       "Himabindu Gurla",
  title =        "Leftmost one computation on meshes with row
                 broadcasting",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "2",
  pages =        "111--111",
  day =          "22",
  month =        apr,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:29 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bartal:1994:BLB,
  author =       "Yair Bartal and Howard Karloff and Yuval Rabani",
  title =        "A better lower bound for on-line scheduling",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "113--116",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (90B35)",
  MRnumber =     "1 281 049",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel-Aviv Univ",
  affiliationaddress = "Tel-Aviv, Isr",
  classification = "721.1; 723.1; C1180 (Optimisation techniques); C1290
                 (Applications of systems theory); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Competitive ratio; competitive ratio;
                 immediate job assignment; job completion time; Lower
                 bound; lower bound; m-machine scheduling problem;
                 makespan minimization; minimisation; multiprocessing
                 systems; online operation; Online scheduling; online
                 scheduling; Online searching; Scheduling; scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moriya:1994:TWT,
  author =       "Etsuro Moriya",
  title =        "On two-way tree automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "117--121",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q68",
  MRnumber =     "95h:68137",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Woman's Christian Univ",
  affiliationaddress = "Tokyo, Jpn",
  classification = "721.1; 723.1; C1160 (Combinatorial mathematics);
                 C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Dept. of Math., Tokyo Womans Christian Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; automata theory; bottom-up model;
                 Formal languages; formal languages; frontier-to-root
                 model; Models; nondeterministic tree automata; Pushdown
                 automata; pushdown tree automata; recognition
                 abilities; root-to-frontier model; top-down model; Tree
                 automata; trees (mathematics); Two way tree automata;
                 two-way tree automata",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dietz:1994:BRO,
  author =       "Paul F. Dietz and Ioan I. Macarie and Joel I.
                 Seiferas",
  title =        "Bits and relative order from residues, space
                 efficiently",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "123--127",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (11A07)",
  MRnumber =     "95f:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rochester",
  affiliationaddress = "Rochester, NY, USA",
  classification = "721.1; 723.1; 723.3; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary representation; binary representation; bit
                 computation; Bits; Chinese remainder theorem;
                 Computational complexity; computational complexity;
                 Data processing; Digital arithmetic; integers; Number
                 theory; number theory; Numbering systems; parity
                 detection; prime products; relative order; residue
                 number system; sign detection; Space complexity; space
                 complexity; space-efficient equality test",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1994:NAM,
  author =       "Dongseung Kim and Seung-Hoon Kim",
  title =        "${O}(\log n)$ numerical algorithms on a mesh with
                 wormhole routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "129--136",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pohang Univ of Science \& Technology",
  affiliationaddress = "Pohang, South Korea",
  classification = "721.1; 722.4; 723.1; 723.3; C4100 (Numerical
                 analysis); C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Postech Inf. Res. Lab., Pohang Univ. of Sci. and
                 Technol., South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; complexity; computational complexity; Data
                 processing; Mathematical techniques; multiprocessor
                 interconnection networks; Numerical methods; Parallel
                 algorithms; parallel algorithms; parallel processing;
                 prefix sum algorithm; Wormhole routing; wormhole
                 routing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weems:1994:ATD,
  author =       "Bob P. Weems and Lloyd C. Swayze",
  title =        "Allocation techniques for distributed reduction data
                 elements",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "137--142",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Arlington",
  affiliationaddress = "Arlington, TX, USA",
  classification = "721.1; 723.1; 723.2; 723.3; C4250 (Database theory);
                 C6120 (File organisation); C6160B (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci. Eng., Texas Univ., Arlington,
                 TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Allocation techniques; allocation techniques;
                 broadcast bus; communication costs; data placement;
                 Data processing; Database systems; Design; distributed
                 database systems; distributed databases; distributed
                 reduction data elements; Distributed reduction data
                 elements (DRDE); file allocation; file organisation;
                 physical database design; point-to-point network;
                 Reduction variables; reduction variables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ding:1994:CBI,
  author =       "Yuzheng Ding and Mark Allen Weiss",
  title =        "On the complexity of building an interval heap",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "143--144",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "721.1; 723.1; 723.2; 921.4; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Los Angeles,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; analysis of algorithms; complexity;
                 Computational complexity; computational complexity;
                 d-dimensional heap; Data structures; data structures;
                 deletion; Heaps; insertion; Interval heap; interval
                 heap; sorting; tight bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kumar:1994:ONP,
  author =       "G. Prem Kumar and G. Phanendra Babu",
  title =        "Optimal network partitioning for fault-tolerant
                 network management using evolutionary programming",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "145--149",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Institute of Science",
  affiliationaddress = "Bangalore, India",
  classification = "721.1; 722.4; 723.1; B6210C (Network management);
                 B6210L (Computer communications)C5620 (Computer
                 networks and techniques); C1180 (Optimisation
                 techniques); C4240 (Programming and algorithm theory);
                 C5470 (Performance evaluation and testing); C5670
                 (Network performance)",
  corpsource =   "Dept. of Electr. Commun. Eng., Indian Inst. of Sci.,
                 Bangalore, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Clustering; clustering; clustering methods;
                 combinatorial optimization; communication cost
                 minimisation; computer networks; Computer programming;
                 Evolutionary programming; evolutionary programming;
                 Fault tolerant computer systems; fault tolerant
                 computing; fault-tolerant network management; globally
                 optimal partition; gradient descent partition methods;
                 locally optimal partitions; Management; management
                 center; Network management; Network partitioning;
                 optimal network partitioning; Optimization; search
                 problems; stochastic programming; stochastic search
                 method; telecommunication network management",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dhamdhere:1994:TBR,
  author =       "Dhananjay M. Dhamdhere and Sandeep S. Kulkarni",
  title =        "A token based $k$-resilient mutual exclusion algorithm
                 for distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "151--157",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Institute of Technology",
  affiliationaddress = "Bombay, India",
  classification = "721.1; 722.4; 723.1; C4240P (Parallel programming
                 and algorithm theory); C5470 (Performance evaluation
                 and testing); C6120 (File organisation); C6150N
                 (Distributed 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 =     "Algorithms; Calculations; complexity analysis;
                 computational complexity; correctness proofs; data
                 structures; distributed algorithms; Distributed
                 computing; distributed computing; Distributed control
                 systems; distributed systems; fault tolerance; Fault
                 tolerant computer systems; fault tolerant computing; K
                 resiliency; k-resiliency; local data structure; message
                 passing; Mutual exclusion; site/link failures; token
                 based k-resilient mutual exclusion algorithm; token
                 message",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yuan:1994:LPS,
  author =       "Li Yan Yuan",
  title =        "Logic program semantics and circumscription of
                 autoepistemic theories",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "159--164",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (03B60 03B70 68N17)",
  MRnumber =     "95e:68136",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Alberta",
  affiliationaddress = "Edmonton, Alberta, Can",
  classification = "721.1; 723.1; 921.3; C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory); C6110L (Logic programming)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "alternating fixpoints; autoepistemic logic;
                 Autoepistemic logic; autoepistemic theories;
                 circumscription; Circumscription; formal logic; Formal
                 logic; Gelfond-Lifschitz transformation; logic program
                 semantics; logic programming; Logic programming;
                 Mathematical transformations; nonmonotonic reasoning;
                 Nonmonotonic reasoning; programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baldoni:1994:DAM,
  author =       "R. Baldoni and B. Ciciani",
  title =        "Distributed algorithms for multiple entries to a
                 critical section with priority",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "3",
  pages =        "165--172",
  day =          "9",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Roma `La Sapienza",
  affiliationaddress = "Roma, Italy",
  classification = "721.1; 722.4; 723.1; C4240P (Parallel programming
                 and algorithm theory); C5220P (Parallel architecture);
                 C6150N (Distributed systems)",
  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 =     "Algorithms; concurrency control; critical section;
                 Critical section; distributed algorithms; Distributed
                 control systems; distributed mutual exclusion
                 algorithms; FCFS discipline; head-of-line;
                 implementation overhead; ME requests; message passing;
                 multiple entries; Mutual exclusion; performance
                 indices; physical arrival time; Priority; priority
                 disciplines; priority-based serialization discipline;
                 short-job-first; shortest-remaining-job-first;
                 starvation; token-based ME algorithms; virtual
                 generation time",
  treatment =    "P Practical",
}

@Article{Sugihara:1994:SPR,
  author =       "K\=okichi Sugihara",
  title =        "Simpler proof of a realizability theorem on {Delaunay}
                 triangulations",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "173--176",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 281 301",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tokyo",
  affiliationaddress = "Tokyo, Jpn",
  classification = "721.1; 723.5; 921.4; B0290T (Finite element
                 analysis); C4185 (Finite element analysis); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Math. Eng. and Inf. Phys., Tokyo Univ.,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational geometry; computational geometry;
                 Computational methods; Data structures; Delaunay
                 triangulation; Delaunay triangulations; Geometry; inner
                 triangulation; mesh generation; Realizability;
                 realizability theorem; simple polygon; Theorem proving;
                 Topology; Voronoi diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Resende:1994:STN,
  author =       "R. F. Resende and A. {El Abbadi}",
  title =        "On the serializability theorem for nested
                 transactions",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "177--183",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68Q10)",
  MRnumber =     "1 281 302",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "721.1; 723.2; 723.3; 921.4; C4250 (Database
                 theory)",
  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 =     "acyclicity; Concurrency control; concurrency control;
                 Conflict serializability; conflict serializability;
                 correctness criteria; Data processing; Database
                 systems; database theory; Graph theory; necessary and
                 sufficient conditions; Nested transactions; nested
                 transactions; Programming theory; Serializability
                 theorem; serializability theorem; Serialization graphs;
                 Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ravi:1994:PDA,
  author =       "R. Ravi",
  title =        "A primal-dual approximation algorithm for the
                 {Steiner} forest problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "185--189",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "95d:05127",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "721.1; 921.4; 921.5; C1160 (Combinatorial
                 mathematics); C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. 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; Approximation algorithm; approximation
                 theory; computational complexity; Computational
                 complexity; Estimation; graph theory; Graph theory;
                 nonnegative edge-costs; Optimization; Primal dual
                 method; primal-dual approximation algorithm; Steiner
                 forest problem; Trees (mathematics); undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Manber:1994:AAM,
  author =       "Udi Manber and Sun Wu",
  title =        "An algorithm for approximate membership checking with
                 application to password security",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "191--197",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Arizona",
  affiliationaddress = "Tucson, AZ, USA",
  classification = "723.2; 723.3; C6120 (File organisation); C6130S
                 (Data security)",
  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; approximate matching; approximate
                 membership checking; Approximate string matching;
                 Bibliographic files; bibliographic files; Bloom
                 filters; Codes (symbols); Cryptography; data structure;
                 Data structures; data structures; password guessing;
                 Password security; password security; Query languages;
                 query word; Security of data; security of data; Spell
                 checking; spelling correction",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Radhakrishnan:1994:DMC,
  author =       "Jaikumar Radhakrishnan and K. V. Subrahmanyam",
  title =        "Directed monotone contact networks for threshold
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "199--203",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tata Inst of Fundamental Research",
  affiliationaddress = "Bombay, India",
  classification = "721.1; 723.5; 921.1; 921.4; C4210 (Formal logic);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Theor. Comput. Sci. Group, 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 =     "Boolean functions; Computational complexity;
                 computational complexity; Computational methods;
                 Contact networks; Directed monotone contact networks;
                 directed monotone contact networks; Function
                 evaluation; Graph theory; lower bound; Threshold
                 functions; threshold functions; threshold logic; upper
                 bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Narayanaswami:1994:AE,
  author =       "Chandrasekhar Narayanaswami and William Luken",
  title =        "Approximating $x^n$ efficiently",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "205--210",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65D20 (41-04 65B99)",
  MRnumber =     "95b:65031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Advanced Workstations and Systems Div",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 723.2; 723.5; 741.2; 921.1; 921.6; B0290F
                 (Interpolation and function approximation); C4130
                 (Interpolation and function approximation); C6130B
                 (Graphics techniques)",
  corpsource =   "IBM Adv. Workstations and Syst. Div., Austin, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "$x^n$ approximation; approximation theory;
                 Approximation theory; Color computer graphics;
                 Computational complexity; Computational methods;
                 computer graphics; elementary functions; floating-point
                 arithmetic; Function evaluation; graphics modeling;
                 Image quality; Light intensity computation; look-up
                 tables; performance requirements; Polynomial
                 evaluation; Polynomials; polynomials; power function;
                 scientific applications; Semiconducting silicon; Table
                 lookup",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Istrail:1994:BWP,
  author =       "Sorin Istrail and Dejan Zivkovic",
  title =        "Bounded-width polynomial-size {Boolean} formulas
                 compute exactly those functions in {${\rm AC}^0$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "211--216",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15)",
  MRnumber =     "95f:68080",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Algorithms and Discrete Mathematics",
  affiliationaddress = "Albuquerque, NM, USA",
  classification = "721.1; 723.5; 921.1; 921.4; C4210 (Formal logic);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Sandia Nat. Labs., Dept. 1423, Algorithms and Discrete
                 Math., Albuquerque, NM, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "AC/sup 0/; Boolean circuit complexity; Boolean
                 functions; Bounded width polynomial size Boolean
                 formula; bounded-width polynomial-size Boolean
                 formulas; Complexity classes; complexity classes;
                 Computational complexity; computational complexity;
                 Computational methods; Equivalence classes; Graph
                 theory; NC/sup 1/; Polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Berkovich:1994:MIN,
  author =       "Simon Y. Berkovich",
  title =        "Multiprocessor interconnection network using pairwise
                 balanced combinatorial designs",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "217--222",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "George Washington Univ",
  affiliationaddress = "WA, DC, USA",
  classification = "703.1; 721.2; 721.3; 722.3; 722.4; 921.4; C4230M
                 (Multiprocessor interconnection); C5670 (Network
                 performance); C6110J (Object-oriented programming)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., George
                 Washington Univ., Washington, DC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bus interconnection networks; Combinatorial circuits;
                 Combinatorial design; Combinatorial mathematics;
                 Computer networks; Connecting elements; connecting
                 elements; Data processing; Distributed computer
                 systems; distributed fault-tolerant systems; Electric
                 network topology; Fault tolerant computer systems;
                 fault tolerant computing; Interconnection networks;
                 Interfaces (computer); Logic design; Multiprocessing
                 systems; multiprocessor interconnection networks;
                 Object oriented constructs; Object oriented
                 programming; object-oriented constructs;
                 object-oriented programming; pairwise balanced
                 combinatorial designs; Pairwise balanced design
                 property; pairwise balanced design property; Processing
                 elements",
  treatment =    "P Practical",
}

@Article{Wang:1994:CGC,
  author =       "Yi-Min Wang and Andy Lowry and W. Kent Fuchs",
  title =        "Consistent global checkpoints based on direct
                 dependency tracking",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "4",
  pages =        "223--230",
  day =          "25",
  month =        may,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "722.3; 722.4; 921.4; B6150M (Protocols); C5640
                 (Protocols); C5670 (Network performance)",
  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 =     "Consistent global checkpoints; consistent global
                 checkpoints; Direct dependency tracking; direct
                 dependency tracking; Distributed computer systems;
                 distributed processing; distributed system; Fault
                 tolerant computer systems; fault tolerant computing;
                 happened before relation; Happened before relations;
                 Mathematical models; maximum-sized antichains; Minimum
                 sized antichains; Network protocols; partially ordered
                 set; Partially ordered sets; protocols; Set theory;
                 State estimation; uncoordinated checkpointing
                 protocols; Uncoordinated checkpoints",
  treatment =    "P Practical",
}

@Article{Manzini:1994:SMV,
  author =       "Giovanni Manzini",
  title =        "Sparse matrix vector multiplication on distributed
                 architectures: Lower bounds and average complexity
                 results",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "231--238",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q25)",
  MRnumber =     "95f:68095",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNR",
  affiliationaddress = "Pisa, Italy",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4140 (Linear algebra); C4240P (Parallel programming
                 and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Istituto di Matematica Computazionale, CNR, Pisa,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Average complexity; average complexity
                 results; computational complexity; distributed
                 architectures; Distributed computer systems; graph
                 theory; local memory machine; lower bounds; Matrix
                 algebra; matrix algebra; nonzero elements; parallel
                 algorithms; Parallel processing systems; Probability;
                 probability; Sparse matrices; sparse matrix vector
                 multiplication; Vectors; Worst case behavior; worst
                 case behaviour",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moore:1994:OAC,
  author =       "Dennis Moore and W. F. Smyth",
  title =        "An optimal algorithm to compute all the covers of a
                 string",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "239--246",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25 68R15)",
  MRnumber =     "95f:68091",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Curtin Univ of Technology",
  affiliationaddress = "Bentley, Aust",
  classification = "721; 723; 921; C1160 (Combinatorial mathematics);
                 C1180 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Sch. of Comput., Curtin Univ. of Technol., Bentley,
                 WA, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm design; Algorithms; Analysis of algorithms;
                 characterization theorem; Combinatorial mathematics;
                 combinatorial mathematics; combinatorial problems;
                 Computation theory; computational complexity; Data
                 processing; Design of algorithms; easily computed
                 normal form; nonempty string; Numerical analysis;
                 optimal algorithm; optimisation; simple recursive
                 algorithm; String covers; string covers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Neilsen:1994:NCM,
  author =       "Mitchell L. Neilsen and Masaaki Mizuno",
  title =        "Nondominated $k$-coteries for multiple mutual
                 exclusion",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "247--252",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sun May 02 08:37:43 1999",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Neilsen:1996:ENC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Oklahoma State Univ",
  affiliationaddress = "Stillwater, OK, USA",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Oklahoma State Univ.,
                 Stillwater, OK, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; communication line failure; composition;
                 Coterie; distributed algorithms; Distributed computer
                 systems; Distributed computing; distributed computing;
                 fault tolerance; Fault tolerant computer systems; fault
                 tolerant computing; multiple mutual exclusion; Mutual
                 exclusion; mutual exclusion algorithms; Network
                 protocols; node failure; nondominated k-coteries;
                 Numerical methods; protocols; Quorum; quorum-based
                 mutual exclusion algorithms; set theory; weighted
                 voting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Li:1994:TPS,
  author =       "Huade Li",
  title =        "Trajectory planning in {$H$}-space",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "253--258",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "95f:68243",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Griffith Univ",
  affiliationaddress = "Queensland, Aust",
  classification = "721; 723; 731; 921; C3120C (Spatial variables);
                 C3390 (Robotics); C4260 (Computational geometry)",
  conferenceyear = "1994",
  corpsource =   "Sch. of Comput. and Inf. Technol., Griffith Univ.,
                 Brisbane, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; centrifugal force; circular robots;
                 collinear; collision-free trajectory; Computation
                 theory; Computational geometry; computational geometry;
                 Graph theory; H-space; mobile robots; path planning;
                 Planning; position control; Robotics; speed
                 requirements; Trajectories; Trajectory planning;
                 trajectory planning; Unknown terrain",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zhang:1994:SRC,
  author =       "Xubo Zhang and Z. Meral {\"O}zsoyo{\v{g}}lu",
  title =        "Some results on the containment and minimization of
                 (in)equality queries",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "259--267",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20",
  MRnumber =     "95d:68034",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory); C4250 (Database theory); C6160D
                 (Relational DBMS); C6160K (Deductive databases)",
  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 =     "computational complexity; conjunctive queries;
                 containment; database theory; deductive databases;
                 equality queries; homomorphism property; minimisation;
                 minimization; NP-complete; optimisation; query
                 optimization; relational databases",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Perleberg:1994:SCS,
  author =       "Chris H. Perleberg",
  title =        "Single character searching methods and the shift-or
                 pattern-matching algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "269--275",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Chile",
  affiliationaddress = "Santiago, Chile",
  classification = "721; 723; 921; C1250 (Pattern recognition); C4240
                 (Programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. de Ciencias de la Comput., Chile Univ.,
                 Santiago, Chile",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; approximate pattern
                 matching; C (programming language); Data processing;
                 longest substring searching; Parallel processing
                 systems; Pattern matching; Pattern recognition; pattern
                 recognition; shift-or pattern-matching algorithm;
                 Single character searching (SCS); single character
                 searching methods; String searching; tuned Boyer--Moore
                 implementation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jimbo:1994:RBD,
  author =       "Shuji Jimbo and Akira Maruoka",
  title =        "On the relationship between the diameter and the size
                 of a boundary of a directed graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "277--282",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (68R10)",
  MRnumber =     "95i:05066",
  MRreviewer =   "{\'A}kos Seress",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tohoku Univ",
  affiliationaddress = "Sendai, Jpn",
  classification = "721; 722; 723; 921; B0250 (Combinatorial
                 mathematics); C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Inf. Eng., Tohoku Univ., Sendai, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boundaries; Boundary value problems; Combinatorial
                 mathematics; computational complexity; Computer
                 networks; directed graph; directed graphs; Expanding
                 graphs; expanding graphs; Graph theory; Linear algebra;
                 Linear functions; one-dimensional linear functions;
                 random numbers; sorting; sorting networks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Punnen:1994:FSA,
  author =       "Abraham P. Punnen and K. P. K. Nair",
  title =        "A fast and simple algorithm for the bottleneck
                 biconnected spanning subgraph problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "283--286",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "95b:05193",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of New Brunswick",
  affiliationaddress = "Fredericton, NB, Can",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Fac. of Adm., New Brunswick Univ., Fredericton, NB,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; bottleneck biconnected spanning subgraph
                 problem; bottleneck objective function; Bottleneck
                 optimization; Combinatorial mathematics; combinatorial
                 mathematics; Complexity; computational complexity;
                 Computer networks; Graph theory; min-sum version;
                 NP-hard; Optimization; Subgraph problem; undirected
                 graph; worst-case complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1994:IPC,
  author =       "Anonymous",
  title =        "{IPL}'s policy on complexity results",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "287--287",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 07:52:53 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bertoni:1994:OLB,
  author =       "Alberto Bertoni and Carlo Mereghetti and Giovanni
                 Pighizzini",
  title =        "An optimal lower bound for nonregular languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "289--292",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q25)",
  MRnumber =     "95c:68126",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Bertoni:1994:COL}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita degli Studi di Milano",
  affiliationaddress = "Milano, Italy",
  classification = "721.1; C4210 (Formal logic); C4220 (Automata
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; computational complexity;
                 Computational methods; Equivalence classes; Formal
                 languages; formal languages; input head inversions;
                 Nonregular languages; nonregular languages; Optimal
                 lower bound; optimal lower bound; Theorem proving;
                 Turing machine; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pirillo:1994:IWB,
  author =       "Giuseppe Pirillo",
  title =        "Infinite words and biprefix codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "293--295",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (94A45)",
  MRnumber =     "95c:68133",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IAMI",
  affiliationaddress = "Firenze, Italy",
  classification = "721.1; 921.4; C1160 (Combinatorial mathematics);
                 C4210 (Formal logic)",
  corpsource =   "IAMI, CNR, Firenze, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Biprefix codes; biprefix codes; Codes (symbols);
                 Combinatorial mathematics; combinatorial mathematics;
                 Computational complexity; Computational methods;
                 Computer science; Formal languages; formal languages;
                 Infinite words; infinite words; positive integers;
                 Terminology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1994:MFA,
  author =       "Chiu-Chuan Lin and Ferng-Ching Lin",
  title =        "Minimal fully adaptive wormhole routing on
                 hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "297--301",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "703.1; 716.1; 721.1; 722.3; 722.4; 723.2; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture)",
  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 =     "adaptive routing method; Adaptive systems; Algorithms;
                 Communication channels (information theory); Critical
                 path analysis; Data communication systems; Data storage
                 equipment; Data transfer; Electric network topology;
                 Hypercube multicomputer; hypercube networks;
                 hypercubes; minimum fully adaptive wormhole routing;
                 Multiprocessing systems; Performance; performance
                 degradation; shortest paths; Switching; switching
                 technique; Telecommunication traffic; Traffic load;
                 Virtual channel; Virtual storage; Wormhole routing",
  treatment =    "P Practical",
}

@Article{Galvez:1994:NPL,
  author =       "Jos{\'e} Fortes G{\'a}lvez",
  title =        "A note on a proposed {LALR} parser for extended
                 context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "303--305",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad de Las Palmas de Gran Canaria",
  affiliationaddress = "Canarias, Spain",
  classification = "721.1; 723.1; C4210 (Formal logic)",
  corpsource =   "Dept. de Inf., Univ. de Las Palmas de Gran Canaria,
                 Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Codes (symbols); Context free grammars;
                 Context free languages; context-free grammars; Counter
                 example grammar; Deterministic finite automata;
                 Extended context free grammars; extended context-free
                 grammars; Finite automata; LALR parser; LALR parser
                 generation; Regular right part grammars; regular right
                 part grammars",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Nykanen:1994:FLC,
  author =       "Matti Nyk{\"a}nen and Esko Ukkonen",
  title =        "Finding lowest common ancestors in arbitrarily
                 directed trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "307--310",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68P20)",
  MRnumber =     "1 286 607",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Helsinky",
  affiliationaddress = "Helsinky, Finl",
  classification = "721.1; 723.2; 723.5; 921.4; 921.6; C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Helsinki Univ., Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Arbitrarily directed trees; arbitrarily
                 directed trees; Computational complexity; Computational
                 methods; Computer simulation; Data structures; Graph
                 theory; Linear time; Lowest common ancestors; lowest
                 common ancestors; Mathematical models; rooted tree;
                 Theorem proving; tree data structures; Trees
                 (mathematics)",
  treatment =    "P Practical",
}

@Article{Alagar:1994:OAD,
  author =       "Sridhar Alagar and S. Venkatesan",
  title =        "An optimal algorithm for distributed snapshots with
                 causal message ordering",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "311--316",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  classification = "716.1; 721.1; 722.3; 722.4; 723.2; 921.6; B6150M
                 (Protocols); C4240 (Programming and algorithm theory);
                 C5640 (Protocols)",
  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 =     "Algorithms; Casual ordering; causal message ordering;
                 Communication channels (information theory);
                 communication complexity; Computational complexity;
                 Data communication systems; Data recording; Distributed
                 computer systems; distributed snapshots; distributed
                 system; global state; Global states; Message
                 complexity; optimal algorithm; Optimal distributed
                 algorithm; Optimal systems; protocols",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gergov:1994:CAM,
  author =       "Jordan Gergov and Christoph Meinel",
  title =        "On the complexity of analysis and manipulation of
                 {Boolean} functions in terms of decision graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "317--322",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "95e:68088",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Informatik Univ of Trier",
  affiliationaddress = "Trier, Ger",
  classification = "721; 721.2; 723.2; 723.5; 921.1; 921.4; C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory); C7410D (Electronic engineering)",
  corpsource =   "Fachbereich IV-Inf., Trier Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Boolean functions; Boolean manipulation;
                 Branching programs; circuit CAD; complexity;
                 Computational complexity; computational complexity;
                 Computer aided logic design; Data structures; Decision
                 graphs; decision graphs; Decision theory; Equivalence
                 classes; equivalence test; Function evaluation; Graph
                 theory; Logic circuits; Ordered binary decision
                 diagrams; Polynomials; restricted branching programs;
                 satisfiability; tautology test; Turing machines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Atkinson:1994:UGF,
  author =       "M. D. Atkinson and J.-R. Sack",
  title =        "Uniform generation of forests of restricted height",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "323--327",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "1 286 609",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of St. Andrews",
  affiliationaddress = "St. Andrews, Scotl",
  classification = "721.1; 722.1; 723.2; 921.6; 922.1; C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Math. and Comput. Sci., St. Andrews Univ.,
                 UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Computational
                 complexity; Computational methods; Data storage
                 equipment; Data structures; Information storage; k-way
                 forests; Random generation; Random processes;
                 restricted height forests; Theorem proving; tree data
                 structures; Trees (mathematics); Trees and forests;
                 uniform generation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Naumann:1994:RTP,
  author =       "David A. Naumann",
  title =        "A recursion theorem for predicate transformers on
                 inductive data types",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "329--336",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q65",
  MRnumber =     "95h:68134",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Southwestern Univ",
  affiliationaddress = "Georgetown, TX, USA",
  classification = "721.1; 723.2; 921.1; 921.2; 921.3; 921.5; C4240
                 (Programming and algorithm theory); C6110B (Software
                 engineering techniques); C6120 (File organisation)",
  corpsource =   "Math. and Comput. Sci., Southwestern Univ.,
                 Georgetown, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; calculus of functions; Catamorphism;
                 Computational complexity; Data structures; data
                 structures; demonic nondeterminacy; Differentiation
                 (calculus); direct manipulation; formal specification;
                 Function evaluation; homomorphisms; Inductive data
                 type; inductive data types; initial algebras; Lax
                 exponent; Mathematical programming; Mathematical
                 transformations; Predicate transformers; predicate
                 transformers; program verification; Programming
                 calculi; Recursion theorem; recursion theorem;
                 Recursive functions; Refinement calculus;
                 specifications; state-transformation programs;
                 structural recursion; Theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pagli:1994:CNF,
  author =       "Linda Pagli and Geppino Pucci",
  title =        "Counting the number of fault patterns in redundant
                 {VLSI} arrays",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "6",
  pages =        "337--342",
  day =          "27",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35",
  MRnumber =     "1 286 611",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "714.2; 721.1; 722.4; B2570 (Semiconductor integrated
                 circuits); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  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 =     "Arrays; Bidirectional links; bidirectional links;
                 Distributed computer systems; Electric wiring; Fault
                 patterns; fault patterns; Fault tolerant computer
                 systems; fault tolerant computing; Integrated circuit
                 layout; Integrated circuit manufacture; link-redundant
                 linear array; lower bounds; Microprocessor chips;
                 parallel processing; Parallel processing systems;
                 Performance; performance evaluation; reconfigurable
                 architectures; reconfiguration capabilities;
                 Redundancy; redundancy; redundant VLSI arrays;
                 Topology; Unidirectional links; unidirectional links;
                 upper bounds; VLSI; VLSI arrays; VLSI circuits",
  treatment =    "P Practical",
}

@Article{Diks:1994:OCV,
  author =       "Krzysztof Diks and Evangelos Kranakis and Danny
                 Krizanc and Bernard Mans and Andrzej Pelc",
  title =        "Optimal coteries and voting schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "1--6",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "95c:68021",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Uniwersytet Warszawski",
  affiliationaddress = "Warszawa, Pol",
  classification = "722.4; 723.1; 921.5; 921.6; 922.2; C4240
                 (Programming and algorithm theory); C5620 (Computer
                 networks and techniques); C5670 (Network performance)",
  conferenceyear = "1994",
  corpsource =   "Inst. Inf., Warsaw Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arbitrary networks; Availability; Bipartite networks;
                 complete multipartite networks; computational
                 complexity; computer networks; Computer system
                 recovery; connected subgraph; Decision theory;
                 Distributed computer systems; Error analysis; Fault
                 tolerant computer systems; fault tolerant computing;
                 Mathematical models; Multipartite networks; network
                 availability; node reliability; operating nodes;
                 Optimal coteries; optimal coteries; Optimal systems;
                 Optimization; Sperner systems; Systems analysis; Voting
                 machines; Voting schemes; voting schemes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mahajan:1994:NSF,
  author =       "Meena Mahajan and Thomas Thierauf and N. V.
                 Vinodchandran",
  title =        "A note on {SpanP} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "7--10",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "95i:68048",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst of Mathematical Sciences",
  affiliationaddress = "Madras, India",
  classification = "721.1; 921.1; C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Inst. of Math. Sci., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Boolean functions; Computational complexity;
                 computational complexity; Equivalence classes; Function
                 evaluation; GapSpanP; Mathematical models;
                 nondeterministic Turing machine; NP sets; SpanP
                 functions; State assignment; Subtraction; Theorem
                 proving; Turing machines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wen:1994:NAL,
  author =       "Zhaofang Wen",
  title =        "New algorithms for the {LCA} problem and the binary
                 tree reconstruction problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "11--16",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68R10)",
  MRnumber =     "95i:68057",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Duluth, MN, USA",
  classification = "722.4; 723.1; 723.2; 921.4; 921.6; C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Duluth, MN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; All nearest smaller value problem; All
                 Nearest Smaller Value problem; All Nearest Taller Value
                 problem; binary tree reconstruction problem; data
                 structure; Data structures; LCA problem; Lowest common
                 ancestor; lowest common ancestor; Mathematical models;
                 Numerical analysis; parallel algorithm design; Parallel
                 algorithms; parallel algorithms; Parallel processing
                 systems; Program processors; R-forest; tree data
                 structures; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jimbo:1994:RBB,
  author =       "Shuji Jimbo and Akira Maruoka",
  title =        "On the relationship between $\epsilon$-biased random
                 variables and $\epsilon$-dependent random variables",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "17--23",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "60E05 (60G99)",
  MRnumber =     "95c:60016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tohoku Univ",
  affiliationaddress = "Sendai, Jpn",
  classification = "723.1; 921.1; 922.1; C4240 (Programming and
                 algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Inf. 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; Distribution; Epsilon
                 biased random variables; Epsilon dependent random
                 variables; in-biased random variables; in-dependent
                 random variables; Independence; independent random
                 variables; Linear algebra; Mathematical models; maximum
                 norm; Parameter estimation; Probability; Random
                 processes; randomized algorithms; Randomized
                 algorithms; randomness; Sample space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1994:FAE,
  author =       "Ling Chen and Henry Y. H. Chuang",
  title =        "A fast algorithm for {Euclidean} distance maps of a
                 $2${-D} binary image",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "25--29",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10",
  MRnumber =     "95g:68133",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Yangzhou Univ",
  affiliationaddress = "Jiangsu, China",
  classification = "721.1; 722.4; 723.1; 723.2; 723.5; 731.5; C1250
                 (Pattern recognition); C4240P (Parallel programming and
                 algorithm theory); C4260 (Computational geometry);
                 C5260B (Computer vision and picture processing)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Math., Teacher's Coll., Yangzhou Univ.,
                 Jiangsu, China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2-D binary image; Algorithms; Computational
                 complexity; computational complexity; computational
                 geometry; Computational methods; Computer vision;
                 computer vision; EREW; Euclidean distance maps;
                 exclusive read exclusive write; Fast algorithms; Image
                 analysis; Image processing; image processing; Image
                 quality; parallel algorithm; parallel algorithms;
                 Parallel processing systems; parallel random access
                 machine; Pattern recognition; pattern recognition;
                 PRAM; Robotics; robotics; time complexity; Two
                 dimensional binary image",
  treatment =    "A Application; P Practical",
}

@Article{Gil:1994:DAE,
  author =       "Joseph Gil and Yossi Matias",
  title =        "Designing algorithms by expectations",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "31--34",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q25)",
  MRnumber =     "95f:68065",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion - Israel Inst of Technology",
  affiliationaddress = "Haifa, Isr",
  classification = "722.4; 723.1; 921.6; 922.1; C4240P (Parallel
                 programming and algorithm theory)",
  conferenceyear = "1994",
  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 =     "Algorithm analysis; Algorithms; designing by
                 expectation; Designing by expectations; Iterative
                 methods; Mathematical models; Numerical analysis;
                 Parallel algorithms; parallel algorithms; Parallel
                 processing systems; Random processes; Randomized
                 algorithms; randomized algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Igarashi:1994:ABS,
  author =       "Yoshihide Igarashi and Shingo Osawa and Walter Unger",
  title =        "Automorphisms of broadcasting schemes with respect to
                 start rounds",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "35--41",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (90B12)",
  MRnumber =     "95e:68015",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Gunma Univ",
  affiliationaddress = "Kiryu, Jpn",
  classification = "716.1; 722.4; 723.1; 723.3; 903.2; 903.3; C5620
                 (Computer networks and techniques); C5670 (Network
                 performance)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Gumma Univ., Kiryu, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automorphisms; automorphisms; binary jumping scheme;
                 Broadcasting; broadcasting schemes; Coding errors;
                 computer networks; Distributed computer systems;
                 Distributed database systems; Distributed systems;
                 Error analysis; Fault tolerant computer systems; fault
                 tolerant computing; hypercubes; Information
                 dissemination; Information retrieval systems;
                 Mathematical models; Program processors; start rounds;
                 Theorem proving",
  treatment =    "P Practical",
}

@Article{Sinachopoulos:1994:LDL,
  author =       "Antonia Sinachopoulos",
  title =        "Logics and decidability for labelled pre- and
                 partially-ordered {Kripke} structures",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "43--52",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B45 (03B25 03B70)",
  MRnumber =     "95e:03061",
  MRreviewer =   "Branislav Bori{\v{c}}i{\'c}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Libre de Bruxelles",
  affiliationaddress = "Bruxelles, Belgium",
  classification = "721.1; 722.4; 723.1; 723.2; C4210 (Formal logic)",
  conferenceyear = "1994",
  corpsource =   "Dept. 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 =     "Axiomatics; axiomatization; Computability and
                 decidability; Computational linguistics; Concurrency;
                 concurrency; concurrent systems; Data structures;
                 decidability; Distributed computer systems; distributed
                 systems; Formal languages; Formal logic; labelled next
                 operators; Labelled partially ordered Kripke
                 structures; Labelled preordered Kripke structures;
                 nondeterminism; Partial order temporal logic; partial
                 order temporal logic; partially ordered Kripke
                 structures; preordered Kripke structures; State
                 assignment; temporal logic; tiling problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Halperin:1994:CDC,
  author =       "Dan Halperin and Micha Sharir",
  title =        "Corrigendum: {``On disjoint concave chains in
                 arrangements of (pseudo) lines'' [Inform. Process.
                 Lett. {\bf 40} (1991), no. 4, 189--192; MR
                 92m:52029]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "53--56",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B55 (05D05 68U05)",
  MRnumber =     "95g:52024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Halperin:1991:DCC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "721.1; 723.5; 921.4; 921.6; C4260 (Computational
                 geometry)",
  conferenceyear = "1994",
  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 =     "Arrangements; Combinatorial mathematics; Computational
                 complexity; computational geometry; Computational
                 methods; disjoint concave chains; Disjoint concave
                 chains; Geometry; Mathematical models;
                 pairwise-disjoint x-monotone concave polygonal chains;
                 Polygonal chains; Pseudo lines; pseudo lines
                 arrangements; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blum:1994:LBS,
  author =       "Norbert Blum and Henning Rochow",
  title =        "A lower bound on the single-operation worst-case time
                 complexity of the union-find problem on intervals",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "57--60",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68P05)",
  MRnumber =     "95f:68100",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Bonn",
  affiliationaddress = "Bonn, Ger",
  classification = "721.1; 723.1; 723.2; 921.4; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  corpsource =   "Inf. IV, Bonn Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Analysis of algorithms; Computational
                 complexity; computational complexity; Data structures;
                 data structures; Disjoint set union problem; disjoint
                 set union problem; intervals; lower bound;
                 Modification; Performance; pointer-algorithms; Set
                 theory; single-operation worst-case time complexity;
                 Theorem proving; Union find problem; union-find
                 problem; Worst case time complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Basin:1994:TEP,
  author =       "David A. Basin",
  title =        "A term equality problem equivalent to {Graph
                 Isomorphism}",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "61--66",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T15 (03D15)",
  MRnumber =     "95c:68194",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Max-Planck-Inst f{\"u}r Informatik",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "721.1; 722.4; 921.1; 921.4; 921.6; C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  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 =     "Associative commutative function; Associative
                 function; associative-commutative function symbols;
                 Automatic theorem proving; Commutative function;
                 Commutative variable binding operator; commutative
                 variable-binding operators; Computational complexity;
                 computational complexity; Computer hardware; Equality
                 reasoning; External ports; Function evaluation; Graph
                 isomorphism; Graph Isomorphism; Graph theory;
                 Mathematical operators; polynomial time; Polynomials;
                 term equality problem; Theorem proving; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Frazier:1994:PGA,
  author =       "Michael Frazier and C. David {Page, Jr.}",
  title =        "Prefix grammars: An alternative characterization of
                 the regular languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "67--71",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "95h:68109",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois",
  affiliationaddress = "Urbana, IL, USA",
  classification = "721.1; 723.1.1; 723.2; C4210 (Formal logic)",
  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 =     "Algorithms; Binary logic program; Computation theory;
                 computation theory; Computational grammars; Computer
                 programming languages; Data structures; Finite
                 automata; Finite set of unary functions; finite subset;
                 Formal languages; formal languages; grammars;
                 polynomial; Polynomials; Prefix grammar; prefix
                 grammars; Regular language; regular languages;
                 right-linear grammar; Single constant; Single unary
                 predicate; Standards; Suffix grammar; suffix grammars;
                 Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blackburn:1994:IRO,
  author =       "Simon R. Blackburn",
  title =        "Increasing the rate of output of $m$-sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "73--77",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A55",
  MRnumber =     "95e:94015",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of London",
  affiliationaddress = "Surrey, Engl",
  classification = "716.1; 721.1; 722.4; 723.1; 921.6; C4220 (Automata
                 theory); C6130S (Data security)",
  corpsource =   "Dept. of Math., R. Holloway, London Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; Computer hardware; Computer
                 software; coprime; Digital systems; Finite state
                 machine; finite state machine; finite state machines;
                 Generalisation; Information theory; linear feedback
                 shift registers; Linear shift register sequences;
                 linear shift register sequences; m sequences;
                 m-sequences; Mathematical techniques; Matrix algebra;
                 Security of data; security of data; Shift registers;
                 Statistical properties; stream ciphers; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hemaspaandra:1994:CTC,
  author =       "Edith Hemaspaandra",
  title =        "Census techniques collapse space classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "79--84",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "95g:68036",
  MRreviewer =   "Stanis{\l}aw P. Radziszowski",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Le Moyne Coll",
  affiliationaddress = "Syracuse, NY, USA",
  classification = "721.1; 723.2; 921.6; C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Le Moyne Coll., Syracuse, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary search; Census techniques; census techniques;
                 Computation tree; Computational complexity;
                 computational complexity; Computational methods; Data
                 structures; Deterministic machines; Oracle tree;
                 Polynomials; Space classes; structural complexity
                 theory; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1994:GCD,
  author =       "Eun-Jung Lee and Kwang-Moo Choe",
  title =        "Grammar coverings of a deterministic parser with
                 action conflicts",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "85--92",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q52 (68Q50)",
  MRnumber =     "95e:68125",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://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 = "721.1; 723.1; 723.2; C4210 (Formal logic)",
  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 =     "Action conflicts; action conflicts; Ambiguous
                 grammars; ambiguous grammars; Computational grammars;
                 cover grammar; Data processing; Decision theory;
                 deterministic parser; extended LR parsing; Formal
                 languages; formal languages; generation method; Grammar
                 coverings; grammar coverings; grammars; Homomorphism;
                 Parser; Parser generating systems; parser
                 transformations; Parsing; Program compilers; Theorem
                 proving; Theoretical model; transformed parser",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sengupta:1994:FTF,
  author =       "Abhijit Sengupta and Suresh Viswanathan",
  title =        "On fault-tolerant fixed routing in hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "93--99",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M07)",
  MRnumber =     "95e:68020",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of South Carolina",
  affiliationaddress = "Columbia, SC, USA",
  classification = "716.1; 722.3; 722.4; 921.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  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 =     "Computer networks; Data communication systems;
                 Distributed computation; Distributed computer systems;
                 fault occurrences; Fault tolerance; Fault tolerant
                 computer systems; fault tolerant computing;
                 fault-tolerant fixed routing; Fixed routing; Graph
                 theory; hypercube networks; Hypercubes; hypercubes;
                 Information theory; minimum distance routing; Node
                 connectivity; node connectivity; Survival route graph;
                 survival route graphs",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bilardi:1994:LBA,
  author =       "Gianfranco Bilardi and Shiva Chaudhuri and Devdatt
                 Dubhashi and K. Mehlhorn",
  title =        "A lower bound for area-universal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "101--105",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35",
  MRnumber =     "95d:68067",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Padova",
  affiliationaddress = "Padova, Italy",
  classification = "703.1; 714.2; 716.1; 721.1; 722.4; 921.4; C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Elettronica Inf., Padova Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Area universal circuits; Area universal graphs;
                 area-universal circuits; area-universal graphs; circuit
                 layout; Computational complexity; computational
                 complexity; Efficiency; Embeddings; Graph theory;
                 Information theory; Lower bound; lower bound; Networks
                 (circuits); Parallel processing systems; Theorem
                 proving; VLSI circuits",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kirrinnis:1994:OBP,
  author =       "Peter Kirrinnis",
  title =        "An optimal bound for path weights in {Huffman} trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "2",
  pages =        "107--110",
  day =          "26",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68P05)",
  MRnumber =     "95e:68093",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Bonn",
  affiliationaddress = "Bonn, Ger",
  classification = "721.1; 723.2; 921.4; 921.6; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  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 =     "Algorithms; Analysis of algorithms; Approximation
                 theory; Computational complexity; computational
                 complexity; Data structures; Errors; Estimation;
                 Fibonacci numbers; Huffman trees; optimal bound; path
                 weights; Polynomials; tree data structures; Trees
                 (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jerrum:1994:CTG,
  author =       "Mark Jerrum",
  title =        "Counting trees in a graph is {$\#{\rm P}$}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "111--116",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (05C05 68Q25)",
  MRnumber =     "95h:68062",
  MRreviewer =   "Stanis{\l}aw P. Radziszowski",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Edinburgh",
  affiliationaddress = "Edinburgh, Engl",
  classification = "721.1; 723.2; 921.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics)",
  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 =     "Boolean formula; Boolean functions; Combinatorial
                 enumeration; Computational complexity; computational
                 complexity; counting; Counting trees; Data processing;
                 Digital arithmetic; Function evaluation; Gaussian
                 elimination; Graph theory; graph theory; input graph;
                 Matrix algebra; Number theory; planar graph;
                 Polynomials; Spanning trees; State assignment; Theorem
                 proving; trees; Trees (mathematics); trees
                 (mathematics); Turing machines; Turing reducibility;
                 undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lu:1994:CDA,
  author =       "Erl Huei Lu and Yi Chang Chen and Hsiao Peng Wuu",
  title =        "A complete decoding algorithm for
                 double-error-correcting primitive binary {BCH} codes of
                 odd $m$",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "117--120",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94B35",
  MRnumber =     "1 290 203",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Lu:1994:CCD}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Chung Cheng Inst of technology",
  affiliationaddress = "Ta-Hsi Tao-Yuan, Taiwan",
  classification = "721.1; 723.2; 921.1; 921.4; 921.6; B6120B (Codes)",
  corpsource =   "Dept. of Electr. Eng., Chung Cheng Inst. of Technol.,
                 Taoyuan, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; BCH codes; binary sequences; Coding
                 errors; complete decoding algorithm; Complete decoding
                 algorithms; complexities; Computational complexity;
                 cube roots; Data structures; Decoding; Double error
                 correcting; double-error-correcting; Error correction;
                 error correction codes; Error vectors; Estimation;
                 Function evaluation; Generator polynomials; Hamming
                 code; long lock lengths; Polynomials; primitive binary
                 BCH codes; Set theory; Table lookup; Theorem proving;
                 trace computation; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Easwarakumar:1994:LAC,
  author =       "K. S. Easwarakumar and C. Pandu Rangan and G. A.
                 Cheston",
  title =        "A linear algorithm for centering a spanning tree of a
                 biconnected graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "121--124",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C05 68Q20 68R10)",
  MRnumber =     "95e:05111",
  MRreviewer =   "Hans L. Bodlaender",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "722.4; 723.2; 921.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4210 (Formal logic)",
  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; arbitrary vertex; Biconnected graph;
                 biconnected graph; Data processing; Distributed
                 computer systems; distributed systems; Eccentricity;
                 graph edges; Graph theory; graph theory; Linear
                 algebra; linear algorithm; Linear time algorithms;
                 linear-time algorithm; Number theory; Real time
                 systems; Set theory; Spanning tree; spanning tree; time
                 algorithm; Trees (mathematics); trees (mathematics);
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bapiraju:1994:EBT,
  author =       "Vinnakota Bapiraju and V. V. Bapeswara Rao",
  title =        "Enumeration of binary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "125--127",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05A15 (05C30)",
  MRnumber =     "95f:05006",
  MRreviewer =   "P. N. Rathie",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "721.1; 723.2; 723.5; 921.4; C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; Binary tree enumeration; binary tree
                 enumeration; binary tree generation; Combinatorial
                 mathematics; combinatorial mathematics; combinatorial
                 problem; Computer applications; Data acquisition;
                 Lexicographic; Number theory; Numerical methods;
                 preorder traversal; sequence generation; tree sequence;
                 Trees (mathematics); trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1994:IPL,
  author =       "Wen Chin Chen and Wen Chun Ni",
  title =        "Internal path length of the binary representation of
                 heap-ordered trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "129--132",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (05C05)",
  MRnumber =     "95e:68035",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "721.1; 723.2; 723.5; 921.4; 921.6; 922.1; C1140
                 (Probability and statistics); C1160 (Combinatorial
                 mathematics); 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 =     "Algorithms; binary representation; Binary sequences;
                 combinatorial algorithms; Combinatorial enumeration;
                 Combinatorial mathematics; Computer applications;
                 Computer systems; data structure; Data structures;
                 Generating function; Heap ordered trees; heap-ordered
                 trees; heapordered tree; HOT; internal path length;
                 Internal path length; minimum key; minimum spanning
                 trees; network flows; Numerical methods; priority
                 queue; probability; Probability; Queueing theory;
                 random n-node heap-ordered tree; Random number
                 generation; Random processes; rooted labeled tree;
                 shortest paths; tree data structures; trees
                 (mathematics); Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hassin:1994:AMA,
  author =       "Refael Hassin and Shlomi Rubinstein",
  title =        "Approximations for the maximum acyclic subgraph
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "133--140",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C85 68Q25)",
  MRnumber =     "95h:05088",
  MRreviewer =   "Marek Kubale",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel-Aviv Univ",
  affiliationaddress = "Tel-Aviv, Isr",
  classification = "721.1; 722.4; 723.2; 921.1; 921.4; 921.5; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Stat. and Operations Res., Tel Aviv Univ.,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Acyclic subgraph; Algorithms; Ancestry relationship;
                 approximation algorithms; Approximation theory;
                 Combinatorial mathematics; combinatorial mathematics;
                 Computational complexity; computational complexity;
                 Data processing; directed graph; directed graphs; Graph
                 theory; maximum acyclic subgraph problem; maximum size
                 arcs; maximum vertex degree; Minimum feedback arc set;
                 optimal solution; Optimization; Permutation
                 optimization problems; Polynomials; Real time systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Deineko:1994:CHL,
  author =       "Vladimir G. De{\u{\i}}neko and Ren{\'e} {van Dal} and
                 G{\"u}nter Rote",
  title =        "The convex-hull-and-line {Traveling Salesman Problem}:
                 {A} solvable case",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "141--148",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (68Q25 90B10)",
  MRnumber =     "95d:90058",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dnepropetrovsk Univ",
  affiliationaddress = "Dnepropetrovsk, Ukraine",
  classification = "721.1; 723.2; 921.1; 921.6; C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Appl. Math., Dnepropetrovsk Univ., Ukraine",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; combinatorial mathematics; computational
                 complexity; Computational complexity; Convex hull;
                 convex-hull-and-line Traveling Salesman Problem;
                 Critical path analysis; Euclidean Traveling Salesman
                 Problem; Euclidean traveling salesman problems; line
                 segment; Numerical analysis; Numerical methods;
                 optimisation; polynomial time algorithm; Polynomial
                 time algorithms; Polynomials; shortest path; Well
                 solvable case; well-solvable case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Szwarcfiter:1994:EKD,
  author =       "Jayme L. Szwarcfiter and Guy Chaty",
  title =        "Enumerating the kernels of a directed graph with no
                 odd circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "149--153",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (68Q25)",
  MRnumber =     "95m:05117",
  MRreviewer =   "Hortensia Galeana-S{\'a}nchez",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidade Federal do Rio de Janeiro",
  affiliationaddress = "Rio de Janeiro, Braz",
  classification = "721.1; 721.3; 723.2; 921.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Inst. de Matematica, Univ. Federal de Rio de Janeiro,
                 Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Arbitrary graphs; Computational
                 complexity; computational complexity; computational
                 geometry; counting problem; Data acquisition; Data
                 structures; Digital arithmetic; Digital circuits;
                 directed graph; Directed graphs; directed graphs;
                 edges; Graph theory; kernel enumeration; Kernels;
                 kernels; No odd circuits; Number theory; odd circuits;
                 P- complete; Polynomial time; polynomial time;
                 Polynomials; Random number generation; Set theory;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramalingam:1994:CLA,
  author =       "G. Ramalingam and Thomas Reps",
  title =        "On competitive on-line algorithms for the dynamic
                 priority-ordering problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "155--161",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "95f:68187",
  MRreviewer =   "Mirko K{\v{r}}iv{\'a}nek",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin-Madison",
  affiliationaddress = "Madison, WI, USA",
  classification = "721.1; 722.4; 723.2; 921.4; 921.6; C1160
                 (Combinatorial mathematics); 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; competitive online algorithms; competitive
                 ratio; Competitive ratio; computational complexity;
                 Computational complexity; constant competitive ratio;
                 DAG; directed acyclic graph; Directed acyclic graph;
                 directed graphs; Dynamic priority ordering problem;
                 dynamic priority-ordering problem; Dynamic topological
                 sorting problems; Graph theory; Number theory; Online
                 systems; prioritization; priority-manipulation
                 operations; sorting; Sorting; topological-sort
                 ordering; Topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hung:1994:FRD,
  author =       "Ching Yu Hung and Behrooz Parhami",
  title =        "Fast {RNS} division algorithms for fixed divisors with
                 application to {RSA} encryption",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "163--169",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 294 308",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "722.4; 723.1; 723.2; 921.6; C4240 (Programming and
                 algorithm theory)C6130S (Data security); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Santa Barbara, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Chinese remainder theorem; Chinese
                 remainder theorem decoding and table lookup;
                 Computational complexity; computational complexity;
                 Computational methods; Computer software; Cryptography;
                 cryptography; Decoding; Digital arithmetic; digital
                 arithmetic; Division; divisor reciprocal;
                 Exponentiation; fast RNS division algorithms; Fixed
                 divisors; fixed divisors; Function evaluation;
                 mathematics computing; Modular multiplication;
                 multiplication; Numbering systems; on-line speed;
                 ordinary integer division; Parallel processing systems;
                 preprocessing; Residue number system; Residue
                 processors; RSA encryption; Sign detection; Table
                 lookup; Time complexity; time complexity",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Raspaud:1994:GSS,
  author =       "Andr{\'e} Raspaud and Eric Sopena",
  title =        "Good and semi-strong colorings of oriented planar
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "171--174",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C15 (05C20)",
  MRnumber =     "95i:05060",
  MRreviewer =   "Michael O. Albertson",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Bordeaux I",
  affiliationaddress = "Talence, Fr",
  classification = "721.1; 723.5; 921.4; B0250 (Combinatorial
                 mathematics); C1160 (Combinatorial mathematics)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arc; Color; Color computer graphics; Combinatorial
                 mathematics; good coloring; graph colouring; Graph
                 theory; k-coloring; Oriented planar graph; oriented
                 planar graphs; semi-strong coloring; Set theory;
                 Theorem proving; vertex; Vertex set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barth:1994:TED,
  author =       "Dominique Barth and Andr{\'e} Raspaud",
  title =        "Two edge-disjoint {Hamiltonian} cycles in the
                 butterfly graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "175--179",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C45 (05C70 68M07)",
  MRnumber =     "95e:05075",
  MRreviewer =   "Brian Alspach",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite Bordeaux",
  affiliationaddress = "Talence, Fr",
  classification = "721.1; 722.4; 723.5; 921.4; C1160 (Combinatorial
                 mathematics); C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Abelian group; butterfly graph; Butterfly graph;
                 Cayley graph; Combinatorial mathematics; combinatorial
                 problems; computer architecture; Computer architecture;
                 Computer simulation; Edge disjoint Hamiltonian cycle;
                 edge-disjoint Hamiltonian cycles; graph theory; Graph
                 theory; group theory; multiprocessor interconnection
                 networks; parallel architectures; parallel machines;
                 Parallel processing systems; recursive construction
                 method; Recursive functions; Set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sridharan:1994:DMI,
  author =       "K. Sridharan and H. E. Stephanou and K. C. Craig and
                 S. S. Keerthi",
  title =        "Distance measures on intersecting objects and their
                 applications",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "181--188",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "95g:68131",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rensselaer Polytechnic Inst",
  affiliationaddress = "Troy, NY, USA",
  classification = "721.1; 731.5; 921.4; 921.6; 943.2; C4260
                 (Computational geometry)",
  corpsource =   "Center for Industrial Innovation, Rensselaer Polytech.
                 Inst., Troy, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; algorithms; collision depth; Computational
                 geometry; computational geometry; Computational
                 methods; Depth of collision; Distance measurement;
                 distance measures; Geometry; intersecting objects; path
                 planning; penetration; planar objects; polyhedral
                 objects; Robotics; robotics; Set theory",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Fischer:1994:CMA,
  author =       "Paul Fischer and Klaus-Uwe H{\"o}ffgen",
  title =        "Computing a maximum axis-aligned rectangle in a convex
                 polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "189--193",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "96h:68205",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Dortmund",
  affiliationaddress = "Dortmund, Ger",
  classification = "721.1; 723.2; 921.4; 921.5; 921.6; C4260
                 (Computational geometry); C6130B (Graphics
                 techniques)",
  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 =     "Algorithms; Binary search; binary search;
                 Calculations; Combinatorial mathematics; computational
                 complexity; Computational geometry; computational
                 geometry; Computational methods; computer graphics;
                 Convex polygon; convex polygon; cyclic order; data
                 structure; Data structures; data structures; Euclidean
                 plane; Function evaluation; Geometry; MAR; maximum
                 area; Maximum axis aligned rectangle; maximum
                 axis-aligned rectangle; Optimization; polygon; Theorem
                 proving; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1994:ECA,
  author =       "Pen Cheng and Shigeru Masuyama",
  title =        "On the equivalence in complexity among three
                 computation problems on maximum number of edge-disjoint
                 $s$-$t$ paths in a probabilistic graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "195--199",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C80)",
  MRnumber =     "95h:68079",
  MRreviewer =   "Charles J. Colbourn",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Toyohashi Univ of Technology",
  affiliationaddress = "Toyohashi-shi, Jpn",
  classification = "721.1; 722.3; 921.1; 921.3; 921.4; 922.1; C1140Z
                 (Other and miscellaneous); C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Knowledge-Based Inf. Eng., Toyohashi Univ. of
                 Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity equivalence; computation problems;
                 Computational complexity; computational complexity;
                 Computer networks; Edge disjoint s t paths;
                 edge-disjoint s-t paths; Equivalence classes; expected
                 value; Failure analysis; Function evaluation; Graph
                 theory; graph theory; Mathematical transformations;
                 Maximum principle; Polynomials; Probabilistic graph;
                 probabilistic graph; Probability; probability;
                 Probability density function; probability density
                 function; Probability distribution function;
                 probability distribution function; random maximum
                 number; Random processes; Reliability; sink; specified
                 source",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Harper:1994:SAP,
  author =       "Robert Harper",
  title =        "A simplified account of polymorphic references",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "201--206",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "95f:68142",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also note \cite{Harper:1996:NSA}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "721.1; 723.1; 723.1.1; 723.2; C4240 (Programming and
                 algorithm theory); C6110 (Systems analysis and
                 programming)",
  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 =     "computational complexity; Computational linguistics;
                 Computer programming; Computer programming languages;
                 Data structures; Formal languages; Formal logic; formal
                 semantics; Functional programming; functional
                 programming; imperative type discipline; polymorphic
                 references; programming languages; Proof of the
                 soundness; References and assignment; semantic
                 formalism; Semantics; simple proof; soundness;
                 structured operational semantics; Syntax; Theorem
                 proving; Toftes imperative type discipline; type
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eppstein:1994:ABS,
  author =       "David Eppstein",
  title =        "Arboricity and bipartite subgraph listing algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "207--211",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C35 68Q25 68R10)",
  MRnumber =     "95j:05157",
  MRreviewer =   "Fabrizio Luccio",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "721.1; 921.4; 921.5; 921.6; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 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 =     "algorithm theory; Algorithms; arboricity; Arboricity
                 bound; Bipartite subgraph; bipartite subgraph listing
                 algorithms; Computational complexity; computational
                 complexity; Graph theory; graph theory; linear time
                 algorithm; maximal complete bipartite subgraphs;
                 n-vertex graph; Optimization; total complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hu:1994:NCA,
  author =       "X. D. Hu and P. D. Chen and F. K. Hwang",
  title =        "A new competitive algorithm for the counterfeit coin
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "213--218",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05A05 (68Q20)",
  MRnumber =     "95h:05001",
  MRreviewer =   "Ding Zhu Du",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Acad Sinica",
  affiliationaddress = "Beijing, China",
  classification = "721.1; 723.2; 921.4; 921.6; C1180 (Optimisation
                 techniques); C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. of Appl. Math., Acad. Sinica, Beijing, China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; competitive algorithm;
                 Computational methods; counterfeit coin problem;
                 Counterfeit coins; mathematical puzzle; search
                 problems; Set theory; Sorting; Weighing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1994:LBR,
  author =       "Bo Chen and Andr{\'e} {van Vliet} and Gerhard J.
                 Woeginger",
  title =        "A lower bound for randomized on-line scheduling
                 algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "219--222",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "95f:68030",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Erasmus Univ Rotterdam",
  affiliationaddress = "Rotterdam, Neth",
  classification = "721.1; 722.4; 723.2; 922.1; C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Econometric Inst., Erasmus Univ., Rotterdam,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial problems; Data structures;
                 lower bound; Machine scheduling; On line algorithms;
                 Online systems; parallel algorithms; parallel machines;
                 Parallel processing systems; Probabilistic logics;
                 Random processes; Randomization; randomized on-line
                 scheduling algorithms; Scheduling; scheduling; Worst
                 case ratio; worst case ratio",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Albacea:1994:PAF,
  author =       "Eliezer A. Albacea",
  title =        "Parallel algorithm for finding a core of a tree
                 network",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "223--226",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "95m:05216",
  MRreviewer =   "Mukkai S. Krishnamoorthy",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of the Philippines at Los Banos",
  affiliationaddress = "Los Banos, Philipp",
  classification = "721.1; 722.1; 722.4; 723.2; 921.4; 921.5; C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Comput. Sci. Lab., Univ. of the Philippines, Laguna,
                 Philippines",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Data structures; EREW PRAM; graph;
                 Location theory; minimisation; minimization; optimal
                 algorithm; Optimal systems; Optimization; Parallel
                 algorithm; parallel algorithm; parallel algorithms;
                 Parallel processing systems; Program processors; Random
                 access storage; Storage allocation (computer); Tree
                 core location; tree network core; Trees (mathematics);
                 trees (mathematics); vertex",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dey:1994:MFC,
  author =       "Tamal K. Dey and Nimish R. Shah",
  title =        "Many-face complexity in incremental convex
                 arrangements",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "227--231",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B30 52B55)",
  MRnumber =     "95g:68121",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kharagpur, India",
  classification = "721.1; 723.2; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry)",
  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 =     "Combinatorial mathematics; Computational complexity;
                 computational complexity; computational geometry;
                 Computational methods; convex cells; Data processing;
                 Hyperplanes; hyperplanes; improved bound; Incremental
                 convex arrangements; incremental convex arrangements;
                 interior-disjoint convex d-polytopes; Many face
                 problem; many-face complexity; plates",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jwo:1994:TDD,
  author =       "Jung Sing Jwo and Tai Ching Tuan",
  title =        "On transmitting delay in a distance-transitive
                 strongly antipodal graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "233--235",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C90 90B12)",
  MRnumber =     "95f:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tunghai Univ",
  affiliationaddress = "Taichung, Taiwan",
  classification = "722.3; 723.1; 723.2; 921.4; C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Inf. and Comput. Sci., Tunghai Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Data structures; Data transfer; delays; Distance
                 transitive strongly antipodal graph;
                 distance-transitive graph; distance-transitive strongly
                 antipodal graph; Graph theory; Large scale systems;
                 parallel algorithms; Parallel processing systems;
                 Program processors; strongly antipodal graph;
                 transmitting delay; Transmitting delay",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shen:1994:RAP,
  author =       "Xiao Jun Shen and Qing Hu and Weifa Liang",
  title =        "Realization of an arbitrary permutation on a
                 hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "237--243",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M07 68Q22)",
  MRnumber =     "95g:68010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Missouri-Kansas City",
  affiliationaddress = "Kansas City, MO, USA",
  classification = "721.1; 721.3; 723.1; 723.2; 922.2; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection)",
  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 =     "(2d-3) step realization; 2-realization; Algorithms;
                 arbitrary permutation; Binary sequences; Circuit
                 switched network; circuit-switched d-dimensional
                 hypercube; Combinatorial algorithm; Combinatorial
                 circuits; combinatorial mathematics; Computer
                 architecture; Data structures; directed edges; explicit
                 combinatorial algorithm; Hypercube; hypercube networks;
                 Large scale systems; Packet switching; packet-switched
                 d-cube; Permutation capability; Realizations;
                 Statistical methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Long:1994:HLL,
  author =       "Philip M. Long",
  title =        "Halfspace learning, linear programming, and
                 nonmalicious distributions",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "245--250",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (90C05)",
  MRnumber =     "95g:68095",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Duke Univ",
  affiliationaddress = "Durham, NC, USA",
  classification = "721.1; 722.4; 723.2; 921.5; 921.6; 922.2; C1180
                 (Optimisation techniques); C1230D (Neural nets); 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; Baum's nonmalicious
                 distribution model; Computation theory; Data
                 structures; Halfspace learning; halfspace learning;
                 learning (artificial intelligence); Learning systems;
                 Linear programming; linear programming; linear
                 programming algorithm; Mathematical models; neural
                 nets; nonmalicious distributions; Perceptron algorithm;
                 perceptron algorithm; Probability; Random processes;
                 Statistical methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Allison:1994:UHA,
  author =       "Lloyd Allison",
  title =        "Using {Hirschberg}'s algorithm to generate random
                 alignments of strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "251--255",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "95g:68039",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Monash Univ",
  affiliationaddress = "Clayton, Aust",
  classification = "721.1; 723.2; 922.1; 922.2; A0250 (Probability
                 theory, stochastic processes, and statistics); A0260
                 (Numerical approximation and analysis); A3620
                 (Macromolecules and polymer molecules); A8715B
                 (Structure, configuration, conformation, and active
                 sites at the biomolecular level); C1140Z (Other and
                 miscellaneous); C4240 (Programming and algorithm
                 theory); C7330 (Biology and medicine)",
  corpsource =   "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; biology computing;
                 Computational complexity; computational complexity;
                 Data structures; DNA; DNA strings; Edit distance;
                 evolutionary distances; family of strings; Hirschberg's
                 algorithm; Longest common subsequence (LCS); longest
                 common subsequence problem; molecular biophysics; Monte
                 Carlo methods; O(n) space; O(n/sup 2/) time;
                 Probability; probability; probability distribution;
                 random alignments; Random number generation; Random
                 processes; random processes; Sampling; space
                 complexity; statistical analysis; statistical
                 estimation; String alignments; strings; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Raz:1994:SCO,
  author =       "Yoav Raz",
  title =        "Serializability by commitment ordering",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "257--264",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68Q10)",
  MRnumber =     "95g:68022",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Digital Equipment Corp",
  affiliationaddress = "Nashua, NH, USA",
  classification = "721.1; 723.2; 723.3; 731.1; C4250 (Database theory);
                 C6130 (Data handling techniques); C6160B (Distributed
                 DBMS)",
  corpsource =   "Digital Equipment Corp., Nashua, NH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "commitment ordering; Commitment ordering (co);
                 Computational linguistics; concurrency control;
                 Concurrency control mechanisms; concurrency control
                 mechanisms; Control systems; Data structures; database
                 theory; Distributed database systems; distributed
                 databases; Global serializability; multiple autonomous
                 database systems; Network protocols; serializability;
                 Strong Strict Two Phase Locking (s-s2pl); strong-strict
                 two phase locking concept; transaction processing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gergov:1994:TST,
  author =       "Jordan Gergov",
  title =        "Time-space tradeoffs for integer, multiplication on
                 various types of input oblivious sequential machines",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "265--269",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q35)",
  MRnumber =     "95k:68075",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Trier",
  affiliationaddress = "Trier, Ger",
  classification = "721.1; 723.2; 921.6; C1140E (Game theory); C1180
                 (Optimisation techniques); C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Trier Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; Boolean functions;
                 branching program size; computational complexity;
                 Computational complexity; Data management; Data
                 structures; decision problem; decision theory; Decision
                 theory; input oblivious sequential machines; integer
                 multiplication; Integer multiplication; integer
                 programming; lower bounds; nontrivial tradeoff results;
                 Oblivious branching programs; sequential machines;
                 Sequential machines; single output Boolean functions;
                 space complexity; Syntactic read k times branching
                 programs; syntactic read-k-times branching programs;
                 Time space tradeoffs; time-space tradeoffs; Turing
                 machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gusfield:1994:FIS,
  author =       "Dan Gusfield",
  title =        "Faster implementation of a shortest superstring
                 approximation",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "271--274",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "95g:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "461.2; 721.1; 723.2; 723.5; 921.4; C4260
                 (Computational geometry); C6120 (File organisation)",
  corpsource =   "Dept. 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; Approximation theory; computational
                 geometry; Data reduction; Data structures; data
                 structures; DNA; Error analysis; error bound; Natural
                 sciences computing; Response time (computer systems);
                 shortest superstring approximation; Shortest
                 superstring problem; shortest superstring problem;
                 Trees (mathematics); Worst case running time; worst
                 case running time",
  treatment =    "P Practical",
}

@Article{Tsai:1994:APG,
  author =       "Ying Teh Tsai and Chuan Yi Tang and Yunn Yen Chen",
  title =        "Average performance of a greedy algorithm for the
                 on-line minimum matching problem on {Euclidean} space",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "275--282",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "95g:68042",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 723.1; 921.6; C4240 (Programming and
                 algorithm theory); C6150J (Operating systems)",
  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 =     "algorithm theory; Algorithms; Average case analysis;
                 average matching cost; average performance;
                 Computational complexity; Euclidean space; greedy
                 algorithm; Greedy algorithm; On line minimum matching
                 problem; on-line minimum matching problem; online
                 operation; Online systems; optimal minimum matching;
                 Performance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Seiden:1994:FSO,
  author =       "Steven S. Seiden and Daniel S. Hirschberg",
  title =        "Finding succinct ordered minimal perfect hash
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "283--288",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68P20)",
  MRnumber =     "1 294 708",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "721.1; 723.1; 723.2; C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  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 =     "Computational complexity; computational complexity;
                 data; Data description; Data structures; file
                 organisation; hash table; keys; Ordered minimal perfect
                 hash functions; Perfect hashing; Predefined key set
                 collision; representation space requirements; Storage
                 allocation (computer); succinct ordered minimal perfect
                 hash functions; Table lookup; time complexity; Unused
                 space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chandra:1994:CSS,
  author =       "Barun Chandra",
  title =        "Constructing sparse spanners for most graphs in higher
                 dimensions",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "289--294",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68U05)",
  MRnumber =     "95m:05219",
  MRreviewer =   "Mukkai S. Krishnamoorthy",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Chicago",
  affiliationaddress = "Chicago, IL, USA",
  classification = "921.4; 921.6; 922.1; C1160 (Combinatorial
                 mathematics); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Chicago Univ., IL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; complete graph; Computational geometry;
                 computational geometry; Computational methods; Edge
                 weights; edge weights; geometric graph; Geometry; Graph
                 spanners; Graph theory; graph theory; graphs; greedy
                 algorithm; Higher dimensions; higher dimensions;
                 hypercube networks; m-dimensional unit hypercube;
                 M-dimensional unit hypercube; metric; minimum spanning
                 tree; Minimum spanning tree (MST); norm; Probability;
                 probability; Random processes; sparse spanner
                 construction; subgraph; T-spanner; t-spanner; Trees
                 (mathematics); Vertex set; vertex set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hofri:1994:TGD,
  author =       "Micha Hofri",
  title =        "On timeout for global deadlock detection in
                 decentralized database systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "295--302",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Houston",
  affiliationaddress = "Houston, TX, USA",
  classification = "723.2; 723.3; 921.6; 922.1; C1140Z (Other and
                 miscellaneous); C4250 (Database theory); C6160B
                 (Distributed DBMS)",
  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 =     "Computer system recovery; concurrency control; Data
                 processing; database theory; decentralized database
                 systems; Distributed database systems; distributed
                 databases; Federated systems; federated systems; Global
                 deadlock detection; global deadlock detection;
                 Mathematical models; multidatabase systems; Network
                 protocols; probabilistic analysis; Probability;
                 probability; Timeout mechanism; timeout mechanism",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lysne:1994:EBM,
  author =       "Olav Lysne",
  title =        "Extending {Bachmair}'s method for proof by consistency
                 to the final algebra",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "303--310",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T15 (03C05 08A70 68Q65)",
  MRnumber =     "95j:68143",
  MRreviewer =   "Ursula Martin",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oslo",
  affiliationaddress = "Oslo, Norway",
  classification = "721.1; 921.1; C4210 (Formal logic); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Inf., Oslo Univ., Norway",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Abstract data; abstract data types; Algebra; algebra;
                 Automata theory; Bachmair's method; Bendix completion
                 process; completion process; Computation theory;
                 Critical pairs; critical pairs; Final algebra; final
                 algebra; human interaction; inconsistencies; Knuth
                 completion process; Left linear sets; left linear sets;
                 Proof by consistency; proof by consistency; Rewrite
                 rules; rewrite rules; rewriting systems; specification;
                 Symmetrical inconsistency witnesses; symmetrical
                 inconsistency witnesses; Theorem proving; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lopez-Ortiz:1994:NLB,
  author =       "Alejandro L{\'o}pez-Ortiz",
  title =        "New lower bounds for element distinctness on a
                 one-tape {Turing} machine",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "311--314",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05 (68Q30)",
  MRnumber =     "95g:68025",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "721.1; 723.2; C4220 (Automata theory); 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 =     "Computation theory; Computational complexity;
                 computational complexity; Data structures;
                 deterministic automata; Deterministic Turing machines;
                 deterministic Turing machines; element distinctness;
                 Element distinctness (ed) problem; Kolmogorov
                 complexity; Lower bounds; lower bounds; Mathematical
                 models; Nondeterministic Turing machines;
                 nondeterministic Turing machines; one-tape Turing
                 machine; Theorem proving; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kuzjurin:1994:MPS,
  author =       "Nikolai N. Kuzjurin",
  title =        "Multi-processor scheduling and expanders",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "315--319",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (05C85)",
  MRnumber =     "95f:68033",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Russian Acad of Sciences",
  affiliationaddress = "Moscow, Russia",
  classification = "721.1; 722.4; 723.1; 921.4; 922.2; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6150N
                 (Distributed systems)",
  corpsource =   "Inst. for Cybern., Acad. of Sci., Moscow, Russia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; Constraint theory; Directed
                 acyclic graph (dag); directed acyclic graphs; directed
                 graphs; expanders; Expanders; Graph theory; ideal
                 p-processor scheduling; multiprocessing programs;
                 multiprocessing systems; Multiprocessing systems;
                 multiprocessor scheduling; P-processor scheduling;
                 Program processors; scheduling; Scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Acciaro:1994:CCG,
  author =       "Vincenzo Acciaro",
  title =        "On the complexity of computing {Gr{\"o}bner} bases in
                 characteristic $2$",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "6",
  pages =        "321--323",
  day =          "26",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40 (68Q15 68Q25)",
  MRnumber =     "95f:68113",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "721.1; 921.1; 921.6; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  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 =     "Algebraic geometry; Algorithms; Boolean algebra;
                 Commutative algebra; Computational complexity;
                 Elementary argument; Gr{\"o}bner bases; Membership
                 problems; Polynomials; Space complexity; Unbounded
                 variables; Boolean algebra; characteristic 2;
                 computational complexity; elementary argument;
                 Gr{\"o}bner base computation; NP-hard problem; space
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Akinari:1994:RNR,
  author =       "Nakagawa Akinari and Hiroshi Hagiwara",
  title =        "On the real-number representation with variable-length
                 exponent field",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "1--6",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ryukoku Univ",
  affiliationaddress = "Otu, Jpn",
  classification = "721.1; 723.2; 921.3; 921.6; C5230 (Digital
                 arithmetic methods)",
  corpsource =   "Fac. of Sci. and Technol., Ryukoku Univ., Ohtsu,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; bit length; Bit length sequences;
                 Computer arithmetic; Data structures; digital
                 arithmetic; Finite binary sequence scattering; Hamada's
                 system; Level index system; Mathematical models;
                 Mathematical transformations; Numerical methods;
                 Overflow/underflow problem; Prefix code; Real number
                 representation; real-number representation; Universal
                 representation of real numbers (URR); Variable length
                 exponent field; variable-length exponent field",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Martel:1994:MFM,
  author =       "Charles U. Martel",
  title =        "Maximum finding on a multiple access broadcast
                 network",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "7--13",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "716.1; 722.4; 723.1; 723.2; 731.1; 921.5; B6150E
                 (Multiple access communication); B6150M (Protocols);
                 B6210L (Computer communications); C5620 (Computer
                 networks and techniques); C5640 (Protocols)",
  corpsource =   "Dept. 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; broadcasting; Communication channels
                 (information theory); Computer networks; computer
                 networks; Contention resolution; Distributed computer
                 systems; Distributed sorting algorithm; Ethernet; Load
                 balancing; load-balancing; matching lower bound;
                 Mathematical models; Maximum finding; maximum finding;
                 multi-access systems; Multiple access broadcast
                 network; multiple access broadcast network; Network
                 nodes; Network protocols; O(log c) transmissions;
                 Optimal control systems; Optimization; parallel
                 algorithms; Parallel processing systems; Parallel
                 sorting algorithm; Prioritized transmission protocols;
                 prioritized transmission protocols; protocols; Sorting;
                 sorting algorithms; Time slotted broadcast channel",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mogensen:1994:WEC,
  author =       "Torben {\AE}. Mogensen",
  title =        "{WORM-2DPDAs}: An extension to {2DPDAs} that can be
                 simulated in linear time",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "15--22",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitesparken",
  affiliationaddress = "Copenhagen O, Den",
  classification = "721.1; 722.1; 723.1; 723.1.1; 723.5; C4210 (Formal
                 logic); C4220 (Automata theory)",
  corpsource =   "DIKU, Copenhagen, Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "2-way deterministic push-down automata; Algorithms;
                 Automata theory; Computer programming languages;
                 Computer simulation; Cook's construction; Data storage
                 equipment; deterministic automata; formal languages;
                 linear time; Linear time simulation; Memorization
                 tables; Program derivation; Software engineering; Two
                 way deterministic push down automata (2DPDAS);
                 WORM-2DPDAs; write-once-read-many store",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Khan:1994:AHF,
  author =       "Md. Mozammel Huq Azad Khan",
  title =        "An algorithm for hazard-free minimization of
                 incompletely specified switching function",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "23--29",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Khulna Univ",
  affiliationaddress = "Khulna, Bangladesh",
  classification = "721.1; 721.2; 721.3; 722.4; 723.1; 723.2; C1180
                 (Optimisation techniques); C4230B (Combinatorial
                 switching theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Comput. Sci. and Eng. Discipline, Khulna Univ.,
                 Bangladesh",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bit level manipulation; bit-level
                 manipulation; combinational network; Combinatorial
                 circuits; combinatorial switching; computational
                 complexity; Computational complexity; computer
                 algorithm; consensus operation; Digital signal
                 processing; Fault tolerant computer systems; fault
                 tolerant computing; Hazard free minimization;
                 hazard-free minimization; incompletely specified
                 switching function; Incompletely specified switching
                 functions; input combination; minimisation of switching
                 nets; Minimization of switching nets; momentary
                 incorrect output; propagation delays; Propagation
                 delays; redundant minterms; Redundant minterms; space
                 complexity; static hazard; Static hazard; switching
                 functions; Switching functions; temporary fault; time
                 complexity; transmission paths; Transmission paths",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Larmore:1994:OST,
  author =       "Lawrence L. Larmore and Wojciech Rytter",
  title =        "An optimal sublinear time parallel algorithm for some
                 dynamic programming problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "31--34",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C39",
  MRnumber =     "1 299 656",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nevada",
  affiliationaddress = "Las Vegas, NV, USA",
  classification = "722.4; 723.1; 723.1.1; 723.2; 921.5; 921.6; C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Context free
                 languages; Dynamic programming; dynamic programming;
                 dynamic programming problem; Dynamic programming
                 problems; Dynamic programming recurrences; dynamic
                 programming recurrences; Mathematical models; O(n/sup
                 2/3/ log n); optimal; Optimal parallel algorithm;
                 Optimization; parallel algorithm; parallel algorithms;
                 Parallel computation; Parallel processing systems;
                 Pattern recognition; sublinear time; Sublinear time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1994:EPB,
  author =       "Shao Dong Chen and Hong Shen and Rodney Topor",
  title =        "An efficient permutation-based parallel range-join
                 algorithm on {$N$}-dimensional torus computers",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "35--38",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Griffith Univ",
  affiliationaddress = "Nathan, Aust",
  classification = "722.4; 723.1; 723.3; C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Sch. of Comput. and Inf. Technol., Griffith Univ.,
                 Brisbane, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; efficient permutation-based parallel
                 range-join algorithm; local range-join algorithm; Mesh
                 computers; N dimensional torus computers; N-dimensional
                 torus computers; Parallel algorithm; parallel
                 algorithms; Parallel processing systems; processor;
                 Program processors; Range join algorithm; Relational
                 database systems; Set theory; Subset permutation;
                 subsets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kleinberg:1994:LBT,
  author =       "Jon M. Kleinberg",
  title =        "A lower bound for two-server balancing algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "39--43",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "722.4; 723.1; 921.5; 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 theory; Algorithms; Balancing algorithm;
                 competitive ratio; Lower bound; lower bound; Online
                 algorithm; Online systems; optimal on-line algorithm;
                 Optimization; Server balancing; two-server balancing
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Galbiati:1994:SNA,
  author =       "G. Galbiati and F. Maffioli and A. Morzenti",
  title =        "A short note on the approximability of the {Maximum
                 Leaves Spanning Tree Problem}",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "45--49",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (05C05 05C85 68R10)",
  MRnumber =     "96a:68033",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita degli Studi di Pavia",
  affiliationaddress = "Pavia, Italy",
  classification = "721.1; 723.1; 921.1; 921.4; 921.5; 921.6; C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4130 (Interpolation and function
                 approximation)C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Pavia Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximability; Approximation preserving
                 reductions; Approximation theory; approximation theory;
                 approximation-preserving reductions; Computational
                 complexity; computational complexity; Data reduction;
                 Maximum leaves; maximum leaves spanning tree problem;
                 NP-hard optimization problems; optimisation;
                 Optimization; Polynomial time approximation; polynomial
                 time approximation scheme; Polynomials; polynomials;
                 Spanning trees; Trees (mathematics); trees
                 (mathematics); Undirected graph; undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mei:1994:ESR,
  author =       "Aohan Mei and Yoshihide Igarashi",
  title =        "An efficient strategy for robot navigation in unknown
                 environment",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "1",
  pages =        "51--56",
  day =          "14",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Gunma Univ",
  affiliationaddress = "Kiryu, Jpn",
  classification = "722.4; 723.1; 723.2; 731.5; 921.6; 922.2; C3390
                 (Robotics); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Gunma Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Artificial intelligence; aspect ratios;
                 Computational geometry; computational geometry;
                 Computational methods; Critical path analysis; Dead
                 free path length; dead-free path length; Euclidean
                 distances; Geometry; mobile robots; Navigation; Online
                 algorithms; Online systems; path planning; Rectangular
                 obstacles; rectangular obstacles; Rectilinear
                 obstacles; rectilinear obstacles; Robot navigation;
                 robot navigation; Robotics; shortest path length; side
                 lengths; start point; Strategic planning; target;
                 Unknown environment; unknown environment",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Seidl:1994:HOD,
  author =       "Helmut Seidl",
  title =        "{Haskell} overloading is {DEXPTIME}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "57--60",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (68Q15)",
  MRnumber =     "1 299 658",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classification = "721.1; 723.1.1; 723.2; C1230 (Artificial
                 intelligence); C4240 (Programming and algorithm
                 theory); C4250 (Database theory)",
  corpsource =   "Fachbereich Inf., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Automata theory; complexity analysis;
                 Computability and decidability; Computational
                 complexity; computational complexity; Computer
                 programming languages; dexptime-complete;
                 DEXPTIME-complete problem; Haskell type classes;
                 Haskell type system; Inference engines; inference
                 mechanisms; Logic programming; Programming theory;
                 runtime estimation; sort environment; Sorting; Turing
                 machines; type judgement; type theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rittri:1994:SUT,
  author =       "Mikael Rittri",
  title =        "Semi-unification of two terms in {Abelian} groups",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "61--68",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N15",
  MRnumber =     "95m:68020a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Rittri:1995:CSU}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Chalmers Univ of Technology",
  affiliationaddress = "Goteborg, Sweden",
  classification = "721.1; 723.1; 723.2; C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Chalmers Univ. of Technol.,
                 Goteborg, Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Abelian groups; Algebra; algorithm theory; Algorithms;
                 Computer programming; Data description; dimension
                 types; Equational semi-unification; polymorphic
                 recursion; Program compilers; programming languages;
                 Programming theory; programming theory; Recursive
                 functions; semiunification; type derivation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liaw:1994:OAS,
  author =       "Bern Cherng Liaw and R. C. T. Lee",
  title =        "An optimal algorithm to solve the minimum weakly
                 cooperative guards problem for $1$-spiral polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "69--75",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "95j:68160",
  MRreviewer =   "Hans-Dietrich Hecker",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 723.1; 921.4; 921.5; C1160 (Combinatorial
                 mathematics); 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/",
  journalabr =   "Inf Process Lett",
  keywords =     "1-spiral polygons; Algorithms; computational
                 complexity; Computational complexity; computational
                 geometry; constrained class; Dynamic programming; Graph
                 theory; minimum weakly cooperative guards problem;
                 Minimum weakly cooperative guards problem; NP-hard;
                 optimal linear time algorithm; Optimization; polynomial
                 algorithms; Programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Peng:1994:RSP,
  author =       "C. H. Peng and J. S. Wang and R. C. T. Lee",
  title =        "Recognizing shortest-path trees in linear time",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "77--85",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10",
  MRnumber =     "95i:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Tsing Hua Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "723.1; 723.2; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry); C6120 (File
                 organisation)",
  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 =     "algorithm theory; Algorithms; Computation theory;
                 computational geometry; Data structures; edges; File
                 organization; Graph theory; linear time; rooted
                 spanning tree; Shortest-path tree; shortest-path trees
                 recognition; spanning tree; tree data structures; Trees
                 (mathematics); undirected graph; Undirected graph;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hassin:1994:MNU,
  author =       "Refael Hassin and Shlomo Lahav (Haddad)",
  title =        "Maximizing the number of unused colors in the vertex
                 coloring problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "87--90",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C15 (05C85 68R10)",
  MRnumber =     "95k:05066",
  MRreviewer =   "Chinh T. Hoang",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel Aviv Univ",
  affiliationaddress = "Tel Aviv, Isr",
  classification = "723.5; 921.4; 921.5; B0250 (Combinatorial
                 mathematics); C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Stat. and Oper. Res., Tel Aviv Univ.,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; Computational
                 complexity; computational complexity; Equivalence
                 classes; error bound; graph colouring; Graph theory;
                 linear time; low complexity algorithm; maximum weighted
                 matching problem; Optimization; polynomial time
                 algorithm; Polynomials; unused colors maximisation;
                 Vertex coloring problem; vertex coloring problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tokuda:1994:AEC,
  author =       "Takehiro Tokuda and Yoshimichi Watanabe",
  title =        "An attribute evaluation of context-free languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "91--98",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Inst of Technology",
  affiliationaddress = "Tokyo, Jpn",
  classification = "721.1; 723.1; C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Tokyo Inst. of Technol.,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "attribute dependency graphs; attribute evaluation;
                 Attribute grammars; attribute grammars; Computational
                 grammars; Context free grammars; Context free
                 languages; context-free languages; Context-free
                 underlying grammar; context-free underlying grammars;
                 derivation trees; Earley's parsing method; Formal
                 languages; Formal logic; input strings; L-attributed
                 grammar; Program compilers; Recursive functions;
                 semantic rules",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gouda:1994:SOD,
  author =       "Mohamed G. Gouda",
  title =        "Stabilizing observers",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "99--103",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "722.4; 723.5; 731.1; 731.4; 921.6; C1320
                 (Stability); C5620 (Computer networks and techniques);
                 C5670 (Network performance); C6150N (Distributed
                 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 =     "array of temperatures; boolean value; Convergence of
                 numerical methods; Distributed computer systems;
                 distributed processing; Error analysis; Fault tolerant
                 computer systems; Observability; performance
                 evaluation; Programmed control systems; sensors;
                 stability; stabilizing observers; Stabilizing
                 observers; Stabilizing phase synchronization; System
                 stability; Uni-directional token systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mayo:1994:DTD,
  author =       "Jean Mayo and Phil Kearns",
  title =        "Distributed termination detection with roughly
                 synchronized clocks",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "105--108",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Coll of William and Mary",
  affiliationaddress = "Williamsburg, VA, USA",
  classification = "716.1; 721.1; 722.3; 722.4; C4240 (Programming and
                 algorithm theory); C5620 (Computer networks and
                 techniques); C6110B (Software engineering techniques);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Coll. of William and Mary,
                 Williamsburg, VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Demodulation; Distributed computer systems;
                 distributed processing; distributed termination
                 detection; logical ring; Multiprocessing systems;
                 Network protocols; physical clock; Program processors;
                 program verification; programming theory; protocol;
                 roughly synchronized clocks; Switching theory;
                 synchronisation; Synchronization; Synchronous
                 communication; Termination detection; timestamped token
                 message",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Roos:1994:VLP,
  author =       "Thomas Roos and Peter Widmayer",
  title =        "$k$-violation linear programming",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "2",
  pages =        "109--114",
  day =          "28",
  month =        oct,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C08 (68Q25)",
  MRnumber =     "95h:90076",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ETH Zentrum",
  affiliationaddress = "Zurich, Switz",
  classification = "721.1; 921.5; B0260 (Optimisation techniques); C1180
                 (Optimisation techniques)",
  corpsource =   "Dept. of Inf., Eidgenossische Tech. Hochschule,
                 Zurich, Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Combinatorial mathematics; Computational
                 complexity; Constraint theory; Geometry; halfplanes;
                 k-violation linear programming; linear functional;
                 Linear programming; linear programming; Programming
                 theory; slope selecting techniques",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pedrotti:1994:ALU,
  author =       "A. Pedrotti",
  title =        "Analysis of a list-update strategy",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "115--121",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Scuola Normale Superiore",
  affiliationaddress = "Pisa, Italy",
  classification = "721.1; 723.2; 921.6; 922.1; 922.2; C4240C
                 (Computational complexity); C6130 (Data handling
                 techniques)",
  corpsource =   "Scuola Normale Superiore, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; analysis of algorithms; average-case
                 complexity; BIT; competitive algorithms; Computational
                 complexity; computational complexity; convergence;
                 Convergence of numerical methods; Data handling;
                 Function evaluation; Heuristic methods; list
                 processing; list update; Markov chains; Move to front
                 algorithm; move-to-front; Probability; Random number
                 generation; searching; Theorem proving; transpose;
                 Zipf's law",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liang:1994:FVS,
  author =       "Y. Daniel Liang",
  title =        "On the feedback vertex set problem in permutation
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "123--129",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "95k:68176",
  MRreviewer =   "Dieter Kratsch",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indiana Purdue Univ at Fort Wayne",
  affiliationaddress = "Fort Wayne, IN, USA",
  classification = "723.2; 921.4; 921.5; 921.6; C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Indiana Univ., Fort Wayne, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; Data processing;
                 Dynamic programming; dynamic programming; feedback
                 vertex set problem; Graph theory; graph theory; Minimum
                 weight feedback vertex set; Permutation graph;
                 permutation graphs; Set theory; time complexity; Time
                 domain analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pruhs:1994:ACS,
  author =       "Kirk R. Pruhs",
  title =        "Average-case scalable on-line algorithms for fault
                 replacement",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "131--136",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pittsburgh",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "722.2; 722.4; 723.1; 723.2; 921.4; 921.6; C4240
                 (Programming and algorithm theory); C5470 (Performance
                 evaluation and testing)",
  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 =     "Algorithms; average-case scalable; competitive
                 algorithms; Competitive ratio; competitiveness;
                 Computer architecture; Computer system recovery; Data
                 processing; fault replacement; fault tolerance; Fault
                 tolerant computer systems; fault tolerant computing;
                 faulty nodes; Graph theory; on-line algorithm; Scalable
                 online algorithms; spare augmented architecture; Spare
                 augmented architectures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Durand:1994:CET,
  author =       "Ir{\`e}ne Durand and Bruno Salinier",
  title =        "Constructor equivalent term rewriting systems are
                 strongly sequential: {A} direct proof",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "137--145",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "95k:68093",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite de Bordeaux I",
  affiliationaddress = "Talence, Fr",
  classification = "721.1; 723.1.1; 723.2; 731.4; 921.6; C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Approximation theory; Codes (symbols); Computer
                 programming languages; Constraint theory; constructor
                 equivalent; Constructor equivalent systems; constructor
                 systems; Convergence of numerical methods; direct
                 proof; Equivalence classes; left-linear constructor
                 system; Linearization; orthogonal TRS; programming
                 languages; rewriting systems; strong sequentiality;
                 Strongly sequential term rewriting systems; Term
                 Rewriting Systems; term rewriting systems;
                 term-rewriting; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dietz:1994:CUT,
  author =       "Paul F. Dietz and Rajeev Raman",
  title =        "A constant update time finger search tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "147--154",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rochester",
  affiliationaddress = "Rochester, NY, USA",
  classification = "722.1; 723.2; 921.4; 921.6; C4240C (Computational
                 complexity); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational complexity; data structure;
                 Data structures; finger search tree; Mathematical
                 operators; Random access storage; random-access
                 machine; Search tree; search tree; Storage
                 modification; tree data structures; tree searching;
                 Trees (mathematics); Update time; update time;
                 worst-case update time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Devroye:1994:NHS,
  author =       "Luc Devroye and Paul Kruszewski",
  title =        "A note on the {Horton--Strahler} number for random
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "155--159",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (60C05 68M07 68R10)",
  MRnumber =     "95i:68059",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "McGill Univ",
  affiliationaddress = "Montreal, Que, Can",
  classification = "723.1; 723.2; 921.6; 922.1; 922.2; C4240C
                 (Computational complexity); C6120 (File organisation)",
  corpsource =   "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; binary trees;
                 computational complexity; Data processing; Horton
                 Strahler number; Horton--Strahler number; probabilistic
                 proof; Probability; Random equiprobable binary trees;
                 random equiprobable binary trees; Random number
                 generation; random trees; tree data structures; Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wagner:1994:AML,
  author =       "Frank Wagner",
  title =        "{Approximate Map Labeling} is in {$\Omega(n \log
                 n)$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "161--165",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "95h:68086",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Freie Universitaet Berlin",
  affiliationaddress = "Berlin-Dahlem, Ger",
  classification = "721.1; 723.1; 723.2; 921.1; 921.6; C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Inst. f{\"u}r Inf., Freie Univ. Berlin, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; algebraic computation tree; Algorithms;
                 approximation algorithm; Approximation theory; Boundary
                 element method; cartographic algorithm; Computation
                 theory; computational complexity; Computational
                 geometry; computational geometry; Computational
                 methods; Function evaluation; map labeling; Map
                 labeling problem; MAP LABELING problem; Mapping;
                 NP-complete",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Flammini:1994:LMD,
  author =       "Michele Flammini",
  title =        "On the learnability of monotone $k \mu$-{DNF} formulae
                 under product distributions",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "167--173",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (03G05)",
  MRnumber =     "96d:68173",
  MRreviewer =   "John Shawe-Taylor",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rome `La Sapienza'",
  affiliationaddress = "Roma, Italy",
  classification = "721.1; 723.2; 921.1; 921.6; C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. and Syst. Sci., Rome Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; analysis of algorithms;
                 Boolean algebra; boolean formulae; Boolean functions;
                 Computation theory; Computational learning;
                 computational learning; Computational methods; DNF
                 formulae; Function evaluation; learnability; learning;
                 learning (artificial intelligence); Learning systems;
                 monotone k mu-DNF formulae; Polynomials; probabilistic
                 logic; probability distribution; Probably Approximately
                 Correct model; product distributions; target concept;
                 Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1994:USR,
  author =       "Rajesh P. N. Rao and J{\"o}rg Rothe and Osamu
                 Watanabe",
  title =        "Upward separation for {${\rm FewP}$} and related
                 classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "175--180",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "95k:68060",
  MRreviewer =   "Sanjay Jain",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See corrigendum \cite{Rao:2000:CSS}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rochester",
  affiliationaddress = "Rochester, NY, USA",
  classification = "721.1; 921.1; 921.4; C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; computational complexity;
                 counting classes; Equivalence classes; Exponential time
                 analogs; exponential-time analogs; FewP; Polynomial
                 time complexity classes; polynomial-time complexity
                 classes; Polynomials; promise class; related classes;
                 Set theory; structural properties; Theorem proving;
                 Upward separation; upward separation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cohen:1994:CSG,
  author =       "Ernie Cohen",
  title =        "The convergence span of greedy load balancing",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "181--182",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bellcore",
  affiliationaddress = "Morristown, NJ, USA",
  classification = "722.4; 723.1; 723.2; 922.1; C4240 (Programming and
                 algorithm theory); C6150J (Operating systems)",
  corpsource =   "Bellcore, Morristown, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Convergence span;
                 convergence span; Data processing; Data transfer; Game
                 theory; greedy load balancing; Load balancing;
                 Multiprocessing systems; multiprocessor system; Program
                 processors; resource allocation; Task migration",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Iwamoto:1994:FHC,
  author =       "Chuzo Iwamoto and Godfried T. Toussaint",
  title =        "Finding {Hamiltonian} circuits in arrangements of
                 {Jordan} curves is {NP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "183--189",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "95k:68077",
  MRreviewer =   "Klaus Jansen",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kyushu Univ",
  affiliationaddress = "Fukuoka, Jpn",
  classification = "721.1; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4190 (Other numerical methods); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  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 =     "arrangements of Jordan curves; Computational
                 complexity; computational complexity; Computational
                 geometry; computational geometry; Computational
                 methods; Geometry; Graph theory; Hamiltonian circuit;
                 Hamiltonian circuits; Intersection points; Jordan
                 curves arrangements; Jordan-curve arrangement graph; NP
                 completeness; NP- complete",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1994:PPE,
  author =       "Su-Hyun Lee and Do-Hyung Kim and Kwang-Moo Choe",
  title =        "Path for {AND}-parallel execution of logic programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "191--199",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17",
  MRnumber =     "95i:68021",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Advanced Inst of Science and Technology",
  affiliationaddress = "Taejon, South Korea",
  classification = "723.1; 723.2; 921.4; 921.6; 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 =     "and parallelism; AND-parallel execution; and/or
                 process model; Applicative programming; Backward
                 execution method; backward execution method; Data
                 dependency graph; data dependency graphs; Data
                 structures; Graph theory; literals; Logic programming;
                 logic programming; logic programs; Mathematical models;
                 Parallel algorithms; Parallel evaluation; Path",
  treatment =    "P Practical",
}

@Article{Sun:1994:DTS,
  author =       "Hung Min Sun and Shiuh Pyng Shieh",
  title =        "On dynamic threshold schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "201--206",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "95h:94027",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "716.1; 722.4; 723.2; C6130S (Data security)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., 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; cryptography; Cryptography; Digital
                 system security; dynamic threshold schemes; Dynamic
                 threshold schemes; Information theory; master key;
                 Master key; perfect dynamic threshold scheme; secret
                 shadows; Secret shadows; Security of data",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nuutila:1994:ETC,
  author =       "Esko Nuutila",
  title =        "An efficient transitive closure algorithm for cyclic
                 digraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "207--213",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Helsinki Univ of Technology",
  affiliationaddress = "Espoo, Finl",
  classification = "921.4; 921.6; 922.1; C1160 (Combinatorial
                 mathematics); C4190 (Other numerical methods); C4260
                 (Computational geometry)",
  corpsource =   "Lab. of Inf. Process. Sci., Helsinki Univ. of
                 Technol., Espoo, Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational geometry; Computational
                 methods; Cyclic digraphs; cyclic digraphs; directed
                 graphs; Graph theory; Mathematical models; partial
                 successor sets; Random graphs; Random processes; Strong
                 component detection; strong component detection; strong
                 components detection; Tarjan's algorithm; Transitive
                 closure algorithm; transitive closure algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{deBerg:1994:RDL,
  author =       "Mark {de Berg} and Marc {van Kreveld}",
  title =        "Rectilinear decompositions with low stabbing number",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "215--221",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55 52C15)",
  MRnumber =     "95j:68154",
  MRreviewer =   "Jovi{\v{s}}a {\v{Z}}uni{\'c}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Utrecht Univ",
  affiliationaddress = "Utrecht, Neth",
  classification = "921.6; C1160 (Combinatorial mathematics); 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; axis-parallel segment; Combinatorial
                 mathematics; combinatorial mathematics; Combinatorial
                 problems; Computational geometry; computational
                 geometry; Computational methods; Geometry; low stabbing
                 number; Rectilinear decompositions; rectilinear
                 decompositions; rectilinear holes; rectilinear polygon;
                 Rectilinear polygons; Stabbing number",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kelsen:1994:OPA,
  author =       "Pierre Kelsen",
  title =        "An optimal parallel algorithm for maximal matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "4",
  pages =        "223--228",
  day =          "25",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q22)",
  MRnumber =     "95i:68101",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of British Columbia",
  affiliationaddress = "Vancouver, BC, Can",
  classification = "721.1; 722.1; 723.1; 921.4; 921.5; 922.1; C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., British Columbia Univ.,
                 Vancouver, BC, Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "bipartite graphs; Computational complexity;
                 computational complexity; deterministic algorithm;
                 deterministic algorithms; EREW PRAM processors;
                 Exclusive read exclusive write (EREW); Graph theory;
                 linear time-processor product; Maximal matching;
                 maximal matching; optimal parallel algorithm;
                 Optimization; Parallel algorithms; parallel algorithms;
                 Parallel complexity; parallel complexity; Parallel
                 random access machines (pram); Random access storage;
                 Random processes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Petersen:1994:RSM,
  author =       "H. Petersen",
  title =        "Refined simulation of multihead automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "229--233",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q68",
  MRnumber =     "95j:68114",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Hamburg",
  affiliationaddress = "Hamburg, Ger",
  classification = "721.1; 722.1; 723.5; C4220 (Automata theory); C4240C
                 (Computational complexity)",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithms; Automata theory; automata theory;
                 complexity theory; Computational complexity;
                 computational complexity; computer science; Computer
                 simulation; Data storage equipment; Finite automata;
                 Formal languages; formal languages; input tape;
                 Magnetic tape; Multihead automata; multihead automata;
                 one-way models; refined simulation; String matching;
                 string-matching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Book:1994:CPT,
  author =       "Ronald V. Book",
  title =        "On collapsing the polynomial-time hierarchy",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "235--237",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15)",
  MRnumber =     "95h:68058",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "721.1; 922.1; C4240C (Computational complexity)",
  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 =     "Algorithmic languages; Collapsing; Computational
                 complexity; computational complexity; Computational
                 grammars; Hierarchical systems; language; Polynomial
                 time hierarchy; polynomial-time hierarchy; Probability;
                 Random oracles; Random processes; Recursive functions;
                 unrelativized polynomial-time hierarchy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Khuller:1994:PCD,
  author =       "Samir Khuller and Uzi Vishkin",
  title =        "On the parallel complexity of digraph reachability",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "239--241",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q22 68R10)",
  MRnumber =     "95f:68109",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "721.1; 722.1; 722.4; 921.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity); C4240P (Parallel 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 =     "Algorithms; Combinatorial mathematics; combinatorial
                 problem; Combinatorial problems; Computational
                 complexity; computational complexity; Digraph
                 reachability; digraph reachability; directed graph
                 reachability problem; directed graphs; Graph theory;
                 Matrix algebra; Microcomputers; parallel algorithm;
                 Parallel algorithms; parallel algorithms; Parallel
                 complexity; parallel complexity; Parallel processing
                 systems; Random access storage; s-t reachability
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Korsh:1994:LGA,
  author =       "James F. Korsh",
  title =        "Loopless generation of $k$-ary tree sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "243--247",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68P05)",
  MRnumber =     "95j:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Temple Univ",
  affiliationaddress = "Philadelphia, PA, USA",
  classification = "721.1; 723.2; 921.3; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Temple Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; binary search tree balancing; Binary
                 sequences; binary tree sequences; Binary trees;
                 Combinatorial algorithms; Combinatorial mathematics;
                 Combinatorial problems; combinatorial problems;
                 constant time; Data structures; data structures; k-ary
                 tree representation; k-ary tree sequences; Loopless
                 generation; loopless generation; Mathematical
                 transformations; n-node binary tree representations;
                 Rotation operation; rotation operation; tree data
                 structures; tree searching; Trees (mathematics); trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bax:1994:ACP,
  author =       "Eric T. Bax",
  title =        "Algorithms to count paths and cycles",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "249--252",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25 68R10)",
  MRnumber =     "95h:68072",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst of Technology",
  affiliationaddress = "Pasadena, CA, USA",
  classification = "721.1; 921.1; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4240C (Computational complexity)",
  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 =     "Algorithms; Complete matching; Computational
                 complexity; computational complexity; Counting cycles;
                 counting cycles; cycle counting; directed graphs;
                 graph; Graph theory; Hamiltonian cycle; Hamiltonian
                 cycles; Matrix algebra; path counting; Polynomials;
                 single vertex; space algorithms; time algorithms;
                 Vertex; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weiss:1994:LTC,
  author =       "Mark Allen Weiss",
  title =        "Linear-time construction of treaps and {Cartesian}
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "253--257",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Florida Intl Univ",
  affiliationaddress = "Miami, FL, USA",
  classification = "721.1; 723.2; 921.4; 921.6; 922.1; C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity)",
  corpsource =   "Sch. of Comput. Sci., Florida Int. Univ., Miami, FL,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm analysis; Algorithms; Binary sequences;
                 Cartesian tree; Cartesian trees; Codes (symbols);
                 computational complexity; Data structures; Geometry;
                 Heap ordered deque; heap-ordered deque; Linear time
                 construction; linear-time construction; Random
                 processes; Search tree; search tree; sorting; Treap;
                 treap; tree searching; Trees (mathematics); trees
                 (mathematics); x-coordinates",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yan:1994:FCA,
  author =       "Jin Tai Yan and Pei Yung Hsiao",
  title =        "A fuzzy clustering algorithm for graph bisection",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "259--263",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (04A72 68R10)",
  MRnumber =     "96a:05137",
  MRreviewer =   "Klaus Jansen",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "716.1; 721.1; 921.4; 921.6; 922.1; C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. and Inf. 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; Constraint
                 theory; fuzzy clustering algorithm; Fuzzy clustering
                 algorithm; fuzzy membership; Fuzzy membership; fuzzy
                 set theory; Fuzzy sets; global connection information;
                 graph bisection; Graph bisection; graph bisection
                 problem; graph theory; Graph theory; Heuristic methods;
                 Information theory; Iterative methods; Pairwise
                 swapping; Random processes; Vertex",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1994:PAF,
  author =       "Zhi-Zhong Chen",
  title =        "A parallel algorithm for finding a triconnected
                 component separator with an application",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "265--271",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q22)",
  MRnumber =     "95m:05220",
  MRreviewer =   "Fabrizio Luccio",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Denki Univ",
  affiliationaddress = "Saitama, Jpn",
  classification = "722.1; 722.4; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4240C (Computational complexity); C4240P
                 (Parallel programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Math. Sci., Tokyo Denki Univ., Saitama,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; arbitrary processor; biconnected graph;
                 common memory; computational complexity; computational
                 geometry; concurrent read concurrent write parallel
                 random access machine; concurrent reads; concurrent
                 writes; CRCW PRAM; Graph theory; graph theory;
                 identical processors; Maximal vertex induced subgraph;
                 Maximality problems; Microcomputers; Optimization;
                 parallel algorithm; Parallel algorithms; parallel
                 algorithms; parallel computation model; parallel
                 machines; Parallel processing systems; Random access
                 storage; Triconnected component separator; triconnected
                 component separator; Vertex; write conflict",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Duszak:1994:GND,
  author =       "Zbigniew Duszak and Waldemar W. Koczkodaj",
  title =        "Generalization of a new definition of consistency for
                 pairwise comparisons",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "273--276",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Laurentian Univ, Sudbury",
  affiliationaddress = "Ont, Can",
  classification = "721.1; 723.1; 723.2; 921.1; 921.6; 922.1; C1230
                 (Artificial intelligence); C4140 (Linear algebra)",
  corpsource =   "Expert Systems Lab., Laurentian Univ., Sudbury, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; comparative judgments; Computability and
                 decidability; Computer software; consistency;
                 consistency definition; Data acquisition; Eigenvalues
                 and eigenfunctions; Expert systems; Experts opinions;
                 generalisation (artificial intelligence);
                 generalization; inexact knowledge; Judgement
                 inconsistency; Knowledge acquisition; knowledge
                 acquisition; knowledge elicitation; Mathematical
                 models; matrix; Matrix algebra; matrix algebra;
                 Pairwise comparisons; pairwise comparisons;
                 Performance; Performance evaluation; performance
                 evaluation; Random processes; Systems analysis;
                 uncertainty handling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luccio:1994:PLU,
  author =       "F. Luccio and A. Pedrotti",
  title =        "A parallel list update problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "5",
  pages =        "277--284",
  day =          "9",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68P10)",
  MRnumber =     "95j:68072",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "722.1; 722.4; 723.1.1; 723.2; 903.3; 921.6; C4240P
                 (Parallel programming and algorithm theory); C6130
                 (Data handling techniques)",
  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 =     "Algorithms; Amortized analysis of algorithms;
                 Competitivity factor; competitivity factor; Data
                 processing; EREW-PRAM; list processing; List processing
                 languages; List searching; list searching; lower bound;
                 Move to front; Online searching; Optimal algorithm;
                 optimisation; Optimization; Parallel algorithms;
                 parallel algorithms; parallel execution; Parallel list
                 update problem; parallel list update problem; Parallel
                 processing systems; Random access storage; Random
                 processes; randomization; shared memory; shared memory
                 systems; static optimal algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bergstra:1994:BTW,
  author =       "J. A. Bergstra and Gh. {\c{S}}tef{\u{a}}nescu",
  title =        "Bisimulation is two-way simulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "285--287",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q55 68Q90)",
  MRnumber =     "95h:68045",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Amsterdam",
  affiliationaddress = "Amsterdam, Neth",
  classification = "721.1; 723.5; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4210 (Formal logic)",
  corpsource =   "Programming Res. Group, Amsterdam Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; Bisimulation; bisimulation;
                 Computation theory; computation theory; Computer
                 simulation; Concurrency; Equivalence classes;
                 equivalence classes; equivalence relation;
                 Flowcharting; Functions; Graph theory; Transition
                 systems; transition systems; two-way simulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carpi:1994:RFW,
  author =       "Arturo Carpi",
  title =        "On repeated factors in {$C^\infty$}-words",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "289--294",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q45)",
  MRnumber =     "95j:68129",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst di Cibernetica del C.N.R.",
  affiliationaddress = "Arco Felice, Italy",
  classification = "721.1; 723.2; 921.4; 921.5; C1160 (Combinatorial
                 mathematics); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Istituto di Cibernetica, CNR, Arco Felice, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary alphabet; Binary sequences; C/sup infinity
                 /-words; Combinatorial mathematics; combinatorial
                 mathematics; combinatorial problems; Data processing;
                 Encoding (symbols); Formal languages; formal languages;
                 Kolakoski sequence; Optimization; positive integer;
                 repeated factors",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bhattacharya:1994:GFM,
  author =       "Subir Bhattacharya and A. Bagchi",
  title =        "A general framework for minimax search in game trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "295--301",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Management",
  affiliationaddress = "Calcutta, India",
  classification = "721.1; 722.1; 921.4; 921.6; 922.2; B0240E (Game
                 theory); B0260 (Optimisation techniques); C1140E (Game
                 theory); C1180 (Optimisation techniques); C6120 (File
                 organisation)",
  corpsource =   "Indian Inst. of Manage., Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; AlphaBeta; Best first search; best-first
                 and depth-first strategies; Computation theory; Data
                 storage equipment; Depth first search; Design of
                 algorithms; Functions; Game theory; game theory; Game
                 trees; game trees; game-tree search procedure; general
                 framework; Gengame; GenGame; Iterative methods; local
                 OPENs; Memory algorithm; MGame; Minimax search; minimax
                 search; minimax techniques; MRecSSS/sup */; Optimal
                 systems; QuickGame; RecSSS/sup */; Recursive functions;
                 Search; tree data structures; Trees (mathematics);
                 variable memory algorithm",
  treatment =    "P Practical",
}

@Article{Klein:1994:DSB,
  author =       "Philip N. Klein",
  title =        "A data structure for bicategories, with application to
                 speeding up an approximation algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "303--307",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "721.1; 722.3; 723.2; 921.4; 921.6; C1160
                 (Combinatorial mathematics); 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; approximately minimum-cost networks;
                 Approximation algorithm; approximation algorithm;
                 Approximation theory; Bicategories; bicategories;
                 Combinatorial mathematics; combinatorial mathematics;
                 Computational complexity; Computer networks; data
                 structure; Data structures; data structures; Graph
                 theory; Set theory; Trees (mathematics)",
  treatment =    "A Application; P Practical",
}

@Article{Liang:1994:DTG,
  author =       "Y. Daniel Liang",
  title =        "Dominations in trapezoid graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "309--315",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "95k:68177",
  MRreviewer =   "Dieter Kratsch",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indiana Purdue Univ at Fort Wayne",
  affiliationaddress = "Fort Wayne, IN, USA",
  classification = "921.4; 921.6; C1160 (Combinatorial mathematics);
                 C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Indiana Univ., Fort Wayne, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; computational geometry; connected
                 domination; Domination; dominations; edges; Functions;
                 Geometry; Graph algorithms; Graph theory; O(nm) time
                 algorithms; Set theory; total domination; Trapezoid
                 graph; trapezoid graphs; vertices; weighted domination
                 problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yan:1994:PPP,
  author =       "Jing Ho Yan and Gerard J. Chang",
  title =        "The path-partition problem in block graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "317--322",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C38 05C70)",
  MRnumber =     "95i:68103",
  MRreviewer =   "Hans L. Bodlaender",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See corrigendum \cite{Chang:2002:CPP}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 921.4; 921.5; 921.6; C1160 (Combinatorial
                 mathematics); C4260 (Computational geometry)",
  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; block graphs; Block graphs; Computational
                 complexity; computational geometry; graph theory; Graph
                 theory; Iterative methods; Linear time algorithm;
                 linear-time algorithm; Optimization; Path partition;
                 path-partition problem; Theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Petersen:1994:DPT,
  author =       "H. Petersen",
  title =        "On the determinacy problem for two-way pushdown
                 automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "323--324",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (03D05 68Q68)",
  MRnumber =     "95h:68111",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Hamburg",
  affiliationaddress = "Hamburg, Ger",
  classification = "721.1; 722.1; 921.6; C4210L (Formal languages and
                 computational linguistics); C4220 (Automata theory)",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; Data storage equipment; decidability;
                 Decision theory; Determinacy problem; determinacy
                 problem; deterministic automata; Deterministic two
                 counter machines; Encoding (symbols); Equivalence
                 classes; Finite language; Formal languages; formal
                 languages; pushdown automata; Turing machines; Two way
                 pushdown automata; two-way pushdown automata",
  treatment =    "T Theoretical or Mathematical",
}

@Article{OConnor:1994:UBN,
  author =       "Luke O'Connor",
  title =        "An upper bound on the number of functions satisfying
                 the {Strict Avalanche Criterion}",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "325--327",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 307 750",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queensland Univ of Technology",
  affiliationaddress = "Brisbane, Aust",
  classification = "723.2; 921.1; 921.4; 921.6; 922.1; C4210 (Formal
                 logic); C6130S (Data security)",
  corpsource =   "Fac. of Inf. Technol., Queensland Univ. of Technol.,
                 Brisbane, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "avalanche effect; Boolean functions; Ciphertext bits;
                 ciphertext bits; Combinatorial mathematics;
                 completeness; cryptographic functions; cryptographic
                 mapping; Cryptography; cryptography; Enumeration;
                 Functions; functions; Matrix algebra; nondegeneracy;
                 Probability; Set theory; Strict avalanche criterion;
                 Strict Avalanche Criterion; upper bound; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boppana:1994:DTC,
  author =       "Ravi B. Boppana",
  title =        "The decision-tree complexity of element distinctness",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "329--331",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "95j:68074",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "New York Univ",
  affiliationaddress = "New York, NY, USA",
  classification = "721.1; 722.1; 723.2; 921.4; 921.6; C1140E (Game
                 theory); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Courant Inst. of Math. Sci.,
                 New York, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; Bucket sorting;
                 Combinatorial mathematics; Computational complexity;
                 computational complexity; Decision theory; decision
                 theory; Decision tree complexity; decision-tree
                 complexity; Element distinctness; element distinctness;
                 Lower bounds; Mathematical models; Random access
                 storage; Sorting; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fokkink:1994:CEA,
  author =       "Wan Fokkink",
  title =        "A complete equational axiomatization for prefix
                 iteration",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "333--337",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q42 68Q55)",
  MRnumber =     "95j:68052",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Centrum voor Wiskunde en Informatica",
  affiliationaddress = "Amsterdam, Neth",
  classification = "721.1; 723.5; 921.1; 921.6; C4210L (Formal languages
                 and computational linguistics); C4220 (Automata
                 theory); C4240P (Parallel programming and algorithm
                 theory)",
  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 =     "Algebra; axioms; Basic process algebra; bisimilar
                 terms; Bisimulation; calculus of communicating systems;
                 CCS; Complete equational axiomatization; complete
                 equational axiomatization; Computational linguistics;
                 Computer simulation; Concurrency; Equivalence classes;
                 Finite automata; finite automata; finite equational
                 axiomatization; Formal languages; formal languages;
                 Iterative methods; Minimal process algebra; Minimal
                 Process Algebra; Prefix iteration; prefix iteration;
                 Programming calculi; strong bisimulation equivalence;
                 term rewriting system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bertoni:1994:COL,
  author =       "A. Bertoni and Carlo Mereghetti and Giovanni
                 Pighizzini",
  title =        "Corrigendum: {``An optimal lower bound for nonregular
                 languages'' [Inform. Process. Lett. {\bf 50} (27 June
                 1994), no. 6, 289--292; MR 95c:68126]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "339--339",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q25)",
  MRnumber =     "1 307 753",
  bibdate =      "Sat Nov 7 17:55:34 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Bertoni:1994:OLB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lu:1994:CCD,
  author =       "Erl Huei Lu and Yi Chang Cheng and Hsiao Peng Wuu",
  title =        "Corrigendum: {``A complete decoding algorithm for
                 double-error-correcting primitive binary {BCH} codes of
                 odd $m$'' [Inform. Process. {Lett}. {\bf 51} (1994),
                 no. 3, 117--120; 1290203]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "6",
  pages =        "341--341",
  day =          "23",
  month =        dec,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94B35",
  MRnumber =     "1 307 754",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Lu:1994:CDA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jain:1995:QAL,
  author =       "Sanjay Jain",
  title =        "On a question about learning nearly minimal programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "1--4",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05",
  MRnumber =     "95m:68141",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Univ of Singapore",
  affiliationaddress = "Singapore, Singapore",
  classification = "721.1; 723.1; 723.4; 723.4.1; 723.5; 921.4; C1230
                 (Artificial intelligence); C1240 (Adaptive system
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithmic devices; Algorithms; computable functions;
                 Computation theory; Computer software; Graph theory;
                 Inductive inference; Inference engines; inference
                 mechanisms; Knowledge acquisition; learning (artificial
                 intelligence); learning nearly minimal programs;
                 Learning systems; learning theory; Minimal programs;
                 n-error program; programming theory; Recursion theory;
                 Recursive functions; Science methodology",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Franzle:1995:GNS,
  author =       "Martin Fr{\"a}nzle and Bernhard {von Stengel} and Arne
                 Wittm{\"u}ss",
  title =        "A generalized notion of semantic independence",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "5--9",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "95i:68075",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Kiel",
  affiliationaddress = "Kiel, Ger",
  classification = "721.1; 722.4; 723.1; 723.2; 723.3; 921; C1230
                 (Artificial intelligence); C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Inf., Kiel Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Bernstein conditions; Binary codes; Computational
                 linguistics; Data structures; Equivalent states;
                 generalized notion; Independence concept; irrelevant
                 interference; Nondeterminism; nondeterminism; Parallel
                 algorithms; Parallel computation; Parallel processing
                 systems; programming theory; relational algebra;
                 Relational database systems; Semantic independence;
                 semantic independence; semantic networks; shared input
                 variables; Theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Monti:1995:CRC,
  author =       "Angelo Monti and Alessandro Roncato",
  title =        "Completeness results concerning systolic tree automata
                 and {E}$0${L} languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "11--16",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q15 68Q68)",
  MRnumber =     "95k:68112",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "721.1; 723.1.1; 921; C4210L (Formal languages and
                 computational linguistics); C4220 (Automata theory);
                 C4240C (Computational complexity)",
  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 =     "Automata theory; automata theory; Binary Systolic Tree
                 Automata; Binary Systolic Tree Automata (BSTA);
                 completeness results; complexity; Computational
                 complexity; computational complexity; decision
                 problems; Decision theory; E0L; emptiness problem; EOL
                 languages; finiteness problem; Formal languages; formal
                 languages; pspace completeness; PSPACE-complete;
                 Reachability; reachability problems; rewriting systems;
                 Set systems; systolic tree automata; Turing machine
                 computations; Turing Machine computations; Turing
                 machines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Canetti:1995:LBS,
  author =       "Ran Canetti and Guy Even and Oded Goldreich",
  title =        "Lower bounds for sampling algorithms for estimating
                 the average",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "17--25",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (65C05)",
  MRnumber =     "96e:68056",
  MRreviewer =   "Stefan Heinrich",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Weizmann Inst",
  affiliationaddress = "Rehovot, Isr",
  classification = "721.1; 723; 723.2; 723.4; 922.1; C4200 (Computer
                 theory)",
  corpsource =   "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
                 of Sci., Rehovot, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; average estimation; Coding errors; coin
                 tosses; Computation theory; computation theory;
                 Constant factor; error probability; lower bounds;
                 Multiplicative constant; Random processes; sample
                 points; Sampling; sampling algorithms; Theorem proving;
                 upper bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Clementi:1995:RPF,
  author =       "Andrea Clementi and Russell Impagliazzo",
  title =        "The reachability problem for finite cellular
                 automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "27--31",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q80",
  MRnumber =     "95k:68165",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Geneva",
  affiliationaddress = "Geneva, Switz",
  classification = "721.1; 722.4; 723; 723.4; 921; C4220 (Automata
                 theory); C4240C (Computational complexity)",
  corpsource =   "Centre Univ. d'Inf., Geneva Univ., Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Automata theory; Cellular automata; cellular automata;
                 complexity; Computational complexity; computational
                 complexity; configuration reachability problem;
                 Configuration reachability Problem (CREP); finite
                 cellular automata; finite weakly predictable cellular
                 automata; Interactive computer graphics; Interactive
                 proof systems; Invertible global functions; Local
                 interactions; Mathematical models; reachability
                 problem; State transition diagram; Theorem proving;
                 Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kulasinghe:1995:MTH,
  author =       "Priyalal Kulasinghe and Said Bettayeb",
  title =        "Multiply-twisted hypercube with five or more
                 dimensions is not vertex-transitive",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "33--36",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "96a:68006",
  MRreviewer =   "Neville G. F. Sancho",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "703.1; 721; 721.1; 722.4; 723; 921; C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Dept. of Electron. and Comput. Eng., 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; Binary codes; Boolean functions;
                 Distributed computer systems; Hypercube; hypercube
                 networks; Interconnection networks; Mathematical
                 models; Multiply twisted hypercube; multiply-twisted
                 hypercube; Sensitivity analysis; Symmetries; Vertex
                 transitivity; vertex transitivity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aggarwal:1995:ESA,
  author =       "C. C. Aggarwal and N. Jain and P. Gupta",
  title =        "An efficient selection algorithm on the pyramid",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "37--47",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68P10 68Q25)",
  MRnumber =     "95m:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Kanpur, India",
  classification = "721.1; 723; 723.2; 921; 921.6; C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Kanpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; Computational complexity;
                 computational complexity; Data acquisition; generalised
                 selection algorithm; Kth element; on-negative weight;
                 Parallel algorithms; parallel algorithms; processors;
                 Pyramid models; Time complexity; time complexity;
                 two-dimensional pyramid model; weighted quantile",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zheng:1995:KAP,
  author =       "Yuliang Zheng",
  title =        "On key agreement protocols based on tamper-proof
                 hardware",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "49--54",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 314 712",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); B6150M (Protocols); C6130S (Data
                 security)",
  corpsource =   "Dept. of Comput. Sci., Wollongong Univ., NSW,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "communication rules; cryptography; identity based
                 conference key agreement protocol; key agreement
                 protocols; legitimate users; protocols; secure
                 communications; shared common key; tamper-proof
                 hardware; users",
  treatment =    "P Practical",
}

@Article{Chang:1995:EPP,
  author =       "Yung Cheng Chang and Lih Hsing Hsu",
  title =        "Element perturbation problems of optimum spanning
                 trees with two-parameter objectives",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "1",
  pages =        "55--59",
  day =          "13",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (68Q25)",
  MRnumber =     "95j:05068",
  MRreviewer =   "Ding Zhu Du",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "721.1; 723.1; 921.1; 921.4; C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., 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 algorithms; computational
                 complexity; Computational complexity; computational
                 geometry; element perturbation problems; Element
                 perturbation problems; graph; Matrix algebra;
                 optimisation; optimum spanning trees; ordered rational
                 number pair; Perturbation techniques; perturbation
                 theory; trees (mathematics); Trees (mathematics); Two
                 parameter objectives; two-parameter objectives",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Russell:1995:RRB,
  author =       "Alexander Russell and Ravi Sundaram",
  title =        "The relativized relationship between probabilistically
                 checkable debate systems, {IP} and {PSPACE}",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "61--68",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D10 03D15)",
  MRnumber =     "96c:68069",
  MRreviewer =   "Gerhard Lischke",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "721.1; 922.1; C4210L (Formal languages and
                 computational linguistics); C4220 (Automata theory);
                 C4240C (Computational complexity)",
  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 =     "Computation theory; Computational complexity;
                 computational complexity; Computational linguistics;
                 Debate systems; formal languages; Interactive proofs;
                 interactive proofs; IP; Oracles; oracles; Probabilistic
                 logics; probabilistically checkable debate systems;
                 PSPACE; relativized relationship; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fischer:1995:NCL,
  author =       "S. T. Fischer",
  title =        "A note on the complexity of local search problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "69--75",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25 90C60)",
  MRnumber =     "96b:68064",
  MRreviewer =   "D. M. Campbell",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Amsterdam",
  affiliationaddress = "Amsterdam, Neth",
  classification = "721.1; 912.3; 921.1; 921.4; 921.5; C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Math. and Comput. Sci., Amsterdam Univ.,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial mathematics; Combinatorial problems;
                 combinatorial problems; complexity; Computation theory;
                 Computational complexity; computational complexity;
                 given feasible solution; Local search; local search;
                 local search problems; locally optimal solutions;
                 NP-complete; Operations research; Optimization; PLS;
                 Polynomials; search problems; theory of computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kurosawa:1995:LEA,
  author =       "Kaoru Kurosawa and Koji Okada and Shigeo Tsujii",
  title =        "Low exponent attack against elliptic curve {RSA}",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "77--83",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "95k:94018",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Inst of Technology",
  affiliationaddress = "Tokyo, Jpn",
  classification = "716; 723.2; C6130S (Data security)",
  corpsource =   "Dept. of Electr. and Electron. Eng., Tokyo Inst. of
                 Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Cryptography; Data handling; Data processing;
                 Demytko's scheme; elliptic curve RSA; Elliptic curves;
                 KMOV scheme; Low exponent attack; low exponent RSA;
                 public key cryptography; RSA; secure; Security of data;
                 time-stamp",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ang:1995:IT,
  author =       "Chuan-Heng Ang and Kok-Phuang Tan",
  title =        "The interval {$B$}-tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "85--89",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Univ of Singapore",
  affiliationaddress = "Singapore",
  classification = "723.2; 723.5; 903.1; 903.3; C4240C (Computational
                 complexity); C4250 (Database theory); C6120 (File
                 organisation); C6160Z (Other DBMS)",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; computational complexity;
                 Computer simulation; data access; Data structures;
                 deletion; high disk I/O overhead; index structure;
                 indexing; Indexing (of information); Information
                 retrieval; information retrieval; input output
                 overhead; Input output programs; insertion;
                 intersections; Interval B tree; interval B-tree;
                 interval intersection operation; query processing;
                 space complexity; temporal databases; temporal queries;
                 time complexity; Time index; time index; time
                 intervals; tree data structures; valid times",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lim:1995:SPP,
  author =       "Chae Hoon Lim and Pil Joong Lee",
  title =        "Several practical protocols for authentication and key
                 exchange",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "91--96",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pohang Univ of Science and Technology",
  affiliationaddress = "Pohang, South Korea",
  classification = "716; 722.4; 723; 723.2; 921.6; B6120B (Codes);
                 C6130S (Data security)",
  corpsource =   "Dept. of Electr. Eng., Pohang Univ. of Sci. and
                 Technol., South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-move identification schemes; Algorithms;
                 authentication; Authentication protocols; Computer
                 networks; Cryptography; Diffie--Hellman-type key
                 exchange protocols; Distributed computer systems; key
                 exchange; Key exchange; message authentication; Network
                 protocols; practical protocols; protocols; public key
                 cryptography; secret key exchange; Security of data;
                 symmetric algorithms; Symmetric algorithms;
                 zero-knowledge technique",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hwang:1995:SSA,
  author =       "Tzonelih Hwang and Yung-Hsiang Chen",
  title =        "On the security of {SPLICE\slash AS} --- The
                 authentication system in {WIDE Internet}",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "97--101",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Cheng-Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "716; 722.4; 723.2; B6120B (Codes); B6210L (Computer
                 communications); C0230 (Economic, social and political
                 aspects of computing); C5620W (Other computer
                 networks); C6130S (Data security)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "authentication protocol; Authentication protocols;
                 authentication system; Authentication system splice/as;
                 Computer networks; Cryptography; Data handling; data
                 protection; Distributed computer systems; Internet;
                 message authentication; Network protocols; protocols;
                 public key cryptography; Public key cryptosystem;
                 public-key cryptosystem; security; Security of data;
                 SPLICE/AS; WIDE Internet",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hwang:1995:TAN,
  author =       "Tzonelih Hwang and Narn-Yih Lee and Chuan-Ming Li and
                 Ming-Yung Ko and Yung-Hsiang Chen",
  title =        "Two attacks on {Neuman-Stubblebine} authentication
                 protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "103--107",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chen-Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "716; 722.4; 723.2; 943.3; B6120B (Codes); C6130S
                 (Data security)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Authentication protocols; Clocks; Computer networks;
                 cryptanalysis; Cryptoanalysis; cryptography;
                 Cryptography; Distributed computer systems; encryption;
                 message authentication; Network protocols;
                 Neuman-Stubblebine authentication protocols;
                 nonce-based mutual authentication protocol; nonces;
                 protocol defects; protocols; Security of data;
                 timestamps; Timestamps",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hassin:1995:MDS,
  author =       "Refael Hassin and Arie Tamir",
  title =        "On the minimum diameter spanning tree problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "109--111",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (05C35)",
  MRnumber =     "95j:05069",
  MRreviewer =   "Ding Zhu Du",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel-Aviv Univ",
  affiliationaddress = "Tel-Aviv, Isr",
  classification = "721.1; 723.1; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Stat. and Oper. Res., Tel Aviv Univ.,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "absolute 1-center; algorithm theory; Algorithms;
                 Combinatorial mathematics; combinatorial mathematics;
                 combinatorial problems; graph; graph theory; Minimum
                 diameter spanning tree; minimum diameter spanning tree;
                 spanning tree; Trees (mathematics); trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wolfson:1995:ADD,
  author =       "Ouri Wolfson and Sushil Jajodia",
  title =        "An algorithm for dynamic data allocation in
                 distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "2",
  pages =        "113--119",
  day =          "27",
  month =        jan,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois",
  affiliationaddress = "Chicago, IL, USA",
  classification = "716; 723.1; 723.2; 723.3; C4240P (Parallel
                 programming and algorithm theory); C4250 (Database
                 theory); C6160B (Distributed databases)",
  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 =     "1-copy-serializability; Algorithms; Computer networks;
                 Data allocation; data allocation; data management; Data
                 processing; database theory; distributed algorithms;
                 Distributed database systems; distributed databases;
                 distributed systems; dynamic data allocation; Primary
                 copy method; primary copy method; Program processors;
                 Replication; replication scheme; resource allocation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonKarger:1995:SC,
  author =       "Burghard {von Karger} and C. A. R. Hoare",
  title =        "Sequential calculus",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "123--130",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B70 68Q10)",
  MRnumber =     "95k:68147",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kiel Univ",
  affiliationaddress = "Kiel, Ger",
  classification = "721.1; 722.4; 723.1; 723.1.1; 723.2; 921.1; C4210
                 (Formal logic)",
  corpsource =   "Inst. for Comput. Sci., Kiel Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Algebraic calculus; algebraic calculus;
                 calculus; Computation theory; Computer hardware
                 description languages; Computer programming; Concurrent
                 systems; Data structures; Formal logic; General
                 converse operation; Programming calculi; Reactive
                 systems; reactive systems; Real time systems;
                 Reasoning; relational algebra; Relational calculus;
                 relational calculus; Sequential calculus; sequential
                 calculus; Sequential phenomena; specification
                 languages; Temporal logic; temporal logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{MPCG:1995:FPC,
  author =       "{Mathematics of Program Construction Group}",
  title =        "Fixed-point calculus",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "131--136",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B70 (06A15 06A23)",
  MRnumber =     "95m:03066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  annote =       "Article footnote lists the group members as:
                 Chritienne Aarts and Roland Backhouse and Eerke Boiten
                 and Henk Doornbos and Netty van Gasteren and Rik van
                 Geldrop and Paul Hoogendijk and Ed Voermans and Jaap
                 van der Woude",
  classification = "721.1; 723.1; 921.1; 921.2; 921.6; C4210 (Formal
                 logic); C4250 (Database 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 =     "Algebra; calculational properties; Calculations;
                 calculus; calculus of extreme fixed points; Complete
                 lattice; Computation theory; Computer programming;
                 Extreme fixed points; Fixed point calculus; fixed
                 points; Functions; Fusion theorem; fusion theorem;
                 Gallois connections; Galois connections; Knaster-Tarski
                 theorem; Problem solving; Program derivation; program
                 derivation; Programming calculi; programming calculi;
                 relational algebra; small calculus; Theorem proving;
                 theory of computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{ETAC:1995:CGA,
  author =       "{The Eindhoven Tuesday Afternoon Club}",
  title =        "Constructing the {Galois} adjoint",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "137--139",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B35 (06A15)",
  MRnumber =     "1 315 196",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  annote =       "Article footnote lists the group members as: A.
                 Bijlsma and R. W. Bulterman and W. H. J. Feijen and A.
                 J. M. van Gasteren and C. S. Scholten and F. W. van der
                 Sommen and A. I. J. Wijnands",
  classification = "721.1; 723.1; 921.6; C1110 (Algebra); 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 =     "Calculations; Computation theory; Computational
                 methods; Computer programming; Equational reasoning;
                 Functions; Galois adjoint; Galois connections; Galois
                 fields; Human engineering; Leibniz rule; Monotonic;
                 Program derivation; programming theory; Proof design;
                 Proof obligation; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dijkstra:1995:HCP,
  author =       "Edsger W. Dijkstra",
  title =        "Heuristics for a calculational proof",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "141--143",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B35",
  MRnumber =     "1 315 197",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 921.6; C4210 (Formal logic); 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 =     "Avoiding rabbits; avoiding rabbits; calculational
                 proof; Calculational proofs; Calculations;
                 Computational methods; Formal logic; Formal proof;
                 formal proofs; formalism; Formula manipulation; formula
                 manipulation; Functions; Heuristic methods; heuristics;
                 Integers; Natural numbers; Number theory; Proof
                 derivation; proof derivation; Proof design; proof
                 design; Theorem proving; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gries:1995:EPL,
  author =       "David Gries and Fred B. Schneider",
  title =        "Equational propositional logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "145--152",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03C05 (03B05)",
  MRnumber =     "95i:03070",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "721.1; 921.1; 921.6; C4210 (Formal logic)",
  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 =     "Boolean functions; Calculations; Completeness;
                 completeness; Computational methods; Equational proof
                 style; Equational propositional logic; equational
                 propositional logic; Equational reasoning; equational
                 reasoning; equational-proof; Formal logic; formal
                 logic; Hilbert style; logic; Soundness; soundness;
                 Theorem proving; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kornerup:1995:MFN,
  author =       "Jacob Kornerup",
  title =        "Mapping a functional notation for parallel programs
                 onto hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "153--158",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68M07 68Q22)",
  MRnumber =     "96a:68028",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 723.2; 921.1; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 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 =     "Algebra; Calculations; Computer program listings;
                 Computer programming; Computer programming languages;
                 Data structures; Functional notation; functional
                 notation; Functional programming; functional
                 programming; Functional programming languages;
                 hypercube networks; Hypercubes; hypercubes; hypercubic
                 architectures; Parallel algorithms; parallel
                 algorithms; Parallel processing systems; Parallel
                 programs; parallel programs; powerlists; Prefix sum;
                 Prefix Sum; Program derivation; program derivation;
                 Programming calculi; programming calculi; Programming
                 theory; Sequential languages; Theory of powerlist",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leino:1995:CPE,
  author =       "K. Rustan M. Leino",
  title =        "Constructing a program with exceptions",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "159--163",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "California Inst of Technology",
  affiliationaddress = "Pasadena, CA, USA",
  classification = "721.1; 723.1; 723.1.1; 921.1; 921.6; C4210L (Formal
                 languages and computational linguistics); 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 =     "algebra; Algebra; Calculations; computational
                 linguistics; Computational linguistics; Computational
                 methods; Computer programming; Computer programming
                 languages; exceptions; Exceptions; Formal languages;
                 formal semantics; Formal semantics; Functions; process
                 algebra; program constructs; program derivation;
                 Program derivation; programming calculi; Programming
                 calculi; programming theory; Programming theory;
                 structured jump; Structured jump; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Back:1995:GWS,
  author =       "R. J. R. Back and J. {von Wright}",
  title =        "Games and winning strategies",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "165--172",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90D05 (90D40)",
  MRnumber =     "95i:90097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Abo Akademi Univ",
  affiliationaddress = "Turku, Finl",
  classification = "721.1; 723.1; 723.1.1; 921.4; 922.1; C1140E (Game
                 theory); C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Abo Akademi, Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Angelic nondeterminism; angelic nondeterminism;
                 Computational linguistics; Computer hardware
                 description languages; Computer programming; Demonic
                 nondeterminism; demonic nondeterminism; equivalence
                 classes; equivalence transformations; Formal semantics;
                 formal semantics; Game theory; game theory; loop
                 correctness rule; process algebra; Program correctness;
                 program correctness; Program transformation; Program
                 verification; program verification; Programming
                 calculi; programming calculi; Programming theory; Set
                 theory; Theorem proving; Traditional loop correctness
                 rule; transformation; Two person games; two-person
                 games; Winning strategies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Subramanian:1995:PBN,
  author =       "Ashok Subramanian",
  title =        "A polynomial bound on the number of light cycles in an
                 undirected graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "173--176",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C38)",
  MRnumber =     "95k:05096",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Subramanian:1995:EPB}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "921.1; 921.2; 921.4; 921.6; C1110 (Algebra); C1160
                 (Combinatorial mathematics)",
  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 =     "Algorithms; Boundary conditions; Combinatorial
                 mathematics; Combinatorial problems; Graph theory;
                 graph theory; light cycles; Matrix algebra; Minimum
                 weight circuits; Minimum weight cycles; minimum-weight
                 cycles; polynomial bound; Polynomials; polynomials;
                 positive real weight; Short cycles; Undirected graph;
                 undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boland:1995:SCP,
  author =       "Ralph P. Boland and Jorge Urrutia",
  title =        "Separating collections of points in {Euclidean}
                 spaces",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "177--183",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B55 (68Q25 68U05)",
  MRnumber =     "96e:52033a",
  MRreviewer =   "Rade {\v{Z}}ivaljevi{\'c}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also corrigendum \cite{Boland:1995:CSC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "721.1; 903.3; 921.2; 921.4; 921.6; C1160
                 (Combinatorial 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 =     "Algorithms; Boundary conditions; Combinatorial
                 mathematics; combinatorial mathematics; Combinatorial
                 problems; complementary half space; Computational
                 complexity; Computational geometry; computational
                 geometry; Convex sets; disjoint convex sets; Euclidean
                 spaces; hyperplane; Hyperplanes; Information retrieval;
                 Point sets; Separability; Set theory; Theorem proving;
                 time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tu:1995:TD,
  author =       "Hsieh-Chang Tu and Carl H. Smith",
  title =        "Training digraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "185--192",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05",
  MRnumber =     "96c:68169",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "721.1; 723.1; 723.4.1; 921.4; 921.6; B0250
                 (Combinatorial mathematics); C1160 (Combinatorial
                 mathematics); C4200 (Computer theory); C4210 (Formal
                 logic)",
  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 =     "Computation theory; computation theory; Computer
                 software; directed graphs; Finite acyclic digraph;
                 finite acyclic digraph; Formal logic; Graph theory;
                 Inference engines; labelled graph; Learning algorithms;
                 learning structure; Mathematical models; Recursive
                 functions; recursive functions; Set theory; Training
                 digraphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1995:GD,
  author =       "Rajiv Gupta",
  title =        "Generalized dominators",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "193--200",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N20 (68R10)",
  MRnumber =     "96a:68011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pittsburgh",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "723.1; 723.2; 731.1; 921.4; 921.5; 921.6; B0250
                 (Combinatorial mathematics); B0260 (Optimisation
                 techniques); C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques)",
  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 =     "Algorithms; Array bound checks; Code hoisting; Code
                 optimization; Codes (symbols); Computational methods;
                 Control flow graph (CFG); Data processing; directed
                 acyclic graph; Directed acyclic graph (DDAG); directed
                 graphs; Flowcharting; Generalized dominators;
                 generalized dominators; Graph theory; Invariance; Loop
                 invariants; Multiple vertex dominators; multiple-vertex
                 dominators; optimisation; Optimization; Single vertex
                 dominators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DePrisco:1995:CIB,
  author =       "Roberto {De Prisco} and Giuseppe Persiano",
  title =        "Characteristic inequalities for binary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "201--207",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68R10)",
  MRnumber =     "96d:68036",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Salerno",
  affiliationaddress = "Baronissi, Italy",
  classification = "721.1; 723.2; 921.1; 921.4; C6120 (File
                 organisation)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; Binary trees; binary trees;
                 characteristic inequalities; Data structures; Integers;
                 Kraft McMillan's characteristic inequality;
                 Kraft--McMillan's characteristic inequality; Length
                 ensemble; Length vector; necessary and sufficient
                 condition; Partial sums problem; Path ensemble; path
                 ensemble; Path vector; path vector; Set theory; tree
                 data structures; Trees (mathematics); U-R systems;
                 Vectors; Yeung's characteristic inequality",
  treatment =    "P Practical",
}

@Article{Kucherov:1995:UGR,
  author =       "Gregory Kucherov and Micha{\"e}l Rusinowitch",
  title =        "Undecidability of ground reducibility for word
                 rewriting systems with variables",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "209--215",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "1 327 587",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CRIN and INRIA-Lorraine",
  affiliationaddress = "Vandoeuvre-les-Nancy, Fr",
  classification = "721.1; 723.1.1; 723.2; 921.4; C1250 (Pattern
                 recognition); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "CRIN-INRIA Lorraine, Vandoeuvre-les-Nancy, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Associative processing; Binary associative function;
                 binary associative function; Codes (symbols);
                 Computability and decidability; Computation theory;
                 Concatenation; concatenation; finitely many constant
                 symbols; Formal languages; formal languages; Ground
                 reducibility; ground reducibility; Pattern matching;
                 pattern matching; Pattern recognition; Reductive power;
                 Rewrite rules; rewriting systems; Set theory;
                 signature; Term rewriting systems; Undecidability;
                 variables; Word rewriting system with variables (WRSV);
                 word rewriting systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Matousek:1995:EPC,
  author =       "Ji{\v{r}}{\'\i} Matou{\v{s}}ek",
  title =        "On enclosing $k$ points by a circle",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "217--221",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55 68Q25)",
  MRnumber =     "96e:68136",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Charles Univ",
  affiliationaddress = "Praha, Czech",
  classification = "721.1; 723.1; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Appl. Math., Charles Univ., Prague, Czech
                 Republic",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Clustering; Computational complexity;
                 computational complexity; Computational geometry;
                 computational geometry; Integer programming; k points
                 enclosing; Logarithmic factors; logarithmic factors;
                 Mathematical models; n-point set; Parametric search;
                 randomised algorithms; Randomized algorithm; randomized
                 algorithms; search problems; Smallest enclosing
                 circle",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ohlebusch:1995:TMC,
  author =       "Enno Ohlebusch",
  title =        "Termination is not modular for confluent
                 variable-preserving term rewriting systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "223--228",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "96d:68118",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  abstract =     "Termination is not modular for confluent
                 variable-preserving term rewriting systems.",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Bielefeld",
  affiliationaddress = "Bielefeld, Ger",
  classification = "721.1; 723.2; 921.4; 921.6; C4210L (Formal languages
                 and computational linguistics)",
  corpsource =   "Technische Fakultat, Bielefeld Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational complexity; computer theory; Confluent
                 variable preserving term rewriting systems; confluent
                 variable-preserving term rewriting system; conjecture;
                 Constraint theory; counterexample; Data processing;
                 Disjoint union; grammar; irreducible TRS; Mathematical
                 models; modular; Modularity; Program specification;
                 Rewrite rules; rewriting systems; Set theory;
                 Termination; termination; TRS",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Likas:1995:PAM,
  author =       "Aristidis Likas and Andreas Stafylopatis",
  title =        "A parallel algorithm for the minimum weighted vertex
                 cover problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "229--234",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C85 68R10)",
  MRnumber =     "96d:68087",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Technical Univ of Athens",
  affiliationaddress = "Athens, Greece",
  classification = "721.1; 723.1; 921.1; 921.4; 921.5; 921.6; C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Dept. of Electr. and Comput. Eng., 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; computational geometry;
                 Graph theory; Heuristic methods; Mathematical models;
                 Matrix algebra; Minimum weighted vertex cover problem;
                 minimum weighted vertex cover problem; optimisation;
                 Optimization; parallel algorithm; Parallel algorithms;
                 parallel algorithms; physical metaphor; Set theory;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rittri:1995:CSU,
  author =       "Mikael Rittri",
  title =        "Corrigendum: {``Semi-unification of two terms in
                 Abelian groups''} {[Inform. Process. Lett. {\bf 52}(2),
                 28 October 1994, pp. 61--68]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "4",
  pages =        "235--235",
  day =          "24",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N15",
  MRnumber =     "95m:68020b",
  bibdate =      "Wed Nov 11 07:56:55 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Rittri:1994:SUT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Otto:1995:SWE,
  author =       "Friedrich Otto",
  title =        "Solvability of word equations modulo finite special
                 and confluent string-rewriting systems is undecidable
                 in general",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "237--242",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "96d:68119",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet GH Kassel",
  affiliationaddress = "Kassel, Ger",
  classification = "721.1; 723.1; 723.5; 921.6; C4210L (Formal languages
                 and computational linguistics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Fachbereich Math. Inf., Univ. Gesamthochschule Kassel,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Associativity; computability;
                 Computability and decidability; Computation theory;
                 Computer science; confluent string-rewriting systems;
                 decidability; finite special string rewriting system;
                 Formal languages; formal languages; rewriting systems;
                 solvability; String rewriting systems; undecidable;
                 Unification; unification module; Word equations; word
                 equations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Laih:1995:SLF,
  author =       "Chi Sung Laih and Fu Kuan Tu and Wen Chung Tai",
  title =        "On the security of the {Lucas} function",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "243--247",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "95m:94006",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Cheng Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "721.1; 723.2; 921.1; 921.6; B6110 (Information
                 theory); B6120B (Codes); C1260 (Information theory);
                 C6130S (Data security)",
  corpsource =   "Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "arithmetic; Computation theory; computational
                 complexity; cryptographically stronger; Cryptography;
                 Discrete logarithm problem; discrete logarithm
                 problems; exponentiation; exponentiation function;
                 functions; Functions; generalized discrete logarithm
                 problems; information theory; Lucas function; Lucas
                 function security; Lucas problem; polynomial-time
                 equivalent; Polynomials; public key cryptography;
                 Public key cryptosystem; public key system; Security of
                 data; security relationship; trapdoor",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Davis:1995:OPA,
  author =       "Robert Davis and Alan Burns",
  title =        "Optimal priority assignment for aperiodic tasks with
                 firm deadlines in fixed priority pre-emptive systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "249--254",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of York",
  affiliationaddress = "York, Engl",
  classification = "721.1; 722.4; 912.2; 921.5; 921.6; C1180
                 (Optimisation techniques); C4240C (Computational
                 complexity); C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., York Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "acceptance testing; Algorithms; Aperiodic tasks;
                 aperiodic tasks; arbitrary ready times; computation
                 time; Computational complexity; computational
                 complexity; Deadlines; firm deadlines; fixed priority
                 pre-emptive systems; Fixed priority preemptive systems;
                 Mathematical models; Microcomputers; off-line
                 feasibility analysis; Online systems; operating systems
                 (computers); Optimal priority assignment; optimal
                 priority assignment; Optimal systems; optimisation;
                 priority assignment; priority assignment policy; Real
                 time systems; real time systems; real-time systems;
                 resource allocation; Scheduling; scheduling; sporadic
                 tasks; uniprocessor scheduling; unique fixed
                 priorities",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Heydemann:1995:NRP,
  author =       "M. C. Heydemann and D. Sotteau",
  title =        "A note on recursive properties of the {de Bruijn},
                 {Kautz}, and {FFT} digraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "255--259",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q10)",
  MRnumber =     "96b:68024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite de Paris-Sud",
  affiliationaddress = "Orsay, Fr",
  classification = "722.3; 722.4; 921.1; 921.3; 921.4; C1160
                 (Combinatorial mathematics)",
  corpsource =   "CNRS, Univ. de Paris-Sud, Orsay, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; complete bipartite digraphs; Cycles; De
                 Bruijn; de Bruijn digraph; diameter; Digraphs; directed
                 graphs; fast Fourier transforms; Fast Fourier
                 transforms; Fast-Fourier-Transform digraphs; FFT
                 digraph; Graph theory; Interconnection networks;
                 intersection digraph; Kautz; Kautz digraph;
                 line-digraph; multiprocessor interconnection networks;
                 Parallel processing systems; recursive properties; Set
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barbosa:1995:AFM,
  author =       "Valmir C. Barbosa and Stella C. S. Porto",
  title =        "An algorithm for {FIFO} message delivery among
                 migrating tasks",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "261--267",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Programa de Engenharia de Sistemas e Computacao",
  affiliationaddress = "Rio de Janeiro, Braz",
  classification = "721.1; 722.1; 722.2; 722.3; 722.4; 723.1; C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessing systems); C6150N (Distributed systems
                 software)",
  corpsource =   "COPPE, 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 =     "Algorithms; asynchronous distributed algorithm;
                 communicating tasks; Communication channels
                 (information theory); communication complexity;
                 complexities; Computational complexity; Computer
                 architecture; concurrent migration; Data communication
                 systems; Data storage equipment; distributed
                 algorithms; Distributed computer systems; Distributed
                 computing; Distributed memory multiprocessors;
                 distributed memory systems; distributed-memory
                 architectures; distributed-memory parallel machines;
                 FIFO message delivery; First in first out message
                 delivery; interprocessor messages; message passing;
                 Message passing programs; Microcomputers; migrating
                 tasks; multiprocessor interconnection networks;
                 parallel machines; Parallel processing systems; Task
                 migration",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Tokuda:1995:ESE,
  author =       "Takehiro Tokuda and Yoshimichi Watanabe",
  title =        "An efficient semantic evaluator for warped {LC(1)}
                 attributed grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "269--276",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Inst of Technology",
  affiliationaddress = "Tokyo, Jpn",
  classification = "721.1; 723.1; 723.2; C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Tokyo Inst. of Technol.,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Attribute grammars; attribute grammars; bottom-up
                 parsing based LR-attributed grammars; bottomup parsing;
                 Codes (symbols); compilers; Computation theory;
                 Computational linguistics; Context free grammars;
                 evaluator construction method; Formal languages; formal
                 languages; Formal semantics; left corner parsing;
                 one-pass evaluatable attribute grammars;
                 precomputation; Program compilers; Semantic evaluator;
                 semantic evaluator; top-down parsing; top-down parsing
                 based LL-attributed grammars; Warped LC(1) attributed
                 grammars; warped LC(1) attributed grammars",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hamdi:1995:TPD,
  author =       "Mounir Hamdi",
  title =        "Topological properties of the directional hypercube",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "277--286",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "96d:68014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hong Kong Univ of Science and Technology",
  affiliationaddress = "Kowloon, Hong Kong",
  classification = "716.1; 722; 722.4; 723.1; 921.4; 922.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessing systems)",
  corpsource =   "Dept. of Comput. Sci., Hong Kong Univ. of Sci. and
                 Technol., Kowloon, Hong Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Bandwidth; bandwidth; binary hypercube;
                 Communication channels (information theory); Computer
                 hardware; concurrency control; Connectivity;
                 connectivity; cost-effective variation; Dcube;
                 deadlock-free; Diameter; diameter; Directional
                 hypercube; directional hypercube; directional links;
                 Emulation; fault tolerance; Fault tolerant computer
                 systems; fault tolerant computing; hypercube networks;
                 message distribution; message passing; message routing;
                 network routing; Node disjoint path; optimal
                 connectivity; parallel architectures; Parallel
                 processing systems; Queueing theory; Routing; routing
                 algorithm; simple duplex links; Telecommunication
                 links; Telecommunication traffic; time performance;
                 Topological properties; topological properties;
                 Topology; virtual channels",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Veloso:1995:MTL,
  author =       "Paulo A. S. Veloso and Thomas S. E. Maibaum",
  title =        "On the {Modularization Theorem} for logical
                 specifications",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "287--293",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pontificia Universidade Catolica - RJ",
  affiliationaddress = "Rio de Janeiro, Braz",
  classification = "721.1; 723.1.1; 723.2; 723.5; C4210 (Formal logic);
                 C6110F (Formal methods)",
  corpsource =   "Dept. de Inf., Pontificia Univ. Catolica do Rio de
                 Janeiro, Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic specification; Computation theory; Computer
                 hardware description languages; Data structures; Data
                 types; first-order sentences; formal languages; Formal
                 logic; formal specification; Logical specifications;
                 logical specifications; many-sorted language; modular
                 structure; Modularization theorem; modularization
                 theorem; Program correctness; program correctness;
                 Program specification; program verification;
                 refinements; software design; Software design and
                 implementation; Software engineering; Systems analysis;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Steiger:1995:PAS,
  author =       "William Steiger and Ileana Streinu",
  title =        "A pseudo-algorithmic separation of lines from
                 pseudo-lines",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "5",
  pages =        "295--299",
  day =          "10",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B55 (68Q25 68U05)",
  MRnumber =     "96a:52022",
  MRreviewer =   "Rade {\v{Z}}ivaljevi{\'c}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rutgers Univ",
  affiliationaddress = "New Brunswick, NJ, USA",
  classification = "721.1; 723.5; 921.1; 921.4; 921.6; C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  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 =     "Algebra; algebraic decision tree; algorithmic type;
                 Algorithms; complexity; computation; computational
                 complexity; Computational complexity; computational
                 geometry; Computational geometry; decision theory;
                 Decision theory; Decision tree; decision tree model;
                 line arrangement; Mathematical models; nonuniform
                 model; polynomial time; Pseudo algorithmic separation;
                 Pseudo lines; pseudo-algorithmic separation of lines;
                 pseudo-lines; quadratic decision tree; reduction
                 argument; sorting; sorting under partial information;
                 trees (mathematics); Trees (mathematics); x-sorting
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Spiliopoulou:1995:QPM,
  author =       "Myra Spiliopoulou and Yannis Cotronis and Michael
                 Hatzopoulos",
  title =        "Query processing for multimedia applications on
                 optical media",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "301--306",
  day =          "24",
  month =        mar,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5320K (Optical storage); C6130M (Multimedia); C7250
                 (Information storage and retrieval)",
  corpsource =   "Dept. of Inf., Athens Univ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cost model; disc access speed; memory capacity;
                 multimedia applications; multimedia systems; optical
                 media; optical storage; optical storage platforms;
                 query execution plans; query processing",
  treatment =    "P Practical",
}

@Article{May:1995:NSD,
  author =       "J. H. R. May and A. D. Lunn",
  title =        "New statistics for demand-based software testing",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "307--314",
  day =          "24",
  month =        mar,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C6110B (Software
                 engineering techniques); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  corpsource =   "Fac. of Math. and Comput., Open Univ., Milton Keynes,
                 UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "demand-based software testing; digital systems;
                 failure probability models; performance evaluation;
                 probability; program structure; program testing;
                 software performance evaluation; software reliability;
                 statistical analysis; statistical estimation;
                 statistical failure probability estimators; system
                 recovery",
  treatment =    "P Practical",
}

@Article{Macarie:1995:DBT,
  author =       "Ioan I. Macarie",
  title =        "Decreasing the bandwidth of a transition matrix",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "315--320",
  day =          "24",
  month =        mar,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bounded-error probabilistic computation; competitions
                 method; computational complexity; deterministic
                 simulations; log-space complete problem; log-space
                 reducible; probabilistic automata; probabilistic Turing
                 machines; space-bounded; transition matrix; Turing
                 machines; unbounded-error probabilistic Turing
                 machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldmann:1995:NPM,
  author =       "Mikael Goldmann",
  title =        "A note on the power of majority gates and modular
                 gates",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "321--327",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25 94C10)",
  MRnumber =     "96d:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230B (Combinatorial switching theory); C4240C
                 (Computational complexity); C5120 (Logic and switching
                 circuits)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean circuits; circuit complexity; combinational
                 circuits; computational complexity; exponential size;
                 logic circuits; logic gates; majority gates; modular
                 gates; prime factor; threshold circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dijkstra:1995:EUP,
  author =       "Rutger M. Dijkstra",
  title =        "An experiment with the use of predicate transformers
                 in {UNITY}",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "329--332",
  day =          "24",
  month =        mar,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Groningen Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "dynamic graphs; parallel algorithms; predicate
                 transformers; program correctness; proof methodology;
                 theorem proving; UNITY",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Natu:1995:PPC,
  author =       "Madan Natu and Shu Cherng Fang",
  title =        "On the point-to-point connection problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "333--336",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B10 (68Q25)",
  MRnumber =     "95m:90040",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Graduate Program in Oper. Res., North Carolina State
                 Univ., Raleigh, NC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; Dijkstra-like algorithm;
                 directed graphs; finite directed network;
                 point-to-point connection problem; source-destination
                 pairs; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Otto:1995:NNM,
  author =       "Martin Otto",
  title =        "A note on the number of monadic quantifiers in monadic
                 {$\Sigma^1_1$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "337--339",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03C85 (03C13 03D15 03D55)",
  MRnumber =     "96b:03050",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4210 (Formal logic);
                 C4240C (Computational complexity)",
  corpsource =   "Math. Grundlagen der Inf., Tech. Hochschule Aachen,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; computational complexity;
                 finite structures; formal logic; monadic quantifiers;
                 monadic second-order logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Valmari:1995:WDP,
  author =       "Antti Valmari",
  title =        "The weakest deadlock-preserving congruence",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "341--346",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q55 68Q90)",
  MRnumber =     "96i:68026",
  MRreviewer =   "Peter Bachmann",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110F (Formal methods)",
  corpsource =   "Software Syst. Lab., Tampere Univ. of Technol.,
                 Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "communicating sequential processes; CSP theory;
                 failures equivalence; formal specification;
                 specification languages; weakest deadlock-preserving
                 congruence; weakest equivalence",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{OConnor:1995:NLB,
  author =       "Luke O'Connor",
  title =        "A new lower bound on the expected size of irredundant
                 forms for {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "347--353",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94C10 (03G05 06E30 68Q25)",
  MRnumber =     "96e:94031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Fac. of Inf. Technol., Queensland Univ. of Technol.,
                 Brisbane, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary functions; Boolean functions; combinatorial
                 mathematics; combinatorial problems; expected size;
                 irredundant forms; largest implicant; lower bound;
                 prime implicants; shortest implicant",
  treatment =    "T Theoretical or Mathematical",
}

@Article{El-Yaniv:1995:GTS,
  author =       "Ran El-Yaniv and Jon Kleinberg",
  title =        "Geometric two-server algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "355--358",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68M20 90B22)",
  MRnumber =     "96e:68043",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "algorithm theory; d-dimensional space;
                 double-coverage; geometric two-server algorithms;
                 higher-dimensional generalization; metric spaces;
                 optimal 2-competitive algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kim:1995:OAF,
  author =       "Sung-Ho Kim and Jung-Heum Park and Seung-Hak Choi and
                 Sung Yong Shin and Kyung-Yong Chwa",
  title =        "An optimal algorithm for finding the edge visibility
                 polygon under limited visibility",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "6",
  pages =        "359--365",
  day =          "24",
  month =        mar,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "96e:68133",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4260 (Computational
                 geometry); C5260B (Computer vision and image processing
                 techniques); C6130B (Graphics techniques)",
  corpsource =   "Dept. of Comput. Eng., Kyungpook Nat. Univ., Taegu,
                 South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; computer graphics;
                 d-visibility; edge visibility polygon; limited
                 visibility; optimal algorithm; robot vision",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Nikolopoulos:1995:CTP,
  author =       "Stavros D. Nikolopoulos",
  title =        "Constant-time parallel recognition of split graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "1--8",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C85 68R10)",
  MRnumber =     "96c:68080",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cyprus Univ., Nicosia, Cyprus",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "graph recognition; graph theory; parallel algorithms;
                 parallel process environment; parallel recognition;
                 perfect; perfect graphs; split graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Petersen:1995:SFF,
  author =       "H. Petersen",
  title =        "On space functions fully constructed by
                 two-dimensional {Turing} machines",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "9--10",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96d:68073",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "recursive functions; single letter alphabets; space
                 functions; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nassar:1995:MMM,
  author =       "Hamed Nassar",
  title =        "A {Markov} model for multibus multiprocessor systems
                 under asynchronous operation",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "11--16",
  day =          "14",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection)",
  corpsource =   "Dept. of Math., King Faisal Univ., Hasa, Saudi
                 Arabia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "asynchronous operation; discrete-time Markov chain;
                 interconnection network; interconnection networks;
                 Markov model; Markov processes; multibus; multibus
                 multiprocessor systems; multiprocessor interconnection
                 networks; multiprocessors; system buses",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kaivola:1995:MSS,
  author =       "Roope Kaivola",
  title =        "On modal mu-calculus and {B{\"u}chi} tree automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "17--22",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D05 (03B45 03D70 68Q68)",
  MRnumber =     "96c:03083",
  MRreviewer =   "Damian Niwi{\'n}ski",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Lab. for Found. of Comput. Sci., Edinburgh Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "automata theory; Buchi tree automata; modal
                 mu-calculus; mu-variables; process algebra; Rabin
                 automata",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dunne:1995:MSS,
  author =       "Paul E. Dunne and Chris J. Gittings and Paul H. Leng",
  title =        "Multiprocessor simulation strategies with optimal
                 speed-up",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "23--33",
  day =          "14",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5210B (Computer-aided logic design)",
  corpsource =   "Dept. of Comput. Sci., Liverpool Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-processor algorithms; analysis of algorithms; logic
                 CAD; logic simulation; optimal speed-up; parallel
                 algorithms; parallel processing; simulation strategies;
                 virtual machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rusu:1995:QPP,
  author =       "Irena Rusu",
  title =        "Quasi-parity and perfect graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "35--39",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C15",
  MRnumber =     "96a:05062",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "CNRS, Orsay, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; algorithms; combinatorial problems;
                 graph theory; perfect graphs; quasi-parity; Strong
                 Perfect Graph Conjecture",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ogihara:1995:HPL,
  author =       "Mitsunori Ogihara",
  title =        "On helping by parity-like languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "41--43",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96e:68039",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; deterministic automata;
                 deterministic oracle; formal languages; language
                 classes; oracle machine; parity-like languages; robust
                 machines; Turing machine; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Oberoi:1995:CGR,
  author =       "Sundeep Oberoi",
  title =        "$\lambda_{\beta'}$ --- {A} $\lambda$-calculus with a
                 generalized $\beta$-reduction rule",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "45--53",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B40 (68Q55)",
  MRnumber =     "96b:03025",
  MRreviewer =   "Mariangiola Dezani-Ciancaglini",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  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/",
  keywords =     "$\lambda_{\beta'}$; arbitrary syntactically-imposed
                 sequentiality; Church--Rosser property; generalized
                 beta-reduction rule; lambda calculus; lambda-calculus",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chickering:1995:FCB,
  author =       "David M. Chickering and Dan Geiger and David
                 Heckerman",
  title =        "On finding a cycle basis with a shortest maximal
                 cycle",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "55--58",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C38 05C85 68Q25)",
  MRnumber =     "96b:68139",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Microsoft Corp., Redmond, WA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; graph theory; Horton's
                 algorithm; longest cycle; shortest maximal cycle
                 basis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kao:1995:LTO,
  author =       "Ming-Yang Kao",
  title =        "Linear-time optimal augmentation for componentwise
                 bipartite-completeness of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "1",
  pages =        "59--63",
  day =          "14",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q20 68R10)",
  MRnumber =     "96d:05100",
  MRreviewer =   "Toma{\v{z}} Pisanski",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "algorithm theory; bipartite graph; component-wise
                 bipartite-complete; componentwise bipartite-
                 completeness; data security; graph theory; linear-time
                 optimal augmentation; optimal time bound; security of
                 data",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jones:1995:PFL,
  author =       "C. B. Jones",
  title =        "Partial functions and logics: {A} warning",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "65--67",
  day =          "28",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)C6150G (Diagnostic, testing,
                 debugging and evaluating systems); C4240 (Programming
                 and algorithm theory); C6110F (Formal methods); C6140D
                 (High level languages)",
  corpsource =   "Dept. of Comput. Sci., Manchester Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "formal logic; formal specification; indeterminate
                 element; logics; partial functions; program reasoning;
                 program specification; program verification;
                 programming theory; specification language;
                 specification languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1995:CEB,
  author =       "Chui Cheng Chen and Rong Jaye Chen",
  title =        "Compact embedding of binary trees into hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "69--72",
  day =          "28",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C10 68M07 68M10)",
  MRnumber =     "96f:68081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary trees; compact embedding; hypercube networks;
                 hypercubes; trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ausiello:1995:LSR,
  author =       "Giorgio Ausiello and Marco Protasi",
  title =        "Local search, reducibility and approximability of
                 {NP}-optimization problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "73--79",
  day =          "28",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q15)",
  MRnumber =     "96c:68082",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240C (Computational
                 complexity)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximability; combinatorial property; complexity
                 theory; computational complexity; guaranteed local
                 optima; integer constant; local optima; local search;
                 NP-optimization problems; optimisation; polynomially
                 bounded optimization problems; reducibility; search
                 problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Barriga:1995:LUE,
  author =       "Luis Barriga and Rassul Ayani",
  title =        "Lazy update: An efficient implementation of {LRU}
                 stacks",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "81--84",
  day =          "28",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Dept. of Teleinformatics, R. Inst. of Technol.,
                 Stockholm, Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cache memories; cache storage; data structures;
                 database systems; file; lazy update; Least Recently
                 Used stacks; Most Recently Used stack",
  treatment =    "P Practical",
}

@Article{Myers:1995:AMC,
  author =       "Gene Myers",
  title =        "Approximately matching context-free languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "85--92",
  day =          "28",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q45)",
  MRnumber =     "96d:68084",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate pattern matching; Cocke-Younger-Kasami
                 algorithm; context-free languages; general comparison
                 cost models; pattern matching; sequence comparison",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bunke:1995:IAC,
  author =       "H. Bunke and J. Csirik",
  title =        "An improved algorithm for computing the edit distance
                 of run-length coded strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "93--96",
  day =          "28",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C6130 (Data
                 handling techniques)",
  corpsource =   "Inst. f{\"u}r Informatik and Angewandte Math., Bern,
                 Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; cost function; edit distance
                 computing; encoding; run-length coded strings; set-set
                 longest common subsequence problem; string matching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Agarwala:1995:WSP,
  author =       "Richa Agarwala and David Fern{\'a}ndez-Baca",
  title =        "Weighted search in the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "97--100",
  day =          "28",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20",
  MRnumber =     "96c:68071",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Center for Discrete Math. and Theor. Comput. Sci.,
                 Rutgers Univ., Piscataway, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "convex optimization problems; convex programming;
                 Megiddo's multidimensional search technique; search
                 problems; two-dimensional weighted version; weighted
                 search",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Moore:1995:COA,
  author =       "Dennis Moore and W. F. Smyth",
  title =        "A correction to {``An optimal algorithm to compute all
                 the covers of a string''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "101--103",
  day =          "28",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
                 recognition)",
  corpsource =   "Sch. of Comput., Curtin Univ. of Technol., Bentley,
                 WA, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; COMPUTECOVERS; optimal
                 algorithm; pattern matching; subalgorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dong:1995:IPP,
  author =       "Guozhu Dong",
  title =        "On the index of positive programmed formal languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "105--110",
  day =          "28",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68P20)",
  MRnumber =     "1 332 428",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrary context free grammar; chain query;
                 context-free grammars; formal languages; index; linear
                 datalog program; linear programming; maximal predicate
                 arity; positive integer; positive programmed formal
                 languages; positive programmed languages; strict index
                 hierarchy",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cidon:1995:MTA,
  author =       "Israel Cidon and Yuval Shavitt",
  title =        "Message terminating algorithms for anonymous rings of
                 unknown size",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "111--119",
  day =          "28",
  month =        apr,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q10)",
  MRnumber =     "96d:68010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6210L (Computer communications); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5620L (Local area
                 networks); C5640 (Protocols)",
  corpsource =   "Dept. of Electr. Eng., Israel Inst. of Technol.,
                 Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "anonymous processors; anonymous rings; communication
                 complexity; computational complexity; deterministic
                 algorithms; deterministic ring orientation algorithm;
                 leader election; message terminating algorithms;
                 partitioning; probabilistic algorithms; probabilistic
                 Las Vegas algorithm; probabilistic Las Vegas version;
                 symmetry breaking link markings; time complexities;
                 token networks; XOR",
  treatment =    "A Application; P Practical",
}

@Article{Varghese:1995:DGV,
  author =       "George Varghese and Roger Chamberlain and William E.
                 Weihl",
  title =        "Deriving global virtual time algorithms from
                 conservative simulation protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "121--126",
  day =          "28",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6150M (Protocols); B6210L (Computer
                 communications); C5640 (Protocols); C6185 (Simulation
                 techniques)",
  corpsource =   "Dept. of Comput. Sci., Washington Univ., St. Louis,
                 MO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "conservative simulation protocols; discrete event
                 simulation; distributed discrete-event simulation;
                 global virtual time algorithms; global virtual time
                 protocols; protocols",
  treatment =    "A Application; P Practical",
}

@Article{Weiss:1995:NCT,
  author =       "M. A. Weiss",
  title =        "A note on construction of treaps and {Cartesian}
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "2",
  pages =        "127--127",
  day =          "28",
  month =        apr,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Sch. of Comput. Sci., Florida Int. Univ., Miami, FL,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Cartesian trees; linear-time algorithm; treaps; tree
                 data structures",
  treatment =    "G General Review; P Practical",
}

@Article{Gonzalez:1995:SLF,
  author =       "Teofilo F. Gonzalez",
  title =        "A simple {LP-free} approximation algorithm for the
                 minimum weight vertex cover problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "129--131",
  day =          "12",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q20)",
  MRnumber =     "1 332 430",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm correctness proving; algorithm theory;
                 approximation bound; approximation theory; edges;
                 graph; graph theory; linear time; minimum weight vertex
                 cover problem; nodes; program verification; programming
                 theory; simple LP-free approximation algorithm;
                 solutions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schlipf:1995:FSE,
  author =       "John S. Schlipf and Fred S. Annexstein and John V.
                 Franco and R. P. Swaminathan",
  title =        "On finding solutions for extended {Horn} formulas",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "133--137",
  day =          "12",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B35",
  MRnumber =     "96a:03025",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Cincinnati Univ.,
                 OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; balanced formulas; Boolean algebra;
                 Boolean formulas; computability; extended Horn
                 formulas; Horn clauses; satisfiability problem; simple
                 quadratic-time algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alvarez:1995:EMM,
  author =       "Guillermo A. Alvarez and Marcelo O. Fern{\'a}ndez",
  title =        "Efficient management of multiple outstanding
                 timeouts",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "139--145",
  day =          "12",
  month =        may,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation); C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., California Univ., San
                 Diego, La Jolla, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; client applications; clocks;
                 correctness proving; data structures; efficient
                 management; independent timeout intervals; multiple
                 outstanding timeouts; operating systems (computers);
                 program verification; programming theory; timer
                 management service; timing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Snelick:1995:USP,
  author =       "Robert Snelick and Joseph J{\'a}J{\'a} and Raghu
                 Kacker and Gordon Lyon",
  title =        "Using synthetic perturbations and statistical
                 screening to assay shared-memory programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "147--153",
  day =          "12",
  month =        may,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C6110P (Parallel
                 programming); C6150G (Diagnostic, testing, debugging
                 and evaluating systems); C6150N (Distributed systems
                 software)",
  corpsource =   "Adv. Syst. Div., Nat. Inst. of Stand. and Technol.,
                 Gaithersburg, MD, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "insufficient parallelism; load imbalance; parallel
                 programming; poor performance; program diagnostics;
                 remote memory accesses; resource allocation; resource
                 contention; shared memory systems; shared-memory
                 program assaying; shared-memory programming systems;
                 software performance evaluation; statistical analysis;
                 statistical screening; synchronisation;
                 synchronization-induced overhead; synthetic
                 perturbation screening",
  treatment =    "P Practical",
}

@Article{Woeginger:1995:STD,
  author =       "Gerhard J. Woeginger",
  title =        "Scheduling with time-dependent execution times",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "155--156",
  day =          "12",
  month =        may,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1290F (Systems
                 theory applications in industry); C4240C (Computational
                 complexity)",
  corpsource =   "Inst. f{\"u}r Math., Tech. Univ. Graz, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; computational complexity;
                 deadline; polynomial time; scheduling; task execution
                 times; time-dependent execution times",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sloan:1995:FTN,
  author =       "Robert H. Sloan",
  title =        "Four types of noise in data for {PAC} learning",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "157--162",
  day =          "12",
  month =        may,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C1230
                 (Artificial intelligence); C4240 (Programming and
                 algorithm theory); C6170K (Knowledge engineering
                 techniques)",
  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/",
  keywords =     "algorithm theory; data noise; disagreement
                 minimisation; instances; labels; learning (artificial
                 intelligence); machine learning algorithms; malicious
                 noise; noisy inputs; PAC learning; polynomial size
                 example set; probably approximately correct learning;
                 random attribute noise; random classification noise;
                 random noise",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jain:1995:AAA,
  author =       "Ravi Jain and John Werth",
  title =        "Analysis of approximate algorithms for edge-coloring
                 bipartite graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "163--168",
  day =          "12",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C15 05C85 68Q20)",
  MRnumber =     "96c:68153",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "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/",
  keywords =     "adjacent edges; algorithm theory; approximate
                 algorithms; approximation theory; bipartite graphs;
                 constrained edge-coloring problem; edge-coloring; graph
                 colouring; minimum color number; optimal algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jenner:1995:KPN,
  author =       "Birgit Jenner",
  title =        "Knapsack problems for {NL}",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "169--174",
  day =          "12",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68R05)",
  MRnumber =     "96f:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1290
                 (Applications of systems theory); C4240C (Computational
                 complexity)",
  corpsource =   "Fac. for Inf., Tech. Univ. Munchen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; computational complexity;
                 knapsack problems; NL complexity class; NL-complete
                 problem; operations research",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gawiejnowicz:1995:SJV,
  author =       "Stanislaw Gawiejnowicz and Lidia Pankowska",
  title =        "Scheduling jobs with varying processing times",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "175--178",
  day =          "12",
  month =        may,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1290F (Systems theory applications in industry);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Fac. of Math. and Comput. Sci., Adam Mickiewicz Univ.,
                 Poznan, Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; C/sub max/ criterion; job processing
                 times; job scheduling; linear functions; makespan
                 scheduling problem; optimal schedule; polynomial-time
                 algorithms; production control; scheduling; starting
                 times",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1995:NSS,
  author =       "Rajesh P. N. Rao",
  title =        "A note on {$P$}-selective sets and closeness",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "3",
  pages =        "179--185",
  day =          "12",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96d:68074",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "closeness; computational complexity; encompassing
                 P/poly class; P-selective sets; set theory; sparse
                 sets; sparse symmetric differences; subclasses; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yu:1995:NST,
  author =       "Xiaokang Yu",
  title =        "A new solution for {Thue}'s problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "187--191",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15",
  MRnumber =     "96c:68159",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B6120B (Codes);
                 C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Pennsylvania State Univ., Altoona, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "auxiliary binary sequence; binary sequences;
                 combinatorial mathematics; formal languages; free
                 monoid; group theory; infinite square-free element
                 sequence; morphism; Thue's problem",
  treatment =    "N New Development; T Theoretical or Mathematical",
}

@Article{Petreschi:1995:RSR,
  author =       "Rossella Petreschi and Andrea Sterbini",
  title =        "Recognizing strict $2$-threshold graphs in {$O(m)$}
                 time",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "193--198",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68R10)",
  MRnumber =     "96i:68034a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Petreschi:1995:ERS}.",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., La Sapienza Univ., Rome,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; cutpoints; graph theory;
                 O(m) time recognition algorithm; strict 2-threshold
                 graph recognition; threshold components",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fernau:1995:NUL,
  author =       "Henning Fernau",
  title =        "A note on uniformly limited {ET0L} systems with unique
                 interpretation",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "199--204",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (68Q45)",
  MRnumber =     "96d:68114",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Lehrstuhl Inf. f{\"u}r Ingenieure und
                 Naturwissenschaftler, Karlsruhe Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "derivation step; different productions; formal
                 languages; grammars; kulETOL systems; programmed
                 grammars; rewriting systems; scattered context
                 grammars; table; ul-counterpart; uniformly limited ETOL
                 systems; unique interpretation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kummer:1995:LTC,
  author =       "Martin Kummer",
  title =        "A learning-theoretic characterization of classes of
                 recursive functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "205--211",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D20 (68T05)",
  MRnumber =     "96g:03072",
  MRreviewer =   "Costic{\u{a}} Cazacu",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory);
                 C6170K (Knowledge engineering techniques)",
  corpsource =   "Inst. f{\"u}r Logik, Komplexitat und Deduktionssyst.,
                 Karlsruhe Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "co-learnable class; inductive inference; inference
                 mechanisms; learning (artificial intelligence);
                 learning-theoretic characterization; numbering;
                 programming systems theory; programming theory;
                 recursive function classes; recursive functions;
                 recursively enumerable class; total recursive
                 functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barsi:1995:DRC,
  author =       "Ferruccio Barsi",
  title =        "Decoding residue codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "213--222",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94B40",
  MRnumber =     "96d:94010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C1260 (Information theory); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dipartimento di Matematica, Perugia Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arithmetic codes; decoding; error code; error
                 correcting procedures; error correction codes; error
                 syndrome; fast correcting procedures; modular
                 computations; parallel algorithms; residue code
                 decoding; unambiguous computations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fujita:1995:NSM,
  author =       "Satoshi Fujita",
  title =        "A note on the size of a multicast tree in hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "223--227",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "1 337 827",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Hiroshima Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; algorithms; communication links;
                 heuristic algorithm; hypercube networks; hypercubes;
                 multicast tree size; nontrivial approximation ratio
                 bound; oblivious algorithm; optimal multicast tree;
                 trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldwurm:1995:RGW,
  author =       "Massimiliano Goldwurm",
  title =        "Random generation of words in an algebraic language in
                 linear binary space",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "229--233",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "96f:68069",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C4210L (Formal
                 languages and computational linguistics); C4240C
                 (Computational complexity)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algebraic language; algorithm; combinatorial
                 structures; computational complexity; context-free
                 languages; linear binary space; O(n \log n) time; O(n)
                 binary space; random processes; random word generation;
                 unambiguous context-free language; uniform random
                 word",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hebrard:1995:UHR,
  author =       "Jean-Jacques H{\'e}brard",
  title =        "{Unique Horn} renaming and {Unique
                 $2$-Satisfiability}",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "235--239",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D15 (68Q25)",
  MRnumber =     "96b:03054",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Lab. d'Inf., Caen Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "clauses; computational complexity; decidability; Horn
                 clauses; linear algorithm; linear time; unique
                 2-satisfiability; unique Horn renaming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chrobak:1995:LTA,
  author =       "M. Chrobak and T. H. Payne",
  title =        "A linear-time algorithm for drawing a planar graph on
                 a grid",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "241--246",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C10 05C85 68Q20)",
  MRnumber =     "96c:68150",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); 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/",
  keywords =     "algorithm theory; edges; graph theory; grid;
                 linear-time algorithm; n-vertex planar graph; planar
                 graph drawing; straight-line segments",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Subramanian:1995:EPB,
  author =       "Ashok Subramanian",
  title =        "Erratum: {``A polynomial bound on the number of light
                 cycles in an undirected graph'' [Inform. Process. Lett.
                 {\bf 53} (1995), no. 4, 173--176; MR 95k:05096]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "247--247",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C38)",
  MRnumber =     "1 337 831",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Subramanian:1995:PBN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Simon:1995:NLB,
  author =       "Klaus Simon",
  title =        "A note on lexicographic breadth first search for
                 chordal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "249--251",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "96b:05165",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst f{\"u}r Theoretische Informatik",
  affiliationaddress = "Zurich, Switz",
  classification = "721.1; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4260 (Computational geometry); C6120 (File
                 organisation)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., Eidgenossische Tech.
                 Hochschule, Zurich, Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Breadth first search; Chordal graphs;
                 chordal graphs; Clique separators; Combinatorial
                 mathematics; Computation theory; computational
                 geometry; Graph theory; graph theory; lexicographic
                 breadth first search; Lexicography; perfect elimination
                 scheme; separators; Set theory; Theorem proving; tree
                 searching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Corneil:1995:LTA,
  author =       "Derek G. Corneil and Stephan Olariu and Lorna
                 Stewart",
  title =        "A linear time algorithm to compute a dominating path
                 in an {AT}-free graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "253--257",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "96b:05160",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto",
  affiliationaddress = "Toronto, Can",
  classification = "721.1; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4260 (Computational geometry)",
  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; asteroidal triple; Asteroidal triple free
                 graphs; AT-free graph; Calculations; computational
                 geometry; Computational methods; dominating path;
                 Domination; Graph theory; graph theory; Linear
                 ordering; Linear time algorithm; linear time algorithm;
                 Linearization; Set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Herman:1995:SPC,
  author =       "Ted Herman and Sukumar Ghosh",
  title =        "Stabilizing phase-clocks",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "259--265",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Iowa",
  affiliationaddress = "Iowa City, IA, USA",
  classification = "722.3; 722.4; 731.1; 731.4; 921.4; 922.1; B6150M
                 (Protocols); C5640 (Protocols); C6150N (Distributed
                 systems software)",
  corpsource =   "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "clock synchronization; Clocks; clocks; deterministic
                 protocol; Distributed computer systems; distributed
                 computing; distributed processing; Integer valued
                 variable; Network protocols; Phase clocks;
                 phase-clocks; probabilistic protocol; Probability;
                 protocol; protocols; Self stabilization;
                 self-stabilization; synchronisation; Synchronization;
                 synchronizing; System stability; Topology; Tree
                 network; Trees (mathematics); Uniform processes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fromentin:1995:FAD,
  author =       "Eddy Fromentin and Claude Jard and Guy-Vincent Jourdan
                 and Michel Raynal",
  title =        "On-the-fly analysis of distributed computations",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "267--274",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IRISA - Campus de Beaulieu",
  affiliationaddress = "Rennes, Fr",
  classification = "721.1; 722.3; 722.4; 731.1; 921.6; C5220P (Parallel
                 architecture); C6110 (Systems analysis and
                 programming); C6150G (Diagnostic, testing, debugging
                 and evaluating systems); C6150N (Distributed systems
                 software)",
  corpsource =   "IRISA, Rennes, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; causal precedence; Causal precedence;
                 Computational methods; Computer debugging; control
                 flows; Control flows; Data communication systems; data
                 flow analysis; distributed computations; Distributed
                 computer systems; distributed processing; Formal
                 languages; Mathematical models; Observability;
                 Observable event; observable events; On the fly
                 analysis; sequence analysis; Sequence analysis; systems
                 analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sugihara:1995:WDT,
  author =       "Kokichi Sugihara and Hiroshi Inagaki",
  title =        "Why is the {3D} {Delaunay} triangulation difficult to
                 construct?",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "275--280",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tokyo",
  affiliationaddress = "Tokyo, Jpn",
  classification = "721.1; 723.1; 723.5; 921.4; 921.6; C4185 (Finite
                 element analysis); C4260 (Computational geometry);
                 C6130B (Graphics techniques)",
  corpsource =   "Dept. of Math. Eng. and Inf. Phys., Tokyo Univ.,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3D Delaunay triangulation; Algorithms; Computational
                 complexity; Computational geometry; computational
                 geometry; Computer programming; Data structures;
                 Degeneracy; degeneracy; Delaunay triangulation; Error
                 analysis; mesh generation; Numerical robustness;
                 numerical robustness; Three dimensional; Topological
                 consistency; topological consistency; topology; Voronoi
                 diagram; Voronoi diagrams",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Demri:1995:CNM,
  author =       "St{\'e}phane Demri",
  title =        "$3$-{${\rm SAT}={\rm SAT}$} for a class of normal
                 modal logics",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "281--287",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D15 (03B45 68Q15 68T27)",
  MRnumber =     "96b:03053",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "LIFIA-IMAG",
  affiliationaddress = "Grenoble, Fr",
  classification = "721.1; 723.1; C4210 (Formal logic); C4240C
                 (Computational complexity)",
  corpsource =   "LIFIA, IMAG, Grenoble, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-SAT; Algorithms; automatic theorem proving;
                 Classical propositional logic; classical propositional
                 logic; Computational complexity; computational
                 complexity; Formal logic; formal logic; Modal clauses;
                 modal clauses; modal logics; Normal modal logics;
                 normal modal logics; SAT; Satisfiability problem;
                 Theorem proving; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Iwama:1995:ELB,
  author =       "Kazuo Iwama and Toniann Pitassi",
  title =        "Exponential lower bounds for the tree-like {Haj{\'o}s}
                 calculus",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "289--294",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03C85 03D15 03F20 68R10)",
  MRnumber =     "96c:68062",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kyushu Univ",
  affiliationaddress = "Fukuoka, Jpn",
  classification = "721.1; 723.2; 921.1; 921.4; C1160 (Combinatorial
                 mathematics); C4210 (Formal logic); C4240C
                 (Computational complexity)",
  corpsource =   "Kyushu Univ., Fukuoka, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Computation theory; Computational complexity;
                 computational complexity; Data structures; graph
                 colouring; Graph theory; Hajos calculus; Hajos
                 Calculus; Lower bounds; lower bounds; Non three
                 colorable graphs; non-3-colorable graphs;
                 nondeterministic procedure; Polynomials; process
                 algebra; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fujiwara:1995:OPA,
  author =       "Akihiro Fujiwara and Toshimitsu Masuzawa and Hideo
                 Fujiwara",
  title =        "An optimal parallel algorithm for the {Euclidean}
                 distance maps of $2${-D} binary images",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "295--300",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q22)",
  MRnumber =     "96d:68206",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Nara Inst of Science and Technology (NAIST)",
  affiliationaddress = "Nara, Jpn",
  classification = "722.4; 723.1; 723.2; 723.5; 921.5; 921.6; C1250
                 (Pattern recognition); C4240P (Parallel programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Graduate Sch. of Inf. Sci., Nara Inst. of Sci. and
                 Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary images; Calculations; chamfer distance maps;
                 chessboard; cityblock; computational complexity;
                 computational geometry; Computer simulation; distance
                 maps; Euclidean distance map; Euclidean distance maps;
                 Image processing; image processing; octagonal;
                 Optimization; parallel algorithm; Parallel algorithms;
                 parallel algorithms; Parallel processing systems; PRAM
                 algorithm; Two dimensional",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blokhuis:1995:ECN,
  author =       "A. Blokhuis and T. Kloks",
  title =        "On the equivalence covering number of splitgraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "301--304",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C70 (05C85 68Q25 68R10)",
  MRnumber =     "96d:05087",
  MRreviewer =   "Renu Laskar",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "721.1; 921.4; 921.6; C1160 (Combinatorial
                 mathematics); C4240C (Computational complexity)",
  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; Approximation theory; Calculations;
                 Computational complexity; computational complexity;
                 Equivalence classes; Equivalence covering; equivalence
                 covering number; Equivalence graph; equivalence graph;
                 equivalence subgraphs; Graph theory; graph theory;
                 NP-complete; NP-hard problem; Set theory; Splitgraphs;
                 splitgraphs",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sajith:1995:COP,
  author =       "G. Sajith and Sanjeev Saxena",
  title =        "Corrigendum: {``Optimal parallel algorithms for
                 coloring bounded degree graphs and finding maximal
                 independent sets in rooted trees'' [Inform. Process.
                 Lett. {\bf 49} (22 March 1994), no. 6, 303--308; MR
                 95a:68058]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "5",
  pages =        "305--305",
  day =          "9",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C15 05C85 68Q25 68R10)",
  MRnumber =     "96e:68054",
  bibdate =      "Sat Nov 7 17:55:38 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Sajith:1994:OPA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{deLuca:1995:DPF,
  author =       "Aldo {de Luca}",
  title =        "A division property of the {Fibonacci} word",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "307--312",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (05A99 68Q45)",
  MRnumber =     "96f:68092",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Roma `La Sapienza'",
  affiliationaddress = "Roma, Italy",
  classification = "721.1; 921.4; 921.6; C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Dipartimento di Matematica, La Sapienza Univ., Rome,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Combinatorial mathematics; Division property; division
                 property; Factorization; Fibonacci word; finite words;
                 Formal languages; formal languages; infinite sequence;
                 Lexicographic order; lexicographic order; limit
                 sequence; Numerical methods; reversal operation; Set
                 theory; standard Sturmian words; Sturmian words;
                 Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tromp:1995:SCG,
  author =       "John Tromp and Jeffrey Shallit",
  title =        "Subword complexity of a generalized {Thue--Morse}
                 word",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "313--316",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q45)",
  MRnumber =     "96d:68170",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "721.1; 723.2; 921.6; C4210L (Formal languages and
                 computational linguistics); C4240C (Computational
                 complexity)",
  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 =     "Calculations; Codes (symbols); Computational
                 complexity; computational complexity; distinct
                 subwords; Encoding (symbols); finite alphabet; Formal
                 languages; formal languages; generalized Thue--Morse
                 word; infinite word; Redundancy; redundancy; Subword
                 complexity; subword complexity; Theorem proving; Thue
                 Morse word",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zissimopoulos:1995:PGN,
  author =       "V. Zissimopoulos",
  title =        "On the performance guarantee of neural networks for
                 {NP}-hard optimization problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "317--322",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (68Q25 90C27 90C60)",
  MRnumber =     "96c:68170",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1230D (Neural
                 nets); C4240C (Computational complexity)",
  corpsource =   "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
                 France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation ratio; computational complexity;
                 encoding; massively parallel algorithm; maximum
                 independent set problem; neural nets; neural networks;
                 NP-hard optimization problems; optimisation;
                 performance guarantee; vertex covering problem; worst
                 case performance",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Schmeiser:1995:PTP,
  author =       "James P. Schmeiser and David T. Barnard",
  title =        "Producing a top-down parse order with bottom-up
                 parsing",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "323--326",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Can",
  classification = "721.1; 723.1; 723.2; C4210L (Formal languages and
                 computational linguistics)",
  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 =     "Algorithms; Bottom up parsing; bottom-up parsing;
                 Codes (symbols); Computational grammars; Computational
                 methods; Formal languages; formal languages; grammars;
                 Program compilers; standard bottom-up order; Top down
                 parse order; top-down parse order",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Desel:1995:SPS,
  author =       "J{\"o}rg Desel and Ekkart Kindler and Tobias Vesper
                 and Rolf Walter",
  title =        "A simplified proof for a self-stabilizing protocol: a
                 game of cards",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "327--328",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Humboldt-Universitaet zu Berlin",
  affiliationaddress = "Berlin, Ger",
  classification = "721.1; 722.4; 723.1; 921.5; 922.1; B0240E (Game
                 theory); B6150M (Protocols); C1140E (Game theory);
                 C5640 (Protocols)",
  corpsource =   "Inst. f{\"u}r Inf., Humboldt-Univ., Berlin, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; distributed algorithm; Distributed
                 computer systems; Game of cards; game of cards; Game
                 theory; game theory; leader election problem;
                 Optimization; protocols; Self stabilization;
                 self-stabilizing protocol; Termination proof;
                 termination proof; Theorem proving; uniform rings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vadapalli:1995:TCG,
  author =       "Premkumar Vadapalli and Pradip K. Srimani",
  title =        "Trivalent {Cayley} graphs for interconnection
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "329--335",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C25 05C85 68R10)",
  MRnumber =     "96c:68010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Colorado State Univ",
  affiliationaddress = "Ft. Collins, CO, USA",
  classification = "722.4; 921.1; 921.4; 921.5; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci., Colorado State Univ., Fort
                 Collins, CO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; algebraic properties; Algorithms; Computer
                 architecture; computer architecture; constant node
                 degree 3; Distributed computer systems; fault
                 tolerance; Fault tolerant computer systems; fault
                 tolerant computing; Fixed degree; Graph theory;
                 Interconnection networks; interconnection networks;
                 Logarithmic diameter; logarithmic diameter; maximally
                 fault tolerant; Multiprocessing systems; multiprocessor
                 interconnection networks; Optimal routing;
                 Optimization; Parallel processing systems; routing
                 algorithm; Topology; Trivalent Cayley graphs; trivalent
                 Cayley graphs",
  treatment =    "A Application; P Practical",
}

@Article{Alon:1995:DST,
  author =       "Noga Alon and Yishay Mansour",
  title =        "$\varepsilon$-discrepancy sets and their application
                 for interpolation of sparse polynomials",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "337--342",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11K31 (11K38 11Y16 65D05)",
  MRnumber =     "96g:11094",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tel Aviv Univ",
  affiliationaddress = "Tel Aviv, Isr",
  classification = "723.1; 921.1; 921.3; 921.4; 921.6; 922.1; B0290F
                 (Interpolation and function approximation); C4130
                 (Interpolation and function approximation); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Math., Tel Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; bit complexity model; Bit complexity
                 model; computational complexity; Computational
                 complexity; Fourier transforms; interpolation;
                 Interpolation; Mathematical models; nontrivial Fourier
                 coefficients; Polynomials; Probability; probability
                 distribution; Set theory; sparse polynomials; Sparse
                 polynomials; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Laroussinie:1995:AEP,
  author =       "F. Laroussinie",
  title =        "About the expressive power of {CTL} combinators",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "343--345",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B45)",
  MRnumber =     "96i:68054",
  MRreviewer =   "G. Mirkowska",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "LIFIA-IMAG",
  affiliationaddress = "Grenoble, Fr",
  classification = "721.1; 723.1; 723.1.1; 921.4; 921.6; C4210 (Formal
                 logic); C6110F (Formal methods)",
  corpsource =   "LIFIA-IMAG, Grenoble, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Boolean functions; Combinatorial
                 mathematics; Computation theory; Computation tree
                 logic; computation tree logic; Computer hardware
                 description languages; CTL combinators; expressive
                 power; Formal logic; formal specification; Mathematical
                 operators; program specification; Temporal logic;
                 temporal logic",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Litow:1995:IGS,
  author =       "B. Litow",
  title =        "The influence of graph structure on generalized
                 dimension exchange",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "347--353",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "96d:68015",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "James Cook Univ",
  affiliationaddress = "Townsville, Aust",
  classification = "722.4; 921.4; 921.6; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture);
                 C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., James Cook Univ. of North
                 Queensland, Townsville, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary Hamming graphs; binary Hamming
                 graphs; Calculations; Convergence of numerical methods;
                 Distributed computer systems; Generalized dimension
                 exchange; generalized dimension exchange; graph
                 structure; Graph theory; Interconnection networks;
                 interconnection networks; load balance; Load balancing;
                 load balancing; lower bound; multiprocessor
                 interconnection networks; resource allocation",
  treatment =    "P Practical",
}

@Article{Oyang:1995:TUB,
  author =       "Yen-Jen Oyang",
  title =        "A tight upper bound of the lumped disk seek time for
                 the {Scan} disk scheduling policy",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "355--358",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "722.1; 722.3; 722.4; 723.5; 903.3; 912.2; C5320C
                 (Storage on moving magnetic media); C6130M
                 (Multimedia); C6150N (Distributed systems software);
                 C7250 (Information storage and retrieval)",
  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 =     "accurate disk seek time model; Bandwidth; Computer
                 simulation; Data communication systems; Disk bandwidth;
                 disk bandwidth; information retrieval; Information
                 retrieval systems; Lumped disk seek time; lumped disk
                 seek time; magnetic disc storage; Magnetic disk
                 storage; multimedia storage system design; Multimedia
                 storage systems; multimedia storage systems; multimedia
                 systems; Real time systems; real-time systems; Scan
                 disk scheduling; Scan disk scheduling policy;
                 Scheduling; scheduling; systems analysis; Tight upper
                 bound; tight upper bound",
  treatment =    "A Application; P Practical",
}

@Article{Boland:1995:CSC,
  author =       "Ralph P. Boland and Jorge Urrutia",
  title =        "Corrigendum: {``Separating collections of points in
                 {Euclidean} spaces''} {[Inform. Process. Lett. {\bf
                 53}(4), 24 February 1995, pp. 177--183]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "6",
  pages =        "359--359",
  day =          "23",
  month =        jun,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B55 (68Q25 68U05)",
  MRnumber =     "96e:52033b",
  MRreviewer =   "Rade {\v{Z}}ivaljevi{\'c}",
  bibdate =      "Wed Nov 11 07:59:15 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Boland:1995:SCP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Huang:1995:EBP,
  author =       "Chung-Ming Huang and Jenq-Muh Hsu and Shiun-Wei Lee",
  title =        "{ECFSM}-based probabilistic protocol verification",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "1--9",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Cheng Kung Univ",
  affiliationaddress = "Tainan, Taiwan",
  classification = "723.1; 723.2; B6150M (Protocols); C5640 (Protocols);
                 C6110F (Formal methods); C6140D (High level
                 languages)",
  corpsource =   "Inst. of Inf. Eng., Nat. Cheng Kung Univ., Tainan,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "combinatorial state space explosion problem;
                 communicating entities; Communicating Finite State
                 Machine; communicating protocol; Computer networks;
                 Data communication systems; Distributed computer
                 systems; distributed systems; ECFSM-based probabilistic
                 protocol verification; Estelle; Extended Communicating
                 Finite State Machine; Extended Communicating Finite
                 State Machine (ECFSM); formal description; formal
                 specification; formal verification; global state
                 reachability analysis; Network protocols; Probability;
                 probability-based partial verification; protocols; SDL;
                 Software engineering; specification languages;
                 state-transition-specified protocols",
  treatment =    "P Practical",
}

@Article{Kloks:1995:CPE,
  author =       "T. Kloks and D. Kratsch",
  title =        "Computing a perfect edge without vertex elimination
                 ordering of a chordal bipartite graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "11--16",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q20 68R10)",
  MRnumber =     "96d:05102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Eindhoven Univ of Technology",
  affiliationaddress = "Eindhoven, Neth",
  classification = "723.2; 921.4; C1160 (Combinatorial mathematics);
                 C4260 (Computational geometry)",
  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 =     "bipartite adjacency matrix; chordal bipartite graph;
                 Chordial bipartite graphs; Computational geometry;
                 computational geometry; Data processing; doubly lexical
                 ordering; Graph theory; graph theory; Mathematical
                 techniques; maximal complete bipartite subgraphs;
                 perfect edge; Topology; Vertex elimination ordering;
                 vertex elimination ordering",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hong:1995:PAD,
  author =       "Dawei Hong and Joseph Y.-T. Leung",
  title =        "Probabilistic analysis of $k$-dimensional packing
                 algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "17--24",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (52B55)",
  MRnumber =     "96f:68061",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nebraska-Lincoln",
  affiliationaddress = "Lincoln, NE, USA",
  classification = "723.2; 921; 922; C1140Z (Other topics in
                 statistics); C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; average-case behavior; computational
                 complexity; computational geometry; Data processing;
                 k-dimensional packing; k-dimensional packing
                 algorithms; Mathematical techniques; moment generating
                 function; NP-hard; optimal algorithm; probabilistic
                 analysis; Probability; probability; Statistical
                 methods; Topology; unbounded length; unit length",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Barsi:1995:AFP,
  author =       "Ferrucio Barsi and M. Cristina Perotti",
  title =        "Addendum to ``{A} fully parallel algorithm for residue
                 to binary conversion'' {[Inform. Process. Lett. {\bf
                 50}(1), 8 April 1994, pp. 1--8]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "25--26",
  day =          "7",
  month =        jul,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Barsi:1994:FPA}. See also erratum
                 \cite{Barsi:1995:EAF}.",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dipartimento di Matematica, Perugia Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "fully parallel algorithm; parallel algorithms; residue
                 system parameters; residue to binary conversion; VLSI
                 AT/sup 2/ lower bound; VLSI designs",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mahajan:1995:NMG,
  author =       "Meena Mahajan and N. V. Vinodchandran",
  title =        "A note on {Mod} and generalised {Mod} classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "27--31",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96h:68076",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "The Inst of Mathematical Sciences",
  affiliationaddress = "Madras, India",
  classification = "721.1; 723.2; 921; C4240C (Computational
                 complexity)",
  corpsource =   "Inst. of Math. Sci., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "co-primality; Computation theory; Computational
                 complexity; computational complexity; Data processing;
                 gcd testing; generalised Mod classes; intersection
                 classes; Mathematical techniques; membership; Mod; Mod
                 classes; Programming theory; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vogler:1995:FPO,
  author =       "Walter Vogler",
  title =        "Fairness and partial order semantics",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "33--39",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "96d:68143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitat Augsburg",
  affiliationaddress = "Augsburg, Ger",
  classification = "723.3; 921.4; C1160 (Combinatorial mathematics);
                 C4210L (Formal languages and computational
                 linguistics); C6150N (Distributed systems software)",
  corpsource =   "Inst. f{\"u}r Math., Augsburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "causality-based partial order semantics; computational
                 linguistics; Concurrency control; Database systems;
                 interval semiwords; parallel processing; Partial order
                 semantics; partial order semantics; partial words;
                 Petri nets; Programming theory; Theorem proving; weak
                 fairness",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Datta:1995:AAB,
  author =       "Alak K. Datta and Ranjan K. Sen",
  title =        "{1-Approximation} algorithm for bottleneck disjoint
                 path matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "41--44",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C70 (05C85 68R10)",
  MRnumber =     "96h:05149",
  MRreviewer =   "Olivia M. Carducci",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bengal Engineering Coll",
  affiliationaddress = "Shibpur, India",
  classification = "723.2; 723.4; 921.4; C1160 (Combinatorial
                 mathematics); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci. and Technol., Bengal Eng. Coll.,
                 Shibpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximation theory; bottleneck disjoint
                 path matching; computational complexity; Computational
                 geometry; Data processing; graph theory; Graph theory;
                 Mathematical techniques; Path matching; polynomial time
                 l-approximation algorithm; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1995:FRS,
  author =       "Hung-Yu Lin and Lein Harn",
  title =        "Fair reconstruction of a secret",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "45--47",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Missouri-Kansas City",
  affiliationaddress = "Kansas City, MO, USA",
  classification = "721.1; 723.2; B6120B (Codes); C4240C (Computational
                 complexity); C6130S (Data security)",
  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 =     "cheating problem; Computation theory; computational
                 complexity; Computational complexity; cryptography;
                 Data processing; dishonest participant; fake shadow;
                 honest participants; Programming theory; protocols;
                 secret reconstruction protocol; Secret sharing; secret
                 sharing policy; secret sharing scheme; shadows;
                 Threshold logic; unconditionally secure protocol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chedid:1995:GTC,
  author =       "Fouad B. Chedid",
  title =        "On the generalized twisted cube",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "49--52",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "96i:68007",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Temple Univ Japan",
  affiliationaddress = "Tokyo, Jpn",
  classification = "722.4; 921.4; C1160 (Combinatorial mathematics);
                 C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Fac. of Comput. Sci., Temple Univ., Tokyo, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "complete binary tree; Computation theory;
                 Computational geometry; dilation 1 embedding;
                 generalized twisted cube; Graph theory; hypercube
                 networks; Hypercubes; hypercubes; Meshes of frees;
                 parallel computation; parallel processing; Parallel
                 processing systems; proof; subgraph; Topology; tree
                 mesh; Trees (mathematics); trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cull:1995:GTC,
  author =       "Paul Cull and Shawn M. Larson",
  title =        "On generalized twisted cubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "53--55",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oregon State Univ",
  affiliationaddress = "Corvallis, OR, USA",
  classification = "723.1; 723.2; C4230M (Multiprocessor
                 interconnection); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
                 OR, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Complete binary tree; Computation theory;
                 computational complexity; Computer architecture;
                 Computer programming; diameter; embedded networks;
                 generalized twisted cubes; hypercube networks;
                 Hypercubes; n-dimensional twisted cubes; Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Butler:1995:EVB,
  author =       "Greg Butler",
  title =        "Easy verification of behavioural subtyping in common
                 cases",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "1",
  pages =        "57--58",
  day =          "7",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Concordia Univ",
  affiliationaddress = "Montreal, Que, Can",
  classification = "721.1; 723.1; C4210L (Formal languages and
                 computational linguistics); C4240 (Programming and
                 algorithm theory); C6110F (Formal methods); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Concordia Univ., Montreal,
                 Que., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "behavioural subtyping; checks; common cases;
                 Computation theory; Computer program listings; easy
                 verification; Formal semantics; Program correctness;
                 program verification; Programming theory; Software
                 engineering; state biconnectivity; supertype object;
                 type theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Westbrook:1995:LBL,
  author =       "Jeffery Westbrook and Dicky Yan",
  title =        "Linear bounds for on-line {Steiner} problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "59--63",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q20 68Q25)",
  MRnumber =     "96e:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; directed graph; directed
                 graphs; linear bounds; linear upper bounds; lower
                 bounds; online generalized Steiner problem; online
                 Steiner problems; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hill:1995:LB,
  author =       "Steve Hill",
  title =        "The lazy $z$-buffer",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "65--70",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Kent",
  affiliationaddress = "Kent, Engl",
  classification = "721.1; 723.1; 723.2; 723.5; C6110 (Systems analysis
                 and programming); C6130B (Graphics techniques)",
  corpsource =   "Comput. Lab., Kent Univ., Canterbury, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Calculations; Computational methods;
                 Computer programming; functional languages; Functional
                 programming; functional programming; hidden feature
                 removal; hidden surface removal; Hybrid algorithm;
                 hybrid algorithm; Image processing; imperative
                 language; Lazy functional language; lazy functional
                 language; lazy z-buffer; Scan-line method; scan-line
                 method; scan-line methods; stereo image processing;
                 Three dimensional computer graphics; three-dimensional
                 computer graphics; Z-buffer; z-buffering",
  treatment =    "P Practical",
}

@Article{Swaminathan:1995:PCB,
  author =       "R. P. Swaminathan and D. Giriraj and D. K. Bhatia",
  title =        "The pagenumber of the class of bandwidth-$k$ graphs is
                 $k - 1$",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "71--74",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C78 68Q25)",
  MRnumber =     "96e:68100",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Cincinnati Univ., OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm analysis; bandwidth-k graphs; graph theory;
                 linear ordering; pagenumber; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alsuwaiyel:1995:FAM,
  author =       "Muhammad H. Alsuwaiyel and D. T. Lee",
  title =        "Finding an approximate minimum-link visibility path
                 inside a simple polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "75--79",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "96h:68199",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Inf. and Comput. Sci., King Fahd Univ. of
                 Pet. and Miner., Dhahran, Saudi Arabia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate minimum-link visibility path;
                 approximation algorithm; approximation theory; bound
                 guarantee; computational complexity; computational
                 geometry; constant performance ratio; minimum link
                 path; minimum-link watchman route; NP-complete;
                 NP-hard; optimal solution; performance ratio; polygonal
                 domains; polynomial-time approximation algorithm;
                 simple polygon",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1995:SRS,
  author =       "Jie Wang",
  title =        "Some results on selectivity and self-reducibility",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "81--87",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96f:68045",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Math. Sci., North Carolina A and T State
                 Univ., Greensboro, NC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "addition; arbitrary time complexity classes;
                 complexity classes; computational complexity;
                 multiplication; probabilistic selectivity; probability;
                 selectivity; self-reducibility; time bounds; Turing
                 machines; Turing self-reducibility",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Valois:1995:VWP,
  author =       "John D. Valois",
  title =        "A $3$-valued wakeup protocol",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "89--93",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rensselaer Polytechnic Inst",
  affiliationaddress = "Troy, NY, USA",
  classification = "722.1; 722.3; 722.4; 723.2; C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessing systems); C5640 (Protocols)",
  corpsource =   "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
                 Troy, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "3-valued shared variable; 3-valued wakeup protocol;
                 concurrency control; Consensus problem; consensus
                 problems; Data processing; Data storage equipment;
                 distributed algorithms; Distributed computer systems;
                 distributed computing; leader election problems; Leader
                 electron problem; Network protocols; Problem solving;
                 protocols; Seesaw protocol; Self-stabilization;
                 self-stabilization; Shared memory; shared memory
                 systems; Single 3-valued shared variable; three valued
                 wakeup protocol; Wakeup problem; wakeup problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Saab:1995:IIV,
  author =       "Youssef Saab",
  title =        "Iterative improvement of vertex covers",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "95--98",
  day =          "21",
  month =        jul,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Missouri Univ., Columbia, MO,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bipartite graphs; coloring function; computational
                 complexity; graph; graph colouring; heuristic
                 solutions; Independent Set problem; iterative
                 improvement; maximum matching algorithm; minimum
                 cardinality; NP-complete; Vertex Cover problem; vertex
                 covers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Corneil:1995:SLT,
  author =       "Derek G. Corneil and Hiryoung Kim and Sridhar
                 Natarajan and Stephan Olariu and Alan P. Sprague",
  title =        "Simple linear time recognition of unit interval
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "99--104",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q20)",
  MRnumber =     "96e:68097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto",
  affiliationaddress = "Toronto, Ont, Can",
  classification = "721.1; 723.5; 921.4; 921.6; C1160 (Combinatorial
                 mathematics)",
  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; Breadth-first search; breadth-first
                 search; Computation theory; Graph recognition; Graph
                 theory; graph theory; Interval graphs; Linear time
                 algorithm; linear time algorithm; Mathematical models;
                 Pattern recognition; Proper interval graphs; simple
                 linear time recognition; tree searching; unit interval
                 graph recognition; Unit interval graphs; unit interval
                 graphs; unit interval model; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dermouche:1995:FAS,
  author =       "A. Dermouche",
  title =        "A fast algorithm for string matching with mismatches",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "105--110",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q20 68U15)",
  MRnumber =     "1 344 788",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; alignments; errors; fast algorithm;
                 information retrieval; mismatches; numerical approach;
                 pattern matching; string matching; text searching; wild
                 cards",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huynh:1995:ICD,
  author =       "Tien Huynh and Kim Marriott",
  title =        "Incremental constraint deletion in systems of linear
                 constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "2",
  pages =        "111--115",
  day =          "21",
  month =        jul,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C08 (68Q20)",
  MRnumber =     "1 344 789",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240C (Computational
                 complexity)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm cost; arithmetic; computational complexity;
                 constraint theory; incremental constraint deletion;
                 linear algebra; linear arithmetic constraints; linear
                 constraint systems; linear equalities; linear
                 inequalities; redundant system; solved form",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singhal:1995:OPA,
  author =       "Mukesh Singhal and Friedemann Mattern",
  title =        "An optimality proof for asynchronous recovery
                 algorithms in distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "117--121",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15",
  MRnumber =     "1 351 883",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 723.2; 723.5; C6150J
                 (Operating systems); C6150N (Distributed systems
                 software)",
  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; asynchronous recovery; Asynchronous
                 recovery algorithms; Computation theory; Computer
                 networks; Computer simulation; Computer system
                 recovery; Consistent cut; consistent cut; Data
                 communication systems; Data processing; Distributed
                 computer systems; distributed processing; distributed
                 systems; Internal events; Message receive events;
                 Message send events; Optimality proof; optimality
                 proof; roll backs; system recovery",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jha:1995:SCD,
  author =       "Pranava K. Jha and Giora Slutzki",
  title =        "A scheme to construct distance-three codes using
                 {Latin} squares, with applications to the $n$-cube",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "123--127",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94B25 (94B65)",
  MRnumber =     "96k:94019",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Delhi Inst of Technology",
  affiliationaddress = "Delhi, India",
  classification = "716.1; 721.1; 723.1; 921.4; B6110 (Information
                 theory); B6120B (Codes); C1260 (Information theory)",
  corpsource =   "Dept. of Comput. Eng., Delhi Inst. of Technol.,
                 India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Codes (symbols); codewords; Combinatorial mathematics;
                 Distance three codes; distance-three codes; Domination
                 number; Graph theory; Hamming codes; Hamming distance;
                 Independent domination number; Information theory;
                 information theory; Latin squares; latin squares;
                 n-cube; partitions; Problem solving; Set theory;
                 Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Berard:1995:UTL,
  author =       "B{\'e}atrice B{\'e}rard",
  title =        "Untiming timed languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "129--135",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q10)",
  MRnumber =     "97f:68090",
  MRreviewer =   "C. Masalagiu",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "LIFAC",
  affiliationaddress = "Cachan, Fr",
  classification = "721.1; 722.4; 723.1; 723.5; 921.4; C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory)",
  corpsource =   "LIFAC, Cachan, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "automata; Automata theory; automata theory;
                 Computational linguistics; Computer programming
                 languages; Computer simulation; context-freeness;
                 finite transition systems; formal languages; Petri
                 nets; Real time systems; real-time systems; regularity;
                 Semantics; Set theory; specification; Timed languages;
                 timed languages; Timed transition systems;
                 verification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shi:1995:SBT,
  author =       "Hongchi Shi and Gerhard X. Ritter and Joseph N.
                 Wilson",
  title =        "Simulations between two reconfigurable mesh models",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "137--142",
  day =          "11",
  month =        aug,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture)",
  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/",
  keywords =     "equivalency; high-performance computing;
                 mesh-connected architectures; multiprocessor
                 interconnection networks; PARBS; reconfigurable
                 architectures; reconfigurable mesh; RMESH",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nikolik:1995:CPT,
  author =       "Borislav Nikolik",
  title =        "Constraint preservation through loops",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "143--148",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "96d:68150",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oregon",
  affiliationaddress = "Eugene, OR, USA",
  classification = "723.1; 723.1.1; 723.2; 723.5; C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Oregon Univ., Eugene,
                 OR, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "computability; Computer programming languages;
                 Computer software; Constraint preservation; Critical
                 path analysis; Dataflow; dataflow; declarative
                 statements; Def-clear path; integers; loops; Object
                 oriented programming; Program analysis; program
                 analysis; Program constraints; program constraints;
                 programming objects; programming theory; reals;
                 satisfiability; Software engineering; strings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Oellermann:1995:PAT,
  author =       "Ortrud Oellermann and Jeremy P. Spinrad",
  title =        "A polynomial algorithm for testing whether a graph is
                 $3${-Steiner} distance hereditary",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "149--154",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "96d:05104",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Brandon Univ., Man., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "3-Steiner distance hereditary; algorithm theory;
                 arbitrary graph; connected induced subgraph; graph
                 theory; hereditary; polynomial algorithm; Steiner
                 distance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chang:1995:NID,
  author =       "Ee-Chien Chang and Chee Yap",
  title =        "A note on improved deterministic time simulation of
                 nondeterministic space for small space",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "155--157",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96d:68064",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "amortization argument; computational complexity;
                 deterministic time simulation; nondeterministic space;
                 NSPACE; theory of computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kavraki:1995:PPA,
  author =       "Lydia E. Kavraki and Mihail N. Kolountzakis",
  title =        "Partitioning a planar assembly into two connected
                 parts is {NP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "159--165",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "96d:68210",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Robotics Lab., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "assembly partitioning; assembly planning;
                 computational complexity; computational geometry;
                 connectedness; decision problem; motion planning;
                 NP-complete; planar assembly",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gong:1995:CKH,
  author =       "Li Gong",
  title =        "Collisionful keyed hash functions with selectable
                 collisions",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "167--170",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20 (94A60)",
  MRnumber =     "1 351 890",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6130S (Data security)",
  corpsource =   "Comput. Sci. Lab., SRI Int., Menlo Park, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "collisionful; cryptography; guessing attack; hash
                 functions; key component; security of data; selectable
                 collisions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hower:1995:CSA,
  author =       "Walter Hower",
  title =        "Constraint satisfaction --- Algorithms and complexity
                 analysis",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "3",
  pages =        "171--178",
  day =          "11",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17 (03B70 68Q40 68T20)",
  MRnumber =     "97c:68035",
  MRreviewer =   "Zhenyu Qian",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Koblenz-Landau",
  affiliationaddress = "Koblenz, Ger",
  classification = "721.1; 723.1; 921.4; C1230 (Artificial
                 intelligence); C4240C (Computational complexity);
                 C6170K (Knowledge engineering techniques)",
  corpsource =   "Inst. f{\"u}r Inf., Koblenz-Landau Univ., Koblenz,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Algorithms analysis; binary constraints;
                 Combinatorial mathematics; complexity analysis;
                 Complexity analysis; computational complexity;
                 Computational complexity; Computational methods;
                 consistent constraint satisfaction; constraint
                 handling; Constraint satisfaction; constraint
                 satisfaction algorithms; Constraint theory; Global
                 consistency; Graph theory; higher-ary constraints;
                 inconsistent constraint satisfaction",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schuler:1995:SPS,
  author =       "Rainer Schuler",
  title =        "Some properties of sets tractable under every
                 polynomial-time computable distribution",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "179--184",
  day =          "25",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96f:68043",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Abteilung Theoretische Inf., Ulm Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "average case complexity; average polynomial-time;
                 computational complexity; NP; polynomial-time
                 computable input distribution; set theory; tally sets;
                 tractable sets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lam:1995:NCH,
  author =       "Nguyen Huong Lam",
  title =        "A note on codes having no finite completions",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "185--188",
  day =          "25",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94B60",
  MRnumber =     "96k:94024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Hanoi Inst. of Math., Viet Nam",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "citeBP book; codes; factorization technique; finite
                 maximal code; finitely incompletable codes; formal
                 language theory; formal languages; n-bayonet codes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blundo:1995:NDT,
  author =       "Carlo Blundo",
  title =        "A note on dynamic threshold schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "189--193",
  day =          "25",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "96f:94010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6110 (Information theory); B6120B (Codes); C1260
                 (Information theory); C6130S (Data security)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "broadcast messages; cryptography; dynamic threshold
                 schemes; information; information theory; lower bounds;
                 participants; secret distribution",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Keller:1995:NIC,
  author =       "J{\"o}rg Keller and Thomas Walle",
  title =        "A note on implementing combining networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "195--200",
  day =          "25",
  month =        aug,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5220P (Parallel architecture); C5440
                 (Multiprocessing systems)",
  corpsource =   "Fachbereich 14 Inf., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combining networks; concurrent access; Fluent Machine;
                 hardware; IBM RP3; memory location; modified routing
                 algorithm; network chips; network nodes; NYU
                 Ultracomputer; parallel architectures; shared memory
                 systems; shared-memory multiprocessors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Atkinson:1995:TVR,
  author =       "Simon Atkinson and David Scholefield",
  title =        "Transformational vs. reactive refinement in real-time
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "201--210",
  day =          "25",
  month =        aug,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110F (Formal methods); C6115 (Programming
                 support); C6140D (High level languages)",
  corpsource =   "Dept. of Comput. Sci., York Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "extended Z language; formal specification; reactive
                 refinement; real-time software development; real-time
                 systems; specification languages; TAM language;
                 Temporal Agent Model; transformational refinement;
                 translation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Thirusangu:1995:NCM,
  author =       "K. Thirusangu and K. Rangarajan",
  title =        "A note on the construction of marked graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "211--215",
  day =          "25",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q90",
  MRnumber =     "1 351 895",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Math., SIVET Coll., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; DEPREL algorithm; exact dependency
                 relations; finite automata; finite state automaton;
                 firing transition sequences; formal languages;
                 inductive inference; input; marked graph construction;
                 Petri nets; polynomial time; regular languages; running
                 time; sequences; trace language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Droubay:1995:PFW,
  author =       "Xavier Droubay",
  title =        "Palindromes in the {Fibonacci} word",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "217--221",
  day =          "25",
  month =        aug,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15",
  MRnumber =     "96h:68156",
  MRreviewer =   "Pascal Weil",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "LAMIFA, Univ. de Picardie, Amiens, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; Fibonacci word; formal
                 languages; palindromes; proofs; Sturmian words; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tan:1995:HTL,
  author =       "Xuehou Tan and Xiaoyu Song",
  title =        "Hexagonal three-layer channel routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "223--228",
  day =          "25",
  month =        aug,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1130B (Computer-aided circuit analysis and design);
                 B2570 (Semiconductor integrated circuits); C7410D
                 (Electronic engineering computing)",
  corpsource =   "Sch. of High-Technol. for Human Welfare, Tokai Univ.,
                 Numazu, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "channel routing; circuit layout CAD; hexagonal grid;
                 layout design; multiterminal channel routing; network
                 routing; routing algorithm; VLSI; VLSI chips",
  treatment =    "P Practical",
}

@Article{Park:1995:SAO,
  author =       "Young Park and Benjamin Goldberg",
  title =        "Static analysis for optimizing reference counting",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "4",
  pages =        "229--234",
  day =          "25",
  month =        aug,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "Sch. of Comput. Sci., Windsor Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data types; automatic storage reclaim;
                 compile-time analysis; distributed environments;
                 functional languages; heap-allocated object;
                 higher-order functional languages; inter-processor
                 message exchanges; multiprocessing systems;
                 multiprocessor environments; reference counting
                 optimisation; reference lifetimes; static analysis;
                 statically inferred information; storage management;
                 system monitoring; uniprocessor environments;
                 updatings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Akutsu:1995:ASM,
  author =       "Tatsuya Akutsu",
  title =        "Approximate string matching with don't care
                 characters",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "235--239",
  day =          "15",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20",
  MRnumber =     "96d:68079",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Gunma Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate string matching; don't care characters; k-
                 differences problem; pattern string; string matching;
                 text string",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ramachandran:1995:MCL,
  author =       "J. Ramachandran",
  title =        "Modulo classes and logarithmic advice",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "241--245",
  day =          "15",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96f:68042",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  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/",
  keywords =     "computational complexity; formal languages;
                 logarithmic advice; module classes; paddable languages;
                 self-reducible paddable sets",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Horng:1995:PAU,
  author =       "Gwoboa Horng",
  title =        "Password authentication without using a password
                 table",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "247--250",
  day =          "15",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6130S (Data security)",
  corpsource =   "Inst. of Inf. Sci., Nat. Chung-Hsing Univ., Taichung,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "authorisation; legal users; message authentication;
                 multiuser computing systems; password authentication;
                 polynomials",
  treatment =    "A Application; P Practical",
}

@Article{Tan:1995:WSM,
  author =       "Kian-Lee Tan and Hongjun Lu",
  title =        "Workload scheduling for multiple query processing",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "251--257",
  day =          "15",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160 (Database management
                 systems (DBMS))",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "heuristics; multiple query processing; query
                 processing; scheduling; workload scheduling",
  treatment =    "P Practical",
}

@Article{Chen:1995:SSP,
  author =       "Lin Chen",
  title =        "Solving the shortest-paths problem on bipartite
                 permutation graphs efficiently",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "259--264",
  day =          "15",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C38 05C85 68M10 68Q22)",
  MRnumber =     "96d:68162",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry)",
  corpsource =   "Fundamental Res. Lab., Los Angeles, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrary bipartite permutation graphs; bipartite
                 permutation graphs; computational geometry; CREW PRAM;
                 parallel algorithms; sequential algorithms;
                 shortest-paths problem; strongly ordered bipartite
                 graphs; time-optimal; work-optimal",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1995:RAD,
  author =       "Soojung Lee and Junguk L. Kim",
  title =        "Resolving all deadlocks in distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "265--271",
  day =          "15",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6150J (Operating systems)",
  corpsource =   "Commun. Syst. R and D Center, Samsung Electron. Co.,
                 Seoul, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "concurrency control; deadlock detection; distributed
                 algorithm; distributed algorithms; distributed systems;
                 wait-for graph",
  treatment =    "P Practical",
}

@Article{Chen:1995:SOD,
  author =       "Tung-Shou Chen",
  title =        "{{\em SIMPLE}}: {An} optimal disk system with two
                 restricted heads",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "273--277",
  day =          "15",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C4240C
                 (Computational complexity); C5320C (Storage on moving
                 magnetic media)",
  corpsource =   "Dept. of Inf. Manage., Nat. Chin-Yi Inst. of Technol.,
                 Taiwan, China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "amortized complexity; computational complexity;
                 cylinders; disk surface; magnetic disc storage; optimal
                 disk system; probability; probability models;
                 restricted heads; SIMPLE; two-headed disk systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leung:1995:SPD,
  author =       "H. Leung and D. Ranjan and H. J. Hern{\'a}ndez and D.
                 Tang and A. Gonz{\'a}lez",
  title =        "A simple proof on the decidability of equivalence
                 between recursive and nonrecursive {Datalog} programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "279--282",
  day =          "15",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 351 601",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C4250 (Database theory); C6160K
                 (Deductive databases)",
  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/",
  keywords =     "database enumeration; database theory; DATALOG;
                 Datalog program optimisation; decidability;
                 decidability proof; deductive databases; equivalence;
                 nonrecursive Datalog programs; programming theory;
                 recursive Datalog programs; recursive functions;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Park:1995:UPR,
  author =       "Ung Kyu Park and Hwang Kyu Choi and Tag Gon Kim",
  title =        "Uniform partitioning of relations using histogram
                 equalization framework: {An} efficient parallel
                 hash-based join",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "283--289",
  day =          "15",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation); C6160D (Relational
                 databases)",
  corpsource =   "Dept. of Electr. Eng., Korea Adv. Energy Res. Inst.,
                 Daejeon, South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bucket overflow; data distribution framework; data
                 skew; file organisation; histogram equalization
                 framework; load imbalance; parallel algorithms;
                 parallel hash-based join; parallel join algorithm;
                 relational databases; relations; synthetic databases;
                 uniform partitioning",
  treatment =    "P Practical",
}

@Article{Boztas:1995:RMP,
  author =       "Serdar Bozta{\c{s}}",
  title =        "A robust multi-priority topology-independent
                 transmission schedule for packet radio networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "5",
  pages =        "291--295",
  day =          "15",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 B6250 (Radio links and equipment); C4130 (Interpolation
                 and function approximation); C5620 (Computer networks
                 and techniques)",
  corpsource =   "Centre for Telecomm. and Inf. Eng., Monash Univ.,
                 Clayton, Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "packet radio networks; polynomials; proper robust
                 scheduling; robust multi-priority topology-independent
                 transmission schedule; scheduling",
  treatment =    "P Practical",
}

@Article{Farach:1995:AMT,
  author =       "Martin Farach and Teresa M. Przytycka and Mikkel
                 Thorup",
  title =        "On the agreement of many trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "297--301",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25 92B10 92D15)",
  MRnumber =     "96g:68040",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "biology; clustering; computational complexity;
                 evolution; evolution (biological); Maximum Agreement
                 Subtree; rooted leaf labeled trees; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1995:FEN,
  author =       "Zhi-Zhong Chen",
  title =        "A fast and efficient {NC} algorithm for maximal
                 matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "303--307",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C70 05C85 68Q25 68R10)",
  MRnumber =     "96f:68055",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Math. Sci., Tokyo Denki Univ., Saitama,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; EREW PRAM; graph theory;
                 maximal independent sets; maximal matching; NC; NC
                 algorithm; parallel algorithms; RNC; running time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nievergelt:1995:MGE,
  author =       "J. Nievergelt and Narsingh Deo",
  title =        "Metric graphs elastically embeddable in the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "309--315",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52C25 (05C10 68U05)",
  MRnumber =     "96j:52039",
  MRreviewer =   "B{\'e}la Uhrin",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Eidgenossische Tech. Hochschule, Zurich, Switzerland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "chordal biconnected graph; combinatorial problems;
                 computational complexity; computational geometry;
                 distance geometry; elastically embeddable; Euclidean
                 distance; weighted graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dasgupta:1995:UPP,
  author =       "Pallab Dasgupta and P. P. Chakrabarti and S. C. {De
                 Sarkar}",
  title =        "Utility of pathmax in partial order heuristic search",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "317--322",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T20",
  MRnumber =     "96g:68119",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1230 (Artificial
                 intelligence); C4240C (Computational complexity)",
  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/",
  keywords =     "algorithm theory; artificial intelligence;
                 computational complexity; heuristic search;
                 multiobjective optimization; partial order heuristic
                 search; partial order search; pathmax; search problems;
                 tree search",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vasconcelos:1995:UKI,
  author =       "Vasco Thudichum Vasconcelos",
  title =        "Unification of kinded infinite trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "323--328",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (68Q55)",
  MRnumber =     "96e:68074",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Keio Univ., Yokohama, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; infinite trees; kindings; mappings;
                 regular trees; tree data structures; unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Broder:1995:BAT,
  author =       "Andrei Z. Broder and Alan Frieze and Carsten Lund and
                 Steven Phillips and Nick Reingold",
  title =        "Balanced allocations for tree-like inputs",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "329--332",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R05)",
  MRnumber =     "96d:68090",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Digital Syst. Res. Center, Palo Alto, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; analysis of algorithms; balanced
                 allocations; combinatorial problems; directed tree;
                 insertion order; on-line load balancing; resource
                 allocation; theory of computation; tree data
                 structures; tree-like inputs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liang:1995:FPA,
  author =       "Weifa Liang",
  title =        "Fast parallel algorithms for the approximate
                 edge-coloring problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "333--338",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C15 68Q22 68R10)",
  MRnumber =     "96f:05179",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 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/",
  keywords =     "computational model; CREW PRAM; edge-coloring; graph
                 colouring; maximum vertex degree; parallel algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nayak:1995:NIC,
  author =       "Amiya Nayak and Vincenzo Accia and Paolo Gissi",
  title =        "A note on isomorphic chordal rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "339--341",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "96d:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Nayak:1996:ENI}.",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "chordal ring; fault tolerant computing; isomorphic;
                 isomorphic chordal rings; longest link; multiprocessor
                 interconnection networks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Park:1995:ODA,
  author =       "Young G. Park and Benjamin Goldberg",
  title =        "Order-of-demand analysis for lazy languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "343--348",
  day =          "29",
  month =        sep,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "Sch. of Comput. Sci., Windsor Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; computational complexity;
                 evaluation-order; evaluation-status; formal languages;
                 functional languages; lazy functional language; lazy
                 languages; order-of-demand analysis;
                 polymorphically-typed; strictness; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pitsch:1995:CCF,
  author =       "Gisela Pitsch",
  title =        "{${\rm LR}(k)$}-coupled-context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "55",
  number =       "6",
  pages =        "349--358",
  day =          "29",
  month =        sep,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q50 (68Q45 68Q52 68S05)",
  MRnumber =     "96d:68131",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6180N (Natural language processing)",
  corpsource =   "Fachbereich Inf., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "context-free grammars; context-free prototype;
                 coupled-context-free grammars; formal languages; LR(k);
                 natural language; natural languages; nonterminals;
                 parsing; Tree Adjoining Grammars; Valid Prefix
                 Property",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Thomas:1995:GCS,
  author =       "Stephen Thomas",
  title =        "Garbage collection in shared-environment closure
                 reducers: Space-efficient depth first copying using a
                 tailored approach",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "1--7",
  day =          "13",
  month =        oct,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Nottingham Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data types; abstract machines;
                 already-scavenged space reuse; auxiliary stack; garbage
                 collection; heap; live data; OP-TIM; PG-TIM; potential
                 maximum size; program compilers; recursive copying
                 collector; shared memory systems; shared-environment
                 closure reducers; space-efficient depth first copying;
                 storage management; tailored approach",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Estivill-Castro:1995:IPV,
  author =       "Vladimir Estivill-Castro and Joseph O'Rourke and Jorge
                 Urrutia and Dianna Xu",
  title =        "Illumination of polygons with vertex lights",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "9--13",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "96g:68138",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry)",
  corpsource =   "Lab. Nacional de Inf. Avanzada, Veracruz, Mexico",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; illumination; polygons with
                 vertex lights; vertex floodlights",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bertoni:1995:ELE,
  author =       "Alberto Bertoni and Nicol{\`o} Cesa-Bianchi and Guido
                 Fiorino",
  title =        "Efficient learning with equivalence queries of
                 conjunctions of modulo functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "15--17",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05",
  MRnumber =     "96g:68102",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6180N (Natural language processing)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bounded adversarial noise; computational linguistics;
                 conjunctions of module functions; input variables;
                 learning with equivalence queries; polynomial time
                 algorithm; query processing; weighted sum",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Greenwood:1995:EME,
  author =       "Garrison W. Greenwood",
  title =        "On the equity of mutual exclusion algorithms in
                 distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "19--22",
  day =          "13",
  month =        oct,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6210L (Computer communications); C5620 (Computer
                 networks and techniques); C5620L (Local area networks);
                 C5640 (Protocols)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Western Michigan
                 Univ., Kalamazoo, MI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "counters; distributed computation; distributed
                 processing; distributed systems; timestamps; token
                 networks; token-based mutual exclusion algorithms",
  treatment =    "P Practical",
}

@Article{Parberry:1995:RTA,
  author =       "Ian Parberry",
  title =        "A real-time algorithm for the $(n^2-1)$-puzzle",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "23--28",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20",
  MRnumber =     "96g:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., North Texas Univ., Denton, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; divide and conquer methods;
                 divide-and-conquer techniques; greedy algorithm; random
                 configurations; real-time algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gu:1995:NNC,
  author =       "Qian Ping Gu and Shietung Peng",
  title =        "Node-to-node cluster fault tolerant routing in star
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "29--35",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15",
  MRnumber =     "1 361 255",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Software, Aizu Univ., Fukushima,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; computational complexity; fault free paths;
                 fault tolerant computing; fault-free path optimal
                 length; interconnection networks; multiprocessor
                 interconnection networks; network routing; node-to-node
                 cluster fault tolerant routing; star graphs; tolerable
                 set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Saxena:1995:PAC,
  author =       "Sanjeev Saxena and N. Malahal Rao",
  title =        "Parallel algorithms for connectivity problems on
                 interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "37--44",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C40 05C85 68Q22 68Q25)",
  MRnumber =     "96h:68152",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., Kanpur, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "biconnected components; COMMON CRCW PRAM;
                 computational complexity; connected components;
                 connectivity problems; disconnecting sets; end-points;
                 graph theory; interval graphs; K-connectivity; linear
                 work; O(log log n) time parallel algorithms; parallel
                 algorithms; randomisation; TOLERANT CRCW PRAM; tree
                 machine",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mitchell:1995:CCP,
  author =       "Joseph S. B. Mitchell and G{\"u}nter Rote and
                 Gopalakrishnan Sundaram and Gerhard Woeginger",
  title =        "Counting convex polygons in planar point sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "45--49",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55 68Q25)",
  MRnumber =     "96h:68212",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Appl. Math. and Stat., State Univ. of New
                 York, Stony Brook, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; computation time; computational complexity;
                 computational geometry; convex k-gons; convex polygon
                 counting; empty convex polygons; planar point sets;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Leung:1995:TBH,
  author =       "Joseph Y.-T.-T. Leung and W.-D.-D. Wei",
  title =        "Tighter bounds on a heuristic for a partition
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "51--57",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M07)",
  MRnumber =     "97a:68083",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240C
                 (Computational complexity); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; computational complexity; discrete
                 minimization problem; heuristic bounds; minimisation;
                 partition problem; positive real numbers; storage
                 allocation; worst-case performance bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hagerup:1995:PCI,
  author =       "Torben Hagerup",
  title =        "The parallel complexity of integer prefix summation",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "59--64",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68M07 68Q25)",
  MRnumber =     "96h:68086",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Max-Planck-Inst. f{\"u}r Inf., Saarbrucken, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; integer prefix summation; p-
                 processor CRCW PRAM; parallel algorithms; parallel
                 complexity; time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Petreschi:1995:ERS,
  author =       "Rossella Petreschi and Andrea Sterbini",
  title =        "Erratum: {``Recognizing strict $2$-threshold graphs in
                 {$O(m)$} time''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "1",
  pages =        "65--65",
  day =          "13",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68R10)",
  MRnumber =     "96i:68034b",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Petreschi:1995:RSR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Krumke:1995:GCP,
  author =       "S. O. Krumke",
  title =        "On a generalization of the {$p$-Center Problem}",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "67--71",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B80",
  MRnumber =     "96j:90046",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Wurzburg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "4-approximation problem; alpha-Neighbor p-Center
                 problem; approximation theory; complete edge-weighted
                 network; computational complexity; nearest neighbors;
                 NP-hard; p-Center problem generalisation; polynomial
                 time approximation algorithm; polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cusick:1995:CPK,
  author =       "Thomas W. Cusick",
  title =        "Cryptanalysis of a public key system based on
                 {Diophantine} equations",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "73--75",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 359 168",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130S (Data security)",
  corpsource =   "Dept. of Math., State Univ. of New York, Buffalo, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cipher system; ciphertext; cryptanalysis; Diophantine
                 equations; explicit bound; linear congruences; public
                 key cryptography; public key system; security",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chakraborty:1995:SDS,
  author =       "Uday Kumar Chakraborty",
  title =        "A simpler derivation of schema hazard in genetic
                 algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "77--78",
  day =          "27",
  month =        oct,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Jadavpur Univ.,
                 Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; genetic algorithms; multinomial
                 distribution; multiple Poisson distribution; schema
                 hazard",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Broder:1995:WCR,
  author =       "Andrei Z. Broder and Martin E. Dyer and Alan M. Frieze
                 and Prabhakar Raghavan and Eli Upfal",
  title =        "The worst-case running time of the random simplex
                 algorithm is exponential in the height",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "79--81",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C05 (68Q25)",
  MRnumber =     "1 359 169",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory); C4240C (Computational
                 complexity)",
  corpsource =   "Digital Systems Res. Center, Palo Alto, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; linear programming;
                 polytope; random simplex algorithm; randomised
                 algorithms; randomized algorithm; simplex algorithm;
                 worst-case running time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1995:PAC,
  author =       "Yue Li Wang and Hon Chan Chen and Chen Yu Lee",
  title =        "An {$O(\log n)$} parallel algorithm for constructing a
                 spanning tree on permutation graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "83--87",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "1 359 170",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Nat. Taiwan Inst. of Technol., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "connected subgraph; EREW PRAM; graph theory; O(log n);
                 parallel algorithm; parallel algorithms; permutation
                 graphs; spanning tree; unweighted permutation graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lawler:1995:AUG,
  author =       "Eugene L. Lawler and Sergei Sarkissian",
  title =        "An algorithm for ``{Ulam's Game}'' and its application
                 to error correcting codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "89--93",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94B60 (90D46)",
  MRnumber =     "96g:94024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B6120B (Codes); C1140E (Game
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., California
                 Univ., Berkeley, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; error correcting codes; error
                 correction codes; game theory; near-optimal algorithm;
                 Ulam's Game; winning strategies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Devroye:1995:NHS,
  author =       "Luc Devroye and Paul Kruszewski",
  title =        "A note on the {Horton--Strahler} number for random
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "95--99",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "96f:68082",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; equiprobable binary trees;
                 Horton--Strahler number; probabilistic proof; random
                 trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liang:1995:SSC,
  author =       "Y. Daniel Liang",
  title =        "{Steiner} set and connected domination in trapezoid
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "101--108",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "96f:68085",
  bibdate =      "Thu Oct 12 07:17:36 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., Fort Wayne, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; breadth-first search; computational
                 complexity; connected domination; graph theory;
                 interval graphs; permutation graphs; Steiner set;
                 trapezoid graph; trapezoid graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arvind:1995:RSA,
  author =       "V. Arvind and J. K{\"o}bler and M. Mundhenk",
  title =        "On reductions to sets that avoid {EXPSPACE}",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "109--114",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q30)",
  MRnumber =     "96k:68064",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Inst. of Math. Sci., CIT Campus, Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; EXPSPACE;
                 EXPSPACE-avoiding; high information density;
                 range-constructibility; reducibility; set theory;
                 sparse set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aspvall:1995:MET,
  author =       "Bengt Aspvall",
  title =        "Minimizing elimination tree height can increase fill
                 more than linearly",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "115--120",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "15A06 (05C50)",
  MRnumber =     "96f:15004",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4140 (Linear
                 algebra); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Inf., Bergen Univ., Norway",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "chordal completion; chordal graphs; elimination tree;
                 elimination tree height; fill; graphs; minimum height;
                 parallel algorithms; parallel processing; sparse
                 matrices; sparse matrix; trees (mathematics); vertex
                 elimination",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barsi:1995:EAF,
  author =       "F. Barsi and M. C. Pinotti",
  title =        "Erratum: Addendum to ``{A} fully parallel algorithm
                 for residue to binary conversion'' {[Inform. Process.
                 Lett. {\bf 50}(1), 8 April 1994, pp. 1--8]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "2",
  pages =        "121--121",
  day =          "27",
  month =        oct,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat May 11 07:15:23 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Barsi:1994:FPA,Barsi:1995:AFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Prodinger:1995:MQH,
  author =       "Helmut Prodinger",
  title =        "{Multiple Quickselect} --- {Hoare}'s {Find} algorithm
                 for several elements",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "123--129",
  day =          "10",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10",
  MRnumber =     "96h:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.
                 Wien, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "average comparisons; average passes; corollaries; find
                 algorithm; multiple Quickselect; order statistics;
                 search problems; specified order statistics;
                 statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lowe:1995:ANS,
  author =       "Gavin Lowe",
  title =        "An attack on the {Needham--Schroeder} public-key
                 authentication protocol",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "131--133",
  day =          "10",
  month =        nov,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5640 (Protocols); C6130S (Data security); C6150N
                 (Distributed systems software); C6155 (Computer
                 communications software)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "access protocols; agent impersonation; attack;
                 authorisation; computer hacking; impersonate; intruder;
                 Needham--Schroeder public-key authentication protocol;
                 public key cryptography",
  treatment =    "P Practical",
}

@Article{Albers:1995:CBT,
  author =       "Susanne Albers and Bernhard von Stengel and Ralph
                 Werchner",
  title =        "A combined {BIT} and {TIMESTAMP} algorithm for the
                 list update problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "135--139",
  day =          "10",
  month =        nov,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6130 (Data
                 handling techniques)C6130D (Document processing
                 techniques)",
  corpsource =   "Int. Comput. Sci. Inst., Berkeley, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; BIT; combined algorithm; competitive
                 factor; initial random choice; list processing; list
                 update problem; merging; randomized on-line algorithm;
                 sorting; sorting problem; TIMESTAMP; updating;
                 worst-case request sequence",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Volpano:1995:TSP,
  author =       "Dennis Volpano and Geoffrey Smith",
  title =        "A type soundness proof for variables in {LCF ML}",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "141--146",
  day =          "10",
  month =        nov,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110F (Formal methods)",
  corpsource =   "Dept. of Comput. Sci., Naval Postgraduate Sch.,
                 Monterey, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "assignment; computational linguistics; formal
                 languages; formal logic; formal semantics; formal
                 verification; language; LCF ML; polymorphic type
                 system; program verification; type soundness proof;
                 type theory; typing variable; variables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jukna:1995:CTF,
  author =       "Stasys Jukna",
  title =        "Computing threshold functions by depth-$3$ threshold
                 circuits with smaller thresholds of their gates",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "147--150",
  day =          "10",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25 94C10)",
  MRnumber =     "96i:68029",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Trier Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; depth-3 threshold circuits;
                 threshold circuits; threshold functions; threshold
                 logic; unbounded fanin threshold circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Clark:1995:SRP,
  author =       "John Clark and Jeremy Jacob",
  title =        "On the security of recent protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "151--155",
  day =          "10",
  month =        nov,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5640 (Protocols); C6130S (Data security)",
  corpsource =   "Dept. of Comput. Sci., York Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "authentication protocol; cryptography; decryption;
                 distributed systems; encryption; encryption mechanism;
                 protocols; security; security in digital systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Devillers:1995:IAF,
  author =       "Olivier Devillers and Mordecai J. Golin",
  title =        "Incremental algorithms for finding the convex hulls of
                 circles and the lower envelopes of parabolas",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "157--164",
  day =          "10",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "96h:68204",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "INRIA, Sophia-Antipolis, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circles; computational complexity; computational
                 geometry; convex hulls; divide-and-conquer; incremental
                 algorithms; lower envelopes; parabolas",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Srinivasan:1995:EDB,
  author =       "Anand Srinivasan and K. Madhukar and P. Nagavamsi and
                 C. Pandu Rangan and Maw-Shang Chang",
  title =        "Edge domination on bipartite permutation graphs and
                 cotriangulated graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "165--171",
  day =          "10",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "96g:05132",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci. and Eng., IIT, Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bipartite permutation graphs; computational
                 complexity; cotriangulated graphs; edge dominating set;
                 graph theory; polynomial time algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tomkins:1995:LBT,
  author =       "Andrew Tomkins",
  title =        "Lower bounds for two call control problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "173--178",
  day =          "10",
  month =        nov,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6210 (Telecommunication applications); C4240C
                 (Computational complexity); C6150N (Distributed systems
                 software)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "call control problems; computational complexity;
                 infinite-duration calls; scheduling; telecommunication
                 networks; two call control",
  treatment =    "T Theoretical or Mathematical",
}

@Article{HerreradeFigueiredo:1995:LTA,
  author =       "Celina M. {Herrera de Figueiredo} and Jo{\~a}o
                 Meidanis and C{\'e}lia {Picinin de Mello}",
  title =        "A linear-time algorithm for proper interval graph
                 recognition",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "179--184",
  day =          "10",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "96g:05129",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Inst. de Matematica, Univ. Federal do Rio de Janeiro,
                 Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; clique partition; computational
                 complexity; graph recognition; graph theory;
                 lexicographic breadth-first search; linear-time
                 algorithm; proper interval graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rubinstein:1995:SMF,
  author =       "Roy S. Rubinstein and John N. Shutt",
  title =        "Self-modifying finite automata: {An} introduction",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "185--190",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05 (68Q70)",
  MRnumber =     "96i:68023",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci., Worcester Polytech. Inst., MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "context-free languages; finite automata; metalinear
                 languages; self-modifying finite automata; standard
                 finite automaton",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Codenotti:1995:ATC,
  author =       "Bruno Codenotti and Giovanni Manzini and Luciano
                 Margara",
  title =        "Algebraic techniques in communication complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "191--195",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q10)",
  MRnumber =     "96i:68038",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Istituto di Matematica Comput., CNR, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algebraic interpretation; algebraic techniques;
                 communication complexity; computational complexity;
                 matrices; tensor products",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pin:1995:NAQ,
  author =       "Jean-Eric Pin",
  title =        "A negative answer to a question of {Wilke} on
                 varieties of $\omega$-languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "197--200",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q70)",
  MRnumber =     "96k:68117",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Paris VI Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean combinations; formal languages;
                 omega-languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sempere:1995:MPN,
  author =       "Jose M. Sempere and Dami{\'a}n L{\'o}pez",
  title =        "A {McCulloch-Pitts} neural net to characterize even
                 linear languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "201--208",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68T05)",
  MRnumber =     "96i:68048",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230D (Neural nets); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Dept. de Sistemas Inf. y Comput., Univ. Politecnica de
                 Valencia, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "equivalence; even linear languages; formal languages;
                 language class; McCulloch-Pitts neural net; net
                 topology; neural nets",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Libkin:1995:RQI,
  author =       "Leonid Libkin and Limsoon Wong",
  title =        "On representation and querying incomplete information
                 in databases with bags",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "209--214",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68P10 68P20)",
  MRnumber =     "96h:68046",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C6140D (High
                 level languages); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; database
                 management systems; databases with bags; incomplete
                 information querying; nested relations; orderings;
                 query languages; relational algebra",
  treatment =    "P Practical",
}

@Article{Liang:1995:CCB,
  author =       "Y. Daniel Liang and Norbert Blum",
  title =        "Circular convex bipartite graphs: maximum matching and
                 {Hamiltonian} circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "215--219",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C70 (05C45 05C85 68Q20 68R10)",
  MRnumber =     "96f:05145",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Indiana Univ., Fort Wayne, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "circular convex bipartite graphs; computational
                 geometry; graph theory; Hamiltonian circuits; linear
                 time algorithms; maximum matching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Utard:1995:DFA,
  author =       "Gil Utard and Ga{\'e}tan Hains",
  title =        "Deadlock-free absorption of barrier synchronisations",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "221--227",
  day =          "24",
  month =        nov,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory); C5440 (Multiprocessing systems);
                 C6110F (Formal methods); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  corpsource =   "Lab. LIP-IMAG, Ecole Normale Sup{\'e}rieure de Lyon,
                 France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "barrier synchronisations; data-parallel languages;
                 deadlock-free absorption; distributed memory systems;
                 global termination; MIMD shared memory architectures;
                 optimisation; program verification; source program;
                 synchronisation; waiting loop; while loops",
  treatment =    "P Practical",
}

@Article{Mereghetti:1995:RMS,
  author =       "Carlo Mereghetti and Giovanni Pighizzini",
  title =        "A remark on middle space bounded alternating {Turing}
                 machines",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "229--232",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05",
  MRnumber =     "96i:68022",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrary alphabets; computational complexity; formal
                 languages; lower bound; middle space bounded
                 alternating Turing machines; nonregular tally
                 languages; tight log n lower bound; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Damaschke:1995:PAN,
  author =       "Peter Damaschke",
  title =        "A parallel algorithm for nearly optimal edge search",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "4",
  pages =        "233--236",
  day =          "24",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q22 68R10)",
  MRnumber =     "96g:05128",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Fern Univ., Hagen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; induced subgraph; nearly
                 optimal edge search; nearly optimal group testing
                 strategy; parallel algorithm; parallel algorithms;
                 parallel construction; search problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yen:1995:NFC,
  author =       "Hsu-Chun Yen",
  title =        "A note on fine covers and iterable factors of {VAS}
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "237--243",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q90)",
  MRnumber =     "97b:68117",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4220 (Automata
                 theory); C4240 (Programming and algorithm theory);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; concurrent system;
                 context-sensitive; EXPSPACE-complete; fine covers;
                 finite automata; formalism; good approximation;
                 irregular language; iterable factor; Karp-Miller
                 coverability graph analysis; model; Petri net; Petri
                 nets; programming languages; programming theory; set of
                 all executable sequences; VAS language; vector addition
                 system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Uehara:1995:ESB,
  author =       "Ryuhei Uehara",
  title =        "Efficient simulations by a biased coin",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "245--248",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05 (68Q10 68Q75)",
  MRnumber =     "96m:68046",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C1220
                 (Simulation, modelling and identification); C4220
                 (Automata theory); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Centre for Inf. Sci., Tokyo Woman's Christian Univ.,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; biased coin; computer theory;
                 cryptographic protocol; efficient simulation;
                 irrationality; probabilistic Turing machine; program
                 verification; programming theory; randomised
                 algorithms; randomized algorithm; randomizing
                 algorithm; simulation; stochastic simulation; Turing
                 machine; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Youssef:1995:RBB,
  author =       "A. M. Youssef and S. E. Tavares",
  title =        "Resistance of balanced $s$-boxes to linear and
                 differential cryptanalysis",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "249--252",
  day =          "8",
  month =        dec,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); B6120B (Codes);
                 C1140 (Probability and statistics); C6130S (Data
                 security)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "balanced s-box resistance; cryptography; differential
                 cryptanalysis; good s-boxes; immunity; input variables;
                 linear approximation table entries; linear
                 cryptanalysis; regular substitution boxes; statistical
                 analysis; XOR distribution table marginal density",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yao:1995:NNS,
  author =       "Xin Yao",
  title =        "A note on neural sorting networks with {$O(1)$} time
                 complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "253--254",
  day =          "8",
  month =        dec,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230D (Neural
                 nets); C4240C (Computational complexity); C5290 (Neural
                 computing techniques); C6130 (Data handling
                 techniques)",
  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/",
  keywords =     "computational complexity; Hopfield model; neural nets;
                 neural sorting networks; number sorting; O(1) time
                 complexity; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1995:BSM,
  author =       "Bo-Ting Yang",
  title =        "A better subgraph of the minimum weight
                 triangulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "255--258",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (05C10)",
  MRnumber =     "96j:68178",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Fac. of Sci., Xi'an Jiaotong Univ., China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; csc(2 pi /7)-skeleton; graph
                 theory; minimum weight triangulation; plane points;
                 subgraph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chiang:1995:SGG,
  author =       "Wei-Kuo Chiang and Rong-Jaye Chen",
  title =        "The $(n,k)$-star graph: {A} generalized star graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "259--264",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C75 68M10)",
  MRnumber =     "97b:68168",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "(n,k)-star graph; fault tolerant computing;
                 generalized star graph; graph theory; hierarchical
                 structure; maximal fault tolerance; multiprocessor
                 interconnection networks; network routing; node
                 symmetry; nodes; simple shortest routing; topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vilar:1995:ROA,
  author =       "Juan Miguel Vilar",
  title =        "Reducing the overhead of the {AESA} metric-space
                 nearest neighbour searching algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "265--271",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "96g:68143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4240 (Programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Dept. de Sistemas Inf. y Comput., Univ. Politecnica de
                 Valencia, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; approximating and eliminating search
                 algorithm; approximation theory; computational
                 geometry; distance computations; expected overall cost;
                 metric-space nearest neighbour searching algorithm;
                 pattern recognition; reduced overhead approximating and
                 eliminating search algorithm; search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bokka:1995:TVO,
  author =       "V. Bokka and H. Gurla and S. Olariu and J. L.
                 Schwing",
  title =        "Time- and {VLSI}-optimal convex hull computation on
                 meshes with multiple broadcasting",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "273--280",
  day =          "8",
  month =        dec,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm design; algorithm theory; computational
                 geometry; computer architecture; finite element model;
                 general-case; mesh; multiple broadcasting; numerical
                 analysis; parallel algorithm; parallel algorithms;
                 parallel programming; time optimal convex hull
                 computation; VLSI optimal convex hull computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chakraborty:1995:BPM,
  author =       "Uday Kumar Chakraborty",
  title =        "A branching process model for genetic algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "281--292",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (65U05 68T05)",
  MRnumber =     "96h:90085",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); B0260
                 (Optimisation techniques); C1140 (Probability and
                 statistics); C1180 (Optimisation techniques)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Jadavpur Univ.,
                 Calcutta, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bitwise mutation; branching process model;
                 fitness-proportionate selection; genetic algorithms;
                 haploid binary fixed-length genetic algorithm;
                 probability; schema processing; single-point crossover;
                 stochastic analysis; stochastic processes; ten-problem
                 test suite",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1995:NPPa,
  author =       "Anonymous",
  title =        "Note from the Publisher",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "5",
  pages =        "i--i",
  day =          "8",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Jan 3 14:24:13 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kuich:1995:RCS,
  author =       "Werner Kuich",
  title =        "Representations and complete semiring morphisms",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "293--298",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (16Y60 68Q70)",
  MRnumber =     "96m:68095",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.
                 Wien, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean semiring; complete semiring morphisms; formal
                 languages; power series; representations; series
                 (mathematics); tropical semiring",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Raychaudhuri:1995:TIN,
  author =       "Arundhati Raychaudhuri",
  title =        "The total interval number of a tree and the
                 {Hamiltonian} completion number of its line graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "299--306",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (05C45 05C85)",
  MRnumber =     "96i:05047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4260 (Computational
                 geometry)",
  corpsource =   "Coll. of Staten Island, City Univ. of New York, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; graph theory; Hamiltonian
                 completion number; line graph; polynomial algorithm;
                 total interval number; tree; trees (mathematics);
                 triangle-free graph",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Danicic:1995:PAS,
  author =       "Sebastian Danicic and Mark Harman and Yoga
                 Sivagurunathan",
  title =        "A parallel algorithm for static program slicing",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "307--313",
  day =          "22",
  month =        dec,
  year =         "1995",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Sch. of Comput., North London Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "concurrent processes; control flow graph; parallel
                 algorithm; parallel algorithms; static program slicing;
                 Weiser's original static slicing algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mazzanti:1995:SIC,
  author =       "S. Mazzanti",
  title =        "Succinct iterative characterizations of primitive
                 computable unary functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "315--319",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03D20 (68N15)",
  MRnumber =     "96h:03081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4200 (Computer theory)",
  corpsource =   "Dipartimento di Matematica e Inf., Udine Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "closure; composition; computation theory; for-do
                 programs; iterative methods; primitive computable unary
                 functions; primitive iteration; succinct iterative
                 characterizations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhou:1995:GVR,
  author =       "Xiao Zhou and Nobuaki Nagai and Takao Nishizeki",
  title =        "Generalized vertex-rankings of trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "321--328",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05 (05C85)",
  MRnumber =     "96i:05049",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Syst. Inf. Sci., Tohoku Univ., Sendai,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "1-vertex-ranking; c-vertex-ranking; computational
                 geometry; generalized vertex-rankings; labeling;
                 ordinary vertex-ranking; positive integer; ranking;
                 trees; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bshouty:1995:ACM,
  author =       "Nader H. Bshouty",
  title =        "On the additive complexity of $2 \times 2$ matrix
                 multiplication",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "329--335",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (15A63)",
  MRnumber =     "97b:68082",
  MRreviewer =   "Peter W. Day",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2*2 matrix multiplication; additive complexity;
                 arbitrary field; bilinear algorithm; binary field;
                 computational complexity; matrix algebra; nonscalar
                 multiplications",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pritchard:1995:SSQ,
  author =       "Paul Pritchard",
  title =        "A simple sub-quadratic algorithm for computing the
                 subset partial order",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "337--341",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(95)00165-4",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "06A07 (68Q20 68Q25)",
  MRnumber =     "96h:06009",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0020019095001654",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Sch. of Comput. and Inf. Technol., Griffith Univ.,
                 Brisbane, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; data structures; lexicographic
                 order; natural partial order; sub-quadratic algorithm;
                 subset partial order; subset relation; worst-case
                 bound; worst-case time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Han:1995:IPC,
  author =       "Yijie Han",
  title =        "An improvement on parallel computation of a maximal
                 matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "343--348",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C70 68Q25 68R10)",
  MRnumber =     "96h:05187",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Electron. Data Syst. Inc., Romulus, MI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; EREW PRAM model; maximal
                 matching; optimal parallel algorithm; parallel
                 algorithms; parallel computation; time complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Anonymous:1995:NPPb,
  author =       "Anonymous",
  title =        "Note from the {Publisher}",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "6",
  pages =        "i--i",
  day =          "22",
  month =        dec,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:00:06 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Das:1996:MLT,
  author =       "S. K. Das",
  title =        "Modal logics in the theory of relational databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "1--7",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (03B45 03B70)",
  MRnumber =     "96k:68040",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C6160D (Relational databases)",
  corpsource =   "William Penney Lab., Imperial Coll. of Sci., Technol.
                 and Med., London, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "attributes; formal logic; inference mechanisms;
                 logical formalisms; modal logics; reasoning; relational
                 databases; standard first-order logic; tuples",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Volpano:1996:LBT,
  author =       "Dennis M. Volpano",
  title =        "Lower bounds on type checking overloading",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "9--13",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N15 (68Q25 68Q55)",
  MRnumber =     "96m:68021",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Naval Postgraduate Sch.,
                 Monterey, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; decidability;
                 functional languages; inference mechanisms; lower
                 bounds; ML type system; polymorphic functional
                 languages; recursion; satisfiability problem; type
                 assumptions; type checking overloading; type theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Harper:1996:NSA,
  author =       "Robert Harper",
  title =        "A note on: {``A simplified account of polymorphic
                 references'' [Inform. Process. Lett. {\bf 51} (1994),
                 no. 4, 201--206; MR 95f:68142]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "15--16",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "1 374 695",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Harper:1994:SAP}.",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm theory);
                 C4250 (Database theory); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "formal logic; functional language; functional
                 programming; polymorphic references; polymorphism;
                 references; soundness; type inference; type theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yanbe:1996:SCN,
  author =       "Akio Yanbe and Kouichi Sakurai",
  title =        "A short certificate of the number of universal optimal
                 strategies for stopping simple stochastic games",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "17--24",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90D15 (68Q25)",
  MRnumber =     "96m:90153",
  MRreviewer =   "Teruhisa Nakai",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); C1140E (Game theory); C4240C
                 (Computational complexity)",
  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/",
  keywords =     "complexity; computational complexity; nondeterministic
                 polynomial-time algorithm; stochastic games; universal
                 optimal strategies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Herman:1996:MCS,
  author =       "Michael W. Herman and Waldemar W. Koczkodaj",
  title =        "A {Monte Carlo} study of pairwise comparison",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "25--29",
  day =          "15",
  month =        jan,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C1230 (Artificial
                 intelligence); C6170K (Knowledge engineering
                 techniques); C6170T (Knowledge engineering tools)",
  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/",
  keywords =     "inference mechanisms; inference tool; knowledge
                 acquisition; knowledge based systems; knowledge-based
                 systems; Monte Carlo methods; Monte Carlo study;
                 pairwise comparison",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dancik:1996:CBF,
  author =       "Vlado Dan{\v{c}}{\'\i}k",
  title =        "Complexity of {Boolean} functions over bases with
                 unbounded fan-in gates",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "31--34",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94C10 (68Q25)",
  MRnumber =     "97b:94050",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Math., Univ. of Southern California, Los
                 Angeles, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bases; Boolean functions; circuit complexity;
                 complexity; computational complexity; negation;
                 unbounded fan-in gates",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Drozdowski:1996:RTS,
  author =       "Maciej Drozdowski",
  title =        "Real-time scheduling of linear speedup parallel
                 tasks",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "35--40",
  day =          "15",
  month =        jan,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessing systems); C6150N (Distributed
                 systems software)",
  corpsource =   "Inst. of Comput. Sci., Tech. Univ. Poznan, Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "deterministic scheduling; linear speedup parallel
                 tasks; makespan optimality criterion; multiprogrammed
                 multiprocessor system; parallel processing; polynomial
                 time algorithm; processor scheduling; real-time
                 scheduling; real-time systems",
  treatment =    "P Practical",
}

@Article{Duh:1996:CPG,
  author =       "Dyi-Rong Duh and Gen-Huey Chen and D. Frank Hsu",
  title =        "Combinatorial properties of generalized hypercube
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "41--45",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C99",
  MRnumber =     "96i:05168",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C5220P (Parallel
                 architecture); C5440 (Multiprocessing systems)",
  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/",
  keywords =     "combinatorial mathematics; combinatorial properties;
                 generalized hypercube graphs; hypercube networks;
                 interconnection networks",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Xue:1996:CSF,
  author =       "Qingbo Xue",
  title =        "On a class of square-free graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "47--48",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C75",
  MRnumber =     "96k:05169",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Basic Sci. Coll., North China Univ. of Technol.,
                 Beijing, China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "F-free; graph theory; square-free graphs; strong
                 perfect graph conjecture",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1996:IAP,
  author =       "Wei-Bin Lee and Chin-Chen Chang",
  title =        "Integrating authentication in public key distribution
                 system",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "49--52",
  day =          "15",
  month =        jan,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130S (Data security)",
  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/",
  keywords =     "authenticated secure session key distribution system;
                 authentication; message authentication; public key
                 cryptography; public key distribution system;
                 randomizer",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Merlini:1996:UMS,
  author =       "Donatella Merlini and Renzo Sprugnoli and M. Cecilia
                 Verri",
  title =        "A uniform model for the storage utilization of
                 {$B$}-tree-like structures",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "1",
  pages =        "53--58",
  day =          "15",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "96j:68043",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Dept. of Syst. and Inf., Florence Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "B-tree-like structures; Riordan arrays; storage
                 utilization; tree data structures; uniform model",
  treatment =    "P Practical",
}

@Article{Zimand:1996:HLK,
  author =       "Marius Zimand",
  title =        "A high-low {Kolmogorov} complexity law equivalent to
                 the $0$-$1$ law",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "59--64",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03C13 (68Q30)",
  MRnumber =     "97c:03101",
  MRreviewer =   "M. I. Dekhtyar",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C1260
                 (Information theory); C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "0-1 law; equivalent formulation; finite structure;
                 finite structures; formal logic; formulation; high-low
                 Kolmogorov complexity law; information theory;
                 Kolmogorov complexity; logic; probability; recursive
                 estimation; recursive logics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blum:1996:ISM,
  author =       "Norbert Blum",
  title =        "An ${O}(n \log n)$ implementation of the standard
                 method for minimizing $n$-state finite automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "65--69",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q68 (68Q45)",
  MRnumber =     "97b:68145",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4220 (Automata
                 theory)",
  corpsource =   "Inf. IV, Bonn Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; finite automata; Hopcroft's data structure;
                 minimisation; minimization; minimizing; n-state finite
                 automata; n-state finite automaton; nontrivial
                 correctness proof; O(nlogn); standard method; time
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Muscholl:1996:NCC,
  author =       "Anca Muscholl and Holger Petersen",
  title =        "A note on the commutative closure of star-free
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "71--74",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "96k:68116",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Inst. f{\"u}r Inf., Stuttgart Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "commutative closure; decidability; decidable; formal
                 language; formal languages; nonregular; partial
                 commutation; programming theory; star-free language;
                 transitive dependence relation; transitive partial
                 commutation relations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ghandeharizadeh:1996:LAO,
  author =       "Shahram Ghandeharizadeh and Doug Ierardi and Roger
                 Zimmermann",
  title =        "An on-line algorithm to optimize file layout in a
                 dynamic environment",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "75--81",
  day =          "29",
  month =        jan,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C6120 (File
                 organisation)",
  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/",
  keywords =     "cache; disk-resident file; dynamic environment;
                 dynamically changing work; file layout optimization;
                 file management; file organisation; magnetic disk
                 drive; magnetic storage; mechanical device; on-line
                 algorithm; optimisation; storage management",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Garrido:1996:SRP,
  author =       "Oscar Garrido and Stefan Jarominek and Andrzej Lingas
                 and Wojciech Rytter",
  title =        "A simple randomized parallel algorithm for maximal
                 $f$-matchings",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "83--87",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C70)",
  MRnumber =     "96i:05159",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel 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/",
  keywords =     "maximal f-matchings; parallel algorithms; randomised
                 algorithms; randomized parallel algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aspvall:1996:QTT,
  author =       "Bengt Aspvall and Christos Levcopoulos and Andrzej
                 Lingas and Robert Storlind",
  title =        "On $2$-{QBF} truth testing in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "89--93",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q15 68Q25)",
  MRnumber =     "97g:68082",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Inf., Bergen Univ., Norway",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-QBF truth testing; Boolean functions; consistency;
                 data bases; decidability; integer programming;
                 knowledge-based systems; parallel algorithms;
                 quantified Boolean formulas; satisfiability problem",
  treatment =    "P Practical",
}

@Article{Dong:1996:CQC,
  author =       "Guozhu Dong and Jianwen Su",
  title =        "Conjunctive query containment with respect to views
                 and constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "95--102",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68Q25)",
  MRnumber =     "96k:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C6110L (Logic programming); C6130 (Data
                 handling techniques); C6160 (Database management
                 systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; conjunctive
                 query containment; constraint-related containment;
                 constraints; data integrity; database integrity
                 constraints; DATALOG; Datalog; decidability;
                 deterministic exponential time; EXPTIME; first order
                 logic; formal logic; multi-valued dependencies;
                 NEXPTIME-hard; polynomial space-hard; PSPACE-hard;
                 query processing; views",
  treatment =    "P Practical",
}

@Article{Deng:1996:LBC,
  author =       "Xiaotie Deng",
  title =        "A lower bound for communication on the crossbar",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "103--108",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "1 374 707",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240C
                 (Computational complexity); C5220P (Parallel
                 architecture)",
  corpsource =   "Dept. of Comput. Sci., York Univ., North York, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "c-arbitrary crossbar model; communication;
                 communication complexity; crossbar; crossbar switch;
                 multiprocessor interconnection networks; network
                 routing; parallel processing; routing problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fagerberg:1996:GBQ,
  author =       "Rolf Fagerberg",
  title =        "A generalization of binomial queues",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "109--114",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "96k:68034",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140C (Queueing theory); C4240 (Programming and
                 algorithm theory); C6120 (File organisation)",
  corpsource =   "Dept. of Math. and Comput. Sci., Odense Univ.,
                 Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrary sequence; binomial queues; data structure;
                 data structures; meldable priority queues; queueing
                 theory; worst case bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nayak:1996:ENI,
  author =       "Amiya Nayak and Vincenzo Acciaro and Paolo Gissi",
  title =        "Erratum: {``A note on isomorphic chordal rings''
                 [Inform. Process. Lett. {\bf 55} (1995), no. 6,
                 339--341; MR 96d:68016]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "2",
  pages =        "115--115",
  day =          "29",
  month =        jan,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "97a:68018",
  bibdate =      "Sun May 02 08:37:12 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Nayak:1995:NIC,Chen:1996:RSP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Clote:1996:NMC,
  author =       "Peter Clote",
  title =        "A note on the monotone complexity of $2${-REF}",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "117--123",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "97b:68086",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Inst. f{\"u}r Inf., Ludwig-Maximilians-Univ., Munchen,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-REF; bounded fan-in Boolean circuits; computational
                 complexity; conjunctive normal form; directed
                 connectivity; directed graph; directed graphs;
                 disjuncts; distinguished vertices; formal logic;
                 monotone circuit; monotone complexity; monotonic depth;
                 monotonic p-projection equivalence; projection
                 reduction; refutable propositional logic formula
                 recognition; satisfiability; st-DCON",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Danyi:1996:NEP,
  author =       "G. D{\'a}nyi and Z. F{\"u}l{\"o}p",
  title =        "A note on the equivalence problem of {$E$}-patterns",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "125--128",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (03B25)",
  MRnumber =     "96m:68090",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See letter to the editor \cite{Danyi:1996:LEN}.",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Found. of Comput. Sci., Jozsef Attila Univ.,
                 Szeged, Hungary",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "decidability; E-patterns; equivalence classes;
                 equivalence problem; erasing-morphism patterns; formal
                 languages; strong necessary condition; terminal
                 alphabet cardinality",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Levcopoulos:1996:TLB,
  author =       "Christos Levcopoulos and Drago Krznaric",
  title =        "Tight lower bounds for minimum weight triangulation
                 heuristics",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "129--135",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "96j:68174",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0260
                 (Optimisation techniques); B0290T (Finite element
                 analysis); C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4185 (Finite element
                 analysis); C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; Delaunay triangulation; graph
                 theory; greedy spanning tree heuristic; greedy
                 triangulation; heuristic programming; mesh generation;
                 minimisation; minimum spanning tree heuristic;
                 minimum-weight triangulation heuristics; optimal
                 subgraph triangulation; tight lower bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldsmith:1996:SIP,
  author =       "Judy Goldsmith and Steven Homer",
  title =        "Scalability and the {Isomorphism Problem}",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "137--143",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "97a:68063",
  MRreviewer =   "Sanjay Jain",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; isomorphism closure;
                 isomorphism problem; P-isomorphic; P-paddable sets;
                 P-printable sets; polynomial-time computable sets;
                 rankable sets; scalability; scalable sets; set theory;
                 sparse sets; thick sets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1996:MGS,
  author =       "Tsong Yueh Chen and Yuen Tak Yu",
  title =        "A more general sufficient condition for partition
                 testing to be better than random testing",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "145--149",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "1 379 689",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "failure detection; failure rates; partition testing;
                 program input domain partitioning; program testing;
                 random testing; sampling rates; sufficient condition;
                 test cases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alimonti:1996:NLS,
  author =       "Paola Alimonti",
  title =        "New local search approximation techniques for maximum
                 generalized satisfiability problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "151--158",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "97f:68059",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240C (Computational complexity)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation theory; bounded neighborhood;
                 computational complexity; decidability; general local
                 search algorithm; guaranteed approximation quality;
                 local search approximation techniques; local search
                 heuristic; maximum generalized satisfiability problems;
                 objective function; relaxed local search; satisfied
                 clauses; search problems; variables",
  treatment =    "N New Development; T Theoretical or Mathematical",
}

@Article{Muller:1996:CES,
  author =       "Michael M{\"u}ller and Christine R{\"u}b and Wolfgang
                 R{\"u}lling",
  title =        "A circuit for exact summation of floating-point
                 numbers",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "159--163",
  day =          "12",
  month =        feb,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1265B (Logic circuits); C5120 (Logic and switching
                 circuits); C5230 (Digital arithmetic methods)",
  corpsource =   "Max-Planck-Inst. f{\"u}r Inf., Saarbrucken, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "accurate partial product accumulation; adders;
                 enclosure intervals; exact inner product computation;
                 exact summation circuit; floating point arithmetic;
                 floating-point numbers; ill conditioned problems; inner
                 product expressions; interval computation; numerical
                 problem solving",
  treatment =    "P Practical",
}

@Article{Abellanas:1996:OP,
  author =       "Manuel Abellanas and Jes{\'u}s Garc{\'\i}a and
                 Gregorio Hern{\'a}ndez-Pe{\~n}alver and Ferr{\'a}n
                 Hurtado and Oriol Serra and Jorge Urrutia",
  title =        "Onion polygonizations",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "3",
  pages =        "165--173",
  day =          "12",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "97a:68156",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Fac. de Inf., Univ. Politecnica de Madrid, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational aspects; computational complexity;
                 computational geometry; convex hull; onion
                 polygonizations; onion polygons; point polygonization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Metivier:1996:MCP,
  author =       "Yves M{\'e}tivier and Nasser Saheb",
  title =        "Medians and centres of polyominoes",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "175--181",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05B50 (90B80 90C27)",
  MRnumber =     "96k:05037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Bordeaux I Univ., Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cell; combinatorial properties; eccentricity function
                 local minimality proof; edge; global minimality; graph
                 theory; polyomino centres; polyomino medians; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vadapalli:1996:SRT,
  author =       "Premkumar Vadapalli and Pradip K. Srimani",
  title =        "Shortest routing in trivalent {Cayley} graph network",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "183--188",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C25 90B12)",
  MRnumber =     "96k:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Colorado State Univ., Fort
                 Collins, CO, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "actual diameter value; algorithm theory; graph theory;
                 multiprocessor interconnection networks; network
                 routing; optimal routing algorithm; shortest routing
                 algorithm; trivalent Cayley graph network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aslam:1996:SCN,
  author =       "Javed A. Aslam and Scott E. Decatur",
  title =        "On the sample complexity of noise-tolerant learning",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "189--195",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (68Q25)",
  MRnumber =     "96j:68152",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C1250 (Pattern
                 recognition); C4210 (Formal logic); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Dartmouth Coll., Hanover, NH,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; classification noise; computational
                 complexity; general lower bound optimality; general
                 upper bounds; learning by example; noise;
                 noise-tolerant learning; noise-tolerant learning
                 algorithm; PAC model; pattern classification; required
                 examples; sample complexity; sample size; symmetric
                 Boolean functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cattell:1996:SLT,
  author =       "Kevin Cattell and Michael J. Dinneen and Michael R.
                 Fellows",
  title =        "A simple linear-time algorithm for finding path-
                 decompositions of small width",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "197--203",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "96j:05099",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Victoria Univ., BC, Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bounded pathwidth graphs; computational complexity;
                 fixed constant; graph pathwidth; graph theory; linear
                 time graph recognition; proof; simple linear-time
                 algorithm; small-width path-decomposition finding;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Murshed:1996:SDT,
  author =       "M. Manzur Murshed and M. Kaykobad",
  title =        "Seek distances in two-headed disk systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "205--209",
  day =          "26",
  month =        feb,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5320C
                 (Storage on moving magnetic media)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Bangladesh Univ. of
                 Eng. and Technol., Dhaka, Bangladesh",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; algorithm theory; intelligently positioned
                 two-headed disk systems; magnetic disc storage;
                 magnetic heads; mean seek time; seek distances",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baclawski:1996:CIC,
  author =       "Kenneth Baclawski and Dan A. Simovici",
  title =        "A characterization of the information content of a
                 classification",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "211--214",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A17 (68P20)",
  MRnumber =     "97g:94009",
  MRreviewer =   "Rafail E. Krichevski{\u{\i}}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C7240 (Information analysis and indexing); C7250
                 (Information storage and retrieval)",
  corpsource =   "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "classification; document retrieval systems; entropy;
                 information content characterisation; information
                 retrieval; information retrieval systems; measures;
                 natural conditions; set collections",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Symvonis:1996:RT,
  author =       "Antonios Symvonis",
  title =        "Routing on trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "215--223",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "96j:68019",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Baser Dept. of Comput. Sci., Sydney Univ., NSW,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm time; algorithms; bits; computational
                 complexity; permutation packet routing problem; routing
                 schedules; routing steps; scheduling; trees; trees
                 (mathematics); vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Veanes:1996:NEC,
  author =       "Margus Veanes and Jonas Barklund",
  title =        "On the number of edges in cycletrees",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "4",
  pages =        "225--229",
  day =          "26",
  month =        feb,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C38 68M10)",
  MRnumber =     "96j:05064",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Uppsala Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary spanning tree; cycletrees; data structures;
                 graph; Hamiltonian cycle; minimal total path length;
                 minimum edge number; tree data structures; tree
                 traversal; trees (mathematics); vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Trevisan:1996:NMA,
  author =       "Luca Trevisan",
  title =        "A note on minimum-area upward drawing of complete and
                 {Fibonacci} trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "231--236",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (05C85 68Q25 68R10)",
  MRnumber =     "96k:68199",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dipartimento di Sci. dell'Inf., La Sapienza Univ.,
                 Rome, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "area requirements; complete trees; computational
                 complexity; computational geometry; Fibonacci trees;
                 graph drawing; minimum-area upward drawing;
                 strictly-upward straight-line grid drawings; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Canetti:1996:MBP,
  author =       "Ran Canetti",
  title =        "More on {BPP} and the {Polynomial-time Hierarchy}",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "237--241",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "96k:68066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "BPP; complexity class; computation theory;
                 computational complexity; formal languages; interactive
                 proof; one-sided-error IP; polynomial-time hierarchy;
                 probability; randomness; theorem proving;
                 two-sided-error IP",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Attiya:1996:LFC,
  author =       "Hagit Attiya and Roy Friedman",
  title =        "Limitations of fast consistency conditions for
                 distributed shared memories",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "243--248",
  day =          "11",
  month =        mar,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5320G (Semiconductor storage); C5440
                 (Multiprocessing systems); 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/",
  keywords =     "causal memory; data integrity; distributed memory
                 systems; distributed shared memory; execution time;
                 fast consistency conditions; mutual exclusion; network
                 delay; pipelined RAM; processor consistency;
                 random-access storage; shared memory systems; virtual
                 storage; weak consistency",
  treatment =    "P Practical",
}

@Article{Koutsoupias:1996:EP,
  author =       "Elias Koutsoupias and Christos Papadimitriou",
  title =        "The $2$-evader problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "249--252",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M20 68N25 90B22)",
  MRnumber =     "96k:68091",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140C (Queueing theory); C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Los Angeles,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2-evader problem; competitive algorithms; competitive
                 ratio; k-server conjecture; metric spaces; online
                 algorithms; queueing theory; server problem; trees
                 (mathematics); work function algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lenhart:1996:DOM,
  author =       "William Lenhart and Giuseppe Liotta",
  title =        "Drawing outerplanar minimum weight triangulations",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "253--260",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (05C10 52B55)",
  MRnumber =     "97b:68227",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Williams Coll., Williamstown,
                 MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial properties; computational complexity;
                 computational geometry; dual trees; graph drawing;
                 graph theory; linear time algorithm; maximal
                 outerplanar graph; maximal outerplanar graphs;
                 outerplanar minimum weight triangulations; regular
                 polygons; straight-line drawing; trees (mathematics);
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cusick:1996:BNFa,
  author =       "Thomas W. Cusick",
  title =        "Bounds on the number of functions satisfying the
                 {Strict Avalanche Criterion}",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "261--263",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 384 171",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See comment \cite{Youssef:1996:CBN}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C6130S (Data security)",
  corpsource =   "Dept. of Math., State Univ. of New York, Buffalo, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; computational complexity;
                 cryptographic functions; cryptography; design criteria;
                 higher-order strict avalanche criteria; lower bound;
                 SAC; Strict Avalanche Criterion; upper bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Viswanathan:1996:FTE,
  author =       "Suresh Viswanathan and {\'E}va Czabarka and Abhijit
                 Sengupta",
  title =        "On fault-tolerant embedding of {Hamiltonian} circuits
                 in line digraph interconnection networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "265--271",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10 68U15)",
  MRnumber =     "96m:68012",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci., South Carolina Univ., Columbia,
                 SC, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "directed graphs; directed line graphs; Euler tour;
                 fault tolerant computing; fault-tolerance; forbidden
                 link pairs; Hamiltonian circuits; line digraph
                 interconnection networks; link failures; multiprocessor
                 interconnection networks; parallel algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Seshadri:1996:THD,
  author =       "S. Seshadri and D. Rotem",
  title =        "The two headed disk: Stochastic dominance of the
                 greedy policy",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "273--277",
  day =          "11",
  month =        mar,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C1180
                 (Optimisation techniques); C5320C (Storage on moving
                 magnetic media)",
  corpsource =   "Dept. of Stat. and Oper. Res., New York Univ., NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "disk addresses; expected seek distance; greedy policy;
                 magnetic disc storage; optimal seek time; optimisation;
                 probability; repositioning policy; request
                 distribution; stochastic dominance; stochastic
                 processes; two headed disk; uniform request
                 probabilities",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Monti:1996:GTA,
  author =       "Angelo Monti and Alessandro Roncato",
  title =        "A gap theorem for the anonymous torus",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "279--285",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q25)",
  MRnumber =     "97a:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dipartimento di Sci. dell'Inf., La Sapienza Univ.,
                 Rome, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "anonymous ring; anonymous torus; asynchronous
                 processors; communication complexity; computability;
                 distributed computing; functions; gap theorem; input
                 collection algorithm; message complexity; message
                 exchange; multiprocessor interconnection networks;
                 nonconstant computable functions; nonsquare torus;
                 processor torus; torus dimension; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rhee:1996:ACC,
  author =       "Chongkye Rhee and Y. Daniel Liang",
  title =        "An {${\rm NC}$} algorithm for the clique cover problem
                 in cocomparability graphs and its application",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "287--290",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C70 68Q25 68R10)",
  MRnumber =     "96m:05188",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Math., Stat. and Comput. Sci., Eastern
                 Kentucky Univ., Richmond, KY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cocomparability graphs; computational complexity; CRCW
                 PRAM; depth-first search problem; graph theory; minimum
                 clique cover problem; NC algorithm; parallel algorithm;
                 parallel algorithms; permutation graphs; processor
                 number; time complexity; tree searching; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Monti:1996:CCG,
  author =       "Angelo Monti",
  title =        "On the computational complexity of graph closures",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "291--295",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "97i:68097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dipartimento di Sci. dell Inf., Rome Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 graph closures; N+k-closure problem; P-complete;
                 parallel complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gawiejnowicz:1996:NSS,
  author =       "Stanis{\l}aw Gawiejnowicz",
  title =        "A note on scheduling on a single processor with speed
                 dependent on a number of executed jobs",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "297--300",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "97e:68012",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6150N (Distributed systems software)",
  corpsource =   "Fac. of Math. and Comput. Sci., Adam Mickiewicz Univ.,
                 Poznan, Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "executed jobs; makespan scheduling problem; optimal
                 schedule; polynomial-time algorithms; processor
                 scheduling; scheduling; single processor",
  treatment =    "P Practical",
}

@Article{Yen:1996:HSS,
  author =       "I-Ling Yen",
  title =        "A highly safe self-stabilizing mutual exclusion
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "301--305",
  day =          "25",
  month =        mar,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6150M (Protocols); C5470 (Performance evaluation
                 and testing); C5640 (Protocols)",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "fault tolerant computing; highly safe self-stabilizing
                 mutual exclusion algorithm; processor specialization;
                 protocols; safety-critical systems; sobriety test;
                 transient failure; vulnerability problem",
  treatment =    "P Practical",
}

@Article{Fudos:1996:POR,
  author =       "Ioannis Fudos and Evaggelia Pitoura and Wojciech
                 Szpankowski",
  title =        "On pattern occurrences in a random text",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "307--312",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15",
  MRnumber =     "97f:68155",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other topics in statistics); B6140C (Optical
                 information, image and video signal processing); C1140Z
                 (Other topics in statistics); C1250 (Pattern
                 recognition)",
  corpsource =   "Dept. of Comput. Sci., Ioannina Univ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "asymmetric Bernoulli model; generating function;
                 pattern occurrences; pattern recognition; probabilities
                 of occurrence; probability; random patterns; random
                 text",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1996:RSP,
  author =       "Danny Z. Chen and Kevin S. Klenk",
  title =        "Rectilinear short path queries among rectangular
                 obstacles",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "313--319",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sun May 02 08:32:40 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also errata \cite{Nayak:1996:ENI,Chen:1996:ERS}.",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Notre Dame Univ., IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation factor; arbitrary query points;
                 computational geometry; data structure; disjoint
                 rectangular obstacles; query processing; rectangular
                 obstacles; rectilinear approximate shortest path
                 queries; rectilinear short path queries",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ramnath:1996:TPS,
  author =       "Sarnath Ramnath and Sivaprakasam Sunder",
  title =        "On two-processor scheduling and maximum matching in
                 permutation graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "321--327",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "97h:68008",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., St. Cloud State Univ., MN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; graph theory; maximum
                 matching; O(n \log n) algorithm; permutation graphs;
                 precedence constraints; scheduling; transitively
                 oriented permutation graph; two-processor scheduling",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ben-Or:1996:APF,
  author =       "Michael Ben-Or and Dana Ron",
  title =        "Agreement in the presence of faults, on networks of
                 bounded degree",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "329--334",
  day =          "25",
  month =        mar,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5470 (Performance evaluation and testing)",
  corpsource =   "Inst. of Comput. Sci., Hebrew Univ., Jerusalem,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "constant probability; fault tolerant computing; fully
                 polynomial almost everywhere agreement scheme; high
                 probability; networks of bounded degree; randomly
                 located faulty processors",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1996:NFC,
  author =       "Sung Kwon Kim",
  title =        "A note on finding compact sets in graphs represented
                 by an adjacency list",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "6",
  pages =        "335--338",
  day =          "25",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "97i:68153",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Kyungsung Univ., Pusan, South
                 Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "adjacency list; adjacency matrix; compact sets;
                 computational geometry; edge-weighted graph; graph
                 theory; O(N/sup 2/) time algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lacoste:1996:FPL,
  author =       "Thierry Lacoste",
  title =        "Finitistic proofs of $0$-$1$ laws for fragments of
                 second-order logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "1--4",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03C85 (03C13)",
  MRnumber =     "97f:03055",
  MRreviewer =   "S. R. Kogalovski{\u{\i}}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C1160
                 (Combinatorial mathematics); C4210 (Formal logic)",
  corpsource =   "Univ. de Provence, Marseille, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "0-1 laws; Ackermann sentences; asymptotic
                 probabilities; Bernays-Schonfinkel; combinatorial
                 mathematics; combinatorial problems; compactness
                 theorem; finitistic proofs; formal logic; infinite
                 structure; infinitistic methods; logic; probability;
                 second order logic; Sigma /sub 1//sup 1/ sentences;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Neufeld:1996:PEP,
  author =       "Stewart W. Neufeld",
  title =        "A pursuit-evasion problem on a grid",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "5--9",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90D26 (90D05)",
  MRnumber =     "97c:90153",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C1230 (Artificial
                 intelligence)",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "games of skill; graph theory; grid; minimum speed;
                 pursuit evasion problem; search problems; searcher and
                 fugitive; two player game; unit maximum speed",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Harikumar:1996:IDM,
  author =       "S. Harikumar and Shashi Kumar",
  title =        "Iterative deepening multiobjective {${\rm A}^*$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "11--15",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C29",
  MRnumber =     "97f:90076",
  MRreviewer =   "Jos{\'e} F. Fontanari",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C1230 (Artificial
                 intelligence); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Indian Inst. of
                 Technol., New Delhi, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "A* algorithm; completeness; computational complexity;
                 correctness; depth first search techniques; depth first
                 version; exponential space complexity; heuristic based
                 best first search techniques; heuristic programming;
                 heuristic search algorithms; IDMOA*; iterative
                 deepening multiobjective A*; linear space; linear space
                 multiobjective generalization; MOA*; multiobjective
                 generalization; multiple objectives; optimality; real
                 world optimization problems; scalar valued criterion;
                 single valued criterion; tree searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Krishnamachari:1996:DAG,
  author =       "Bagirath R. Krishnamachari and Ravi Mittal",
  title =        "Design and analysis of a generalized multi-ring
                 architecture",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "17--21",
  day =          "8",
  month =        apr,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture); C5440 (Multiprocessing
                 systems)",
  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/",
  keywords =     "communication ports per processor; cube connected
                 cycles; diameter; hypercubes; interprocessor
                 communication delay; LAN; large multicomputer systems
                 design; local area network; multi-ring architecture;
                 multi-ring network; multiprocessor interconnection
                 networks; network routing; parallel algorithms;
                 parallel architectures; performance evaluation;
                 shortest path routing algorithm; size increase; star
                 graphs; topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Marathe:1996:AAM,
  author =       "M. V. Marathe and S. S. Ravi",
  title =        "On approximation algorithms for the minimum
                 satisfiability problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "23--29",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "97b:68094",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240C (Computational complexity)",
  corpsource =   "Los Alamos Nat. Lab., NM, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation algorithms; approximation theory;
                 approximation-preserving reduction; CNF formula;
                 computability; computational complexity; heuristics;
                 minimum satisfiability problem; minimum vertex cover;
                 MINSAT; MINVC; NP-complete; performance evaluation;
                 performance guarantee; planar instances; truth
                 assignment",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Caussinus:1996:NTB,
  author =       "Herv{\'e} Caussinus",
  title =        "A note on a theorem of {Barrington, Straubing} and
                 {Th{\'e}rien}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "31--33",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "97f:68063",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C5110 (Logic elements)",
  corpsource =   "Dept. d'Inf. et de Recherche Oper., Montreal Univ.,
                 Que., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "AND function; Boolean circuit; Boolean functions;
                 computational complexity; depth-two MOD/sub 6/
                 circuits; exponential lower bound; logic gates; lower
                 bound proof; polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ogihara:1996:FCL,
  author =       "Mitsunori Ogihara",
  title =        "Functions computable with limited access to {NP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "35--38",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25)",
  MRnumber =     "97h:68041",
  MRreviewer =   "Frederic Green",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computability; computational complexity; constant;
                 functional oracle queries; functions; multivalued
                 functions; nondeterministic functions; NP limited
                 access; polynomial time; polynomial-time hierarchy;
                 reducibility; single-valued NP functions; Turing
                 machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lipton:1996:PGN,
  author =       "Richard J. Lipton",
  title =        "On proving that a graph has no large clique: {A}
                 connection with {Ramsey} theory",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "39--42",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (05C55 68R10)",
  MRnumber =     "97i:68078",
  MRreviewer =   "Jerrold W. Grossman",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation theory; clique; complexity;
                 computational complexity; feasible proofs; graph; graph
                 theory; hard approximation problems; inseparable sets;
                 NP-hard problems; polynomial time approximation; Ramsey
                 theory; recursion theory; recursive functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tzeng:1996:PEN,
  author =       "Wen-Guey Tzeng",
  title =        "On path equivalence of nondeterministic finite
                 automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "43--46",
  day =          "8",
  month =        apr,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q75)",
  MRnumber =     "97b:68097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ.,
                 Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computability; computation paths; computational
                 complexity; decidability; decidable; finite automata;
                 lambda cycles; nondeterministic finite automata;
                 parallel time; path equivalence; polynomial sequential
                 time; PSPACE-complete; solvable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kirousis:1996:SAS,
  author =       "Lefteris M. Kirousis and Paul Spirakis and Philippas
                 Tsigas",
  title =        "Simple atomic snapshots: {A} linear complexity
                 solution with unbounded time-stamps",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "1",
  pages =        "47--53",
  day =          "8",
  month =        apr,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessing systems)",
  corpsource =   "Dept. of Comput. Eng. and Inf., Patras Univ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "asynchronous wait-free operation; bounded time-
                 stamps; composite register; computational complexity;
                 concurrency control; distributed algorithms;
                 distributed computing; formal correctness proof; linear
                 complexity; protocol; read; shared memory systems;
                 simple atomic snapshots; single reader composite
                 register; single writer per variable; time complexity;
                 unbounded timestamps; variables; write",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Garrido:1996:SAM,
  author =       "Oscar Garrido and Pierre Kelsen and Andrzej Lingas",
  title =        "A simple {${\rm NC}$}-algorithm for a maximal
                 independent set in a hypergraph of poly-log
                 arboricity",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "55--58",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (05C85 68Q25 68R10)",
  MRnumber =     "97b:68078",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)C4260
                 (Computational geometry); C4240C (Computational
                 complexity); C4240P (Parallel 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/",
  keywords =     "computational complexity; computational geometry;
                 hypergraph; maximal independent set; NC-algorithm;
                 parallel algorithms; poly-log arboricity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Balasubramanian:1996:PPT,
  author =       "R. Balasubramanian and S. V. Nagaraj",
  title =        "Perfect power testing",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "59--63",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11Y16 (68Q25)",
  MRnumber =     "97i:11122",
  MRreviewer =   "John B. Friedlander",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Inst. of Math., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; average running time; number theory;
                 perfect power testing; polynomial size",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chao:1996:MSP,
  author =       "Chia-Chiang Chao and Wen-Tsuen Chen and Gen-Huey
                 Chen",
  title =        "Multiple search problem on reconfigurable meshes",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "65--69",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M07)",
  MRnumber =     "97b:68015",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture)",
  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 =     "constant time algorithm; distributed processing;
                 massively parallel computing; mesh connected computer;
                 multiple search problem; multiprocessor interconnection
                 networks; parallel algorithm; parallel algorithms;
                 parallel processing; reconfigurable architectures;
                 reconfigurable bus; reconfigurable mesh; search
                 problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eiselt:1996:OLF,
  author =       "H. A. Eiselt and Michel Gendreau and Gilbert Laporte",
  title =        "Optimal location of facilities on a network with an
                 unreliable node or link",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "71--74",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68M15 90B10 90B25)",
  MRnumber =     "97b:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110P (Parallel programming); C6150N (Distributed
                 systems software)",
  corpsource =   "Fac. of Adm., New Brunswick Univ., Fredericton, NB,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "distributed processing; expected demand; facilities
                 optimal location; fault tolerant computing; low-order
                 polynomial algorithm; minimization; network; p
                 facilities; parallel algorithm; stochastic location;
                 unreliable link; unreliable node",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1996:UDC,
  author =       "Changwook Kim",
  title =        "Unambiguous description of chain code picture
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "75--79",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68U05)",
  MRnumber =     "97b:68111",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6130B (Graphics techniques); C6140D
                 (High level languages)",
  corpsource =   "Sch. of Comput. Sci., Oklahoma Univ., Norman, OK,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computer graphics; context free chain code picture
                 language; context-free languages; formal language;
                 formal languages; line drawing; picture-unambiguous
                 context-sensitive language; recursively enumerable
                 chain code picture language; regular chain code picture
                 language; unambiguous description",
  treatment =    "T Theoretical or Mathematical",
}

@Article{deAzevedo:1996:STP,
  author =       "Marcelo M. {de Azevedo} and Nader Bagherzadeh and
                 Martin Dowd and Shahram Latifi",
  title =        "Some topological properties of star connected cycles",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "81--85",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C25 68R10)",
  MRnumber =     "97c:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory); C6150N (Distributed systems software)",
  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/",
  keywords =     "algorithm theory; average distance; computational
                 complexity; diameter; directed graphs; distributed
                 computing; distributed processing; graph automorphism
                 group; graph theory; hypercube networks;
                 interconnection network; polynomial time; routing
                 algorithm; star connected cycles; tight bounds;
                 topological properties; undirected Cayley graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ra:1996:PPA,
  author =       "Dong-Yul Ra and Jong-Hyun Kim",
  title =        "A parallel parsing algorithm for arbitrary
                 context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "87--96",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q52 (68Q22 68Q50)",
  MRnumber =     "97d:68122",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)C6150C
                 (Compilers, interpreters and other processors); C4240P
                 (Parallel programming and algorithm theory); C6110P
                 (Parallel programming); C6150N (Distributed systems
                 software)",
  corpsource =   "Dept. of Comput. Sci., Yonsei Univ., KangWon, South
                 Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrary context-free grammar; Chomsky normal form;
                 computational complexity; computational time;
                 context-free grammars; CYK algorithm; hypercube;
                 multiprocessing; multiprocessing programs; one-way
                 one-dimensional array; parallel algorithm; parallel
                 algorithms; parallel parsing algorithm; program
                 compiler; program compilers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kimura:1996:ESA,
  author =       "Shigetomo Kimura and Atsushi Togashi and Norio
                 Shiratori",
  title =        "Extension of synthesis algorithm of recursive
                 processes to $\mu$-calculus",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "2",
  pages =        "97--104",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "97c:68100",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory);
                 C4240P (Parallel programming and algorithm theory);
                 C6170K (Knowledge engineering techniques)",
  corpsource =   "Inst. of Inf. Sci. and Electron., Tsukuba Univ.,
                 Ibaraki, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; calculus of communicating systems;
                 communicating system calculus; inductive inference;
                 inductive synthesis algorithm; inference mechanisms;
                 mu-calculus; process algebra; recursion method;
                 recursive process; synthesis algorithm extension",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kann:1996:AMS,
  author =       "Viggo Kann and Jens Lagergren and Alessandro
                 Panconesi",
  title =        "Approximability of maximum splitting of $k$-sets and
                 some other {$Apx$}-complete problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "105--110",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (68Q25)",
  MRnumber =     "1 409 713",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Numerical Anal. and Comput. Sci., R. Inst. of
                 Technol., Stockholm, Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; approximation algorithms;
                 approximation theory; Apx-complete problems;
                 combinatorial problems; computational complexity;
                 k-sets; maximum splitting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Panda:1996:NLT,
  author =       "B. S. Panda",
  title =        "New linear time algorithms for generating perfect
                 elimination orderings of chordal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "111--115",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25)",
  MRnumber =     "97d:05253",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Birla Inst. of Technol.,
                 Ranchi, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "chordal graphs; computational complexity; graph
                 theory; linear time algorithms; maximum cardinality
                 breadth-first search; maximum cardinality depth-first
                 search; MCBFS; MCDFS; perfect elimination orderings;
                 search problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Obokata:1996:POE,
  author =       "Koji Obokata and Yasuaki Nishitani and Yoshihide
                 Igarashi",
  title =        "A probably optimal embedding of hyper-rings in
                 hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "117--122",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C10 68R10)",
  MRnumber =     "97d:68017",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Gunma Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "embeddings; hyper-rings; hypercube networks;
                 hypercubes; optimal embedding; parallel algorithms;
                 probably optimal embedding; process algebra; process
                 graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Seo:1996:AGA,
  author =       "Sang Koo Seo and Yoon Joon Lee",
  title =        "Applicability of genetic algorithms to optimal
                 evaluation of path predicates in object-oriented
                 queries",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "123--128",
  day =          "13",
  month =        may,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4250 (Database
                 theory); C6160J (Object-oriented databases)",
  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/",
  keywords =     "database theory; genetic algorithms; object-oriented
                 database; object-oriented databases; object-oriented
                 queries; path predicate; path predicates; query
                 optimization; query processing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hirata:1996:ULT,
  author =       "Tomio Hirata",
  title =        "A unified linear-time algorithm for computing distance
                 maps",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "129--133",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10",
  MRnumber =     "97j:68137",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4240C (Computational
                 complexity); C5260B (Computer vision and image
                 processing techniques)",
  corpsource =   "Fac. of Eng., Nagoya Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary image; chamfer; chessboard; city block;
                 computational complexity; computer vision; distance
                 maps; Euclidean; Euclidean distance; Euclidean distance
                 transform; image processing; machine vision; matrix
                 searching; octagonal",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ta-Shma:1996:NPV,
  author =       "Amnon Ta-Shma",
  title =        "A note on {PCP} vs. {MIP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "135--140",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q10 68Q25)",
  MRnumber =     "97e:68036",
  MRreviewer =   "M. V. D. Burmester",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Inst. of Comput. Sci., Hebrew Univ., Jerusalem,
                 Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithms; complexity; computational complexity;
                 interactive proof systems; MIP; oracle model; PCP;
                 single-round multi-prover model; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Basten:1996:BBE,
  author =       "Twan Basten",
  title =        "Branching bisimilarity is an equivalence indeed!",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "141--147",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q55)",
  MRnumber =     "97f:68039",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel 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/",
  keywords =     "bisimilarity; branching bisimilarity; concurrency
                 semantics; equivalence classes; equivalence relation;
                 parallel algorithms; process algebra; semi-branching
                 bisimulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liang:1996:NAD,
  author =       "Weifa Liang and Brendan D. McKay and Hong Shen",
  title =        "{NC} algorithms for dynamically solving the all pairs
                 shortest paths problem and related problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "3",
  pages =        "149--155",
  day =          "13",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q22 68R10)",
  MRnumber =     "97d:05251",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4140 (Linear
                 algebra); C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Australian Nat. Univ.,
                 Canberra, ACT, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "all pairs longest paths; all pairs shortest paths
                 problem; computational complexity; concurrent read;
                 CREW PRAM computational model; data structure; data
                 structures; directed acyclic graph; directed graph;
                 directed graphs; directed weighted graph; dynamic
                 solution; edge cost; edge insertions; matrix
                 multiplication; memory cell; NC algorithms; processors;
                 query answering; time; topological order; transitive
                 closure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rehof:1996:SNN,
  author =       "Jakob Rehof",
  title =        "Strong normalization for non-structural subtyping via
                 saturated sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "157--162",
  day =          "27",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (03B40 68N15)",
  MRnumber =     "97f:68114",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "DIKU, Copenhagen, Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "lambda calculus; non-structural subtyping;
                 P-reduction; saturated sets; strong normalization;
                 subtyping systems; type theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ciampolini:1996:AIF,
  author =       "Anna Ciampolini and Evelina Lamma and Paola Mello",
  title =        "An abstract interpretation framework for optimizing
                 dynamic modular logic languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "163--170",
  day =          "27",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17",
  MRnumber =     "97j:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110L (Logic programming)",
  corpsource =   "Dipartimento di Elettronica, Inf. e Sistemistica,
                 Bologna Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract interpretation; dynamic modular logic
                 languages; formal languages; logic language; logic
                 programming; modular logic language; programming
                 languages; search technique",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cai:1996:FPT,
  author =       "Leizhen Cai",
  title =        "Fixed-parameter tractability of graph modification
                 problems for hereditary properties",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "171--176",
  day =          "27",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "97e:68098",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Chinese Univ. of Hong
                 Kong, Shatin, Hong Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; decidability; deciding;
                 fixed-parameter tractability; graph; graph modification
                 problems; graph theory; hereditary properties",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grandi:1996:INP,
  author =       "Piercarlo Grandi",
  title =        "Implementing (nondeterministic) parallel assignments",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "177--179",
  day =          "27",
  month =        may,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110P (Parallel programming); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Wales, Aberystwyth,
                 UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "compilers; multiple assignment; multiple instruction
                 threads; nondeterministic; optimization; parallel;
                 parallel assignments; parallel programming; program
                 compilers; serial computer",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Balachandran:1996:CTC,
  author =       "V. Balachandran and P. Nagavamsi and C. Pandu Rangan",
  title =        "Clique transversal and clique independence on
                 comparability graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "181--184",
  day =          "27",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "97f:68141",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Indian Inst. of Technol., Madras, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "clique independence; clique transversal; comparability
                 graph; comparability graphs; complexity; computational
                 complexity; computational geometry; graph theory; n*n
                 matrices",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Birget:1996:SCC,
  author =       "Jean-Camille Birget",
  title =        "The state complexity of {$\overline{\Sigma^*\overline
                 L}$} and its connection with temporal logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "185--188",
  day =          "27",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (03B45 03D05 03D15 68Q60 68Q68)",
  MRnumber =     "97k:68097",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; deterministic automata;
                 deterministic finite automaton; finite alphabet; finite
                 automata; formal languages; nondeterministic finite
                 automaton; regular language; Sigma *L; state
                 complexity; temporal logic; upper bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hwang:1996:AES,
  author =       "Shin-Jia Hwang and Chin-Chen Chang and Wei-Pang Yang",
  title =        "Authenticated encryption schemes with message
                 linkage",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "189--194",
  day =          "27",
  month =        may,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130S (Data security)",
  corpsource =   "Inst. of Comput. and Inf. Sci., Nat. Chiao Tung Univ.,
                 Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "authenticated encryption schemes; communication costs;
                 computation cost; cryptography; discrete logarithm
                 problem; message authentication; message blocks;
                 message linkage; redundancy schemes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Salomaa:1996:YLT,
  author =       "Kai Salomaa",
  title =        "Yield-languages of two-way pushdown tree automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "195--199",
  day =          "27",
  month =        may,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q68 (03D05 68Q45)",
  MRnumber =     "98a:68134",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory)",
  corpsource =   "Dept. of Math., Turku Univ., Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrary Turing machine; formal languages;
                 homomorphisms; pushdown automata; recursively
                 enumerable languages; regular languages; simulation
                 result; strong representation results; two-way pushdown
                 tree automata; yield-languages",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Malhotra:1996:SED,
  author =       "Vishv M. Malhotra and Bala Srinivasan and Santosh
                 Kulkarni",
  title =        "Storage-efficient data structure for large lookup
                 dictionaries",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "4",
  pages =        "201--206",
  day =          "27",
  month =        may,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques); C7250 (Information storage and
                 retrieval)",
  corpsource =   "Dept. of Comput. Sci., Tasmania Univ., Hobart, Tas.,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "data structures; digital decomposition; digital
                 searching; glossaries; hashing; information retrieval;
                 large lookup dictionaries; multiple bit hashing; search
                 trees; storage-efficient data structure; table lookup",
  treatment =    "P Practical",
}

@Article{Hofmeister:1996:ISG,
  author =       "Thomas Hofmeister and Hanno Lefmann",
  title =        "Independent sets in graphs with triangles",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "207--210",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85",
  MRnumber =     "97g:05152",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lehrstuhl Inf. II, Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; derandomization; fast algorithm;
                 graph theory; graphs; graphs with triangles;
                 independence number; independent set; triangle-free
                 graphs; triangles",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shidlovsky:1996:NDO,
  author =       "Boris Shidlovsky and Elisa Bertino",
  title =        "On the number of descendants in an object {DAG}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "211--216",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (05C85)",
  MRnumber =     "97i:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4250 (Database
                 theory); C6160J (Object-oriented databases)",
  corpsource =   "Dipartimento di Ingegneria dell'Inf. et Matematica
                 Applicata, Salerno Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "closed form; data management systems; database theory;
                 directed graphs; number of descendants; object DAG;
                 object databases; object-oriented databases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Colussi:1996:TSE,
  author =       "Livio Colussi and Alessia {De Col}",
  title =        "A time and space efficient data structure for string
                 searching on large texts",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "217--222",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "97d:68035",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C6120 (File
                 organisation)",
  corpsource =   "Dipartimento di Matematica Pura e Applicata, Padova
                 Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; data structure; large texts;
                 search operation; string matching; string searching;
                 suffix array; suffix tree; tree data structure; tree
                 data structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burns:1996:CTP,
  author =       "Alan Burns and Robert Davis",
  title =        "Choosing task periods to minimise system utilisation
                 in time triggered systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "223--229",
  day =          "10",
  month =        jun,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessing systems); C6150N (Distributed
                 systems software)",
  corpsource =   "Dept. of Comput. Sci., York Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "heuristic; optimal priority ordering; priority based
                 scheduling; processor scheduling; real-time systems;
                 system utilisation; task periods; time triggered
                 systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hui:1996:ASA,
  author =       "Lucas Chi Kwong Hui and Charles U. Martel",
  title =        "Analyzing self-adjusting linear list algorithms with
                 deletions and unsuccessful searches",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "231--236",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68P10)",
  MRnumber =     "97g:68048",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data types; competitive; competitive
                 algorithms; deletions; insertions; linear list
                 algorithms; list processing; MP; self-adjusting;
                 self-adjusting linear list algorithm; successful
                 searches; unsuccessful searches",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dijkstra:1996:EPA,
  author =       "Rutger M. Dijkstra",
  title =        "``Everywhere'' in predicate algebra and modal logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "237--243",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B45 (03B70 03G25 68Q60)",
  MRnumber =     "1 409 950",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://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., Groningen Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "everywhere operator; lattice theory; modal logic;
                 predicate algebra; predicate calculus; process algebra;
                 programming theory; programs; propositional modal
                 logic; reasoning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sharir:1996:EAS,
  author =       "Micha Sharir",
  title =        "Excess in arrangements of segments",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "245--247",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B55 (68U05)",
  MRnumber =     "97g:52034",
  MRreviewer =   "Rade {\v{Z}}ivaljevi{\'c}",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Sch. of Math. Sci., Tel Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 excess; faces; line segments; plane; segment
                 arrangements; segment repetitions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sacca:1996:MTS,
  author =       "Domenico Sacc{\`a}",
  title =        "Multiple total stable models are definitely needed to
                 solve unique solution problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "249--254",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17 (68P15 68Q15 68Q55)",
  MRnumber =     "97i:68044",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity); C6110L
                 (Logic programming); C6140D (High level languages);
                 C6160D (Relational databases)C4250 (Database theory)",
  corpsource =   "Dept. DEIS, Calabria Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bound DATALOG queries; computational complexity;
                 computational linguistics; database theory; DATALOG;
                 formal semantics; logic programming; logic programs;
                 multiple total stable models; negated goals;
                 programming theory; query processing; relational
                 databases; rules; unique solution problem solving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blazewicz:1996:SCI,
  author =       "Jacek B{\l}a\.zewicz and Pascal Bouvry and
                 Fr{\'e}d{\'e}ric Guinand and Denis Trystram",
  title =        "Scheduling complete intrees on two uniform processors
                 with communication delays",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "255--263",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "97d:68018",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessing systems)",
  corpsource =   "Inst. of Comput. Sci., Poznan Tech. Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "communication delays; complete intree scheduling;
                 complete k-ary tree; computational complexity; delays;
                 minimized schedule length; multiprocessing systems;
                 optimal algorithm; parallel algorithms; processor
                 scheduling; trees (mathematics); uniform processors;
                 unit communication times; unit standard execution
                 times",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lim:1996:MAJ,
  author =       "Andrew Lim",
  title =        "Minimum area joining of $k$ compacted cells",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "265--269",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35 (68Q25)",
  MRnumber =     "97b:68101",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1130B (Computer-aided circuit analysis and design);
                 B2570 (Semiconductor integrated circuits); C7410D
                 (Electronic engineering computing)",
  corpsource =   "Inf. Technol. Inst., Singapore",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "channel densities; circuit layout CAD; compacted
                 cells; linear time algorithm; minimum area joining;
                 VLSI",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Binkley:1996:CSQ,
  author =       "Aaron B. Binkley and Stephen R. Schach",
  title =        "A comparison of sixteen quality metrics for
                 object-oriented design",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "271--275",
  day =          "24",
  month =        jun,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C0310F (Software development management); C6110B
                 (Software engineering techniques); C6110J
                 (Object-oriented programming); C6110S (Software
                 metrics)",
  corpsource =   "Dept. of Comput. Sci., Vanderbilt Univ., Nashville,
                 TN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "cohesion; coupling; design quality; fan-in; fan-out;
                 inheritance; inheritance tree; object-oriented design;
                 object-oriented programming; psychological design
                 complexity; quality metrics; software metrics; software
                 quality",
  treatment =    "P Practical",
}

@Article{Cheng:1996:WES,
  author =       "Siu-Wing Cheng",
  title =        "Widest empty {$L$}-shaped corridor",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "277--283",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97b:68220",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://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 =   "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; tree searching; widest empty
                 L-shaped corridor",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ogata:1996:MMV,
  author =       "Wakaha Ogata and Keiichi Sakano and Kaoru Kurosawa",
  title =        "Multisymbol majority vote and hard core",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "285--292",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P25 (68Q25 94A60)",
  MRnumber =     "97d:68047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Himeji Inst. of Technol., Hyogo, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; hard core; k-symbol one-way
                 functions; majority logic; multisymbol majority vote;
                 probabilistic polynomial time algorithm; probability;
                 weak sense majority-vote technique",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Obana:1996:VIS,
  author =       "Satoshi Obana and Kaoru Kurosawa",
  title =        "Veto is impossible in secret sharing schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "293--295",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "97b:94025",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B6120B (Codes);
                 C1160 (Combinatorial mathematics); C6130S (Data
                 security)",
  corpsource =   "Tokyo Inst. of Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "codes; cryptography; geometry; qualified minorities;
                 reconstruction machine; secret sharing schemes; veto
                 capability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Staiger:1996:CSW,
  author =       "Ludwig Staiger",
  title =        "Codes, simplifying words, and open set condition",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "297--301",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (20M05 94B35)",
  MRnumber =     "97f:68101",
  MRreviewer =   "Dong Yang Long",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B6120B (Codes);
                 C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "Inst. f{\"u}r Inf., Martin-Luther-Univ.,
                 Halle-Wittenberg, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Canter space; code messages; codes; deciphering delay;
                 finite alphabet; formal language theory; formal
                 languages; fractals; geometry; infinite strings;
                 iterated function systems; open set condition;
                 simplifying words",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Juurlink:1996:CPB,
  author =       "Ben H. H. Juurlink and Harry A. G. Wijshoff",
  title =        "Communication primitives for {BSP} computers",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "303--310",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q05 68Q22)",
  MRnumber =     "97d:68059",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessing systems)",
  corpsource =   "Dept. of Comput. Sci., Leiden Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2D prefix; bridging model; broadcasting; BSP
                 computers; bulk-synchronous parallel model;
                 communication complexity; communication primitives;
                 duplication; hypercube networks; interconnection
                 topology; K-item broadcast; parallel algorithms;
                 parallel architectures; parallel computers; parallel
                 software; single-item broadcast; sorting;
                 synchronisation; synchronization periodicity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dasgupta:1996:ASU,
  author =       "Pallab Dasgupta and P. P. Chakrabarti and S. C.
                 DeSarkar",
  title =        "Agent search in uniform $b$-ary trees: Multiple goals
                 and unequal costs",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "311--318",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T20",
  MRnumber =     "97f:68166",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4130 (Interpolation and function
                 approximation); C4240C (Computational complexity)",
  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/",
  keywords =     "agent search; backtracking; breadth-first searches;
                 computational complexity; iterative deepening strategy;
                 iterative methods; multiple goals; path generation;
                 recursive backtracking algorithms; retracing; search
                 strategies; state space; tree searching; unequal costs;
                 uniform b-ary trees",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Higham:1996:SEA,
  author =       "Lisa Higham and Teresa Przytycka",
  title =        "A simple, efficient algorithm for maximum finding on
                 rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "319--324",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "97d:68014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); 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/",
  keywords =     "asynchronous unidirectional rings; communication
                 complexity; deterministic algorithm; distributed
                 algorithms; lowest worst-case complexity; maximum
                 finding; maximum identifier",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ahuja:1996:AAP,
  author =       "Mohan Ahuja",
  title =        "Erratum: {``Assertions about past and future in {\em
                 Highways}: Global flush broadcast and
                 flush-vector-time'' [Inform. Process. Lett. {\bf
                 48}(1), 29 October 1993, pp. 21--28]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "325--325",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:05:26 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Ahuja:1993:AAP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Danyi:1996:LEN,
  author =       "G. D{\'a}nyi and Z. F{\"u}l{\"o}p",
  title =        "Letter to the editor: {``A note on the equivalence
                 problem of {$E$}-patterns'' [Inform. Process. Lett.
                 {\bf 57} (1996), no. 3, 125--128; MR 96m:68090]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "6",
  pages =        "327--327",
  day =          "24",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (03B25)",
  MRnumber =     "97g:68122",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Danyi:1996:NEP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Manku:1996:LTA,
  author =       "Gurmeet Singh Manku",
  title =        "A linear time algorithm for the bottleneck biconnected
                 spanning subgraph problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "1--7",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85",
  MRnumber =     "97e:05183",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Indian Inst. of Technol., New
                 Delhi, India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "bottleneck biconnected spanning subgraph problem;
                 computational geometry; edges; graph theory; linear
                 time algorithm; running time; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alstrup:1996:AFI,
  author =       "Stephen Alstrup and Jens Clausen and Kristian
                 J{\o}rgensen",
  title =        "An {$O(|V|*|E|)$} algorithm for finding immediate
                 multiple-vertex dominators",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "9--11",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "1 418 728",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry); C6110 (Systems analysis and
                 programming); C6130B (Graphics techniques); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Copenhagen Univ., Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; data flow analysis; data flow
                 graphs; edges; graph; immediate multiple-vertex
                 dominators; O(V*E) algorithm; program compilers;
                 vertices",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Watjen:1996:DRC,
  author =       "Dietmar W{\"a}tjen and Heike Spilker",
  title =        "Decidability results concerning $k$-limited {ED0L}
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "13--17",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "98a:68121",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Inst. f{\"u}r Theor. Inf., Tech. Univ. Braunschweig,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "context-sensitive grammars; context-sensitive
                 languages; decidability; decidability results;
                 deterministic k-limited E0L systems; emptiness; ET0L
                 languages; finiteness; k-limited ED0L systems;
                 k-limited ET0L systems; k1ET0L systems; membership
                 problem; propagating k1ET0L systems; rewriting;
                 rewriting systems; uncertainty; undecidability
                 results",
  treatment =    "P Practical",
}

@Article{Natschlager:1996:EVD,
  author =       "Thomas Natschl{\"a}ger and Michael Schmitt",
  title =        "Exact {VC}-dimension of {Boolean} monomials",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "19--20",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q99 (68T05)",
  MRnumber =     "97g:68172a",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See also erratum \cite{Natschlager:1996:EEV}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  corpsource =   "Inst. for Theor. Comput. Sci., Tech. Univ. Graz,
                 Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; Boolean monomials; computational
                 complexity; exact VC-dimension; Vapnik--Chervonenkis
                 dimension",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Baeza-Yates:1996:FPA,
  author =       "Ricardo A. Baeza-Yates and Chris H. Perleberg",
  title =        "Fast and practical approximate string matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "21--27",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q20)",
  MRnumber =     "98b:68069",
  MRreviewer =   "Maxime Crochemore",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4240 (Programming and
                 algorithm theory); C6130 (Data handling techniques)",
  corpsource =   "Dept. de Ciencias de la Comput., Chile Univ.,
                 Santiago, Chile",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate string matching; arithmetical operations;
                 linear worst case time; mismatches; partitioning;
                 pattern matching; string matching; string searching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zwick:1996:NAV,
  author =       "Uri Zwick",
  title =        "On the number of {ANDs} versus the number of {ORs} in
                 monotone {Boolean} circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "29--30",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25)",
  MRnumber =     "97h:68043",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B1265B (Logic circuits); C4210 (Formal logic);
                 C4240C (Computational complexity); C5120 (Logic and
                 switching circuits)",
  corpsource =   "Raymond and Beverly Sackler Fac. of Exact Sci., Tel
                 Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "ANDs; Boolean functions; computational complexity;
                 duality; logarithmic factor; logic gates; monotone
                 Boolean circuits; monotone Boolean function; ORs",
  treatment =    "P Practical",
}

@Article{Kuo:1996:SSC,
  author =       "Yu-Chen Kuo and Shing-Tsaan Huang",
  title =        "A simple scheme to construct $k$-coteries with
                 {$O(\sqrt N)$} uniform quorum sizes",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "31--36",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68M10)",
  MRnumber =     "97f:68046",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing); C6150J (Operating systems)",
  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 =     "concurrency control; distributed k-mutual exclusion
                 problem; distributed processing; fault tolerant
                 computing; k-coteries; O( square root N) uniform quorum
                 sizes",
  treatment =    "P Practical",
}

@Article{Bshouty:1996:SEL,
  author =       "Nader H. Bshouty",
  title =        "A subexponential exact learning algorithm for {DNF}
                 using equivalence queries",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "37--39",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68T05)",
  MRnumber =     "97i:68093",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C1240 (Adaptive system theory); C4210L
                 (Formal languages and computational linguistics);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational linguistics;
                 DNF; equivalence classes; equivalence queries; learning
                 (artificial intelligence); PAC-learnable;
                 subexponential exact learning algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Henzinger:1996:NSC,
  author =       "Monika Henzinger and David P. Williamson",
  title =        "On the number of small cuts in a graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "41--44",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C40 (68R10)",
  MRnumber =     "97f:05111",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4260 (Computational
                 geometry)",
  corpsource =   "Syst. Res. Center, Digital Equipment Corp., Palo Alto,
                 CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; graph; graph theory; small
                 cuts; undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1996:FGD,
  author =       "Xiaodong Wang and Qingxiang Fu",
  title =        "A frame for general divide-and-conquer recurrences 1",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "45--51",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (11B37 68R05)",
  MRnumber =     "97k:68085",
  MRreviewer =   "Renzo Sprugnoli",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Fuzhou Univ., China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; divide and conquer methods;
                 general divide-and-conquer algorithms; general
                 divide-and-conquer recurrences; solution tables; time
                 complexities",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Marchetti-Spaccamela:1996:MTO,
  author =       "Alberto Marchetti-Spaccamela and Umberto Nanni and
                 Hans Rohnert",
  title =        "Maintaining a topological order under edge
                 insertions",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "1",
  pages =        "53--58",
  day =          "8",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68P05 68R10)",
  MRnumber =     "97e:05184",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry); C6120 (File organisation)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "amortized time per edge insertion; computational
                 geometry; data structures; directed acyclic graph;
                 directed graphs; dynamic version; edge insertions;
                 space requirement; topological order; vertices",
  treatment =    "P Practical",
}

@Article{Fujito:1996:NAV,
  author =       "Toshihiro Fujito",
  title =        "A note on approximation of the vertex cover and
                 feedback vertex set problems---unified approach",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "59--63",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C70 (68Q25)",
  MRnumber =     "97d:05223",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Hiroshima Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; combinatorial mathematics;
                 combinatorial problems; design of algorithms; feedback
                 vertex set; graph theory; heuristics; optimisation;
                 optimization; undirected graphs; vertex cover",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Howard:1996:PLI,
  author =       "Paul G. Howard and Jeffrey Scott Vitter",
  title =        "Parallel lossless image compression using {Huffman}
                 and arithmetic coding",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "65--73",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(96)00090-7",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); B6140C (Optical information, image
                 and video signal processing); C1250 (Pattern
                 recognition); C1260 (Information theory); C5260B
                 (Computer vision and image processing techniques);
                 C6110P (Parallel programming)",
  corpsource =   "Visual Commun. Res., AT and T Res., Holmdel, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "arithmetic coding; data compression; error modeling;
                 hierarchical MLP; Huffman codes; Huffman coding; image
                 coding; image compression; parallel; parallel
                 algorithms; parallelization; prediction",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Glaister:1996:LBT,
  author =       "Ian Glaister and Jeffrey Shallit",
  title =        "A lower bound technique for the size of
                 nondeterministic finite automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "75--77",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q68 (68Q45)",
  MRnumber =     "97d:68133",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4220 (Automata theory)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "finite automata; formal languages; lower bound;
                 nondeterministic automata; regular language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dunten:1996:SEF,
  author =       "Brian Dunten and Julie Jones and Jonathan Sorenson",
  title =        "A space-efficient fast prime number sieve",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "79--84",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11Y16 (11N36 68Q25)",
  MRnumber =     "97g:11141",
  MRreviewer =   "Samuel S. Wagstaff, Jr.",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Math. and Comput. Sci., Butler Univ.,
                 Indianapolis, IN, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; algorithm theory; computational complexity;
                 number theory; O(n/(log/n loglogn)) space; O(n/loglogn)
                 arithmetic operations; prime number sieve;
                 space-efficient",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barth:1996:OBB,
  author =       "Dominique Barth",
  title =        "Optimal broadcasting in the back to back $d$-ary
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "85--89",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C90 90B12)",
  MRnumber =     "97f:68008",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture)",
  corpsource =   "CNRS, Univ. de Paris-Sud, Orsay, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "back to back; broadcast time; Broadcasting;
                 communication complexity; computer architectures;
                 constant time; d-ary trees; multiprocessor
                 interconnection networks; parallel architectures;
                 parallel machine architecture; processor bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nagumo:1996:LLF,
  author =       "Hideo Nagumo and Mi Lu and Karan Watson",
  title =        "On-line longest fragment first parsing algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "91--96",
  day =          "22",
  month =        jul,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Electr. Eng., Texas A and M Univ., College
                 Station, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "data compression; dictionary indexes; grammars; LFF
                 parsing; longest fragment first parsing; on-line
                 algorithm; static dictionary compression",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Madanlal:1996:TSI,
  author =       "M. S. Madanlal and G. Venkatesan and C. Pandu Rangan",
  title =        "Tree $3$-spanners on interval, permutation and regular
                 bipartite graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "97--102",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C05",
  MRnumber =     "97d:05066",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4260 (Computational
                 geometry)",
  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/",
  keywords =     "computational geometry; graph theory; interval;
                 permutation; regular bipartite graphs; tree 3-spanners;
                 trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ho:1996:LTA,
  author =       "Ting-Yem Ho and Yue-Li Wang and Ming-Tsan Juan",
  title =        "A linear time algorithm for finding all hinge vertices
                 of a permutation graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "103--107",
  day =          "22",
  month =        jul,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68M10 68R10 90B12)",
  MRnumber =     "97e:05182",
  bibdate =      "Sat Feb 04 08:32:40 2012",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
  note =         "See errata \cite{Honma:2011:EAS}.",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods); C4260 (Computational geometry)",
  corpsource =   "Dept. of Inf. Manage., Nat. Inst. of Technol., Taipei,
                 Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "all hinge vertices; computational geometry; critical
                 nodes; linear time algorithm; permutation graph",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chung:1996:SBT,
  author =       "Soon M. Chung and Pyeong S. Mah",
  title =        "Semantics-based transaction management for
                 multidatabase systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "2",
  pages =        "109--115",
  day =          "22",
  month =        jul,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C5640 (Protocols); C6150J (Operating systems);
                 C6160B (Distributed databases); C6170K (Knowledge
                 engineering techniques)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Wright State Univ.,
                 Dayton, OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "atomicity requirement; commit protocol; concurrency
                 control; concurrency control scheme; correctness
                 criterion; distributed databases; flexible transaction
                 model; global subtransactions; multidatabase systems;
                 prepare-to-commit operations; protocols; semantic
                 networks; semantics-based transaction management;
                 transaction processing",
  treatment =    "A Application; P Practical",
}

@Article{Shen:1996:OPS,
  author =       "Hong Shen and Sarnath Ramnath",
  title =        "Optimal parallel selection in sorted matrices",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "117--122",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q22)",
  MRnumber =     "97h:68021",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Sch. of Comput. and Inf. Technol., Griffith Univ.,
                 Nathan, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; EREW PRAM; matrix algebra;
                 parallel algorithm; parallel algorithms; sorted
                 matrices; square matrices; time complexity; work-
                 optimal",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alon:1996:MNB,
  author =       "Noga Alon and Phillip G. Bradford and Rudolf
                 Fleischer",
  title =        "Matching nuts and bolts faster",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "123--127",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68P10)",
  MRnumber =     "97h:68046",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Raymond and Beverly Sackler Fac. of Exact Sci., Tel
                 Aviv Univ., Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "analysis of algorithms; computational complexity;
                 deterministic algorithm; deterministic algorithms;
                 matching nuts and bolts; nuts and bolts; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paun:1996:SST,
  author =       "Gheorghe P{\u{a}}un",
  title =        "Splicing systems with targets are computationally
                 universal",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "129--133",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "97d:68114",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Inst. of Math., Acad. of Sci., Bucharest, Romania",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "DNA computing; extended splicing system; formal
                 languages; H system; recursively enumerable language;
                 regular language; splicing rule",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baier:1996:DLT,
  author =       "Christel Baier and Mila E. Majster-Cederbaum",
  title =        "Denotational linear time semantics and sequential
                 composition",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "135--143",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "1 409 963",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C6110F (Formal methods)",
  corpsource =   "Fakultat f{\"u}r Math. und Inf., Mannheim Univ.,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "denotational linear time semantics; denotational
                 semantics; formal languages; linear time semantics;
                 nondeterministic languages; sequential composition;
                 specification languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aranha:1996:EDA,
  author =       "R. F. M. Aranha and C. Pandu Rangan",
  title =        "An efficient distributed algorithm for centering a
                 spanning tree of a biconnected graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "145--150",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "97d:05247",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 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/",
  keywords =     "biconnected graph; communication complexity;
                 computational complexity; distributed algorithm;
                 distributed algorithms; graph theory; message
                 complexity; spanning tree; time complexity; tree data
                 structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bernasconi:1996:SVB,
  author =       "A. Bernasconi",
  title =        "Sensitivity vs. block sensitivity (an average-case
                 study)",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "151--157",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (94C10)",
  MRnumber =     "97f:68061",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "block sensitivity; Boolean functions; harmonic
                 analysis; sensitivity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morgan:1996:U,
  author =       "Carroll Morgan and Annabelle McIver",
  title =        "Unifying $wp$ and $wlp$",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "159--163",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68N15)",
  MRnumber =     "97e:68083",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4210L (Formal languages and
                 computational linguistics); C6110F (Formal methods)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arithmetic inequality; associated transformer; Boolean
                 functions; Boolean-valued predicate; characteristic
                 functions; computational linguistics; Egli Milner
                 order; extended healthiness conditions; extended
                 predicates; formal logic; formal semantics; isomorphic
                 predicate; program correctness proving; program
                 verification; programming theory; state space;
                 sub-additivity; unification; weakest liberal
                 precondition; weakest precondition; wlp; wp",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moriya:1996:LSL,
  author =       "Tetsuo Moriya and Hideki Yamasaki",
  title =        "Literal shuffle on $\omega$-languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "165--168",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "97d:68113",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Electr. Eng., Kokushikan Univ., Setagaya,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "closure properties; duo; epsilon-free morphisms;
                 formal language; formal languages; formal logic;
                 intersection; inverse epsilon-free morphism; literal
                 shuffle; omega-language family; omega-regular
                 language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DeAgostino:1996:LVL,
  author =       "Sergio {De Agostino} and James A. Storer",
  title =        "On-line versus off-line computation in dynamic text
                 compression",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "3",
  pages =        "169--174",
  day =          "12",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A29",
  MRnumber =     "1 409 968",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C4210 (Formal logic); C4210L (Formal
                 languages and computational linguistics); C4220
                 (Automata theory); C4240C (Computational complexity);
                 C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "coding; computational complexity; data compression;
                 dynamic text compression; encoded string; encoding;
                 finite automata; finite case; grammars; off line
                 computation; often called; on line computation; parse;
                 parsing; rewriting systems; textual substitution;
                 textual substitution method",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Santos:1996:ISB,
  author =       "Francisco Santos",
  title =        "Inscribing a symmetric body in an ellipse",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "175--178",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "52B12 (52B55 68U05)",
  MRnumber =     "98e:52007",
  MRreviewer =   "Ilda P. F. da Silva",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. de Matematicas, Cantabria Univ., Santander,
                 Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "centrally symmetric object; computational geometry;
                 ellipse; Minkowskian geometry; symmetric body",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Goltz:1996:MCA,
  author =       "Ursula Goltz and Heike Wehrheim",
  title =        "Modelling causality via action dependencies in
                 branching time semantics",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "179--184",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55 (68Q10)",
  MRnumber =     "97f:68111",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Inst. f{\"u}r Inf., Hildesheim Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "action dependencies; bisimulation; branching time
                 semantics; causal testing; causality modelling;
                 equivalence classes; formal logic; global dependency
                 relation; history preserving bisimulation; Mazurkiewicz
                 trace theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Panaite:1996:HPR,
  author =       "Petri{\c{s}}or Panaite",
  title =        "Hypercube permutations routable under all dimension
                 orderings",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "185--189",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "97k:68019",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5620 (Computer networks and
                 techniques)",
  corpsource =   "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
                 France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; common clock source;
                 dimension orderings; equally spaced cycles; frequently
                 used bijections; hypercube networks; hypercube
                 permutations; network cycles; packet switching;
                 packet-switched network; processor nodes; shift
                 permutation; synchronous n-dimensional hypercube",
  treatment =    "P Practical",
}

@Article{Young:1996:DMB,
  author =       "Christopher H. Young and Philip A. Wilsey",
  title =        "A distributed method to bound rollback lengths for
                 fossil collection in time warp simulators",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "191--196",
  day =          "26",
  month =        aug,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C5440
                 (Multiprocessing systems); C6185 (Simulation
                 techniques)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Cincinnati Univ.,
                 OH, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "distributed method; distributed processing; event
                 information; fossil collection; GVT; optimistic fossil
                 collection; parallel processing; probability; rollback
                 lengths; time warp simulation; time warp simulators",
  treatment =    "A Application; P Practical",
}

@Article{Holsztynski:1996:CIA,
  author =       "W{\l}odzimierz Holszty{\'n}ski and Waldemar W.
                 Koczkodaj",
  title =        "Convergence of inconsistency algorithms for the
                 pairwise comparisons",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "197--202",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T99",
  MRnumber =     "97h:68132",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4130
                 (Interpolation and function approximation); C6170K
                 (Knowledge engineering techniques)",
  corpsource =   "Dept. of Comput. Sci., Laurentian Univ., Sudbury,
                 Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "convergence of inconsistency algorithms; convergence
                 of numerical methods; formal proof; inference;
                 inference mechanisms; iterative methods; knowledge
                 acquisition; pairwise comparisons; pc matrix",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Szepietowski:1996:EDP,
  author =       "Andrzej Szepietowski",
  title =        "The element distinctness problem on one-tape {Turing}
                 machines",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "203--206",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q05)",
  MRnumber =     "97f:68075",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory); C4240C (Computational
                 complexity)",
  corpsource =   "Inst. of Math., Gdansk Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; element distinctness
                 problem; lower bounds; one-tape Turing machines; short
                 numbers; time complexity; Turing machines; upper
                 bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alsuwaiyel:1996:FSH,
  author =       "Muhammad H. Alsuwaiyel",
  title =        "Finding a shortest {Hamiltonian} path inside a simple
                 polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "207--210",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C45 (68R10)",
  MRnumber =     "97h:05110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Inf. and Comput. Sci., King Fahd Univ. of
                 Pet. and Miner., Dhahran, Saudi Arabia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computation time; computational complexity;
                 computational geometry; fixed endpoints; fixed source
                 point; inter-point distances; minimum Euclidean length;
                 optimal path; optimisation; shortest Hamiltonian path;
                 simple polygon; simply connected region; watchman
                 route",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Borchert:1996:SCR,
  author =       "Bernd Borchert and Antoni Lozano",
  title =        "Succinct circuit representations and leaf language
                 classes are basically the same concept",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "211--215",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q05)",
  MRnumber =     "97f:68047",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Heidelberg Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity theory; computational complexity; graph
                 theory; leaf language classes; polynomial-time many-
                 one completeness; succinct circuit representations;
                 succinct version; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tseng:1996:ERH,
  author =       "Yu-Chee Tseng",
  title =        "Embedding a ring in a hypercube with both faulty links
                 and faulty nodes",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "217--222",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15 (05C10 68M10)",
  MRnumber =     "97i:68023",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Central
                 Univ., Chung-Li, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "binary n-cube; fault tolerant computing; faulty edges;
                 faulty vertices; graph theory; hypercube; hypercube
                 networks; ring embedding",
  treatment =    "A Application; P Practical",
}

@Article{Athithan:1996:HNP,
  author =       "G. Athithan and T. Sony Roy",
  title =        "Hyperspherical neighbourhoods and pattern recognition
                 using neural networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "223--228",
  day =          "26",
  month =        aug,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6140C (Optical information, image and video signal
                 processing); C1230D (Neural nets); C1250 (Pattern
                 recognition); C4260 (Computational geometry)",
  corpsource =   "Adv. Numerical Res. and Anal. Group, Hyderabad,
                 India",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate algorithm; computational geometry; exact
                 algorithm; hyperspheres; hyperspherical neighbourhoods;
                 maximal neighbourhoods; metric spaces; neural nets;
                 neural networks; numerical simulations; pattern
                 recognition",
  treatment =    "A Application; P Practical",
}

@Article{Ivkovic:1996:FRF,
  author =       "Zoran Ivkovi{\'c} and Errol L. Lloyd",
  title =        "A fundamental restriction on fully dynamic maintenance
                 of bin packing",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "4",
  pages =        "229--232",
  day =          "26",
  month =        aug,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "97e:68037",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1290 (Applications of systems theory)",
  corpsource =   "Sch. of Manage., Yale Univ., New Haven, CT, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate solution; bin packing; competitive ratio;
                 fixed constant upper bound; fully dynamic maintenance;
                 operations research; time-efficient fully dynamic
                 approximation algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bollig:1996:ELC,
  author =       "Beate Bollig and Martin L{\"o}bbing and Ingo Wegener",
  title =        "On the effect of local changes in the variable
                 ordering of ordered decision diagrams",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "233--239",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q05)",
  MRnumber =     "97e:68043",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4210 (Formal
                 logic); C4230 (Switching theory); C4240C (Computational
                 complexity); C5210 (Logic design methods)",
  corpsource =   "Fachbereich Inf., Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "benchmark circuits; Boolean functions; computational
                 complexity; decision tables; local changes; local
                 search; logic design; logic testing; NP-hard; OBDDs;
                 OFDDs; optimal variable ordering; simulated annealing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baeza-Yates:1996:FAS,
  author =       "Ricardo A. Baeza-Yates and Luis O. Fuentes",
  title =        "A framework to animate string algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "241--244",
  day =          "9",
  month =        sep,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110V
                 (Visual programming)",
  corpsource =   "Dept. de Ciencias de la Comput., Chile Univ.,
                 Santiago, Chile",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm animation system; algorithm theory; computer
                 animation; data generation tools; sequences of symbols;
                 string algorithms; string matching; string searching;
                 visual programming; visualization; Xaa",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Romijn:1996:NFA,
  author =       "Judi Romijn and Frits Vaandrager",
  title =        "A note on fairness in {I/O} automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "245--250",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68Q68)",
  MRnumber =     "97f:68125",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "CWI, Amsterdam, Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "automata theory; fair executions; fair I/O automaton;
                 fairness; fairness sets; I/O automata; live I/O
                 automaton; liveness; reachable state",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Turan:1996:SDT,
  author =       "Gy{\"o}rgy Tur{\'a}n and Farrokh Vatan",
  title =        "A size-depth trade-off for the analog computation of
                 {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "251--254",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05 (68Q25)",
  MRnumber =     "98c:68054",
  MRreviewer =   "Christoph Meinel",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory);
                 C4240C (Computational complexity)",
  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/",
  keywords =     "Boolean functions; complexity of computation;
                 computational complexity; feedforward neural networks;
                 real-valued complexity classes; real-valued models;
                 size-depth trade-off",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nielsen:1996:OSP,
  author =       "Franck Nielsen",
  title =        "Output-sensitive peeling of convex and maximal
                 layers",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "255--259",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97e:68138",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Nice Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; computational geometry; convex and
                 maximal layers; operations research; output-sensitive
                 algorithm; pattern recognition; peeling; statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{HernandezBarrera:1996:ADC,
  author =       "Antonio {Hern{\'a}ndez Barrera}",
  title =        "Algorithms for deciding the containment of polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "261--265",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97g:68226",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Math., Hiroshima Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithms; computational complexity; computational
                 geometry; containment of polygons; deciding;
                 rectilinear; time complexities",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Plandowski:1996:PTC,
  author =       "Wojciech Plandowski and Wojciech Rytter and Tomasz
                 Szymacha",
  title =        "Parallel tree-contraction and {Fibonacci} numbers",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "267--271",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q22 68R05)",
  MRnumber =     "97e:68031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorics of trees; Fibonacci numbers; parallel
                 algorithms; parallel tree contraction; series
                 (mathematics); tree contraction algorithm; tree data
                 structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tanaka:1996:NLC,
  author =       "Keisuke Tanaka and Tetsuro Nishino and Robert Beals",
  title =        "Negation-limited circuit complexity of symmetric
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "273--279",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q15 94C10)",
  MRnumber =     "97i:68099",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory);
                 C4240C (Computational complexity)",
  corpsource =   "Sch. of Inf. Sci., Japan Adv. Inst. of Sci. and
                 Technol., Ishikawa, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; boolean functions; circuit
                 complexity; computational complexity; logic gates;
                 minimisation of switching nets; NEGATION gates;
                 negation-limited; negation-limited circuits; nonlinear
                 lower bounds; symmetric functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ghosh:1996:EFC,
  author =       "Sukumar Ghosh and Arobinda Gupta",
  title =        "An exercise in fault-containment: self-stabilizing
                 leader election",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "5",
  pages =        "281--288",
  day =          "9",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68M15)",
  MRnumber =     "97e:68029",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "distributed algorithms; distributed computing; fault
                 tolerant computing; fault-containment; fault-tolerance;
                 leader election; leader election protocol;
                 self-stabilizing algorithms; single transient fault",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Czumaj:1996:PMI,
  author =       "Artur Czumaj and Krzysztof Diks and Teresa M.
                 Przytycka",
  title =        "Parallel maximum independent set in convex bipartite
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "289--294",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q22)",
  MRnumber =     "97f:68143",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Paderborn",
  affiliationaddress = "Ger",
  classification = "722.1; 722.4; 723; 723.1; 921.4; C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Math. and Comput. Sci., Paderborn Univ.,
                 Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; arbitrary CRCW PRAM; computational
                 complexity; Convex bipartite graphs; convex bipartite
                 graphs; Graph theory; graph theory; independent
                 vertices; O(log/sup 2/(n))-time n-processor EREW PRAM
                 algorithm; parallel maximum independent set; Parallel
                 processing systems; Parallel random access memory
                 (pram); Program processors; Random access storage; Set
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Deineko:1996:CHL,
  author =       "Vladimir G. De{\u{\i}}neko and Gerhard J. Woeginger",
  title =        "The convex-hull-and-$k$-line travelling salesman
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "295--301",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (90B35)",
  MRnumber =     "97f:90072",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Universtat Graz",
  affiliationaddress = "Austria",
  classification = "723; 921; 921.1; 921.4; 921.5; B0250 (Combinatorial
                 mathematics); B0260 (Optimisation techniques); C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4240C (Computational complexity)",
  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; Combinatorial mathematics; computational
                 complexity; convex-hull-and-k-line travelling salesman
                 problem; Euclidean TSP; Matrix algebra; Optimization;
                 Polynomial time solution; polynomial time solution
                 algorithm; Polynomials; Problem solving; Travelling
                 salesman problem (TSP); travelling salesman problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Seidl:1996:FSN,
  author =       "Helmut Seidl",
  title =        "Fast and simple nested fixpoints",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "303--308",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "97g:68158",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Trier",
  affiliationaddress = "Ger",
  classification = "721.1; 921; 921.6; C4130 (Interpolation and function
                 approximation); C4210 (Formal logic); C4240C
                 (Computational complexity)",
  corpsource =   "Trier Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Alternation depth; calculus; complete lattice;
                 Computational complexity; computational complexity;
                 Computational linguistics; formal logic; Iterative
                 methods; iterative methods; model checking; Nested
                 fixpoint expressions; nested fixpoints; Theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DePrisco:1996:NEP,
  author =       "Roberto {De Prisco} and Giuseppe Parlati and Giuseppe
                 Persiano",
  title =        "A note on the expected path length of trees with known
                 fringe",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "309--315",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q25)",
  MRnumber =     "97f:68020",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "MIT Lab for Computer Science",
  affiliationaddress = "MA, USA",
  classification = "721.1; 723; 723.2; 921.1; 921.4; C1140Z (Other
                 topics in statistics); C1160 (Combinatorial
                 mathematics); C6120 (File organisation)",
  corpsource =   "MIT, Cambridge, MA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Algorithms; Binary sequences; Binary trees;
                 Critical path analysis; Data structures; efficiency
                 measure; expected path length; Fringe; fringe; maximal
                 path length; minimal path length; Path length;
                 probability; root-leaf paths; tree data structures;
                 Trees (mathematics); trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rescigno:1996:CCP,
  author =       "Adele A. Rescigno",
  title =        "On the communication complexity of polling",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "317--323",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q10 68Q25)",
  MRnumber =     "97e:68011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Salerno",
  affiliationaddress = "Italy",
  classification = "721; 721.1; 722.4; 723; 723.1.1; 921.5; B6150C
                 (Communication switching); C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
                 Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Broadcasting; communication complexity;
                 communication network; communication time;
                 Computational complexity; cost function; Distributed
                 computer systems; Interconnection networks;
                 multiprocessor interconnection networks; NP-complete;
                 optimal communication cost algorithm; Optimization;
                 Polling; polling; Query languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ustimenko:1996:ATL,
  author =       "A. P. Ustimenko",
  title =        "Algebra of two-level cause-effect structures",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "325--330",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q05 68Q90)",
  MRnumber =     "97i:68075",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Russian Acad of Sciences",
  affiliationaddress = "Russia",
  classification = "721.1; 921; 921.1; 921.4; B0210 (Algebra); B0250
                 (Combinatorial mathematics); C1110 (Algebra); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk,
                 Russia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "coloured nodes; Computational complexity; distributive
                 axiom; Equivalence classes; Mathematical operators;
                 Petri nets; Polynomials; polynomials; Problem solving;
                 Set theory; strong equivalence; Theorem proving; Two
                 level cause effect structures (TCES); two-level
                 cause-effect structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tokunaga:1996:INT,
  author =       "Shin-ichi Tokunaga",
  title =        "Intersection number of two connected geometric
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "331--333",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C38 (05C05 68R10)",
  MRnumber =     "97f:05107",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Ikashika Univ",
  affiliationaddress = "Jpn",
  classification = "723.2; 921; 921.4; B0250 (Combinatorial
                 mathematics); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Appl. Math., Tokyo Ikashika Univ., Ichikawa,
                 Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Critical path analysis; Finite points; Geometric
                 graphs; geometric graphs; Geometric spanning trees;
                 geometric spanning trees; Geometry; graph colouring;
                 intersection number; Problem solving; Set theory;
                 Theorem proving; Trees (mathematics); trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Melkman:1996:APC,
  author =       "Avraham A. Melkman and Solomon E. Shimony",
  title =        "Algorithms for parsimonious complete sets in directed
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "59",
  number =       "6",
  pages =        "335--339",
  day =          "23",
  month =        sep,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10 68T15)",
  MRnumber =     "97h:05167",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ben Gurion Univ of the Negev",
  affiliationaddress = "Isr",
  classification = "721.1; 921; 921.4; C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm theory);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Math. and Comput. Sci., Ben-Gurion Univ. of
                 the Negev, Beer-Sheva, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "abduction; Acyclic graphs; Algorithms; complete sets;
                 Computational complexity; computational complexity;
                 Directed graphs; directed graphs; Graph theory;
                 parsimonious; Parsimonious complete sets; parsimonious
                 complete sets; Problem solving; proof graphs; Set
                 theory; theorem proving; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Julia:1996:CCG,
  author =       "S. Julia and I. Litovsky and B. Patrou",
  title =        "On codes, $\omega$-codes and $\omega$-generators",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "1--5",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q70 68R15)",
  MRnumber =     "97k:68100",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C1260 (Information theory); C4210L
                 (Formal languages and computational linguistics)",
  corpsource =   "Nice Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "codes; formal languages; free submonoid; greatest
                 omega-generator; omega-codes; omega-generators;
                 rational codes; rational language; three-element code",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Makki:1996:DAD,
  author =       "S. A. M. Makki and George Havas",
  title =        "Distributed algorithms for depth-first search",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "7--12",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q10 68R10)",
  MRnumber =     "97f:68010",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4240P (Parallel
                 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/",
  keywords =     "backtracking; communication graphs; communication
                 network; depth-first search; distributed algorithms;
                 dynamic backtracking; network topology; search tree;
                 tree searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Garcia:1996:UTM,
  author =       "Alfredo Garc{\'\i}a and Javier Tejel",
  title =        "Using total monotonicity for two optimization problems
                 on the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "13--17",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (68Q25 68U05)",
  MRnumber =     "97f:90073",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240C (Computational
                 complexity); C4260 (Computational geometry)",
  corpsource =   "Fac. de Ciencias, Zaragoza Univ., Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; computational complexity; computational
                 geometry; convex polygon; Hamiltonian curve; minimum
                 Hamiltonian curve; optimisation; optimization problems;
                 total monotonicity; totally monotone matrices;
                 travelling salesman problem; travelling salesman
                 problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1996:SDM,
  author =       "Dong-Tsan Lee",
  title =        "Semantic data modelling using linear logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "19--27",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (03F50 68T30)",
  MRnumber =     "1 420 324",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Western Australia Univ.,
                 Nedlands, WA, Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "data structures; database events; database theory;
                 formal logic; linear logic; representations; semantic
                 data modelling; semantics; transition constraints;
                 update operators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Giakoumakis:1996:LGN,
  author =       "Vassilis Giakoumakis",
  title =        "${P}_4$-laden graphs: {A} new class of brittle
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "29--36",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C75 (05C15 68R10)",
  MRnumber =     "97i:05108",
  MRreviewer =   "Chinh T. Hoang",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Amiens Univ., France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm theory; brittle graphs; classical
                 optimization; graph theory; modular decomposition;
                 P/sub 4/-laden graphs; P/sub 4/-lite graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Otto:1996:FOQ,
  author =       "Martin Otto and Jan {Van den Bussche}",
  title =        "First-order queries on databases embedded in an
                 infinite structure",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "37--41",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (03B70 03C68)",
  MRnumber =     "97g:68056",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory);
                 C6160D (Relational databases)",
  corpsource =   "Tech. Hochschule Aachen, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "auxiliary linear ordering; background structure;
                 database theory; first-order queries; formal logic;
                 generic query; isomorphism-invariant queries; query
                 processing; relational databases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{AlJabri:1996:UDU,
  author =       "A. Kh. {Al Jabri}",
  title =        "The unicity distance: {An} upper bound on the
                 probability of an eavesdropper successfully estimating
                 the secret key",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "43--47",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "97g:94016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); B6110
                 (Information theory); B6120B (Codes); C1140
                 (Probability and statistics); C1260 (Information
                 theory); C6130S (Data security)",
  corpsource =   "Dept. of Electr. Eng., King Saud Univ., Riyadh, Saudi
                 Arabia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "ciphertext; ciphertext symbols; cryptography;
                 distributed systems; information theory; probability;
                 secret-key cipher; unicity distance; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wegener:1996:CEA,
  author =       "Ingo Wegener",
  title =        "On the complexity of encoding in analog circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "1",
  pages =        "49--52",
  day =          "14",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (94C10)",
  MRnumber =     "97f:68077",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory);
                 C4240C (Computational complexity); C5120 (Logic and
                 switching circuits)",
  corpsource =   "Fachbereich Inf., Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "analog circuits; analogue circuits; Boolean functions;
                 Boolean vector; complexity of encoding; computational
                 complexity; logic circuits; one-to-one mapping",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Melancon:1996:VFI,
  author =       "Guy Melan{\c{c}}on",
  title =        "{Viennot} factorization of infinite words",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "53--57",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15",
  MRnumber =     "97k:68137",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  corpsource =   "LaBRI, Bordeaux I Univ., Talence, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial mathematics; combinatorial problems;
                 computational linguistics; formal languages; infinite
                 words; Lyndon factorization theorem; Viennot
                 factorization theorem; word division; word
                 periodicity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Veloso:1996:PCM,
  author =       "Paulo A. S. Veloso",
  title =        "On pushout consistency, modularity and interpolation
                 for logical specifications",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "59--66",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B70)",
  MRnumber =     "98d:68144",
  MRreviewer =   "G. Mirkowska",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110F (Formal methods)",
  corpsource =   "Dept. de Inf., Pontificia Univ. Catolica do Rio de
                 Janeiro, Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algebraic specification; data structures; data types;
                 extension modularity; internalization techniques;
                 interpolation; joint consistency; logical
                 specifications; logical theorems; modularization
                 theorem; pushout consistency",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sere:1996:PAR,
  author =       "K. Sere",
  title =        "Procedures and atomicity refinement",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "67--74",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68Q10)",
  MRnumber =     "97g:68159",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Appl. Math., Kuopio Univ.,
                 Finland",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "action system; atomicity refinement; distributed
                 algorithm; early return; parallel algorithm; parallel
                 algorithms; procedures; program derivation; program
                 specification; programming theory; refinement calculus;
                 remote procedure call; remote procedure calls; return
                 statement",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Reingold:1996:LAL,
  author =       "Nick Reingold and Jeffery Westbrook",
  title =        "Off-line algorithms for the list update problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "75--80",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q25)",
  MRnumber =     "98a:68038",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data types; competitive analysis;
                 computational complexity; dictionary; linear list; list
                 length; list processing; list update problem; optimum
                 offline algorithms; search problems; sequential
                 search",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shiau:1996:FMF,
  author =       "Shyue-Horng Shiau and Chang-Biau Yang",
  title =        "A fast maximum finding algorithm on broadcast
                 communication",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "81--89",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q22)",
  MRnumber =     "97i:68018",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); 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/",
  keywords =     "active processors; broadcast communication; broadcast
                 conflict; communication complexity; conflict resolution
                 scheme; Ethernet; fast maximum finding algorithm; layer
                 concept; local area networks; message broadcasting;
                 message passing; multiprocessor interconnection
                 networks; parallel algorithms; parallel computation
                 models; shared channel; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gopalakrishnan:1996:SAE,
  author =       "K. Gopalakrishnan and D. R. Stinson",
  title =        "A simple analysis of the error probability of
                 two-point based sampling",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "91--96",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (05B15 68Q10)",
  MRnumber =     "97g:68173",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140 (Probability and statistics); C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wichita State Univ., KS, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "combinatorial analysis; combinatorial mathematics;
                 combinatorial structures; derandomization; error
                 analysis; error probability; orthogonal arrays;
                 probability; randomised algorithms; randomized
                 algorithms; statistical analysis; two-point based
                 sampling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eades:1996:TKB,
  author =       "Peter Eades and Charles Stirk and Sue Whitesides",
  title =        "The techniques of {Komolgorov} and {Bardzin} for
                 three-dimensional orthogonal graph drawings",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "97--103",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q35 68R10)",
  MRnumber =     "97m:68195",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Newcastle Univ., NSW,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "3D orthogonal graph drawings; complexity;
                 computational complexity; computational geometry;
                 cortex neural networks; data visualisation; geometric
                 representations; graph drawing algorithms; graph
                 theory; grid drawings; information engineering;
                 relational information visualization; software
                 engineering; three-dimensional orthogonal graph
                 drawing; vertices; VLSI layout",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1996:ERS,
  author =       "Danny Z. Chen and Kevin S. Klenk",
  title =        "Erratum to {``Rectilinear short path queries among
                 rectangular obstacles''. Information Processing Letters
                 57 (6) (25 March 1996) 313--319}",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "105--105",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:48 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Chen:1996:RSP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Natschlager:1996:EEV,
  author =       "Thomas Natschl{\"a}ger and Michael Schmitt",
  title =        "Erratum to {``Exact VC-dimension of Boolean
                 monomials'' Information Processing Letters 59 (1) (8
                 July 1996) 19--20}",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "107--107",
  day =          "28",
  month =        oct,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q99 (68T05)",
  MRnumber =     "97g:68172b",
  bibdate =      "Sat Nov 7 17:55:48 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Natschlager:1996:EVD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Banach:1996:TTG,
  author =       "R. Banach",
  title =        "Transitive term graph rewriting",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "109--114",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (68Q10 68R10)",
  MRnumber =     "97g:68110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Manchester Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Church--Rosser properties; distributed algorithms;
                 distributed machines; ease of implementation; graph
                 grammars; orthogonal systems; rewriting systems;
                 semantics; transitive redirections; transitive term
                 graph rewriting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Erlingsson:1996:EMR,
  author =       "{\'U}lfar Erlingsson and Mukkai Krishnamoorthy and T.
                 V. Raman",
  title =        "Efficient multiway radix search trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "115--120",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N20 (68P05)",
  MRnumber =     "1 423 917",
  bibdate =      "Fri Feb 17 18:47:15 2006",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "ftp://ftp.cs.princeton.edu/pub/packages/lcc/contrib/mrst.shar;
                 http://www.cs.princeton.edu/software/lcc/doc/mrst.pdf",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6120 (File
                 organisation)",
  corpsource =   "Rensselaer Polytech. Inst., Troy, NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "code generation; file organisation; imperative
                 languages; multiway radix search trees; set theory;
                 sparse case sets; static search trees; switch
                 statements; timing; tree searching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Schwarzkopf:1996:RSL,
  author =       "Otfried Schwarzkopf and Jules Vleugels",
  title =        "Range searching in low-density environments",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "121--127",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97g:68230",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4260 (Computational geometry); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Pohang Univ. of Sci. and
                 Technol., South Korea",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "arbitrarily-shaped objects; axis-parallel hypercube
                 intersects; computational geometry; data structure;
                 data structures; low-density environments; path
                 planning; point location; query ranges; range search
                 queries; range searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chou:1996:SPT,
  author =       "Ching-Tsun Chou",
  title =        "Simple proof techniques for property preservation via
                 simulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "129--134",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (03B70 68Q60)",
  MRnumber =     "97h:68031",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1220 (Simulation, modelling and identification);
                 C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Fujitsu Labs. of America, Santa Clara, CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "formal logic; grammars; infinitary logics; modular
                 proofs; nontrivial results; proof techniques; property
                 preservation; reactive systems; simulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1996:DSO,
  author =       "Tsong Yueh Chen and Man Fai Lau",
  title =        "Dividing strategies for the optimization of a test
                 suite",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "135--141",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "97g:68149",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory); C6110B (Software engineering
                 techniques); C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "divide and conquer methods; divide-and-conquer
                 approach; dividing strategies; optimal solution
                 reconstruction; optimisation; program testing;
                 programming theory; regression testing; set covering;
                 set theory; simulation; software test suite
                 optimization; software testing; statistical analysis;
                 sub-problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Prather:1996:SPS,
  author =       "Ronald E. Prather",
  title =        "The subprogram problem for software metric design",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "143--149",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N05",
  MRnumber =     "97g:68025",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C6110S (Software
                 metrics)",
  corpsource =   "Dept. of Comput. Sci., Trinity Univ., San Antonio, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; coupling complexity; exact
                 computation; iterative computational approach;
                 iterative methods; matrix algebra; matrix analysis;
                 software metric design; software metrics; subprogram
                 calls; subprogram coupling pattern; subroutines;
                 tightly-coupled modules",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hunt:1996:EAC,
  author =       "Galen C. Hunt and Maged M. Michael and Srinivasan
                 Parthasarathy and Michael L. Scott",
  title =        "An efficient algorithm for concurrent priority queue
                 heaps",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "151--157",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q10)",
  MRnumber =     "1 423 922",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140C (Queueing theory); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory); C6110P (Parallel programming); C6120 (File
                 organisation); C6150N (Distributed systems software)",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "array-based priority queue heaps; bit-reversal
                 technique; bottom-up insertions; computational
                 complexity; concurrency control; concurrent access;
                 consecutive insertions; contention reduction; data
                 structures; efficient algorithm; mixed
                 insertion/deletion workloads; parallel algorithms;
                 parallel operations; performance improvements; queueing
                 theory; scattered accesses; Silicon Graphics Challenge
                 multiprocessor; software performance evaluation;
                 synchronization; top-down deletions; tree data
                 structures; tree fringe",
  treatment =    "P Practical; T Theoretical or Mathematical; X
                 Experimental",
}

@Article{Liang:1996:FBC,
  author =       "Y. Daniel Liang and Chongkye Rhee",
  title =        "Finding biconnected components in {$O(n)$} time for a
                 class of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "3",
  pages =        "159--163",
  day =          "11",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "97g:68183",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Indiana Univ., Fort Wayne, IN,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "biconnected components; computational complexity;
                 connected induced subgraph; interval graphs;
                 linear-time algorithm; nonleaf vertex; permutation
                 graphs; rooted tree; single-branch breadth-first search
                 tree; single-branch tree; tree searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Christie:1996:SPB,
  author =       "David A. Christie",
  title =        "Sorting permutations by block-interchanges",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "165--169",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68R05 92D20)",
  MRnumber =     "97i:68082",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "block-interchange diameter; block-interchanges;
                 computational complexity; global rearrangements;
                 permutations; polynomial-time algorithm; sorting;
                 string comparison; string matching; symmetric group",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bax:1996:FDS,
  author =       "Eric Bax and Joel Franklin",
  title =        "A finite-difference sieve to count paths and cycles by
                 length",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "171--176",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C38 (05C85 68Q25 68R10)",
  MRnumber =     "97h:05096",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0290P
                 (Differential equations); C1160 (Combinatorial
                 mathematics); C4170 (Differential equations); C4240C
                 (Computational complexity)",
  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/",
  keywords =     "combinatorial mathematics; computational complexity;
                 counting cycles; counting paths; directed graph;
                 directed graphs; finite difference methods;
                 finite-difference sieve; space complexity; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wagh:1996:HCT,
  author =       "Meghanad D. Wagh and Jiancheng Mo",
  title =        "{Hamilton} cycles in {Trivalent Cayley} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "177--181",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C25 05C45 68M10)",
  MRnumber =     "97i:68157",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture)",
  corpsource =   "Dept. of Comput. Sci. and Electr. Eng., Lehigh Univ.,
                 Bethlehem, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computer architecture; graph theory; Hamilton cycle;
                 interconnection networks; mapping; multiprocessor
                 interconnection networks; near recursive; parallel
                 algorithms; Trivalent Cayley graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1996:POM,
  author =       "Yen-Chun Lin",
  title =        "Perfectly overlapped merging and sorting on a two-way
                 linear array",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "183--187",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q25)",
  MRnumber =     "97i:68050",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 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/",
  keywords =     "computational complexity; merge sorting; merging;
                 overlapped merging; parallel algorithms;
                 runs-generation algorithm; sorting; time complexity;
                 two-way linear array",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alidaee:1996:SSP,
  author =       "Bahram Alidaee and Ahmad Ahmadian",
  title =        "Scheduling on a single processor with variable speed",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "189--193",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "97i:68024",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1290F (Systems theory applications in industry);
                 C4240C (Computational complexity)",
  corpsource =   "Dept. of Manage. and Marketing, Mississippi Univ., MS,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; makespan; polynomial time
                 algorithms; scheduling; scheduling objectives; single
                 machine scheduling; total flow time; varying processing
                 times",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kitsios:1996:SOH,
  author =       "Nectarios Kitsios and Athanasios Tsakalidis",
  title =        "Space-optimal hidden line elimination for rectangles",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "195--200",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97i:68203",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Eng. and Inf., Patras Univ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 hidden line; hidden line elimination; iso-oriented
                 rectangles; rectangles",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nitsche:1996:ASP,
  author =       "Ulrich Nitsche and Peter Ochsenschl{\"a}ger",
  title =        "Approximately satisfied properties of systems and
                 simple language homomorphisms",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "201--206",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68Q45)",
  MRnumber =     "97i:68135",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  corpsource =   "Inst. TKT, GMD-German Nat. Res Centre for Inf.
                 Technol., Darmstadt, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximate satisfaction; Cantor topology; complexity;
                 computational complexity; formal languages;
                 homomorphism; liveness; omega-languages; safety;
                 satisfied properties; simple language homomorphisms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Buhaceanu:1996:FDA,
  author =       "D. S. Buh{\u{a}}ceanu and W. H. J. Feijen",
  title =        "Formal derivation of an algorithm for distributed
                 phase synchronization",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "207--213",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "1 435 154",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110P (Parallel programming)",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "communication facilities; design heuristics;
                 distributed algorithms; distributed phase
                 synchronization; multibounds; multiprogramming;
                 neighbouring nodes; parallel programming; parallel
                 programs; phase synchronization; predicate calculus;
                 program derivation; theory of Owicki and Gries",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cusick:1996:BNFb,
  author =       "Thomas W. Cusick and Pantelimon St{\u{a}}nic{\u{a}}",
  title =        "Bounds on the number of functions satisfying the
                 {Strict Avalanche Criterion}",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "215--219",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "1 435 155",
  bibdate =      "Sun May 02 08:32:59 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Youssef:1996:CBN}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230 (Switching theory);
                 C6130S (Data security)",
  corpsource =   "Dept. of Math., State Univ. of New York, Buffalo, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean function; Boolean functions; counting
                 functions; cryptographic functions; cryptography;
                 strict avalanche criterion",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kloks:1996:FFG,
  author =       "T. Kloks",
  title =        "{$K_{1,3}$}-free and {$W_4$}-free graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "4",
  pages =        "221--223",
  day =          "25",
  month =        nov,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C35 (05C85 68R10)",
  MRnumber =     "97i:05071",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity); C4260 (Computational geometry)",
  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/",
  keywords =     "computational complexity; computational geometry;
                 dominoes; graph theory; induced subgraph; K/sub
                 1,3/-free graphs; maximal cliques; maximum clique
                 problem; NP-completeness; recognition algorithm;
                 solution time; W/sub 4/n-free graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chlebikova:1996:AMB,
  author =       "Janka Chleb{\'\i}kov{\'a}",
  title =        "Approximating the {Maximally Balanced Connected
                 Partition Problem} in graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "225--230",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C85 68R10)",
  MRnumber =     "98a:68093",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0260
                 (Optimisation techniques); C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240C
                 (Computational complexity)",
  corpsource =   "Fac. of Math. and Phys., Comenius Univ., Bratislava,
                 Slovakia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "approximation theory; computational complexity;
                 connected graph; connected partition; disjoint sets;
                 graph theory; maximally balanced connected partition
                 approximation; NP-hard problem; optimisation;
                 optimization; polynomial-time algorithm;
                 polynomial-time approximation algorithm; subgraphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Skillicorn:1996:PTD,
  author =       "D. B. Skillicorn",
  title =        "A parallel tree difference algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "231--235",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22",
  MRnumber =     "1 435 841",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation); C6130 (Data handling 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/",
  keywords =     "computational complexity; edit sequence algorithm;
                 expected parallel execution time; expected sequential
                 execution time; hypermedia; hypertext; parallel
                 algorithms; parallel tree difference algorithm;
                 structured text; text editing; tree data structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sun:1996:TRH,
  author =       "Yong Sun",
  title =        "Term rewriting and {Hoare} logic --- {Coded}
                 rewriting",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "237--242",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (68Q60)",
  MRnumber =     "1 435 842",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Queen's Univ., Belfast, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algebra; coded algebra; coded rewriting; derivations;
                 dual objects; formal logic; Hoare logic; morphisms;
                 programs; proofs; rewrite rules; rewriting system;
                 rewriting systems; term rewriting; transitive-reflexive
                 closure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Venema:1996:NAS,
  author =       "Sven Venema and Hong Shen and Francis Suraweera",
  title =        "{NC} algorithms for the {Single Most Vital Edge}
                 problem with respect to shortest paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "243--248",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q22 68Q25)",
  MRnumber =     "97k:68135",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0260
                 (Optimisation techniques); C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Sch. of Comput. and Inf. Technol., Griffith Univ.,
                 Brisbane, Qld., Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Ackermann's function; computational complexity; CRCW
                 PRAM; CREW processors; EREW processors; graph theory;
                 minimisation; NC algorithms; parallel algorithms;
                 sequential algorithm; shortest paths; single most vital
                 edge problem; time complexity; weighted undirected
                 graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Venkatesan:1996:ATC,
  author =       "G. Venkatesan and C. Pandu Rangan",
  title =        "Approximate triclique coloring for register
                 allocation",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "249--253",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C15 05C85 68N20 68Q25)",
  MRnumber =     "97i:68156",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C6120 (File organisation);
                 C6150C (Compilers, interpreters and other processors)",
  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/",
  keywords =     "approximate triclique coloring; approximation
                 algorithm; approximation ratio; chromatic number;
                 compiler design; complement; computational complexity;
                 control flow graph; flow graphs; graph; graph
                 colouring; NP-complete; planar tripartite line graphs;
                 program compilers; register allocation; storage
                 allocation; vertex set partitioning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nassif:1996:GES,
  author =       "Nayla Nassif and Nader Bagherzadeh",
  title =        "A grid embedding into the star graph for image
                 analysis solutions",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "255--260",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q22 68U10)",
  MRnumber =     "1 435 845",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
                 recognition); C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory)",
  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/",
  keywords =     "data communication; data communication patterns; graph
                 theory; grid embedding; image analysis; image
                 processing; multiprocessor interconnection networks;
                 optimization; parallel algorithms; problem solving;
                 star graph; star interconnection network",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jan:1996:SIE,
  author =       "Jinn-Ke Jan and Yuh-Min Tseng",
  title =        "On the security of image encryption method",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "261--265",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "97k:94033",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); B6140C (Optical information, image
                 and video signal processing); C1250 (Pattern
                 recognition); C1260 (Information theory); C6130S (Data
                 security)",
  corpsource =   "Inst. of Appl. Math., Nat. Chung-Hsing Univ.,
                 Taichung, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "2D gray scale images; 2D image transposition
                 encryption; cipher-sequential data; cryptographic
                 schemes; cryptography; fractals; image coding; image
                 encryption method; image transposition; plain-image
                 data; security; two dimensional gray scale images;
                 unique key",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ito:1996:SRI,
  author =       "Masayuki Ito and Naofumi Takagi and Shuzo Yajima",
  title =        "Square rooting by iterative multiply-additions",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "267--269",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M07",
  MRnumber =     "97i:68014",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Inf. Sci., Kyoto Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computer arithmetic; convergence of numerical methods;
                 digital arithmetic; iterative methods; iterative
                 multiply-additions; linear converging ratio;
                 multiplicative methods; Newton--Raphson method;
                 read-only storage; ROM sizes; square root algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Youssef:1996:CBN,
  author =       "A. M. Youssef and S. E. Tavares",
  title =        "Comment on: {``Bounds on the number of functions
                 satisfying the strict avalanche criterion'' [Inform.
                 Process. Lett. {\bf 60} (1996), no. 4, 215--219; 1 435
                 155] by T. W. Cusick and P. St{\u{a}}nic{\u{a}}}",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "271--275",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "1 435 848",
  bibdate =      "Sun May 02 08:39:14 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Cusick:1996:BNFa,Cusick:1996:BNFb}.",
  acknowledgement = ack-nhfb,
  classification = "C1260 (Information theory); C4210 (Formal logic);
                 C4240C (Computational complexity); C6130S (Data
                 security)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "Boolean functions; combinatorial mathematics;
                 combinatorial problems; computability; computational
                 complexity; constructive proof; cryptographic
                 functions; cryptography; design criteria; functions;
                 lower bound; satisfiability; Strict Avalanche
                 Criterion; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DomingoiFerrer:1996:NPH,
  author =       "Josep {Domingo i. Ferrer}",
  title =        "A new privacy homomorphism and applications",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "277--282",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P25 (94A60)",
  MRnumber =     "97i:68058",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C1260 (Information theory); C6130S
                 (Data security)",
  corpsource =   "Univ. Rovira i Virgili, Catalonia, Spain",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "addition; additive multiplicative privacy
                 homomorphism; classified retrieval; cleartext data;
                 cryptography; data privacy; disclosure-protected data;
                 encryption function; exact statistics; known-cleartext
                 attack; multilevel statistical computation;
                 multiplication; security; statistical analysis;
                 unclassified computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Germain:1996:TSP,
  author =       "Christian Germain and Jean Pallo",
  title =        "Two shortest path metrics on well-formed parentheses
                 strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "283--287",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05",
  MRnumber =     "97h:68092",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Bourgogne Univ., Dijon, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational geometry; lattice approach; least-move
                 distances; shortest path metrics; well-formed
                 parentheses strings",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Nystrom:1996:TNF,
  author =       "Sven-Olof Nystr{\"o}m",
  title =        "There is no fully abstract fixpoint semantics for
                 non-deterministic languages with infinite
                 computations",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "289--293",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q55",
  MRnumber =     "97h:68076",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Dept. of Comput. Sci., Uppsala Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract fixpoint semantics; arbitrary functions;
                 arbitrary partial orders; context free grammars;
                 context-free grammars; context-free languages;
                 continuity problems; infinite computations; least
                 fixpoint semantics; nondeterministic programming
                 languages; programming languages; semantic functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grable:1996:NPH,
  author =       "David A. Grable",
  title =        "Nearly-perfect hypergraph packing is in {NC}",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "295--299",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q22)",
  MRnumber =     "97i:68094",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Inst. f{\"u}r Inf., Humboldt-Univ., Berlin, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity class NC; computational complexity;
                 derandomized algorithm; disjoint edges; graph theory;
                 nearly-perfect hypergraph packing; Nibble Algorithm;
                 parallel algorithm; parallel algorithms; parallel
                 processors; randomised algorithms; uniform hypergraph;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kurosawa:1996:CLB,
  author =       "Kaoru Kurosawa and Koji Okada",
  title =        "Combinatorial lower bounds for secret sharing
                 schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "301--304",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "97i:94006",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics)C1260 (Information
                 theory); B6110 (Information theory); C1160
                 (Combinatorial mathematics); C6130S (Data security)",
  corpsource =   "Dept. of Electr. and Electron. Eng., Tokyo Inst. of
                 Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "access structure; combinatorial lower bounds;
                 combinatorial mathematics; digital systems; information
                 theory; nonuniformly distributed secrets; safety;
                 secret sharing schemes; security; security of data;
                 share size; user share",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kocberber:1996:PEQ,
  author =       "Seyit Kocberber and Fazli Can",
  title =        "Partial evaluation of queries for bit-sliced signature
                 files",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "305--311",
  day =          "23",
  month =        dec,
  year =         "1996",
  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.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6120 (File organisation);
                 C6160 (Database management systems (DBMS)); C7250R
                 (Information retrieval techniques)",
  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/",
  keywords =     "1 s; bit-slice computers; bit-sliced signature
                 organization; database size; database theory; disk
                 block sequentiality assumption; file organisation;
                 information retrieval; multi-term query environments;
                 on-bit subset; optimisation; partial query evaluation;
                 partially-evaluated bit-sliced signature file;
                 performance; query processing; query processing time
                 improvement; query signature; response time
                 minimization; signature file optimization method;
                 software performance evaluation; space overhead",
  treatment =    "N New Development; T Theoretical or Mathematical; X
                 Experimental",
}

@Article{Veanes:1996:CNC,
  author =       "Margus Veanes and Jonas Barklund",
  title =        "Construction of natural cycletrees",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "313--318",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C05 05C38)",
  MRnumber =     "97h:05169",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0260
                 (Optimisation techniques); C1160 (Combinatorial
                 mathematics); C1180 (Optimisation techniques); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Uppsala Univ., Sweden",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algorithm; binary spanning tree; computational
                 complexity; graph; Hamiltonian cycles; minimal edge
                 set; minimal total path length; minimisation; natural
                 cycletrees; split relation; subtree structure; time
                 complexity; top-down construction; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Neilsen:1996:ENC,
  author =       "Mitchell N. Neilsen and Masaaki Mizuno",
  title =        "Erratum to {``Nondominated $k$-coteries for multiple
                 mutual exclusion''. Information Processing Letters 50
                 (5) (10 June 1994) 247--252}",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "319--319",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:49 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Neilsen:1994:NCM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1996:AIV,
  author =       "Anonymous",
  title =        "Author Index: Volume 60 (1996)",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "322--324",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:07:31 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1996:MSI,
  author =       "Anonymous",
  title =        "Master Subject Index: Volumes 51--60",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "325--336",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:08:03 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1996:MIV,
  author =       "Anonymous",
  title =        "Master Index Volumes 51--60",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "6",
  pages =        "337--351",
  day =          "23",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:08:22 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1997:NHS,
  author =       "Yongge Wang",
  title =        "{NP}-hard sets are superterse unless {NP} is small",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "1--6",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "97k:68065",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Max-Planck-Inst. f{\"u}r Inf., Saarbrucken, Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; NP-hard sets; p-measure;
                 P-selective set; polynomial time; polynomial time
                 circuits; reducibility; superterseness",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Farach:1997:OPR,
  author =       "Martin Farach and S. Muthukrishnan",
  title =        "Optimal parallel randomized renaming",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "7--10",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q10)",
  MRnumber =     "97j:68039",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4240P (Parallel
                 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/",
  keywords =     "computational complexity; Las Vegas type PRAM
                 algorithm; multiset sorting problem; optimal parallel
                 randomized renaming; parallel algorithms; processing
                 step; sorting; string algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{King:1997:LAD,
  author =       "Gow-Hsing King and Wen-Guey Tzeng",
  title =        "On-line algorithms for the dominating set problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "11--14",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "97m:68165",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods); C4240C (Computational complexity);
                 C4260 (Computational geometry)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ.,
                 Hsinchu, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "adjacency condition; computational complexity;
                 computational geometry; dominating set problem; graph
                 theory; minimum cardinality; minimum dominating set
                 problem; NP-complete problems; online algorithms;
                 performance ratio; tight bound; undirected graph;
                 vertex",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kornerup:1997:OES,
  author =       "Jacob Kornerup",
  title =        "Odd--even sort in powerlists",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "15--24",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10 (68Q22 68Q60)",
  MRnumber =     "1 439 862",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "0-1 principle; Batcher's networks; Bitonic Sort;
                 compare-and-swap sorting algorithm; divide and conquer
                 strategy; odd-even sort; parallel algorithms;
                 powerlists; programming theory; sorting",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hasunuma:1997:CBN,
  author =       "Toru Hasunuma and Yukio Shibata",
  title =        "Containment of butterflies in networks constructed by
                 the line digraph operation",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "25--30",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "97j:68006",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Dept. of Comput. Sci., Gunma Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "butterflies containment; de Bruijn graphs; digraph;
                 directed graphs; hypercube networks; integer; Kautz
                 graphs; line digraph operation; vertex-disjoint
                 copies",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sedjelmaci:1997:IAI,
  author =       "Mohamed S. Sedjelmaci and Christian Lavault",
  title =        "Improvements on the accelerated integer {GCD}
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "31--36",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65Y05 (68Q22 68Q25)",
  MRnumber =     "97m:65256",
  bibdate =      "Sat Nov 7 17:55:49 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bozanis:1997:SOV,
  author =       "Panayiotis Bozanis and Nectarios Kitsios and Christos
                 Makris and Athanasios Tsakalidis",
  title =        "The space-optimal version of a known rectangle
                 enclosure reporting algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "37--41",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97m:68193",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Eng. and Inf., Patras Univ., Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; computational geometry;
                 four-dimensional dominance reporting problem;
                 iso-oriented rectangles; parallel algorithms; rectangle
                 enclosure reporting algorithm; space-optimal version",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ashir:1997:CAA,
  author =       "Yaagoub Ashir and Iain A. Stewart and Aqeel Ahmed",
  title =        "Communication algorithms in $k$-ary $n$-cube
                 interconnection networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "43--48",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "1 439 866",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5440
                 (Multiprocessing systems)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Wales, Swansea, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "broadcasting; communication algorithms; hypercube
                 networks; k-ary n-cube interconnection networks;
                 multi-node broadcasting algorithms; network routing;
                 one-port I/O communication; optimal algorithms;
                 parallel algorithms; routing algorithms; single-node
                 scattering algorithms; total exchange algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blum:1997:CAC,
  author =       "Avrim Blum and David Karger",
  title =        "An {$\tilde{O}(n^{3/14})$}-coloring algorithm for
                 $3$-colorable graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "49--53",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C15 (05C85)",
  MRnumber =     "97k:05068",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "computational complexity; graph colouring; n-node
                 3-colorable graph; O(n/sup 3/14/)-coloring algorithm;
                 polynomial-time algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Taylor:1997:AHN,
  author =       "Stephen Taylor and Nabil Hachem and Stanley Selkow",
  title =        "The average height of a node in the {BANG} abstract
                 directory tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "1",
  pages =        "55--61",
  day =          "14",
  month =        jan,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "1 439 868",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Worcester Polytech. Inst., MA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "abstract data types; abstract logical data structure;
                 average insertion cost; average node height; average
                 search cost; BANG abstract directory tree; BANG file
                 directory; bucket; bucket capacity; file size; growth
                 on data principle; multi-dimensional file structures;
                 multiway tree structure; order constant; perfect
                 hashing; simulation; tree data structures; tree growth;
                 virtual machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zippel:1997:ZTA,
  author =       "Richard Zippel",
  title =        "Zero testing of algebraic functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "63--67",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40 (68Q60 68T05)",
  MRnumber =     "97j:68066",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Loescher:1997:OUF,
  author =       "Bernd Loescher",
  title =        "One unary function says less than two in existential
                 second order logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "69--75",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "03B15 (03C85 68Q15)",
  MRnumber =     "1 439 870",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Guan:1997:CPW,
  author =       "D. J. Guan and Xuding Zhu",
  title =        "A coloring problem for weighted graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "77--81",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C15)",
  MRnumber =     "97k:68131",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Uehara:1997:CPS,
  author =       "Ryuhei Uehara",
  title =        "Collapse of {PP} with a semi-random source to {BPP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "83--87",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "98c:68077",
  MRreviewer =   "Claude Sureson",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Saab:1997:IAI,
  author =       "Youssef G. Saab",
  title =        "An improved algorithm for intersecting convex
                 polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "89--90",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 439 873",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shikishima-Tsuji:1997:TCO,
  author =       "Kayoko Shikishima-Tsuji and Masashi Katsura and Yuji
                 Kobayashi",
  title =        "On termination of confluent one-rule string-rewriting
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "91--96",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42",
  MRnumber =     "97j:68071",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chung:1997:EHD,
  author =       "Kuo-Liang Chung",
  title =        "Efficient {Huffman} decoding",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "97--99",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (94B35)",
  MRnumber =     "1 439 875",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See comment \cite{Turpin:1998:CEH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bodlaender:1997:IHK,
  author =       "Hans L. Bodlaender and Dimitrios M. Thilikos and
                 Koichi Yamazaki",
  title =        "It is hard to know when greedy is good for finding
                 independent sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "101--106",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "97m:68161",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lu:1997:LTA,
  author =       "Chin Lung Lu and Chuan Yi Tang",
  title =        "A linear-time algorithm for the weighted feedback
                 vertex problem on interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "107--111",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85)",
  MRnumber =     "1 439 877",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Franciosa:1997:IMD,
  author =       "Paolo G. Franciosa and Giorgio Gambosi and Umberto
                 Nanni",
  title =        "The incremental maintenance of a {Depth-First-Search}
                 tree in directed acyclic graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "2",
  pages =        "113--120",
  day =          "28",
  month =        feb,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "97j:68051",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Deogun:1997:AAC,
  author =       "Jitender S. Deogun and Dieter Kratsch and George
                 Steiner",
  title =        "An approximation algorithm for clustering graphs with
                 dominating diametral path",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "121--127",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C85 68R10)",
  MRnumber =     "97k:68076",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lecroq:1997:FLS,
  author =       "Thierry Lecroq and Guillaume Luce and Jean
                 Fr{\'e}d{\'e}ric Myoupo",
  title =        "A faster linear systolic algorithm for recovering a
                 longest common subsequence",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "129--136",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35",
  MRnumber =     "1 439 880",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mosca:1997:PAM,
  author =       "Raffaele Mosca",
  title =        "Polynomial algorithms for the maximum stable set
                 problem on particular classes of {$P_5$}-free graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "137--143",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C85 68R10)",
  MRnumber =     "97j:68054",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Zhang:1997:SSL,
  author =       "Guochuan Zhang",
  title =        "A simple semi on-line algorithm for {${\rm P}2//C_{\rm
                 max}$} with a buffer",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "145--148",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68Q25)",
  MRnumber =     "97k:68025",
  bibdate =      "Wed Nov 11 08:09:11 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hong:1997:RDC,
  author =       "Seok Hee Hong and Myoung Ho Kim",
  title =        "Resolving data conflicts with multiple versions and
                 precedence relationships in real-time databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "149--156",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 439 883",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fris:1997:DCC,
  author =       "Ivan Fri{\v{s}} and Ivan Havel and Petr Liebl",
  title =        "The diameter of the cube-connected cycles",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "157--160",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C90)",
  MRnumber =     "1 439 884",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rosenbloom:1997:MRC,
  author =       "Arnold Rosenbloom",
  title =        "Monotone real circuits are more powerful than monotone
                 {Boolean} circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "161--164",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "97j:68034",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1997:LCP,
  author =       "M. Z. Wang",
  title =        "Linear complexity profiles and jump complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "165--168",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A55 (68P25)",
  MRnumber =     "98a:94016",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sato:1997:ELC,
  author =       "Tadakazu Sato",
  title =        "Ergodicity of linear cellular automata over {${\bf
                 Z}_m$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "3",
  pages =        "169--172",
  day =          "14",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q80",
  MRnumber =     "97m:68148",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1997:FEF,
  author =       "Shih-Yih Wang and Lih-Hsing Hsu and Ting-Yi Sung",
  title =        "Faithful $1$-edge fault tolerant graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "173--181",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68M10)",
  MRnumber =     "97k:68136",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Henk:1997:NSN,
  author =       "Martin Henk",
  title =        "Note on shortest and nearest lattice vectors",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "183--188",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55 68Q25)",
  MRnumber =     "97j:68132",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cintioli:1997:RRK,
  author =       "Patrizio Cintioli and Riccardo Silvestri",
  title =        "Revisiting a result of {Ko}",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "189--194",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "98a:68065",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DellOlmo:1997:ARD,
  author =       "P. Dell'Olmo and S. Giordani and M. G. Speranza",
  title =        "An approximation result for a duo-processor task
                 scheduling problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "195--200",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68Q25)",
  MRnumber =     "97j:68010",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Encarnacion:1997:BBP,
  author =       "Mark J. Encarnaci{\'o}n",
  title =        "Black-box polynomial resultants",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "201--204",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q40",
  MRnumber =     "97k:68089",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Roupin:1997:AMC,
  author =       "Fr{\'e}d{\'e}ric Roupin",
  title =        "On approximating the memory-{Constrained Module
                 Allocation Problem}",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "205--208",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q10)",
  MRnumber =     "97j:68057",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Park:1997:IBN,
  author =       "Sung Mo Park and Sangjin Lee and Soo Hak Sung and
                 Kwangjo Kim",
  title =        "Improving bounds for the number of correlation immune
                 {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "209--212",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94C10 (03G05 06E30 68P25)",
  MRnumber =     "97k:94100",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Choi:1997:DST,
  author =       "Y. Choi and T. W. Lam",
  title =        "Dynamic suffix tree and two-dimensional texts
                 management",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "213--220",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "97m:68039",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kulasinghe:1997:CCC,
  author =       "Priyalal D. Kulasinghe",
  title =        "Connectivity of the crossed cube",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "4",
  pages =        "221--226",
  day =          "27",
  month =        mar,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "97k:68018",
  bibdate =      "Sat Nov 7 17:55:50 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Thilikos:1997:FPA,
  author =       "Dimitrios M. Thilikos and Hans L. Bodlaender",
  title =        "Fast partitioning $l$-apex graphs with applications to
                 approximating maximum induced-subgraph problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "227--232",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68Q25 68R10)",
  MRnumber =     "97k:05189",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mazurkiewicz:1997:DE,
  author =       "Antoni Mazurkiewicz",
  title =        "Distributed enumeration",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "233--239",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "97m:68064",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Morris:1997:NDE,
  author =       "Joseph M. Morris",
  title =        "Non-deterministic expressions and predicate
                 transformers",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "241--246",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "97k:68116",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Calamoneri:1997:NRT,
  author =       "Tiziana Calamoneri and Rossella Petreschi",
  title =        "A new {$3$D} representation of trivalent {Cayley}
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "247--252",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "97k:68015",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Myoupo:1997:ILS,
  author =       "Jean-Fr{\'e}d{\'e}ric Myoupo and Ahmad Wabbi",
  title =        "Improved linear systolic algorithms for substring
                 statistics",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "253--258",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22",
  MRnumber =     "1 445 652",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Micheneau:1997:DHC,
  author =       "C. Micheneau",
  title =        "Disjoint {Hamiltonian} cycles in recursive circulant
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "259--264",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C45 (68R10)",
  MRnumber =     "97k:05141",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Iwama:1997:FPA,
  author =       "K. Iwama and C. Iwamoto and T. Ohsawa",
  title =        "A faster parallel algorithm for $k$-connectivity",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "265--269",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q22 68Q25)",
  MRnumber =     "98c:68170",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Verbarg:1997:ACP,
  author =       "Knut Verbarg",
  title =        "Approximate center points in dense point sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "271--278",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97m:68201",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Schoenmakers:1997:TLB,
  author =       "Berry Schoenmakers",
  title =        "A tight lower bound for top-down skew heaps",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "5",
  pages =        "279--284",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "97m:68042",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kumar:1997:CEA,
  author =       "Devendra Kumar and Abraham Silberschatz",
  title =        "A counter-example to an algorithm for the generalized
                 input-output construct of {CSP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "287--287",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "1 448 523",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kushilevitz:1997:SAL,
  author =       "Eyal Kushilevitz",
  title =        "A simple algorithm for learning {$O(\log n)$}-term
                 {DNF}",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "289--292",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q99 (68T05)",
  MRnumber =     "98b:68146",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ibarra:1997:FPM,
  author =       "Louis Ibarra",
  title =        "Finding pattern matchings for permutations",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "293--295",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05",
  MRnumber =     "97m:68159",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dror:1997:SCM,
  author =       "Moshe Dror and Wieslaw Kubiak and Paolo Dell'Olmo",
  title =        "Scheduling chains to minimize mean flow time",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "297--301",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M20)",
  MRnumber =     "97m:68092",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bshouty:1997:LMP,
  author =       "Nader H. Bshouty",
  title =        "On learning multivariate polynomials under the uniform
                 distribution",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "303--309",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q99 (68T05)",
  MRnumber =     "97m:68154",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chao:1997:OEP,
  author =       "H. S. Chao and F. R. Hsu and R. C. T. Lee",
  title =        "An optimal {EREW} parallel algorithm for computing
                 breadth-first search trees on permutation graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "311--316",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q22)",
  MRnumber =     "97m:68162",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1997:NAG,
  author =       "Jianer Chen and Saroja P. Kanchi and Arkady Kanevsky",
  title =        "A note on approximating graph genus",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "317--322",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C10 05C85 68R10)",
  MRnumber =     "98a:68092",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Vakali:1997:EAE,
  author =       "Athena Vakali and Yannis Manolopoulos",
  title =        "An exact analysis on expected seeks in shadowed
                 disks",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "323--329",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20",
  MRnumber =     "1 448 530",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Flocchini:1997:MSD,
  author =       "Paola Flocchini",
  title =        "Minimal sense of direction in regular networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "61",
  number =       "6",
  pages =        "331--338",
  day =          "24",
  month =        apr,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (05C85)",
  MRnumber =     "97m:68010",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Halava:1997:GPZ,
  author =       "Vesa Halava and Tero Harju and Lucian Ilie",
  title =        "On a geometric problem of zigzags",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "1--4",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "20M99",
  MRnumber =     "1 453 685",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{vonKarger:1997:CKD,
  author =       "Burghard {von Karger} and Rudolf Berghammer",
  title =        "Computing kernels in directed bichromatic graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "5--11",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (03G15 05C15 90D43)",
  MRnumber =     "98d:68167",
  MRreviewer =   "D. Rosenblatt",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gal:1997:SFR,
  author =       "Anna G{\'a}l",
  title =        "A simple function that requires exponential size
                 read-once branching programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "13--16",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q05)",
  MRnumber =     "98a:68096",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jagadish:1997:AHC,
  author =       "H. V. Jagadish",
  title =        "Analysis of the {Hilbert} curve for representing
                 two-dimensional space",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "17--22",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P20 (68P15)",
  MRnumber =     "98a:68048",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gergatsoulis:1997:UFT,
  author =       "Manolis Gergatsoulis",
  title =        "Unfold\slash fold transformations for disjunctive
                 logic programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "23--29",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17",
  MRnumber =     "98a:68025",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kindler:1997:MNF,
  author =       "Ekkart Kindler and Rolf Walter",
  title =        "Mutex needs fairness",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "31--39",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q55 68Q90)",
  MRnumber =     "98b:68047",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Orda:1997:ETC,
  author =       "Ariel Orda and Michael Merritt",
  title =        "Efficient test{\&}set constructions for faulty shared
                 memory",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "41--46",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M15 (68Q10)",
  MRnumber =     "1 453 691",
  bibdate =      "Wed Nov 11 08:10:18 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Orozco:1997:RMS,
  author =       "J. Orozco and R. Cayssials and J. Santos and E.
                 Ferro",
  title =        "{802.4 Rate Monotonic} scheduling in hard real-time
                 environments: Setting the medium access control
                 parameters",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "1",
  pages =        "47--55",
  day =          "7",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "1 453 692",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Makinen:1997:IUT,
  author =       "Erkki M{\"a}kinen",
  title =        "Inferring uniquely terminating regular languages from
                 positive data",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "57--60",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68T05)",
  MRnumber =     "97m:68122",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chmeiss:1997:GCG,
  author =       "Assef Chmeiss and Philippe J{\'e}gou",
  title =        "A generalization of chordal graphs and the maximum
                 clique problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "61--66",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C75 (05C85 68Q25 68R10)",
  MRnumber =     "98a:05122",
  bibdate =      "Wed Nov 11 08:10:36 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kang:1997:AOD,
  author =       "Hee-Joong Kang and Kawon Kim and Jin H. Kim",
  title =        "Approximating optimally discrete probability
                 distribution with $k$th-order dependency for combining
                 multiple decisions",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "67--75",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T10",
  MRnumber =     "1 452 992",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yen:1997:SAT,
  author =       "Sung-Ming Yen and Kuo-Hong Liao",
  title =        "Shared authentication token secure against replay and
                 weak key attacks",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "77--80",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 452 993",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kant:1997:ARV,
  author =       "Goos Kant and Giuseppe Liotta and Roberto Tamassia and
                 Ioannis G. Tollis",
  title =        "Area requirement of visibility representations of
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "81--88",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "97m:68197",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Varadarajan:1997:LAS,
  author =       "Kasturi R. Varadarajan and Pankaj K. Agarwal",
  title =        "Linear approximation of simple objects",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "89--94",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "98a:68184",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Amir:1997:IDA,
  author =       "Amihood Amir and Emanuel Dar",
  title =        "An improved deterministic algorithm for generating
                 different many-element random samples",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "95--101",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20",
  MRnumber =     "97m:68077",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Breslauer:1997:TCM,
  author =       "Dany Breslauer and Artur Czumaj and Devdatt P.
                 Dubhashi and Friedhelm {Meyer auf der Heide}",
  title =        "Transforming comparison model lower bounds to the
                 parallel-random-access-machine",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "2",
  pages =        "103--110",
  day =          "21",
  month =        may,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68Q05)",
  MRnumber =     "97m:68091",
  bibdate =      "Sat Nov 7 17:55:51 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bouquet:1997:UOH,
  author =       "Fabrice Bouquet and Philippe J{\'e}gou",
  title =        "Using {OBDDs} to handle dynamic constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "111--120",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T20 (68Q05)",
  MRnumber =     "1 453 693",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Eppstein:1997:DCD,
  author =       "David Eppstein",
  title =        "Dynamic connectivity in digital images",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "121--126",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10 (68Q25 68T20)",
  MRnumber =     "98a:68188",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gluck:1997:RSG,
  author =       "Robert Gl{\"u}ck and Andrei Klimov",
  title =        "A regeneration scheme for generating extensions",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "127--134",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N05 (68N15)",
  MRnumber =     "98a:68020",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Abbasi:1997:AFD,
  author =       "Sarmad Abbasi and Anirvan Sengupta",
  title =        "An {$O(n\log n)$} algorithm for finding dissimilar
                 strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "135--139",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (92C40 92D20)",
  MRnumber =     "98b:68065",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yang:1997:NEC,
  author =       "Ching-Nung Yang and Chi-Sung Laih",
  title =        "A note on error-correcting codes for authentication
                 and subliminal channels",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "141--143",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94Bxx",
  MRnumber =     "1 453 697",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bach:1997:CNT,
  author =       "Eric Bach",
  title =        "The complexity of number-theoretic constants",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "145--152",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "11Yxx (68P25 68Q25)",
  MRnumber =     "1 453 698",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{King:1997:OEP,
  author =       "Valerie King and Chung Keung Poon and Vijaya
                 Ramachandran and Santanu Sinha",
  title =        "An optimal {EREW PRAM} algorithm for minimum spanning
                 tree verification",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "153--159",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68R10)",
  MRnumber =     "98a:68084",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Doring:1997:DAL,
  author =       "Andreas D{\"o}ring and Wolfgang J. Paul",
  title =        "Decimal adjustment of long numbers in constant time",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "161--163",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M07 (68M20)",
  MRnumber =     "1 453 700",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Zimand:1997:LSM,
  author =       "Marius Zimand",
  title =        "Large sets in {${\rm AC}^0$} have many strings with
                 low {Kolmogorov} complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "3",
  pages =        "165--170",
  day =          "4",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30 (68Q10)",
  MRnumber =     "98a:68102",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Istrate:1997:SEE,
  author =       "Gabriel Istrate",
  title =        "The strong equivalence of {ET0L} grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "171--176",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45",
  MRnumber =     "97m:68118",
  bibdate =      "Wed Nov 11 08:10:41 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sengupta:1997:CEP,
  author =       "Rimli Sengupta",
  title =        "Cancellation is exponentially powerful for computing
                 the determinant",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "177--181",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (15A15 68Q40)",
  MRnumber =     "98a:68100",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fokkink:1997:UIS,
  author =       "Wan Fokkink",
  title =        "Unification for infinite sets of equations between
                 finite terms",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "183--188",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N17 (03B35 68T15)",
  MRnumber =     "1 453 457",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hirose:1997:CKD,
  author =       "Shouichi Hirose and Katsuo Ikeda",
  title =        "A conference key distribution system for the star
                 configuration based on the discrete logarithm problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "189--192",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dong:1997:MTC,
  author =       "Guozhu Dong and Chaoyi Pang",
  title =        "Maintaining transitive closure in first order after
                 node-set and edge-set deletions",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "193--199",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "98b:68029",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gu:1997:NSD,
  author =       "Qian-Ping Gu and Shietung Peng",
  title =        "Node-to-set disjoint paths problem in star graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "201--207",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C38)",
  MRnumber =     "98d:68164",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cucker:1997:CD,
  author =       "Felipe Cucker and Pascal Koiran and Mart{\'\i}n
                 Matamala",
  title =        "Complexity and dimension",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "209--212",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15 68Q05)",
  MRnumber =     "98c:68069",
  MRreviewer =   "Klaus Meer",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bao:1997:ACR,
  author =       "Feng Bao and Aohan Mei and Yoshihide Igarashi",
  title =        "Average competitive ratios of on-line spanning trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "213--216",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C05 05C85)",
  MRnumber =     "98a:68143",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Verhaegh:1997:PTA,
  author =       "W. F. J. Verhaegh and E. H. L. Aarts",
  title =        "A polynomial-time algorithm for {Knapsack} with
                 divisible item sizes",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "4",
  pages =        "217--221",
  day =          "11",
  month =        jun,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "97m:68105",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Khan:1997:ACM,
  author =       "Md. Mozammel Huq Azad Khan and Md. Shamsul Alam",
  title =        "Algorithms for conversion of minterms to positive
                 polarity {Reed--Muller} coefficients and vice versa",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "223--230",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94Bxx",
  MRnumber =     "1 459 611",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Harbane:1997:SBK,
  author =       "Rabah Harbane and Carles Padr{\'o}",
  title =        "Spanners of {de Bruijn} and {Kautz} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "231--236",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C35 68M10)",
  MRnumber =     "98c:68166",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Harbane:1997:SUG,
  author =       "Rabah Harbane and Carles Padr{\'o}",
  title =        "Spanners of underlying graphs of iterated line
                 digraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "237--244",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C35 68M10)",
  MRnumber =     "98c:68167",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lambert:1997:OAR,
  author =       "Timothy Lambert",
  title =        "An optimal algorithm for realizing a {Delaunay}
                 triangulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "245--250",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "98b:68190",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gray:1997:CJV,
  author =       "James W. {Gray, III}",
  title =        "On the {Clark-Jacob} version of {SPLICE\slash AS}",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "251--254",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "98c:94015",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mok:1997:KNF,
  author =       "Wai Yin Mok",
  title =        "On keys and normal forms",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "255--258",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "98b:68032",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hermo:1997:CUC,
  author =       "Montserrat Hermo",
  title =        "Compressibility and uniform complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "259--264",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30",
  MRnumber =     "98b:68083",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Vassiliev:1997:DTO,
  author =       "V. A. Vassiliev",
  title =        "On decision trees for orthants",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "265--268",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "98b:68081",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Formica:1997:VAI,
  author =       "Anna Formica and Michele Missikoff",
  title =        "A verification algorithm for inheritance hierarchies
                 in object-oriented databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "5",
  pages =        "269--279",
  day =          "2",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68N15)",
  MRnumber =     "1 459 619",
  bibdate =      "Sat Nov 7 17:55:52 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fouquet:1997:TAM,
  author =       "J. L. Fouquet and I. Parfenoff and H. Thuillier",
  title =        "An {$O(n)$} time algorithm for maximum matching in
                 {$P_4$}-tidy graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "281--287",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (05C70 68R10)",
  MRnumber =     "98b:05089",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Justin:1997:SFI,
  author =       "J. Justin and G. Pirillo",
  title =        "On some factorizations of infinite words by elements
                 of codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "289--294",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R15 (68Q45 94B99)",
  MRnumber =     "98b:68156",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kumar:1997:NOR,
  author =       "S. Ravi Kumar and Rina Panigrahy and Alexander Russell
                 and Ravi Sundaram",
  title =        "A note on optical routing on trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "295--300",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q25 90C27)",
  MRnumber =     "1 463 345",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ma:1997:ILB,
  author =       "Yuan Ma and Serge Plotkin",
  title =        "An improved lower bound for load balancing of tasks
                 with unknown duration",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "301--303",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68M10)",
  MRnumber =     "1 463 346",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sassa:1997:SDM,
  author =       "Masataka Sassa and Takuya Ookubo",
  title =        "Systematic debugging method for attribute grammar
                 description",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "305--313",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nakano:1997:LTA,
  author =       "Shin-ichi Nakano and Md. Saidur Rahman and Takao
                 Nishizeki",
  title =        "A linear-time algorithm for four-partitioning
                 four-connected planar graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "315--322",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "98b:05091",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nakayama:1997:PAS,
  author =       "Shin-ichi Nakayama and Shigeru Masuyama",
  title =        "A parallel algorithm for solving the coloring problem
                 on trapezoid graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "323--327",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C15 (05C85 68Q22 68R10)",
  MRnumber =     "98b:05045",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Pritchard:1997:OSQ,
  author =       "Paul Pritchard",
  title =        "An old sub-quadratic algorithm for finding extremal
                 sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "62",
  number =       "6",
  pages =        "329--334",
  day =          "16",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R05)",
  MRnumber =     "98c:68095",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bird:1997:CR,
  author =       "Richard S. Bird and Jes{\'u}s N. Ravelo",
  title =        "On computing representatives",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "1--7",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (68N05 68Q60)",
  MRnumber =     "98d:68160",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nardelli:1997:BTR,
  author =       "Enrico Nardelli and Vincenzo Mastrobuoni and Alesiano
                 Santomo",
  title =        "On building the transitive reduction of a
                 two-dimensional poset",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "9--12",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (06A07)",
  MRnumber =     "1 470 128",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1997:LTA,
  author =       "Hon-Chan Chen and Yue-Li Wang",
  title =        "A linear time algorithm for finding depth-first
                 spanning trees on trapezoid graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "13--18",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (68Q25)",
  MRnumber =     "98e:68199",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1997:SAG,
  author =       "Chin-Chen Chang and Shin-Jia Hwang",
  title =        "A simple approach for generating {RSA} keys",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "19--21",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94Axx (68P25)",
  MRnumber =     "1 470 130",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Flocchini:1997:ISD,
  author =       "Paola Flocchini and Bernard Mans and Nicola Santoro",
  title =        "On the impact of sense of direction on message
                 complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "23--31",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M10 68Q10 68R10)",
  MRnumber =     "98e:68105",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bax:1997:PFM,
  author =       "Eric Bax and Joel Franklin",
  title =        "A permanent formula with many zero-valued terms",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "33--39",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (15A15 68R05)",
  MRnumber =     "98d:68094",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{vanDijk:1997:MIT,
  author =       "Marten {van Dijk}",
  title =        "More information theoretical inequalities to be used
                 in secret sharing?",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "41--44",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94Axx (68P25)",
  MRnumber =     "1 470 133",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ivkovic:1997:PDP,
  author =       "Zoran Ivkovi{\'c} and Errol L. Lloyd",
  title =        "Partially dynamic bin packing can be solved within
                 $1+\epsilon$ in (amortized) polylogarithmic time",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "45--50",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (90C27)",
  MRnumber =     "98d:68102",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sgall:1997:LBR,
  author =       "Ji{\v{r}}{\'\i} Sgall",
  title =        "A lower bound for randomized on-line multiprocessor
                 scheduling",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "1",
  pages =        "51--55",
  day =          "30",
  month =        jul,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "98d:68033",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chung:1997:FAS,
  author =       "Kuo-Liang Chung",
  title =        "A fast algorithm for stereo matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "57--61",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10",
  MRnumber =     "1 474 579",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hassin:1997:AAM,
  author =       "Refael Hassin and Shlomi Rubinstein",
  title =        "An approximation algorithm for maximum packing of
                 $3$-edge paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "63--67",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68R10)",
  MRnumber =     "1 474 580",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gaines:1997:PME,
  author =       "J. G. Gaines",
  title =        "Partitions with minimum entropy of regions in
                 {${\mathbb R}^2$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "69--73",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R05 (65Y05 68U05)",
  MRnumber =     "1 474 581",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Frandsen:1997:DMM,
  author =       "Gudmund S. Frandsen and Sven Skyum",
  title =        "Dynamic maintenance of majority information in
                 constant time per update",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "75--78",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "1 474 582",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chrobak:1997:BLB,
  author =       "Marek Chrobak and Lawrence L. Larmore and Carsten Lund
                 and Nick Reingold",
  title =        "A better lower bound on the competitive ratio of the
                 randomized $2$-server problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "79--83",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "98e:68098",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Busch:1997:IRW,
  author =       "Costas Busch and Marios Mavronicolas",
  title =        "Impossibility results for weak threshold networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "85--90",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "98e:68060",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Imrich:1997:RHG,
  author =       "Wilfried Imrich and Sandi Klav{\v{z}}ar",
  title =        "Recognizing {Hamming} graphs in linear time and
                 space",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "91--95",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "98d:05134",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Calamoneri:1997:SLG,
  author =       "Tiziana Calamoneri and Andrea Sterbini",
  title =        "{$3$D} straight-line grid drawing of $4$-colorable
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "97--102",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 474 586",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ho:1997:BFC,
  author =       "Jan-Ming Ho and Ming-Tat Ko",
  title =        "Bounded fan-out $m$-center problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "103--108",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "98e:68106",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Afek:1997:BCP,
  author =       "Y. Afek and M. Cohen and E. Haalman",
  title =        "The bit complexity of the predecessor problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "109--112",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M10)",
  MRnumber =     "98e:68095",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Geist:1997:PBM,
  author =       "Robert Geist",
  title =        "Performance bounds for modeling {NUMA} architectures",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "2",
  pages =        "113--117",
  day =          "13",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:53 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Amoura:1997:NSM,
  author =       "A. K. Amoura",
  title =        "A note on scheduling multiprocessor tasks with
                 precedence constraints on parallel processors",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "119--122",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "1 474 135",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Huang:1997:ERM,
  author =       "Shou-Hsuan S. Huang and Hongfei Liu and Rakesh M.
                 Verma",
  title =        "On embedding rectangular meshes into rectangular
                 meshes of smaller aspect ratio",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "123--129",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68Q35)",
  MRnumber =     "1 474 136",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Goldreich:1997:ULA,
  author =       "Oded Goldreich and Dana Ron",
  title =        "On universal learning algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "131--136",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68T05)",
  MRnumber =     "98e:68077",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Schittenkopf:1997:FAM,
  author =       "Christian Schittenkopf and Gustavo Deco and Wilfried
                 Brauer",
  title =        "Finite automata-models for the investigation of
                 dynamical systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "137--141",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "58F08 (68Q45 68Q68)",
  MRnumber =     "1 474 138",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jonsson:1997:NRF,
  author =       "P. Jonsson",
  title =        "A nonapproximability result for finite function
                 generation",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "143--145",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "98e:68108",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Arratia-Quesada:1997:GHL,
  author =       "A. A. Arratia-Quesada and I. A. Stewart",
  title =        "Generalized {Hex} and logical characterizations of
                 polynomial space",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "147--152",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03C13)",
  MRnumber =     "98d:68072",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Borchert:1997:CLL,
  author =       "Bernd Borchert and Riccardo Silvestri",
  title =        "A characterization of the leaf language classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "153--158",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "98e:68071",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Feijs:1997:ADT,
  author =       "L. M. G. Feijs and R. C. {van Ommering}",
  title =        "Abstract derivation of transitive closure algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "159--164",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kucera:1997:CRF,
  author =       "Lud{\v{e}}k Ku{\v{c}}era",
  title =        "Computing {OR} on a randomized fixed adversary {CRCW
                 PRAM}",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "165--166",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q25)",
  MRnumber =     "98e:68092",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kratsch:1997:TDT,
  author =       "Dieter Kratsch and Lorna Stewart",
  title =        "Total domination and transformation",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "3",
  pages =        "167--170",
  day =          "27",
  month =        aug,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C85 68Q25)",
  MRnumber =     "98e:68206",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Csirik:1997:SAL,
  author =       "J{\'a}nos Csirik and Gerhard J. Woeginger",
  title =        "Shelf algorithms for on-line strip packing",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "171--175",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "1 477 300",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lalgudi:1997:CSS,
  author =       "Kumar N. Lalgudi and Marios C. Papaefthymiou",
  title =        "Computing strictly-second shortest paths",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "177--181",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C38 05C85)",
  MRnumber =     "98e:68207",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Park:1997:WSA,
  author =       "Kunsoo Park and Sang Lyul Min and Yookun Cho",
  title =        "The working set algorithm has competitive ratio less
                 than two",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "183--188",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68N25",
  MRnumber =     "98e:68035",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Konana:1997:UTI,
  author =       "Prabhudev Konana and Juhnyoung Lee and Sudha Ram",
  title =        "Updating timestamp interval for dynamic adjustment of
                 serialization order in {Optimistic Concurrency
                 Control-Time Interval} ({OCCTI}) protocol",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "189--193",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68Q10)",
  MRnumber =     "1 477 303",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Crochemore:1997:TBC,
  author =       "Maxime Crochemore and Thierry Lecroq",
  title =        "Tight bounds on the complexity of the
                 {Apostolico-Giancarlo} algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "195--203",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25",
  MRnumber =     "98e:68099",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1997:DRF,
  author =       "Sying-Jyan Wang",
  title =        "Distributed routing in a fault-tolerant multistage
                 interconnection network",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "205--210",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "1 477 305",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bshouty:1997:TBA,
  author =       "Nader H. Bshouty and Yishay Mansour and Baruch
                 Schieber and Prasoon Tiwari",
  title =        "A tight bound for approximating the square root",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "211--213",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (65B15 68Q40)",
  MRnumber =     "1 477 306",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{deBerg:1997:CSC,
  author =       "Mark {de Berg} and Olivier Devillers and Katrin
                 Dobrindt and Otfried Schwarzkopf",
  title =        "Computing a single cell in the overlay of two simple
                 polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "215--219",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 477 307",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ebert:1997:SGC,
  author =       "J{\"u}rgen Ebert and Gottfried Vossen",
  title =        "{I}-serializability: Generalized correctness for
                 transaction-based environments",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "4",
  pages =        "221--227",
  day =          "10",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10",
  MRnumber =     "98e:68042",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hakimi:1997:OGO,
  author =       "S. Louis Hakimi and Edward F. Schmeichel and Neal E.
                 Young",
  title =        "Orienting graphs to optimize reachability",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "229--235",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C20 68R10)",
  MRnumber =     "1 475 334",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Olson:1997:AAL,
  author =       "Clark F. Olson",
  title =        "An approximation algorithm for least median of squares
                 regression",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "237--241",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "62J99 (68U05)",
  MRnumber =     "1 475 335",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Peled:1997:SIT,
  author =       "Doron Peled and Thomas Wilke",
  title =        "Stutter-invariant temporal properties are expressible
                 without the next-time operator",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "243--246",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "1 475 336",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1997:AES,
  author =       "Wei-Bin Lee and Chin-Chen Chang",
  title =        "Authenticated encryption schemes with linkage between
                 message blocks",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "247--250",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94Axx (68P25)",
  MRnumber =     "1 475 337",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Veith:1997:LRB,
  author =       "Helmut Veith",
  title =        "Languages represented by {Boolean} formulas",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "251--256",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (03D15)",
  MRnumber =     "1 475 338",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Boppana:1997:ASB,
  author =       "Ravi B. Boppana",
  title =        "The average sensitivity of bounded-depth circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "257--261",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15",
  MRnumber =     "1 475 339",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wu:1997:AFO,
  author =       "B. Y. Wu and C. Y. Tang",
  title =        "An {$O(n)$} algorithm for finding an optimal position
                 with relative distances in an evolutionary tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "263--269",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Qxx (92-XX)",
  MRnumber =     "1 475 340",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wei:1997:BSP,
  author =       "Li-Chiun Wei and Ruay-Shiung Chang",
  title =        "Broadcast scheduling in packet radio networks by
                 {Hopfield} neural networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "271--276",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90B12",
  MRnumber =     "1 475 341",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1997:MLS,
  author =       "Ruay-Shiung Chang and Shing-Jiuan Leu",
  title =        "The minimum labeling spanning trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "277--282",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C05 68Q25 68T20)",
  MRnumber =     "98e:68197",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Blondel:1997:WPM,
  author =       "Vincent D. Blondel and John N. Tsitsiklis",
  title =        "When is a pair of matrices mortal?",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "5",
  pages =        "283--286",
  day =          "24",
  month =        sep,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "15A99 (03D15 03D35 68Q25)",
  MRnumber =     "1 475 343",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Goldmann:1997:PTG,
  author =       "Mikael Goldmann",
  title =        "On the power of a threshold gate at the top",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "287--293",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25 94C10)",
  MRnumber =     "98e:68076",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Garg:1997:DCG,
  author =       "Vijay K. Garg and J. Roger Mitchell",
  title =        "Detecting conjunctions of global predicates",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "295--302",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q60)",
  MRnumber =     "1 477 844",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kim:1997:LWL,
  author =       "Sung Kwon Kim",
  title =        "Logarithmic width, linear area upward drawing of {AVL}
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "303--307",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68R10)",
  MRnumber =     "1 477 845",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kim:1997:ESD,
  author =       "Seung-Hoon Kim and Kyungshik Lim and Cheeha Kim",
  title =        "Efficient stream distribution algorithm for
                 heterogeneous multimedia multicast with link capacity
                 constraint",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "309--315",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27 (68M10)",
  MRnumber =     "1 477 846",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Blundo:1997:LBR,
  author =       "Carlo Blundo and Alfredo {De Santis}",
  title =        "Lower bounds for robust secret sharing schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "317--321",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "1 477 847",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Le:1997:NSC,
  author =       "Ng{\d{o}}c-Minh L{\^e}",
  title =        "On non-smooth convex distance functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "323--329",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (52B55)",
  MRnumber =     "1 477 848",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Luccio:1997:IPC,
  author =       "Fabrizio Luccio and Linda Pagli",
  title =        "An insight on {PRAM} computational bounds",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "331--336",
  day =          "8",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q22 (68Q05 68Q25)",
  MRnumber =     "98e:68093",
  bibdate =      "Sat Nov 7 17:55:54 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bertino:1997:TOT,
  author =       "E. Bertino and B. Catania and B. Shidlovsky",
  title =        "Towards optimal two-dimensional indexing for
                 constraint databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "1--8",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15 (68T20)",
  MRnumber =     "1 481 299",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Agrawal:1997:BQG,
  author =       "Divyakant Agrawal and {\"O}mer E{\u{g}}ecio{\u{g}}lu
                 and Amr {El Abbadi}",
  title =        "Billiard quorums on the grid",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "9--16",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "1 481 300",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Belogay:1997:CHD,
  author =       "E. Belogay and C. Cabrelli and U. Molter and R.
                 Shonkwiler",
  title =        "Calculating the {Hausdorff} distance between curves",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "17--22",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U10 (68U05)",
  MRnumber =     "1 481 301",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1997:ECI,
  author =       "Hung-Yi Chang and Rong-Jaye Chen",
  title =        "Embedding cycles in {IEH} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "23--27",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "1 481 302",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kulkarni:1997:MBS,
  author =       "Sandeep S. Kulkarni and Anish Arora",
  title =        "Multitolerant barrier synchronization",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "29--36",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Golic:1997:FCA,
  author =       "J. Dj. Goli{\'c} and M. Salmasizadeh and L. Simpson
                 and E. Dawson",
  title =        "Fast correlation attacks on nonlinear filter
                 generators",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "37--42",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60",
  MRnumber =     "1 481 303",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Baruah:1997:FLS,
  author =       "Sanjoy K. Baruah and Johannes E. Gehrk and C. Greg
                 Plaxton and Ion Stoica and Hussein Abdel-Wahab and
                 Kevin Jeffay",
  title =        "Fair on-line scheduling of a dynamic set of tasks on a
                 single resource",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "1",
  pages =        "43--51",
  day =          "22",
  month =        oct,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20",
  MRnumber =     "1 481 304",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Arnold:1997:RST,
  author =       "A. Arnold and M. Kanta and D. Krob",
  title =        "Recognizable subsets of the two letter plactic
                 monoid",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "53--59",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q70)",
  MRnumber =     "1 482 424",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Coffman:1997:AMP,
  author =       "E. G. {Coffman, Jr.} and L. Flatto and E. N. Gilbert
                 and A. G. Greenberg",
  title =        "An approximate model of processor communication rings
                 under heavy load",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "61--67",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "1 482 425",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kovalyov:1997:BSD,
  author =       "Mikhail Y. Kovalyov and Yakov M. Shafransky",
  title =        "Batch scheduling with deadlines on parallel machines:
                 An {NP}-hard case",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "69--74",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68Q25 90B35)",
  MRnumber =     "1 482 426",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1997:CEG,
  author =       "Gyung-Ok Lee and Do-Hyung Kim",
  title =        "Characterization of extended {${\rm LR}(k)$}
                 grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "75--82",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q52 (68N20)",
  MRnumber =     "1 482 427",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Coupry:1997:SLA,
  author =       "Laurent Coupry",
  title =        "A simple linear algorithm for the edge-disjoint
                 $(s,t)$-paths problem in undirected planar graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "83--86",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05Cxx 68Q25)",
  MRnumber =     "1 482 428",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rhee:1997:TBS,
  author =       "Injong Rhee and Jennifer L. Welch",
  title =        "Time bounds on synchronization in a periodic
                 distributed system",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "87--93",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10",
  MRnumber =     "1 482 429",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1997:EAM,
  author =       "Ye-In Chang and Bi-Yen Yang",
  title =        "Efficient access methods for image databases",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "2",
  pages =        "95--105",
  day =          "5",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dehne:1997:EAC,
  author =       "Frank Dehne and Katia Guimar{\~a}es",
  title =        "Exact and approximate computational geometry solutions
                 of an unrestricted point set stereo matching problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "107--114",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 491 277",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Aaron:1997:FJU,
  author =       "Eric Aaron and David Gries",
  title =        "Formal justification of underspecification for {S5}",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "115--121",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B45)",
  MRnumber =     "1 491 278",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Flouret:1997:NMA,
  author =       "M. Flouret and E. Laugerotte",
  title =        "Noncommutative minimization algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "123--126",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q45 (68Q70)",
  MRnumber =     "1 491 279",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Aceto:1997:CFB,
  author =       "Luca Aceto and Anna Ing{\'o}lfsd{\'o}ttir",
  title =        "A characterization of finitary bisimulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "127--134",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q10 (68Q55)",
  MRnumber =     "1 491 280",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mok:1997:IDI,
  author =       "Wai Yin Mok and David W. Embley",
  title =        "On improving dependency implication algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "135--141",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P15",
  MRnumber =     "1 491 281",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lin:1997:CCR,
  author =       "Min-Sheng Lin and Deng-Jyi Chen",
  title =        "The computational complexity of the reliability
                 problem on distributed systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "143--147",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (68M15)",
  MRnumber =     "1 491 282",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nardelli:1997:CPR,
  author =       "Enrico Nardelli and Vincenzo Mastrobuoni and Alesiano
                 Santomo",
  title =        "Computing a poset from its realizer",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "149--154",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "06A07 (68P05)",
  MRnumber =     "1 491 283",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Albers:1997:RCA,
  author =       "Susanne Albers and Michael Mitzenmacher",
  title =        "Revisiting the {COUNTER} algorithms for list update",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "3",
  pages =        "155--160",
  day =          "29",
  month =        nov,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05",
  MRnumber =     "1 491 284",
  bibdate =      "Sat Nov 7 17:55:55 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Alstrup:1997:OLD,
  author =       "Stephen Alstrup and Jens Peter Secher and Maz Spork",
  title =        "Optimal on-line decremental connectivity in trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "161--164",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q20)",
  MRnumber =     "1 491 285",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cesati:1997:EPT,
  author =       "Marco Cesati and Luca Trevisan",
  title =        "On the efficiency of polynomial time approximation
                 schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "165--171",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68Q25)",
  MRnumber =     "1 491 286",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kabadi:1997:ESP,
  author =       "S. N. Kabadi and Y. P. Aneja",
  title =        "An efficient, strongly polynomial,
                 $\varepsilon$-approximation parametric optimization
                 scheme",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "173--177",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "90C27",
  MRnumber =     "1 491 287",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Domingo:1997:POR,
  author =       "Carlos Domingo and Tatsuie Tsukiji and Osamu
                 Watanabe",
  title =        "{Partial Occam's Razor} and its applications",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "179--185",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q99 (68T05)",
  MRnumber =     "1 491 288",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tyszkiewicz:1997:NKD,
  author =       "Jerzy Tyszkiewicz",
  title =        "A note on the {Kolmogorov} data complexity and
                 nonuniform logical definitions",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "187--195",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30 (03C13 03C40 03C80)",
  MRnumber =     "1 491 289",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Edalat:1997:BAI,
  author =       "Abbas Edalat and David Sharp and Lyndon While",
  title =        "Bounding the attractor of an {IFS}",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "197--202",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65Y25 (28A80 58F03 68U05)",
  MRnumber =     "1 491 290",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bagchi:1997:RSM,
  author =       "Anindo Bagchi",
  title =        "Route selection with multiple metrics",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "203--205",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M10",
  MRnumber =     "1 491 291",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DiZenzo:1997:NIR,
  author =       "Silvano {Di Zenzo} and Paolo Bottoni and Piero
                 Mussio",
  title =        "A notion of information related to computation",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "4",
  pages =        "207--215",
  day =          "13",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q05 (68Q55)",
  MRnumber =     "1 491 292",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Reingold:1997:KMP,
  author =       "Edward M. Reingold and Kenneth J. Urban and David
                 Gries",
  title =        "{K-M-P} string matching revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "217--223",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "1 492 846",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hirata:1997:CSR,
  author =       "Kouichi Hirata",
  title =        "Constructing simply recursive programs from a finite
                 set of good examples",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "225--230",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T05 (68N17)",
  MRnumber =     "1 492 847",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Veloso:1997:MSI,
  author =       "Paulo A. S. Veloso and Sheila R. M. Veloso",
  title =        "On methods for safe introduction of operations",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "231--238",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60",
  MRnumber =     "1 492 848",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rabi:1997:OAO,
  author =       "Muhammad Rabi and Alan T. Sherman",
  title =        "An observation on associative one-way functions in
                 complexity theory",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "239--244",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q15 (68P25 94Axx)",
  MRnumber =     "1 492 849",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wierzbowska:1997:CDS,
  author =       "Izabela Wierzbowska",
  title =        "Checker for data structures which sort elements",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "245--249",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68P10)",
  MRnumber =     "1 492 850",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Slavik:1997:IPG,
  author =       "Petr Slav{\'\i}k",
  title =        "Improved performance of the greedy algorithm for
                 partial cover",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "251--254",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (90C27)",
  MRnumber =     "1 492 851",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dai:1997:NPA,
  author =       "Yang Dai and Kazuo Iwano and Naoki Katoh",
  title =        "A new probabilistic analysis of {Karger}'s randomized
                 algorithm for minimum cut problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "255--261",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C85 68R10 90C27)",
  MRnumber =     "1 492 852",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gupta:1997:TAR,
  author =       "Prosenjit Gupta and Ravi Janardan and Michiel Smid",
  title =        "A technique for adding range restrictions to
                 generalized searching problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "5",
  pages =        "263--269",
  day =          "23",
  month =        dec,
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05",
  MRnumber =     "1 492 853",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Iyengar:1998:EFS,
  author =       "Vikram Iyengar and Krishnendu Chakrabarty",
  title =        "An efficient finite-state machine implementation of
                 {Huffman} decoders",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "271--275",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Turpin:1998:CEH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mitrana:1998:PM,
  author =       "Victor Mitrana",
  title =        "Primitive morphisms",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "277--281",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shokrollahi:1998:RMR,
  author =       "M. A. Shokrollahi and D. A. Spielman and V. Stemann",
  title =        "A remark on matrix rigidity",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "283--285",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Graf:1998:SDQ,
  author =       "T. Graf and V. Kamakoti",
  title =        "Sparse dominance queries for many points in optimal
                 time and space",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "287--291",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Woeginger:1998:TNA,
  author =       "Gerhard J. Woeginger",
  title =        "There is no asymptotic {PTAS} for two-dimensional
                 vector packing",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "293--297",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Boldi:1998:MSD,
  author =       "Paolo Boldi and Sebastiano Vigna",
  title =        "Minimal sense of direction and decision problems for
                 {Cayley} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "299--303",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Alonso:1998:UGS,
  author =       "L. Alonso and J. L. R{\'e}my and R. Schott",
  title =        "Uniform generation of a {Schr{\"o}der} tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "305--308",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Efrat:1998:SSL,
  author =       "Alon Efrat and Otfried Schwarzkopf",
  title =        "Separating and shattering long line segments",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "309--314",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Queinnec:1998:FCD,
  author =       "Christian Queinnec",
  title =        "Fast and compact dispatching for dynamic
                 object-oriented languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "64",
  number =       "6",
  pages =        "315--321",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Raman:1998:SNC,
  author =       "Venkatesh Raman and B. Ravikumar and S. {Srinivasa
                 Rao}",
  title =        "A simplified {NP}-complete {MAXSAT} problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "1--6",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ryan:1998:ARA,
  author =       "P. Y. A. Ryan and S. A. Schneider",
  title =        "An attack on a recursive authentication protocol ---
                 {A} cautionary tale",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "7--10",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lakhal:1998:PAE,
  author =       "J. Lakhal and L. Litzler",
  title =        "A polynomial algorithm for the extendability problem
                 in bipartite graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "11--16",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dunne:1998:IUB,
  author =       "Paul E. Dunne and Michele Zito",
  title =        "An improved upper bound on the non-3-colourability
                 threshold",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "17--23",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Blundo:1998:SSS,
  author =       "Carlo Blundo and Alfredo {De Santis} and Ugo Vaccaro",
  title =        "On secret sharing schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "25--32",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Israeli:1998:TCU,
  author =       "Amos Israeli and Asaf Shirazi",
  title =        "The time complexity of updating snapshot memories",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "33--40",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mahmoud:1998:RFB,
  author =       "Hosam M. Mahmoud",
  title =        "On rotations in fringe-balanced binary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "41--46",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Molva:1998:SSA,
  author =       "R. Molva and G. Tsudik",
  title =        "Secret sets and applications",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "1",
  pages =        "47--55",
  day =          "15",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:56 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Knapik:1998:FQC,
  author =       "Teodor Knapik and {\'E}tienne Payet",
  title =        "The full quotient and its closure property for regular
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "57--62",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ait-Bouziad:1998:IAR,
  author =       "Ahmed Ait-Bouziad and Helen Kassel",
  title =        "An improved algorithm for retrieving fuzzy information
                 from two systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "63--66",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Odijk:1998:ISS,
  author =       "Michiel A. Odijk and Hans {van Maaren}",
  title =        "Improved solutions to the {Steiner} triple covering
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "67--69",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Horng:1998:AAP,
  author =       "Gwoboa Horng",
  title =        "An active attack on protocols for server-aided {RSA}
                 signature computation",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "71--73",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cheng:1998:CSS,
  author =       "T. C. E. Cheng and Q. Ding",
  title =        "The complexity of scheduling starting time dependent
                 tasks with release times",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "75--79",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1998:RGC,
  author =       "Jou-Ming Chang and Chin-Wen Ho",
  title =        "The recognition of geodetically connected graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "81--88",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Grabner:1998:ASR,
  author =       "Peter J. Grabner and Helmut Prodinger",
  title =        "An asymptotic study of a recursion occurring in the
                 analysis of an algorithm on broadcast communication",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "89--93",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Segal:1998:EPS,
  author =       "Michael Segal and Klara Kedem",
  title =        "Enclosing $k$ points in the smallest axis parallel
                 rectangle",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "95--99",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dervos:1998:CSF,
  author =       "D. Dervos and Y. Manolopoulos and P. Linardis",
  title =        "Comparison of signature file models with superimposed
                 coding",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "101--106",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dessmark:1998:NPC,
  author =       "Anders Dessmark and Oscar Garrido and Andrzej Lingas",
  title =        "A note on parallel complexity of maximum
                 $f$-matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "107--109",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Fri Oct 13 13:50:39 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Biedl:1998:RBS,
  author =       "Therese C. Biedl",
  title =        "Relating bends and size in orthogonal graph drawings",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "2",
  pages =        "111--115",
  day =          "29",
  month =        jan,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Arya:1998:FAA,
  author =       "Sunil Arya and H. Ramesh",
  title =        "A $2.5$-factor approximation algorithm for the
                 $k$-{MST} problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "117--118",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wu:1998:NCL,
  author =       "Q. S. Wu and K. M. Chao and R. C. T. Lee",
  title =        "The {NPO}-completeness of the longest {Hamiltonian}
                 cycle problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "119--123",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dasgupta:1998:AUF,
  author =       "Pallab Dasgupta",
  title =        "Agreement under faulty interfaces",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "125--129",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chaudhuri:1998:NCP,
  author =       "Shiva Chaudhuri and Naveen Garg and R. Ravi",
  title =        "The $p$-neighbor $k$-center problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "131--134",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Xiang:1998:APB,
  author =       "Limin Xiang and Kazuo Ushijima",
  title =        "{ANSV} problem on {BSRs}",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "135--138",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Son:1998:GAC,
  author =       "Jung Je Son and Jong In Lim and Seongtaek Chee and Soo
                 Hak Sung",
  title =        "Global avalanche characteristics and nonlinearity of
                 balanced {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "139--144",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kann:1998:AMC,
  author =       "Viggo Kann and Jens Lagergren and Alessandro
                 Panconesi",
  title =        "Approximate {Max} $k$-{Cut} with subgraph guarantee",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "145--150",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  xxtitle =      "Approximate {Max-Cut} with subgraph guarantee",
}

@Article{Hemaspaandra:1998:RWG,
  author =       "Edith Hemaspaandra and J{\"o}rg Rothe",
  title =        "Recognizing when greed can approximate maximum
                 independent sets is complete for parallel access to
                 {NP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "151--156",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1998:OHG,
  author =       "Jeng-Jung Wang and Chun-Nan Hung and Lih-Hsing Hsu",
  title =        "Optimal $1$-{Hamiltonian} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "157--161",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Balasubramanian:1998:IFP,
  author =       "R. Balasubramanian and Michael R. Fellows and
                 Venkatesh Raman",
  title =        "An improved fixed-parameter algorithm for vertex
                 cover",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "3",
  pages =        "163--168",
  day =          "13",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Larsen:1998:REN,
  author =       "Kim S. Larsen",
  title =        "Regular expressions with nested levels of back
                 referencing form a hierarchy",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "169--172",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nawrocki:1998:SCT,
  author =       "Jerzy R. Nawrocki and Adam Czajka and Wojciech
                 Complak",
  title =        "Scheduling cyclic tasks with binary periods",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "173--178",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Vedantham:1998:BAP,
  author =       "Sundararajan Vedantham and S. S. Iyengar",
  title =        "The {Bandwidth Allocation Problem} in the {ATM}
                 network model is {NP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "179--182",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nikolopoulos:1998:NST,
  author =       "S. D. Nikolopoulos and P. Rondogiannis",
  title =        "On the number of spanning trees of multi-star related
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "183--188",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hwang:1998:AUS,
  author =       "Tzonelih Hwang and Chih-Hung Wang",
  title =        "Arbitrated unconditionally secure authentication
                 scheme with multi-senders",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "189--193",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Devroye:1998:RCS,
  author =       "Luc Devroye",
  title =        "On the richness of the collection of subtrees in
                 random binary search trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "195--199",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Poon:1998:PTS,
  author =       "Chung Keung Poon and Binhai Zhu and Francis Chin",
  title =        "A polynomial time solution for labeling a rectilinear
                 map",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "201--207",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shmueli:1998:DSQ,
  author =       "Oded Shmueli and Kurt Shoens",
  title =        "Data sufficiency for queries on cache",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "209--216",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/S0020-0190(97)00205-6",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bshouty:1998:LWT,
  author =       "Nader H. Bshouty and Christino Tamon and David K.
                 Wilson",
  title =        "On learning width two branching programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "4",
  pages =        "217--222",
  day =          "27",
  month =        feb,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:57 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Amir:1998:OAQ,
  author =       "Yair Amir and Avishai Wool",
  title =        "Optimal availability quorum systems: {Theory} and
                 practice",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "223--228",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DellOlmo:1998:AAP,
  author =       "Paolo Dell'Olmo and Hans Kellerer and Maria Grazia
                 Speranza and Zsolt Tuza",
  title =        "A $13/12$ approximation algorithm for bin packing with
                 extendable bins",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "229--233",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Korsh:1998:SLG,
  author =       "James F. Korsh and Seymour Lipschutz",
  title =        "Shifts and loopless generation of $k$-ary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "235--240",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Frank:1998:AFS,
  author =       "Jeremy Frank and Ian P. Gent and Toby Walsh",
  title =        "Asymptotic and finite size parameters for phase
                 transitions: {Hamiltonian} circuit as a case study",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "241--245",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kim:1998:SFS,
  author =       "Heung-Taek Kim and Myoung Ho Kim",
  title =        "Starvation-free secure multiversion concurrency
                 control",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "247--253",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Guan:1998:OMR,
  author =       "D. J. Guan",
  title =        "An optimal message routing algorithm for double-loop
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "255--260",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1998:TSG,
  author =       "Wen-huei Chen",
  title =        "Test sequence generation from the protocol data
                 portion based on the {Selecting Chinese Postman}
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "261--268",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1998:MVP,
  author =       "Danny Z. Chen and Ovidiu Daescu",
  title =        "Maintaining visibility of a polygon with a moving
                 point of view",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "269--275",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bose:1998:PMP,
  author =       "Prosenjit Bose and Jonathan F. Buss and Anna Lubiw",
  title =        "Pattern matching for permutations",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "5",
  pages =        "277--283",
  day =          "13",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{McCune:1998:APC,
  author =       "William McCune",
  title =        "Automatic proofs and counterexamples for some
                 ortholattice identities",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "285--291",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DelLungo:1998:MDS,
  author =       "A. {Del Lungo} and M. Nivat and R. Pinzani and L.
                 Sorri",
  title =        "The medians of discrete sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "293--299",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dahlhaus:1998:MCS,
  author =       "Elias Dahlhaus and Paul D. Manuel and Mirka Miller",
  title =        "Maximum $h$-colourable subgraph problem in balanced
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "301--303",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Andersson:1998:BAA,
  author =       "Gunnar Andersson and Lars Engebretsen",
  title =        "Better approximation algorithms for {Set Splitting}
                 and {Not-All-Equal Sat}",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "305--311",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Herrmann:1998:TAR,
  author =       "Philippe Herrmann",
  title =        "Timed automata and recognizability",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "313--318",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1998:SIV,
  author =       "Kaijung Chang and Yan Huat Tan and Yaakov Varol and
                 Jiang-Hsing Chu",
  title =        "A study on interleaving versus segmentation",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "319--324",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Huang:1998:FSS,
  author =       "Shing-Tsaan Huang and Tzong-Jye Liu",
  title =        "Four-state stabilizing phase clock for unidirectional
                 rings of odd size",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "325--329",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1998:PAC,
  author =       "Yaw-Wen Chang and Chang-Biau Yang",
  title =        "A parallel algorithm for circulant tridiagonal linear
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "65",
  number =       "6",
  pages =        "331--337",
  day =          "27",
  month =        mar,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gavril:1998:IGA,
  author =       "F{\v{a}}nic{\v{a}} Gavril and Oded Shmueli",
  title =        "Intersection graphs of $k$-acyclic families of
                 subtrees and relational database query processing",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "1--6",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rabinovich:1998:NEL,
  author =       "A. Rabinovich",
  title =        "Non-elementary lower bound for {Propositional Duration
                 Calculus}",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "7--11",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wagner:1998:NPQ,
  author =       "Klaus W. Wagner",
  title =        "A note on parallel queries and the
                 symmetric-difference hierarchy",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "13--20",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ding:1998:CGO,
  author =       "Cunsheng Ding and Tor Helleseth",
  title =        "On cyclotomic generator of order $r$",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "21--25",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dannoura:1998:IYF,
  author =       "Eisuke Dannoura and Kouichi Sakurai",
  title =        "An improvement on {El-Yaniv-Fiat-Karp-Turpin}'s
                 money-making bi-directional trading strategy",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "27--33",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mandoiu:1998:OEP,
  author =       "Ion I. M{\u{a}}ndoiu",
  title =        "Optimum extensions of prefix codes",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "35--40",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Fri Oct 13 13:53:01 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hower:1998:RGC,
  author =       "Walter Hower",
  title =        "Revisiting global constraint satisfaction",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "41--48",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Suzuki:1998:BTW,
  author =       "Ichiro Suzuki and Masafumi Yamashita and Hideki
                 Umemoto and Tsunehiko Kameda",
  title =        "Bushiness and a tight worst-case upper bound on the
                 search number of a simple polygon",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "1",
  pages =        "49--52",
  day =          "15",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:58 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bollig:1998:VSF,
  author =       "Beate Bollig and Ingo Wegener",
  title =        "A very simple function that requires exponential size
                 read-once branching programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "53--57",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Luccio:1998:AEM,
  author =       "Flaminia L. Luccio",
  title =        "Almost exact minimum feedback vertex set in meshes and
                 butterflies",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "59--64",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1998:WII,
  author =       "Maw-Shang Chang and P. Nagavamsi and C. {Pandu
                 Rangan}",
  title =        "Weighted irredundance of interval graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "65--70",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Baier:1998:VQP,
  author =       "Christel Baier and Marta Kwiatkowska",
  title =        "On the verification of qualitative properties of
                 probabilistic processes under fairness constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "71--79",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Krumke:1998:MLS,
  author =       "Sven O. Krumke and Hans-Christoph Wirth",
  title =        "On the minimum label spanning tree problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "81--85",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Low:1998:FSA,
  author =       "Chor Ping Low",
  title =        "A fast search algorithm for the quorumcast routing
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "87--92",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chiu:1998:FTB,
  author =       "Ge-Ming Chiu",
  title =        "A fault-tolerant broadcasting algorithm for
                 hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "93--99",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sato:1998:SLC,
  author =       "Tadakazu Sato",
  title =        "Surjective linear cellular automata over
                 {$\mathbb{Z}_m$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "101--104",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Fri Oct 13 13:53:56 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ha:1998:CMM,
  author =       "Jae-Cheol Ha and Sang-Jae Moon",
  title =        "A common-multiplicand method to the {Montgomery}
                 algorithm for speeding up exponentiation",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "2",
  pages =        "105--107",
  day =          "29",
  month =        apr,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Althaus:1998:MNF,
  author =       "Ernst Althaus and Kurt Mehlhorn",
  title =        "Maximum network flow with floating point arithmetic",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "109--113",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rhee:1998:CIG,
  author =       "Chongkye Rhee",
  title =        "On the chromatic index of graphs with $2m+1$ vertices
                 and $2m^2$ edges",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "115--118",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Baek:1998:CHS,
  author =       "Nakhoon Baek and Sung-Yong Shin",
  title =        "On circularly-hidden surface removal",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "119--123",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Czyzowicz:1998:SPR,
  author =       "Jurek Czyzowicz and Evangelos Kranakis and Jorge
                 Urrutia",
  title =        "A simple proof of the representation of bipartite
                 planar graphs as the contact graphs of orthogonal
                 straight line segments",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "125--126",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Xue:1998:FDT,
  author =       "Guoliang Xue and Shangzhi Sun and J. Ben Rosen",
  title =        "Fast data transmission and maximal dynamic flow",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "127--132",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shin:1998:ADB,
  author =       "Chan-Su Shin and Sung Kwon Kim and Sung-Ho Kim and
                 Kyung-Yong Chwa",
  title =        "Algorithms for drawing binary trees in the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "133--139",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kim:1998:ASL,
  author =       "Seongyeol Kim and Ilyong Chung",
  title =        "Application of the special {Latin} square to a
                 parallel routing algorithm on a recursive circulant
                 network",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "141--147",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Litow:1998:NAC,
  author =       "B. Litow and B. Mans",
  title =        "A note on the {{\'A}d{\'a}m} conjecture for double
                 loops",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "149--153",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dimitrov:1998:AME,
  author =       "V. S. Dimitrov and G. A. Jullien and W. C. Miller",
  title =        "An algorithm for modular exponentiation",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "155--159",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cabrelli:1998:LTA,
  author =       "Carlos A. Cabrelli and Ursula M. Molter",
  title =        "A linear time algorithm for a matching problem on the
                 circle",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  pages =        "161--164",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shimozono:1998:HAM,
  author =       "Shinichi Shimozono and Kouichi Hirata and Ayumi
                 Shinohara",
  title =        "On the hardness of approximating the minimum
                 consistent acyclic {DFA} and decision diagram",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "165--170",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fekete:1998:TBM,
  author =       "S{\'a}ndor P. Fekete and William R. Pulleyblank",
  title =        "Traveling the boundary of {Minkowski} sums",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "171--174",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Feuerstein:1998:ETB,
  author =       "Esteban Feuerstein and Stefano Leonardi and Alberto
                 Marchetti-Spaccamela and Nicola Santoro",
  title =        "Efficient token-based control in rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "175--180",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Diks:1998:BUH,
  author =       "Krzysztof Diks and Stefan Dobrev and Evangelos
                 Kranakis and Andrzej Pelc and Peter
                 Ru{\v{z}}i{\v{c}}ka",
  title =        "Broadcasting in unlabeled hypercubes with a linear
                 number of messages",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "181--186",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:57:56 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/44/20/25/abstract.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Miyadera:1998:DFL,
  author =       "Youzou Miyadera and Koushi Anzai and Hiroshi Unno and
                 Takeo Yaku",
  title =        "Depth-first layout algorithm for trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "187--194",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Okuno:1998:PCS,
  author =       "Hiroshi G. Okuno and Shin-ichi Minato and Hideki
                 Isozaki",
  title =        "On the properties of combination set operations",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "195--199",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sung:1998:FTT,
  author =       "Ting-Yi Sung and Chun-Yuan Lin and Yen-Chu Chuang and
                 Lih-Hsing Hsu",
  title =        "Fault tolerant token ring embedding in double loop
                 networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "201--207",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ito:1998:LTA,
  author =       "Hiro Ito and Mitsuo Yokoyama",
  title =        "Linear time algorithms for graph search and
                 connectivity determination on complement graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "209--213",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chiang:1998:AG,
  author =       "Wei-Kuo Chiang and Rong-Jaye Chen",
  title =        "On the arrangement graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "215--219",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Luke:1998:OEM,
  author =       "Edward A. Luke and Ioana Banicescu and Jin Li",
  title =        "The optimal effectiveness metric for parallel
                 application analysis",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "223--229",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Campbell:1998:CMP,
  author =       "Duncan K. G. Campbell",
  title =        "On the {CLUMPS} model of parallel computation",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "231--236",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nash:1998:SPP,
  author =       "Jonathan Nash",
  title =        "Scalable and predictable performance for irregular
                 problems using the {WPRAM} computational model",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "237--246",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kim:1998:RBS,
  author =       "Jin-Soo Kim and Soonhoi Ha and Chu Shik Jhon",
  title =        "Relaxed barrier synchronization for the {BSP} model of
                 computation on message-passing architectures",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "247--253",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Simon:1998:LDA,
  author =       "J. Simon and J.-M. Wierum",
  title =        "The {Latency-of-Data-Access} model for analyzing
                 parallel computation",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "255--261",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Thomborson:1998:ELM,
  author =       "Clark D. Thomborson",
  title =        "The economics of large-memory computations",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "263--268",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Maggs:1998:RTE,
  author =       "Bruce M. Maggs and Eric J. Schwabe",
  title =        "Real-time emulations of bounded-degree networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "5",
  pages =        "269--276",
  day =          "16",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Makris:1998:ATD,
  author =       "Christos Makris and Athanasios Tsakalidis",
  title =        "Algorithms for three-dimensional dominance searching
                 in linear space",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "277--283",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mizuno:1998:TSS,
  author =       "Masaaki Mizuno and Mikhail Nesterenko",
  title =        "A transformation of self-stabilizing serial model
                 programs for asynchronous parallel computing
                 environments",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "285--290",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Schwarz:1998:BCF,
  author =       "S. Schwarz and S. O. Krumke",
  title =        "On budget-constrained flow improvement",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "291--297",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Salhi:1998:PIG,
  author =       "A. Salhi and H. Glaser and D. {De Roure}",
  title =        "Parallel implementation of a genetic-programming based
                 tool for symbolic regression",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "299--307",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1998:IFM,
  author =       "Jiun-Liang Chen and Feng-Jian Wang",
  title =        "An inheritance flow model for class hierarchy
                 analysis",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "309--315",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hsieh:1998:H,
  author =       "Tsu-Miin Hsieh and Yi-Shiung Yeh and Yung-Cheng Hsieh
                 and Chan-Chi Wang",
  title =        "A homophonic {DES}",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "317--320",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DeMarco:1998:BHS,
  author =       "Gianluca {De Marco} and Ugo Vaccaro",
  title =        "Broadcasting in hypercubes and star graphs with
                 dynamic faults",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "6",
  pages =        "321--326",
  day =          "30",
  month =        jun,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hanus:1998:SSI,
  author =       "Michael Hanus and Salvador Lucas and Aart Middeldorp",
  title =        "Strongly sequential and inductively sequential term
                 rewriting systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "1--8",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Liberatore:1998:UMR,
  author =       "Vincenzo Liberatore",
  title =        "Uniform multipaging reduces to paging",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "9--12",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bottoni:1998:SVH,
  author =       "Paolo Bottoni and Stefano Levialdi and Gheorghe
                 P{\u{a}}un",
  title =        "Successful visual human-computer interaction is
                 undecidable",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "13--19",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:13:30 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yang:1998:DPA,
  author =       "Wuu Yang",
  title =        "A data-parallel algorithm for minimum-width tree
                 layout",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "21--28",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Blass:1998:VZO,
  author =       "Andreas Blass and Yuri Gurevich and Vladik Kreinovich
                 and Luc Longpr{\'e}",
  title =        "A variation on the zero-one law",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "29--30",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cerioli:1998:HSS,
  author =       "Marcia R. Cerioli and Hazel Everett and Celina M. H.
                 {de Figueiredo} and Sulamita Klein",
  title =        "The homogeneous set sandwich problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "31--35",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Johannsen:1998:LBM,
  author =       "Jan Johannsen",
  title =        "Lower bounds for monotone real circuit depth and
                 formula size and tree-like {Cutting Planes}",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "37--41",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Waldmann:1998:ERO,
  author =       "Uwe Waldmann",
  title =        "Extending reduction orderings to {ACU-compatible}
                 reduction orderings",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "43--49",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nardelli:1998:FDC,
  author =       "Enrico Nardelli and Guido Proietti and Peter
                 Widmayer",
  title =        "Finding the detour-critical edge of a shortest path
                 between two nodes",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "1",
  pages =        "51--54",
  day =          "16",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DeBonis:1998:IAG,
  author =       "Annalisa {De Bonis} and Ugo Vaccaro",
  title =        "Improved algorithms for group testing with
                 inhibitors",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "57--64",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Audsley:1998:FPS,
  author =       "N. C. Audsley and A. Burns",
  title =        "On fixed priority scheduling, offsets and co-prime
                 task periods",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "65--69",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Krivelevich:1998:CRG,
  author =       "Michael Krivelevich and Benny Sudakov",
  title =        "Coloring random graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "71--74",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Castro:1998:LNM,
  author =       "Jorge Castro and David Guijarro and V{\'\i}ctor
                 Lav{\'\i}n",
  title =        "Learning nearly monotone $k$-term {DNF}",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "75--79",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Montana:1998:KCR,
  author =       "J. L. Monta{\~n}a and Luis M. Pardo",
  title =        "On {Kolmogorov} complexity in the real {Turing}
                 machine setting",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "81--86",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Grolmusz:1998:LBD,
  author =       "Vince Grolmusz",
  title =        "A lower bound for depth-$3$ circuits with {MOD} $m$
                 gates",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "87--90",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rosenberg:1998:FNR,
  author =       "Burton Rosenberg",
  title =        "Fast nondeterministic recognition of context-free
                 languages using two queues",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "91--93",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bergstra:1998:KTV,
  author =       "Jan A. Bergstra and Alban Ponse",
  title =        "Kleene's three-valued logic and process algebra",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "95--103",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Phillips:1998:LTA,
  author =       "Jeffrey Mark Phillips and Abraham P. Punnen and S. N.
                 Kabadi",
  title =        "A linear time algorithm for the bottleneck traveling
                 salesman problem on a {Halin} graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "2",
  pages =        "105--110",
  day =          "30",
  month =        jul,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:00 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Crochemore:1998:AFW,
  author =       "M. Crochemore and F. Mignosi and A. Restivo",
  title =        "Automata and forbidden words",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "111--117",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Majster-Cederbaum:1998:TSE,
  author =       "Mila Majster-Cederbaum and Markus Roggenbach",
  title =        "Transition systems from event structures revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "119--124",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hassin:1998:AAM,
  author =       "Refael Hassin and Shlomi Rubinstein",
  title =        "An approximation algorithm for the maximum traveling
                 salesman problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "125--130",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Damaschke:1998:RGT,
  author =       "Peter Damaschke",
  title =        "Randomized group testing for mutually obscuring
                 defectives",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "131--135",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hu:1998:OAT,
  author =       "T. C. Hu and P. A. Tucker",
  title =        "Optimal alphabetic trees for binary search",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "137--140",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rajasekaran:1998:OPA,
  author =       "Sanguthevar Rajasekaran",
  title =        "An optimal parallel algorithm for sorting multisets",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "141--143",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Pedreschi:1998:WPP,
  author =       "Dino Pedreschi and Salvatore Ruggieri",
  title =        "Weakest preconditions for pure {Prolog} programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "145--150",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1998:TCM,
  author =       "Loon-Been Chen and I-Chen Wu",
  title =        "On the time complexity of minimum and maximum global
                 snapshot problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "151--156",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chalamaiah:1998:FSP,
  author =       "Nimmagadda Chalamaiah and Badrinath Ramamurthy",
  title =        "Finding shortest paths in distributed loop networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "3",
  pages =        "157--161",
  day =          "17",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lobbing:1998:POC,
  author =       "Martin L{\"o}bbing and Detlef Sieling and Ingo
                 Wegener",
  title =        "Parity {OBDDs} cannot be handled efficiently enough",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "163--168",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Backhouse:1998:PAG,
  author =       "Roland Backhouse",
  title =        "Pair algebras and {Galois} connections",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "169--175",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bonabeau:1998:SOM,
  author =       "Eric Bonabeau and Florian H{\'e}naux",
  title =        "Self-organizing maps for drawing large graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "177--184",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Martinelli:1998:IAS,
  author =       "Fabio Martinelli",
  title =        "An improvement of algorithms for solving interface
                 equations",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "185--190",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fujita:1998:QBM,
  author =       "Satoshi Fujita",
  title =        "A quorum based $k$-mutual exclusion by weighted
                 $k$-quorum systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "191--197",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Greco:1998:ETF,
  author =       "G. Greco",
  title =        "Embeddings and the trace of finite sets",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "199--203",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Goldreich:1998:CIP,
  author =       "Oded Goldreich and Johan H{\aa}stad",
  title =        "On the complexity of interactive proofs with bounded
                 communication",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "205--214",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Baader:1998:CBU,
  author =       "Franz Baader",
  title =        "On the complexity of {Boolean} unification",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "4",
  pages =        "215--220",
  day =          "31",
  month =        aug,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1998:SNR,
  author =       "Huaxiong Wang",
  title =        "On syntactic nuclei of rational languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "221--226",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Harary:1998:BSC,
  author =       "Frank Harary and Desh Ranjan",
  title =        "Breaking symmetry in complete graphs by orienting
                 edges: asymptotic bounds",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "227--230",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Burkard:1998:TSP,
  author =       "Rainer E. Burkard and Vladimir G. De{\u{\i}}neko",
  title =        "On the traveling salesman problem with a relaxed
                 {Monge} matrix",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "231--237",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 08:14:21 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nagamochi:1998:NMS,
  author =       "Hiroshi Nagamochi and Toshihide Ibaraki",
  title =        "A note on minimizing submodular functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "239--244",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lucas:1998:RNA,
  author =       "Salvador Lucas",
  title =        "Root-neededness and approximations of neededness",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "245--254",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sterbini:1998:TAR,
  author =       "Andrea Sterbini and Thomas Raschle",
  title =        "An {$O(n^3)$} time algorithm for recognizing threshold
                 dimension $2$ graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "255--259",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gens:1998:ABS,
  author =       "George Gens and Eugene Levner",
  title =        "An approximate binary search algorithm for the
                 multiple-choice knapsack problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "261--265",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gonzalez:1998:IAA,
  author =       "Teofilo F. Gonzalez",
  title =        "Improved approximation algorithms for embedding
                 hyperedges in a cycle",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "5",
  pages =        "267--271",
  day =          "15",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:01 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{RamirezAlfonsin:1998:SAM,
  author =       "J. L. {Ram{\'\i}rez Alfons{\'\i}n}",
  title =        "A special arrangement with minimal number of
                 triangles",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "273--276",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Guaiana:1998:EWP,
  author =       "G. Guaiana and R. Meyer and A. Petit and P. Weil",
  title =        "An extension of the wreath product principle for
                 finite {Mazurkiewicz} traces",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "277--282",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gu:1998:EAP,
  author =       "Qian-Ping Gu and Shietung Peng",
  title =        "An efficient algorithm for $k$-pairwise disjoint paths
                 in star graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "283--287",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chu:1998:RO,
  author =       "Francis Chu",
  title =        "Reducing {$\Omega$} to $\diamondsuit {W}$",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "289--293",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Feder:1998:OCA,
  author =       "Tom{\'a}s Feder and Sunil M. Shende",
  title =        "Online channel allocation in {FDMA} networks with
                 reuse constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "295--302",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chan:1998:BAK,
  author =       "Timothy M. Chan",
  title =        "Backwards analysis of the Karger-Klein-Tarjan
                 algorithm for minimum spanning trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "303--304",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sanders:1998:RPD,
  author =       "P. Sanders",
  title =        "Random permutations on distributed, external and
                 hierarchical memory",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "305--309",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Choi:1998:RTS,
  author =       "Kyunghee Choi and Gihyun Jung and Taegeun Kim and
                 Seunhun Jung",
  title =        "Real-time scheduling algorithm for minimizing maximum
                 weighted error with {$O(N\log N + cN)$} complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "311--315",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Boroujerdi:1998:EAC,
  author =       "Ali Boroujerdi and Jeffrey Uhlmann",
  title =        "An efficient algorithm for computing least cost paths
                 with turn constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "67",
  number =       "6",
  pages =        "317--321",
  day =          "30",
  month =        sep,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Turpin:1998:CEH,
  author =       "Andrew Turpin and Alistair Moffat",
  title =        "Comment on {``Efficient Huffman decoding''} and {``An
                 efficient finite-state machine implementation of
                 Huffman decoders''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "1--2",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Chung:1997:EHD,Iyengar:1998:EFS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Garcia:1998:EAL,
  author =       "Alfredo Garc{\'\i}a and Pedro Jodr{\'a} and Javier
                 Tejel",
  title =        "An efficient algorithm for on-line searching of minima
                 in {Monge} path-decomposable tridimensional arrays",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "3--9",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Caprara:1998:IFA,
  author =       "Alberto Caprara and Romeo Rizzi",
  title =        "Improving a family of approximation algorithms to edge
                 color multigraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "11--15",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Govindan:1998:APO,
  author =       "Rajeev Govindan and Michael A. Langston and Xudong
                 Yan",
  title =        "Approximating the pathwidth of outerplanar graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "17--23",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shin:1998:WDC,
  author =       "Chan-Su Shin and Sung Yong Shin and Kyung-Yong Chwa",
  title =        "The widest $k$-dense corridor problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "25--31",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gartner:1998:EPS,
  author =       "Bernd G{\"a}rtner and Sven Sch{\"o}nherr",
  title =        "Exact primitives for smallest enclosing ellipses",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "33--38",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yeh:1998:VLC,
  author =       "Chi-Hsiang Yeh and Behrooz Parhami",
  title =        "{VLSI} layouts of complete graphs and star graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "39--45",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fraczak:1998:NSO,
  author =       "Wojciech Fraczak and Marek B. Zaremba",
  title =        "A non-{SOS} operational semantics for a process
                 algebra",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "1",
  pages =        "47--54",
  day =          "15",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bottreau:1998:SRK,
  author =       "Anne Bottreau and Yves M{\'e}tivier",
  title =        "Some remarks on the {Kronecker} product of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "55--61",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Warners:1998:LTT,
  author =       "Joost P. Warners",
  title =        "A linear-time transformation of linear inequalities
                 into conjunctive normal form",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "63--69",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ranjan:1998:EAT,
  author =       "D. Ranjan and E. Pontelli and G. Gupta",
  title =        "Efficient algorithms for the temporal precedence
                 problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "71--78",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gabarro:1998:PDL,
  author =       "Joaquim Gabarr{\'o} and Xavier Messeguer",
  title =        "Parallel dictionaries with local rules on {AVL} and
                 brother trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "79--85",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fidge:1998:LVT,
  author =       "C. J. Fidge",
  title =        "A limitation of vector timestamps for reconstructing
                 distributed computations",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "87--91",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Venkatesh:1998:PAB,
  author =       "S. Venkatesh",
  title =        "Pseudo-average block sensitivity equals average
                 sensitivity",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "93--95",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kanth:1998:EDR,
  author =       "K. V. Ravi Kanth and Ambuj Singh",
  title =        "Efficient dynamic range searching using data
                 replication",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "2",
  pages =        "97--105",
  day =          "30",
  month =        oct,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:49:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/19/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/19/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Padro:1998:RVS,
  author =       "Carles Padr{\'o}",
  title =        "Robust vector space secret sharing schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "107--111",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Vajnovszki:1998:LGB,
  author =       "Vincent Vajnovszki",
  title =        "On the loopless generation of binary tree sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "113--117",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:59:16 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/46/18/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/46/18/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jurdzinski:1998:DWP,
  author =       "Marcin Jurdzi{\'n}ski",
  title =        "Deciding the winner in parity games is in {UP} $\cap$
                 co-{UP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "119--124",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 08:37:45 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/ipl/cas_sub/browse/browse.cgi?year=1998&volume=68&issue=3&aid=2076",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Amir:1998:ESC,
  author =       "Amihood Amir and Gad M. Landau and Moshe Lewenstein
                 and Noa Lewenstein",
  title =        "Efficient special cases of pattern matching with
                 swaps",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "125--132",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/ipl/cas_sub/browse/browse.cgi?year=1998&volume=68&issue=3&aid=2077",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Malvestuto:1998:CAF,
  author =       "F. M. Malvestuto",
  title =        "A complete axiomatization of full acyclic join
                 dependencies",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "133--139",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/ipl/cas_sub/browse/browse.cgi?year=1998&volume=68&issue=3&aid=2078",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Low:1998:PTS,
  author =       "Chor-Ping Low",
  title =        "A polynomial time solvable instance of the feasible
                 minimum cover problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "141--146",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/ipl/cas_sub/browse/browse.cgi?year=1998&volume=68&issue=3&aid=2075",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Charatonik:1998:UFT,
  author =       "Witold Charatonik",
  title =        "An undecidable fragment of the theory of set
                 constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "147--151",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/ipl/cas_sub/browse/browse.cgi?year=1998&volume=68&issue=3&aid=2081",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gordon:1998:SMS,
  author =       "Valery Gordon and Wieslaw Kubiak",
  title =        "Single machine scheduling with release and due date
                 assignment to minimize the weighted number of late
                 jobs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "3",
  pages =        "153--159",
  day =          "15",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:56:02 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/ipl/cas_sub/browse/browse.cgi?year=1998&volume=68&issue=3&aid=2079",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Creignou:1998:CVS,
  author =       "Nadia Creignou",
  title =        "Complexity versus stability for classes of
                 propositional formulas",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "161--165",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Posenato:1998:NLB,
  author =       "Roberto Posenato and Massimo Santini",
  title =        "A new lower bound on approximability of the ground
                 state problem for tridimensional {Ising} spin glasses",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "167--171",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hesselink:1998:ICH,
  author =       "Wim H. Hesselink",
  title =        "Invariants for the construction of a handshake
                 register",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "173--177",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kwai:1998:PTD,
  author =       "Ding-Ming Kwai and Behrooz Parhami",
  title =        "Pruned three-dimensional toroidal networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "179--183",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sanchez:1998:ICP,
  author =       "Pedro P. Sanchez and Refik Soyer",
  title =        "Information concepts and pairwise comparison
                 matrices",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "185--188",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mansour:1998:LCN,
  author =       "Yishay Mansour and Michal Parnas",
  title =        "Learning conjunctions with noise under product
                 distributions",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "189--196",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gilbert:1998:ASR,
  author =       "Henri Gilbert and Dipankar Gupta and Andrew Odlyzko
                 and Jean-Jacques Quisquater",
  title =        "Attacks on {Shamir}'s `{RSA} for paranoids'",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "197--199",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Jul 19 07:20:21 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.research.att.com/~amo/doc/rsa.for.paranoids.pdf;
                 http://www.research.att.com/~amo/doc/rsa.for.paranoids.ps;
                 http://www.research.att.com/~amo/doc/rsa.for.paranoids.tex",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kloks:1998:VRA,
  author =       "Ton Kloks and Haiko M{\"u}ller and C. K. Wong",
  title =        "Vertex ranking of asteroidal triple-free graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "201--206",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sengupta:1998:REH,
  author =       "Abhijit Sengupta",
  title =        "On ring embedding in hypercubes with faulty nodes and
                 links",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "207--214",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cheng:1998:MVR,
  author =       "Yi Chang Cheng and Erl Huei Lu and Shaw Woei Wu",
  title =        "A modified version of the {Rao--Nam} algebraic-code
                 encryption scheme",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "4",
  pages =        "215--217",
  day =          "30",
  month =        nov,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:01 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ustimenko:1998:CCE,
  author =       "A. P. Ustimenko",
  title =        "Colored cause--effect structures",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "219--225",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Zheng:1998:HCE,
  author =       "Yuliang Zheng and Hideki Imai",
  title =        "How to construct efficient signcryption schemes on
                 elliptic curves",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "227--233",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1998:DSA,
  author =       "Kyung Oh Lee and Heon Y. Yeom",
  title =        "A dynamic scheduling algorithm for large scale
                 multimedia servers",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "235--240",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Guruswami:1998:NFO,
  author =       "Venkatesan Guruswami and C. Pandu Rangan",
  title =        "A natural family of optimization problems with
                 arbitrarily small approximation thresholds",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "241--248",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jonsson:1998:NON,
  author =       "P. Jonsson",
  title =        "Near-optimal nonapproximability results for some {Npo
                 PB}-complete problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "249--253",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bultena:1998:EMA,
  author =       "Bette Bultena and Frank Ruskey",
  title =        "An {Eades--McKay} algorithm for well-formed
                 parentheses strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "255--259",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sereno:1998:BSE,
  author =       "Matteo Sereno",
  title =        "Binary search with errors and variable cost queries",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "5",
  pages =        "261--270",
  day =          "15",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:04 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rifa:1998:NAA,
  author =       "Josep Rif{\`a}",
  title =        "A new algebraic algorithm to decode the ternary
                 {Golay} code",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "271--274",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sinha:1998:SPS,
  author =       "Rakesh K. Sinha",
  title =        "Simulation of {PRAM}s with scan primitives by
                 unbounded fan-in circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "275--282",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Calera-Rubio:1998:CRE,
  author =       "Jorge Calera-Rubio and Rafael C. Carrasco",
  title =        "Computing the relative entropy between regular tree
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "283--289",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Harms:1998:SOA,
  author =       "Janelle J. Harms",
  title =        "A simple optimal algorithm for scheduling
                 variable-sized requests",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "291--293",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yan:1998:FNS,
  author =       "Wen-Ming Yan and Wendy Myrvold and Kuo-Liang Chung",
  title =        "A formula for the number of spanning trees of a
                 multi-star related graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "295--298",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Szepietowski:1998:WSO,
  author =       "Andrzej Szepietowski",
  title =        "Weak and strong one-way space complexity classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "299--302",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Fraigniaud:1998:HBN,
  author =       "Pierre Fraigniaud",
  title =        "Hierarchical broadcast networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "303--305",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kuhn:1998:LCV,
  author =       "Ulrich K{\"u}hn",
  title =        "Local calculation of {Voronoi} diagrams",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "307--312",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kloks:1998:BCG,
  author =       "Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller",
  title =        "Bandwidth of chain graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "313--315",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Collins:1998:ILB,
  author =       "Michael J. Collins and Bernard M. E. Moret",
  title =        "Improved lower bounds for the link length of
                 rectilinear spanning paths in grids",
  journal =      j-INFO-PROC-LETT,
  volume =       "68",
  number =       "6",
  pages =        "317--319",
  day =          "30",
  month =        dec,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Jul 17 18:06:06 MDT 1999",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Denis:1999:FMD,
  author =       "Fran{\c{c}}ois Denis",
  title =        "Finding a minimal $1$-{DNF} consistent with a positive
                 sample is {LOGSNP}-complete",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "1--5",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gupta:1999:EAC,
  author =       "Prosenjit Gupta and Ravi Janardan and Michiel Smid",
  title =        "Efficient algorithms for counting and reporting
                 pairwise intersections between convex polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "7--13",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Deogun:1999:CRP,
  author =       "Jitender S. Deogun and K. Gopalakrishnan",
  title =        "Consecutive retrieval property---revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "15--20",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sung:1999:GAC,
  author =       "Soo Hak Sung and Seongtaek Chee and Choonsik Park",
  title =        "Global avalanche characteristics and propagation
                 criterion of balanced {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "21--24",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Strijk:1999:LRM,
  author =       "Tycho Strijk and Marc van Kreveld",
  title =        "Labeling a rectilinear map more efficiently",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "25--30",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tsai:1999:EDF,
  author =       "Jichiang Tsai and Yi-Min Wang and Sy-Yen Kuo",
  title =        "Evaluations of domino-free communication-induced
                 checkpointing protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "31--37",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1999:TAS,
  author =       "Jae-Ha Lee and Kyung-Yong Chwa",
  title =        "Tight analysis of a self-approaching strategy for the
                 online kernel-search problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "39--45",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kruszewski:1999:NHS,
  author =       "Paul Kruszewski",
  title =        "A note on the {Horton--Strahler} number for random
                 binary search trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "1",
  pages =        "47--51",
  day =          "15",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:39 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/17/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/17/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lin:1999:STP,
  author =       "Guo-Hui Lin and Guoliang Xue",
  title =        "{Steiner} tree problem with minimum number of
                 {Steiner} points and bounded edge-length",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "53--57",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bordihn:1999:HLG,
  author =       "H. Bordihn and M. Holzer",
  title =        "On a hierarchy of languages generated by cooperating
                 distributed grammar systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "59--62",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wu:1999:EAL,
  author =       "Bang Ye Wu and Kun-Mao Chao and Chuan Yi Tang",
  title =        "An efficient algorithm for the length-constrained
                 heaviest path problem on a tree",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "63--67",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1999:MNN,
  author =       "Ju-Hong Lee and Guang-Ho Cha and Chin-Wan Chung",
  title =        "A model for {$k$}-nearest neighbor query processing
                 cost in multidimensional data space",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "69--76",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chauhan:1999:PBR,
  author =       "S. R. Chauhan and I. A. Stewart",
  title =        "On the power of built-in relations in certain classes
                 of program schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "77--82",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Zimand:1999:RRO,
  author =       "Marius Zimand",
  title =        "Relative to a random oracle, {P\slash poly} is not
                 measurable in {EXP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "83--86",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ho:1999:SAP,
  author =       "Chin-Wen Ho and Jou-Ming Chang",
  title =        "Solving the all-pairs-shortest-length problem on
                 chordal bipartite graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "87--93",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1999:CTG,
  author =       "Chih-Hung Wang and Tzonelih Hwang and Narn-Yih Lee",
  title =        "Comments on two group signatures",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "95--97",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Karpovsky:1999:CVF,
  author =       "Mark G. Karpovsky and Krishnendu Chakrabarty and Lev
                 B. Levitin and Dimiter R. Avresky",
  title =        "On the covering of vertices for fault diagnosis in
                 hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "2",
  pages =        "99--103",
  day =          "29",
  month =        jan,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:41 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/18/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/18/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cregut:1999:PPE,
  author =       "P. Cr{\'e}gut and B. Heyd",
  title =        "Progress properties for empty {Unity} programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "107--109",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1999:CQS,
  author =       "Zheng Wang",
  title =        "On the complexity of quality of service routing",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "111--114",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1999:STR,
  author =       "Yongge Wang",
  title =        "A separation of two randomness concepts",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "115--118",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1999:MEF,
  author =       "Hong-Chung Chen and Yue-Li Wang and Yu-Feng Lan",
  title =        "A memory-efficient and fast {Huffman} decoding
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "119--122",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Baronaigien:1999:MSM,
  author =       "Dominique Roelants van Baronaigien",
  title =        "A multi-stack method for the fast generation of
                 permutations with minimal length increasing
                 subsequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "123--126",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cai:1999:COB,
  author =       "Leizhen Cai and Yinfeng Xu and Binhai Zhu",
  title =        "Computing the optimal bridge between two convex
                 polygons",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "127--130",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Stinson:1999:ARS,
  author =       "D. R. Stinson and R. Wei",
  title =        "An application of ramp schemes to broadcast
                 encryption",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "131--135",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Alur:1999:UPO,
  author =       "Rajeev Alur and Doron Peled",
  title =        "Undecidability of partial order logics",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "137--143",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Golic:1999:SCE,
  author =       "J. Dj. Goli{c{\'{}}}",
  title =        "Stream cipher encryption of random access files",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "145--148",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Terekhov:1999:TED,
  author =       "I. Terekhov and T. Camp",
  title =        "Time efficient deadlock resolution algorithms",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "149--154",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/26/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/26/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Iwasaki:1999:IST,
  author =       "Yukihiro Iwasaki and Yuka Kajiwara and Koji Obokata
                 and Yoshihide Igarashi",
  title =        "Independent spanning trees of chordal rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "3",
  pages =        "155--160",
  day =          "12",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:43 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/19/27/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/19/27/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sugimoto:1999:GLD,
  author =       "Noriko Sugimoto and Hiroki Ishizaka",
  title =        "Generating languages by a derivation procedure for
                 elementary formal systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "161--166",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cai:1999:CPP,
  author =       "Jin-Yi Cai",
  title =        "A classification of the probabilistic polynomial time
                 hierarchy under fault tolerant access to oracle
                 classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "167--174",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Damm:1999:DES,
  author =       "Carsten Damm",
  title =        "Depth-efficient simulation of {Boolean} semi-unbounded
                 circuits by arithmetic ones",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "175--179",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Arvind:1999:SSA,
  author =       "V. Arvind and Jacobo Tor{\'a}n",
  title =        "Sparse sets, approximable sets, and parallel queries
                 to {NP}",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "181--188",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Robins:1999:DSR,
  author =       "Gabriel Robins and Brian L. Robinson and Bhupinder S.
                 Sethi",
  title =        "On detecting spatial regularity in noisy images",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "189--195",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Arvind:1999:SMM,
  author =       "A. Arvind and C. Pandu Rangan",
  title =        "{Symmetric Min--Max} heap: {A} simpler data structure
                 for double-ended priority queue",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "197--199",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{DeSantis:1999:GCP,
  author =       "Alfredo {De Santis} and Giovanni Di Crescenzo and Oded
                 Goldreich and Giuseppe Persiano",
  title =        "The graph clustering problem has a perfect
                 zero-knowledge interactive proof",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "201--206",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nepomniaschy:1999:SVM,
  author =       "V. A. Nepomniaschy",
  title =        "Symbolic verification method for definite iteration
                 over data structures",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "4",
  pages =        "207--213",
  day =          "26",
  month =        feb,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:45 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/20/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/20/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Aichholzer:1999:NRM,
  author =       "Oswin Aichholzer and Franz Aurenhammer and Reinhard
                 Hainz",
  title =        "New results on {MWT} subgraphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "215--219",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Schobbens:1999:LSS,
  author =       "P.-Y. Schobbens and J.-F. Raskin",
  title =        "The logic of ``initially'' and ``next'': {Complete}
                 axiomatization and complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "221--225",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Garcia-Villalba:1999:GCN,
  author =       "L. J. Garc{\'\i}a-Villalba and A. F{\'u}ster-Sabater",
  title =        "On the general classification of nonlinear filters of
                 $m$-sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "227--232",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mizuno:1999:SAD,
  author =       "Masaaki Mizuno",
  title =        "A structured approach for developing concurrent
                 programs in {Java}",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "233--238",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cheriyan:1999:AHL,
  author =       "Joseph Cheriyan and Kurt Mehlhorn",
  title =        "An analysis of the highest-level selection rule in the
                 preflow-push max-flow algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "239--242",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yan:1999:CUU,
  author =       "K. Q. Yan and S. C. Wang and Y. H. Chin",
  title =        "Consensus under unreliable transmission",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "243--248",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Radhakrishnan:1999:PAD,
  author =       "D. Radhakrishnan and A. P. Preethy",
  title =        "A parallel approach to direct analog-to-residue
                 conversion",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "249--252",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Torres:1999:SIS,
  author =       "Marco A. Torres and Susumu Kuroyanagi and Akira
                 Iwata",
  title =        "The {Self-Indexed Search Algorithm}: {A} bit-level
                 approach to minimal perfect hashing",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "253--258",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bshouty:1999:MTR,
  author =       "Nader H. Bshouty and Lisa Higham and Jolanta
                 Warpechowska-Gruca",
  title =        "Meeting times of random walks on graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "5",
  pages =        "259--265",
  day =          "12",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:47 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/47/21/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/47/21/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jukna:1999:LCH,
  author =       "Stasys Jukna",
  title =        "Linear codes are hard for oblivious read-once parity
                 branching programs",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "267--269",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Gobel:1999:RTU,
  author =       "Manfred G{\"o}bel",
  title =        "A rewriting technique for universal polynomial
                 invariants",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "271--273",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Liu:1999:SGU,
  author =       "Zhaohui Liu and Wenci Yu and T. C. Edwin Cheng",
  title =        "Scheduling groups of unit length jobs on two identical
                 parallel machines",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "275--281",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chrobak:1999:RCP,
  author =       "Marek Chrobak and Christoph D{\"u}rr",
  title =        "Reconstructing $hv$-convex polyominoes from orthogonal
                 projections",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "283--289",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Saouter:1999:CAN,
  author =       "Yannick Saouter and Herv{\'e} Le Verge",
  title =        "Computability of affine non-conditional recurrent
                 systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "291--295",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tzeng:1999:IPI,
  author =       "Wen-Guey Tzeng and Chi-Ming Hu",
  title =        "Inter-protocol interleaving attacks on some
                 authentication and key distribution protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "297--302",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Manos:1999:CH,
  author =       "H. Manos",
  title =        "Construction of halvers",
  journal =      j-INFO-PROC-LETT,
  volume =       "69",
  number =       "6",
  pages =        "303--307",
  day =          "26",
  month =        mar,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:50 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/47/22/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/47/22/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Harper:1999:PVG,
  author =       "Robert Harper and John C. Mitchell",
  title =        "Parametricity and variants of {Girard}'s {J}
                 operator",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "1--5",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Korsh:1999:LGG,
  author =       "James F. Korsh and Paul LaFollette",
  title =        "Loopless generation of {Gray} codes for $k$-ary
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "7--11",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Barden:1999:EDS,
  author =       "Benjamin Barden and Ran Libeskind-Hadas and Janet
                 Davis and William Williams",
  title =        "On edge-disjoint spanning trees in hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "13--16",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1999:MWT,
  author =       "Cao An Wang and Francis Y. Chin and Bo Ting Yang",
  title =        "Maximum weight triangulation and graph drawing",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "17--22",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kucera:1999:FRI,
  author =       "Anton{\'\i}n Ku{\v{c}}era",
  title =        "On finite representations of infinite-state
                 behaviours",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "23--30",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Katajainen:1999:PSF,
  author =       "Jyrki Katajainen and Tomi A. Pasanen",
  title =        "In-place sorting with fewer moves",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "31--37",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Khuller:1999:BMC,
  author =       "Samir Khuller and Anna Moss and Joseph (Seffi) Naor",
  title =        "The budgeted maximum coverage problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "39--45",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Shachnai:1999:MMT,
  author =       "Hadas Shachnai and John J. Turek",
  title =        "Multiresource malleable task scheduling to minimize
                 response time",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "1",
  pages =        "47--52",
  day =          "16",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:52 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/17/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/17/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{delaVega:1999:AHD,
  author =       "W. Fernandez de la Vega and M. Karpinski",
  title =        "On the approximation hardness of dense {TSP} and other
                 path problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "53--55",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Roussel:1999:LAC,
  author =       "F. Roussel and I. Rusu",
  title =        "A linear algorithm to color {$i$}-triangulated
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "57--62",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Atkinson:1999:PSP,
  author =       "M. D. Atkinson and J.-R. Sack",
  title =        "Pop-stacks in parallel",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "63--67",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Barbuti:1999:AIT,
  author =       "Roberto Barbuti and Nicoletta De Francesco and
                 Antonella Santone and Gigliola Vaglini",
  title =        "Abstract interpretation of trace semantics for
                 concurrent calculi",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "69--78",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1999:STI,
  author =       "Narn-Yih Lee and Tzonelih Hwang and Chih-Hung Wang",
  title =        "The security of two {ID}-based multisignature
                 protocols for sequential and broadcasting
                 architectures",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "79--81",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Biham:1999:BGD,
  author =       "Eli Biham and Dan Boneh and Omer Reingold",
  title =        "Breaking generalized {Diffie--Hellman} modulo a
                 composite is no easier than factoring",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "83--87",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Simpson:1999:FCA,
  author =       "L. Simpson and J. Goli{\'c} and M. Salmasizadeh and E.
                 Dawson",
  title =        "A fast correlation attack on multiplexer generators",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "89--93",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rosenbloom:1999:SPM,
  author =       "Arnold Rosenbloom",
  title =        "On the sets of perfect matchings for two bipartite
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "95--97",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Leino:1999:VCS,
  author =       "K. Rustan M. Leino and Raymie Stata",
  title =        "Virginity: {A} contribution to the specification of
                 object-oriented software",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "2",
  pages =        "99--105",
  day =          "30",
  month =        apr,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:54 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/18/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/18/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wright:1999:RRS,
  author =       "William E. Wright",
  title =        "A refinement of replacement selection",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "107--111",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jain:1999:QNM,
  author =       "Sanjay Jain",
  title =        "On a question of nearly minimal identification of
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "113--117",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Quaglia:1999:EIO,
  author =       "Francesco Quaglia and Roberto Baldoni",
  title =        "Exploiting intra-object dependencies in parallel
                 simulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "119--125",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Powell:1999:VDC,
  author =       "David R. Powell and Lloyd Allison and Trevor I. Dix",
  title =        "A versatile divide and conquer technique for optimal
                 string alignment",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "127--139",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dinitz:1999:AZS,
  author =       "Yefim Dinitz and Alon Itai and Michael Rodeh",
  title =        "On an algorithm of {Zemlyachenko} for subtree
                 isomorphism",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "141--146",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{deFigueiredo:1999:TCN,
  author =       "Celina M. H. de Figueiredo and Jo{\~a}o Meidanis and
                 C{\'e}lia Picinin de Mello",
  title =        "Total-chromatic number and chromatic index of dually
                 chordal graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "147--152",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tzeng:1999:CMC,
  author =       "Wen-Guey Tzeng",
  title =        "Common modulus and chosen-message attacks on
                 public-key schemes with linear recurrence relations",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "3",
  pages =        "153--156",
  day =          "14",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:56 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/19/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/19/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bernasconi:1999:CBB,
  author =       "A. Bernasconi",
  title =        "On the complexity of balanced {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "4",
  pages =        "157--163",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:58 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/20/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/20/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bertino:1999:FRN,
  author =       "E. Bertino and B. Catania and Limsoon Wong",
  title =        "Finitely representable nested relations",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "4",
  pages =        "165--173",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:58 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/20/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/20/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1999:ACR,
  author =       "Yangjun Chen",
  title =        "Arc consistency revisited",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "4",
  pages =        "175--184",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:58 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/20/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/20/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Amir:1999:RSM,
  author =       "Amihood Amir and Ayelet Butman and Moshe Lewenstein",
  title =        "Real scaled matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "4",
  pages =        "185--190",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:58 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/20/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/20/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lin:1999:FOP,
  author =       "Yen-Chun Lin and Chun-Keng Liu",
  title =        "Finding optimal parallel prefix circuits with fan-out
                 $2$ in constant time",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "4",
  pages =        "191--195",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:58 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/20/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/20/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Huang:1999:TDP,
  author =       "Kuo-Chan Huang and Feng-Jian Wang and Jyun-Hwei Tsai",
  title =        "Two design patterns for data-parallel computation
                 based on master-slave model",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "4",
  pages =        "197--204",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:43:58 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/20/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/20/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Buhrman:1999:LBQ,
  author =       "Harry Buhrman and Ronald de Wolf",
  title =        "A lower bound for quantum search of an ordered list",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "205--209",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Morillo:1999:WTS,
  author =       "P. Morillo and C. Padr{\'o} and G. S{\'a}ez and J. L.
                 Villar",
  title =        "Weighted threshold secret sharing schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "211--216",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Emerald:1999:NIU,
  author =       "J. D. Emerald and K. G. Subramanian and D. G. Thomas",
  title =        "A note on inferring uniquely terminating code
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "217--222",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Young-Lai:1999:ASM,
  author =       "Matthew Young-Lai",
  title =        "Adding state merging to the {DMC} data compression
                 algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "223--228",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Johansson:1999:SDD,
  author =       "{\"O}jvind Johansson",
  title =        "Simple distributed {$\Delta+1$}-coloring of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "229--232",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Guijarro:1999:ELW,
  author =       "David Guijarro and V{\'\i}ctor Lav{\'\i}n and Vijay
                 Raghavan",
  title =        "Exact learning when irrelevant variables abound",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "233--239",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nath:1999:AEL,
  author =       "Suman Kumar Nath and Rezaul Alam Chowdhury and M.
                 Kaykobad",
  title =        "On average edge length of minimum spanning trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "241--243",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Franzblau:1999:EDB,
  author =       "D. S. Franzblau",
  title =        "Ear decomposition with bounds on ear length",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "245--249",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Arikati:1999:CCS,
  author =       "Srinivasa R. Arikati and Kurt Mehlhorn",
  title =        "A correctness certificate for the {Stoer--Wagner}
                 min-cut algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "5",
  pages =        "251--254",
  day =          "21",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:01 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/48/21/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/48/21/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hwang:1999:PRL,
  author =       "W.-P. Hwang and C.-L. Wang",
  title =        "In-place random list permutations",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "6",
  pages =        "255--257",
  day =          "30",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:03 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/22/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/22/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chou:1999:DFT,
  author =       "C.-y. Chou and D. J. Guan and K.-l. Wang",
  title =        "A dynamic fault-tolerant message routing algorithm for
                 double-loop networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "6",
  pages =        "259--264",
  day =          "30",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:03 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See erratum \cite{Chou:1999:ESD}.",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/22/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/22/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Crvenkovic:1999:NEC,
  author =       "S. Crvenkovi{\'{c}} and I. Dolinka and Z. {\'E}sik",
  title =        "A note on equations for commutative regular
                 languages",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "6",
  pages =        "265--267",
  day =          "30",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:03 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/22/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/22/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kindler:1999:LFR,
  author =       "E. Kindler and W. van der Aalst",
  title =        "Liveness, fairness, and recurrence in {Petri} nets",
  journal =      j-INFO-PROC-LETT,
  volume =       "70",
  number =       "6",
  pages =        "269--274",
  day =          "30",
  month =        jun,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:03 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/48/22/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/48/22/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tseng:1999:ATS,
  author =       "Yuh-Min Tseng and Jinn-Ke Jan",
  title =        "Attacks on threshold signature schemes with traceable
                 signers",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "1--4",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ambainis:1999:NQB,
  author =       "Andris Ambainis",
  title =        "A note on quantum black-box complexity of almost all
                 {Boolean} functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "5--7",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Datta:1999:ESS,
  author =       "Alak Kumar Datta and Ranjan Kumar Sen",
  title =        "An efficient scheme to solve two problems for
                 two-terminal series parallel graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "9--15",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Torng:1999:TLB,
  author =       "Eric Torng and Patchrawat Uthaisombut",
  title =        "A tight lower bound for the best-$\alpha$ algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "17--22",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hu:1999:RG,
  author =       "Qing Hu and Yixin Zhang and Xiaojun Shen",
  title =        "Rearrangeable graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "23--27",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chu:1999:VCA,
  author =       "P. C. Chu",
  title =        "Verbs are not cases: {Applying} case grammar to
                 document retrieval",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "29--34",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tsuchiya:1999:CBQ,
  author =       "Tatsuhiro Tsuchiya and Nobuhiko Ido and Tohru Kikuno",
  title =        "Constructing {Byzantine Quorum} systems from
                 combinatorial designs",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "35--42",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Xiang:1999:RSI,
  author =       "Limin Xiang and Kazuo Ushijima",
  title =        "Rearranging scattered information on {BSR}",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "1",
  pages =        "43--47",
  day =          "16",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:05 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/17/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/17/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Cheng:1999:TMF,
  author =       "T. C. E. Cheng and G. Wang",
  title =        "Two-machine flowshop scheduling with consecutive
                 availability constraints",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "49--54",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/17/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/17/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Goldreich:1999:ASL,
  author =       "O. Goldreich and D. Micciancio and S. Safra and J.-P.
                 Seifert",
  title =        "Approximating shortest lattice vectors is not harder
                 than approximating closest lattice vectors",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "55--61",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/18/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/18/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Yamakami:1999:NCC,
  author =       "T. Yamakami and A. C. Yao",
  title =        "{NQP$_C$} = co-{C$_=$P}",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "63--69",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/19/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/19/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Xiang:1999:TRB,
  author =       "L. Xiang and K. Ushijima",
  title =        "A theorem on the relation between {BSR$_k$} and
                 {BSR$^+$}",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "71--73",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/20/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/20/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Li:1999:CBA,
  author =       "C. M. Li",
  title =        "A constraint-based approach to narrow search trees for
                 satisfiability",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "75--80",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/21/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/21/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dobrev:1999:OBH,
  author =       "S. Dobrev and I. Vr{\u{t}}o",
  title =        "Optimal broadcasting in hypercubes with dynamic
                 faults",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "81--85",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/22/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/22/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Klavzar:1999:GWL,
  author =       "S. Klav{\v{z}}ar and J. Koolen and H. M. Mulder",
  title =        "Graphs which locally mirror the hypercube structure",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "87--90",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/23/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/23/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lin:1999:EPP,
  author =       "Y.-C. Lin and C.-S. Yeh",
  title =        "Efficient parallel prefix algorithms on multiport
                 message-passing systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "2",
  pages =        "91--95",
  day =          "30",
  month =        jul,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:07 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/18/24/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/18/24/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kemp:1999:OOC,
  author =       "Rainer Kemp",
  title =        "A one-to-one correspondence between a class of leftist
                 trees and binary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "97--105",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Crochemore:1999:FPM,
  author =       "Maxime Crochemore and A. Czumaj and L. Gs{\k{a}}ieniec
                 and T. Lecroq and W. Plandowski and W. Rytter",
  title =        "Fast practical multi-pattern matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "107--113",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Jan 26 09:55:58 2004",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/26/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/26/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Levene:1999:HPI,
  author =       "Mark Levene and George Loizou",
  title =        "How to prevent interaction of functional and inclusion
                 dependencies",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "115--125",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/27/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/27/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dror:1999:TPS,
  author =       "M. Dror and W. Kubiak and J. Y-T. Leung",
  title =        "Tree precedence in scheduling: {The} strong-weak
                 distinction",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "127--134",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/28/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/28/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bar-Noy:1999:MAB,
  author =       "Amotz Bar-Noy and Magn{\'u}s M. Halld{\'o}rsson and
                 Guy Kortsarz",
  title =        "A matched approximation bound for the sum of a greedy
                 coloring",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "135--140",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/29/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/29/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Bhatt:1999:IWP,
  author =       "P. C. P. Bhatt",
  title =        "An interesting way to partition a number",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "141--148",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/30/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/30/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Maitra:1999:HWC,
  author =       "Subhamoy Maitra and Palash Sarkar",
  title =        "{Hamming} weights of correlation immune {Boolean}
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "149--153",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/31/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/31/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Aguilera:1999:SBP,
  author =       "Marcos Kawazoe Aguilera and Sam Toueg",
  title =        "A simple bivalency proof that $t$-resilient consensus
                 requires $t+1$ rounds",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "155--158",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/32/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/32/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Plaisted:1999:CSC,
  author =       "David A. Plaisted and Gregory Kucherov",
  title =        "The complexity of some complementation problems",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "159--165",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/33/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/33/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jayanti:1999:CGD,
  author =       "Prasad Jayanti and Tushar Deepak Chandra and Sam
                 Toueg",
  title =        "The cost of graceful degradation for omission
                 failures",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "3--4",
  pages =        "167--172",
  day =          "27",
  month =        aug,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:09 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/49/28/34/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/49/28/34/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Dassow:1999:MMN,
  author =       "J{\"u}rgen Dassow and Gheorghe P{\u{a}}un",
  title =        "Min of {Mat} is not necessarily {Mat}",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "175--177",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Alfonsin:1999:CAR,
  author =       "J. L. Ram{\'\i}rez Alfons{\'\i}n",
  title =        "Cyclic arrangements and {Roudneff}'s conjecture in the
                 space",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "179--182",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/26/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/26/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ramnath:1999:SSR,
  author =       "Sarnath Ramnath and Venkatesh Raman",
  title =        "Selecting small ranks in {EREW PRAM}",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "183--186",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/27/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/27/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lotker:1999:NRM,
  author =       "Zvi Lotker and Boaz Patt-Shamir",
  title =        "A note on randomized mutual search",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "187--191",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/28/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/28/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wojna:1999:CM,
  author =       "Arkadiusz Wojna",
  title =        "Counter machines",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "193--197",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/29/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/29/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nourine:1999:FAB,
  author =       "Lhouari Nourine and Olivier Raynaud",
  title =        "A fast algorithm for building lattices",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "199--204",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/30/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/30/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lan:1999:LTA,
  author =       "Yu-Feng Lan and Yue-Li Wang and Hitoshi Suzuki",
  title =        "A linear-time algorithm for solving the center problem
                 on weighted cactus graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "205--212",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/31/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/31/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kim:1999:TAP,
  author =       "Jong Soo Kim and Sung Tak Kang and Myoung Ho Kim",
  title =        "On temporal aggregate processing based on time
                 points",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "213--220",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/32/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/32/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Abellanas:1999:STD,
  author =       "Manuel Abellanas and Ferran Hurtado and Pedro A.
                 Ramos",
  title =        "Structural tolerance and {Delaunay} triangulation",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "221--227",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/33/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/33/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Vasconcelos:1999:CEC,
  author =       "Vasco T. Vasconcelos and Ant{\'o}nio Ravara",
  title =        "Communication errors in the {$\pi$}-calculus are
                 undecidable",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "229--233",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/34/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/34/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Symvonis:1999:NDW,
  author =       "Antonios Symvonis",
  title =        "A note on deflection worm routing on meshes",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "235--239",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/35/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/35/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chou:1999:ESD,
  author =       "Chun-yen Chou and D. J. Guan and Kuei-lin Wang",
  title =        "Erratum to {``A dynamic fault-tolerant message routing
                 algorithm for double-loop networks'', Information
                 Processing Letters {\bf 70}(6) (1999) 259--264}",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "241--241",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Chou:1999:DFT}.",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/36/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/36/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1999:Ia,
  author =       "Anonymous",
  title =        "Index",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "243--244",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/37/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/37/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1999:Ib,
  author =       "Anonymous",
  title =        "Index",
  journal =      j-INFO-PROC-LETT,
  volume =       "71",
  number =       "5--6",
  pages =        "245--246",
  day =          "30",
  month =        sep,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:11 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/49/30/38/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/49/30/38/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Vitini:1999:LCO,
  author =       "F. Montoya Vitini and J. Mu{\~n}oz Masqu{\'e} and A.
                 Peinado Dom{\'\i}nguez",
  title =        "Linear complexity of the $x^2 \bmod p$ orbits",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "3--7",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kucera:1999:RNP,
  author =       "Anton{\'\i}n Ku{\v{c}}era",
  title =        "Regularity of normed {PA} processes",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "9--17",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/26/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/26/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Wang:1999:NSM,
  author =       "Y. Wang and K. Inoue and A. Ito and T. Okazaki",
  title =        "A note on self-modifying finite automata",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "19--24",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/27/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/27/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ma:1999:ADR,
  author =       "Z. M. Ma and W. J. Zhang and W. Y. Ma",
  title =        "Assessment of data redundancy in fuzzy relational
                 databases based on semantic inclusion degree",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "25--29",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/28/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/28/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Mount:1999:ERF,
  author =       "John A. Mount",
  title =        "Estimating the range of a function in an online
                 setting",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "31--35",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/29/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/29/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Ra:1999:NOP,
  author =       "Dong-Yul Ra and George C. Stockman",
  title =        "A new one pass algorithm for estimating stochastic
                 context-free grammars",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "37--45",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/30/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/30/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Nievergelt:1999:MEE,
  author =       "Jurg Nievergelt and Narsingh Deo and Ambros Marzetta",
  title =        "Memory-efficient enumeration of constrained spanning
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "47--53",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/31/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/31/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hung:1999:CTV,
  author =       "Chun-Nan Hung and Lih-Hsing Hsu and Ting-Yi Sung",
  title =        "{Christmas} tree: {A} versatile $1$-fault-tolerant
                 design for token rings",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "55--63",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/32/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/32/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Navarro:1999:VFS,
  author =       "Gonzalo Navarro and Ricardo Baeza-Yates",
  title =        "Very fast and simple approximate string matching",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "65--70",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/33/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/33/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Barbosa:1999:GAA,
  author =       "Valmir C. Barbosa and Jayme L. Szwarcfiter",
  title =        "Generating all the acyclic orientations of an
                 undirected graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "1--2",
  pages =        "71--74",
  day =          "29",
  month =        oct,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:14 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/27/34/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/27/34/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chen:1999:FMM,
  author =       "Chien-Yuan Chen and Chin-Chen Chang",
  title =        "A fast modular multiplication algorithm for
                 calculating the product {AB} modulo {N}",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "77--81",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Matamala:1999:CSC,
  author =       "Martin Matamala and Klaus Meer",
  title =        "On the computational structure of the connected
                 components of a hard problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "83--90",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/26/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/26/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Raynal:1999:RFD,
  author =       "Michel Raynal and Fr{\'e}d{\'e}ric Tronel",
  title =        "Restricted failure detectors: {Definition} and
                 reduction protocols",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "91--97",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/27/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/27/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Megson:1999:HTH,
  author =       "G. M. Megson and Xiaofan Yang and Xiaoping Liu",
  title =        "Honeycomb tori are {Hamiltonian}",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "99--103",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/28/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/28/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Khuller:1999:VAS,
  author =       "Samir Khuller",
  title =        "An {$O(|V|^2)$} algorithm for single connectedness",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "105--107",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See addendum \cite{Khuller:2000:ASV}.",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/29/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/29/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Tsai:1999:CDT,
  author =       "Chang-Hsiung Tsai and Chun-Nan Hung and Lih-Hsing Hsu
                 and Chung-Haw Chang",
  title =        "The correct diameter of trivalent {Cayley} graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "109--111",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/30/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/30/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Macarie:1999:ASP,
  author =       "Ioan I. Macarie and Joel I. Seiferas",
  title =        "Amplification of slight probabilistic advantage at
                 absolutely no cost in space",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "113--118",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/31/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/31/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Verhoeven:1999:RSU,
  author =       "Yann Verhoeven",
  title =        "Random $2$-{SAT} and unsatisfiability",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "119--123",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/32/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/32/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lavault:1999:WCA,
  author =       "Christian Lavault and S. Mohamed Sedjelmaci",
  title =        "Worst-case analysis of {Weber}'s {GCD} algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "125--130",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/33/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/33/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Hwang:1999:NCC,
  author =       "Shien-Ching Hwang and Gen-Huey Chen",
  title =        "A note on cyclic-cubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "131--135",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/34/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/34/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Calamoneri:1999:OLM,
  author =       "Tiziana Calamoneri and Annalisa Massini",
  title =        "An optimal layout of multigrid networks",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "137--141",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/35/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/35/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Sridharan:1999:CTP,
  author =       "K. Sridharan",
  title =        "Computing two penetration measures for curved {$2$D}
                 objects",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "3--4",
  pages =        "143--148",
  day =          "26",
  month =        nov,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:16 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/29/28/24/60/28/36/abstract.html;
                 http://www.elsevier.nl/gej-ng/29/28/24/60/28/36/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jiang:1999:OVO,
  author =       "Xiaoyi Jiang and Horst Bunke",
  title =        "Optimal vertex ordering of graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "149--154",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/25/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/25/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Jancar:1999:NWQ,
  author =       "Petr Jan{\v{c}}ar",
  title =        "A note on well quasi-orderings for powersets",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "155--160",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/26/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/26/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Aardal:1999:AAK,
  author =       "Karen Aardal and Fabi{\'a}n A. Chudak and David B.
                 Shmoys",
  title =        "A $3$-approximation algorithm for the $k$-level
                 uncapacitated facility location problem",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "161--167",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/27/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/27/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Blundo:1999:PSS,
  author =       "C. Blundo and A. De Santis and A. Giorgio Gaggia",
  title =        "Probability of shares in secret sharing schemes",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "169--175",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/28/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/28/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lagogiannis:1999:NAR,
  author =       "George Lagogiannis and Christos Makris and Athanasios
                 Tsakalidis",
  title =        "A new algorithm for rectangle enclosure reporting",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "177--182",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/29/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/29/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Krishnamurti:1999:AAN,
  author =       "Ramesh Krishnamurti and Daya Ram Gaur",
  title =        "An approximation algorithm for nonpreemptive
                 scheduling on hypercube parallel task systems",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "183--188",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/30/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/30/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Lee:1999:LPP,
  author =       "Gyung-Ok Lee and Kwang-Moo Choe",
  title =        "An {LR} parser with pre-determined reduction goals",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "189--196",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/31/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/31/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Kosub:1999:NUF,
  author =       "Sven Kosub",
  title =        "A note on unambiguous function classes",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "197--203",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/32/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/32/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:1999:ECA,
  author =       "Jae-Young Chang and Sang-Goo Lee",
  title =        "Extended conditions for answering an aggregate query
                 using materialized views",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "205--212",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/33/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/33/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Huang:1999:OEC,
  author =       "Chien-Hung Huang and Ju-Yuan Hsiao and R. C. T. Lee",
  title =        "An optimal embedding of cycles into incomplete
                 hypercubes",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "213--218",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/34/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/34/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1999:Ic,
  author =       "Anonymous",
  title =        "Index",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "219--220",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/35/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/35/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Anonymous:1999:Id,
  author =       "Anonymous",
  title =        "Index",
  journal =      j-INFO-PROC-LETT,
  volume =       "72",
  number =       "5--6",
  pages =        "221--222",
  day =          "30",
  month =        dec,
  year =         "1999",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:18 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/60/25/36/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/60/25/36/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Rao:2000:CSS,
  author =       "Rajesh P. N. Rao and J{\"o}rg Rothe and Osamu
                 Watanabe",
  title =        "Corrigendum to {``Upward separation for FewP and
                 related classes'', Information Processing Letters {\bf
                 52}(4) (1994) 175--180}",
  journal =      j-INFO-PROC-LETT,
  volume =       "74",
  number =       "1--2",
  pages =        "89--89",
  month =        apr,
  year =         "2000",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:55:20 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Rao:1994:USR}.",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/63/25/37/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/63/25/37/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Khuller:2000:ASV,
  author =       "Samir Khuller",
  title =        "Addendum to {``An $O(|V|^2)$ algorithm for single
                 connectedness'', [Information Processing Letters {\bf
                 72}(3--4) (1999) 105--107]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "74",
  number =       "5--6",
  pages =        "263--263",
  day =          "30",
  month =        jun,
  year =         "2000",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Thu Oct 12 06:44:31 MDT 2000",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Khuller:1999:VAS}.",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/63/28/37/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/63/28/37/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@Article{Chang:2002:CPP,
  author =       "Gerard J. Chang",
  title =        "Corrigendum to {``The path-partition problem in block
                 graphs'': [Information Processing Letters {\bf 52}
                 (1994) 317--322]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "83",
  number =       "5",
  pages =        "293--293",
  day =          "15",
  month =        sep,
  year =         "2002",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Jan 26 08:44:29 MST 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Yan:1994:PPP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}