%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.14",
%%% date = "06 March 2014",
%%% time = "08:04:45 MST",
%%% filename = "infoproc1980.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "19140 51024 220507 2258344",
%%% 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 1980--1989.
%%%
%%% 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 World-Wide Web sites at
%%%
%%% http://www.sciencedirect.com/science/journal/00200190
%%% http://www.elsevier.com/wps/find/journaldescription.cws_home/505612/
%%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/
%%%
%%% with tables of contents for all volumes.
%%%
%%% 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.14, the year coverage looked
%%% like this:
%%%
%%% 1972 ( 1) 1980 ( 118) 1988 ( 188)
%%% 1973 ( 0) 1981 ( 115) 1989 ( 207)
%%% 1974 ( 0) 1982 ( 108) 1990 ( 2)
%%% 1975 ( 0) 1983 ( 113) 1991 ( 3)
%%% 1976 ( 0) 1984 ( 105) 1992 ( 1)
%%% 1977 ( 1) 1985 ( 102) 1993 ( 1)
%%% 1978 ( 1) 1986 ( 123)
%%% 1979 ( 7) 1987 ( 184)
%%%
%%% Article: 1380
%%%
%%% Total entries: 1380
%%%
%%% The initial draft was extracted from the ACM
%%% Computing Archive CD ROM for the 1980s, with
%%% manual corrections and additions.
%%%
%%% At version 1.09, this bibliography was
%%% extended with 854 new entries derived from
%%% the OCLC Contents1st database, after
%%% conversion to BibTeX format, and extensive
%%% editing and correction. Regrettably, that
%%% database does not record final page numbers
%%% of journal articles, so were are many page
%%% ranges of the form 123--?? in this
%%% bibliography, until they were corrected
%%% with data from other databases, and from
%%% manual checking of articles in the original
%%% journal issues. At version 1.17, another
%%% 1044 entries were added from a search in
%%% the Compendex databases (1970--1996), and
%%% about 1000 others were updated with
%%% additional information.
%%%
%%% An additional 470 new entries were added at
%%% version 1.22 from the MathSciNet database,
%%% and most of the missing final page numbers in
%%% the other entries were supplied from
%%% MathSciNet data.
%%%
%%% At version 1.25, another 134 new entries were
%%% added from a combination of data from the
%%% journal Web site, and from other databases.
%%%
%%% Numerous errors in the sources noted above
%%% have been corrected. Spelling has been
%%% verified with the UNIX spell and GNU ispell
%%% programs using the exception dictionary
%%% stored in the companion file with extension
%%% .sok.
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order, using bibsort -byvolume.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{
"\ifx \cedla \undefined \let \cedla = \c \fi"
#
"\ifx \cftil \undefined \def \cftil#1{\~#1} \fi"
#
"\ifx \cprime \undefined \def \cprime {$\mathsurround=0pt '$}\fi"
#
"\ifx \Dbar \undefined \def \Dbar {\leavevmode\raise0.2ex\hbox{--}\kern-0.5emD} \fi"
#
"\ifx \k \undefined \let \k = \c \fi"
#
"\ifx \lfhook \undefined \let \lfhook = \relax \fi"
#
"\ifx \mathbb \undefined \def \mathbb #1{{\bf #1}}\fi"
#
"\ifx \polhk \undefined \let \polhk = \k \fi"
#
"\ifx \soft \undefined \def \soft{'} \fi"
#
"\hyphenation{
Ishi-zu-ka
Kath-ryn
Ker-n-i-ghan
Krom-mes
Lar-ra-bee
Man-o-har
Mehl-horn
Mee-nak-shi
Ne-va-lai-nen
Pat-rick
Port-able
Post-Script
Pren-tice
Rich-ard
Richt-er
Ro-bert
Schra-der
Schwartz-bach
Sha-mos
Sit-ha-ra-ma
Spring-er
Ta-ka-na-mi
The-o-dore
Uz-ga-lis
Vong-sat-horn
} "
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%======================================================================
%% Journal abbreviations:
@String{j-INFO-PROC-LETT = "Information Processing Letters"}
%%% ====================================================================
%%% Bibliography entries:
%%% The University of Utah Marriott Library has volumes 8..60
%%% (1979--1996), so I have been unable to check questions about entries
%%% for volumes 1..7.
@Article{Graham:1972:EAD,
author = "R. L. Graham",
title = "An efficient algorithm for determining the convex hull
of a finite planar set",
journal = j-INFO-PROC-LETT,
volume = "1",
number = "4",
pages = "132--133",
day = "??",
month = jun,
year = "1972",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See note \cite{Gries:1987:NGC}.",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convex hull; efficient algorithm; extreme points;
finite planar set; numerical methods; set theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Bui:1977:SMS,
author = "T. D. Bui",
title = "On an {$L$}-stable method for stiff differential
equations",
journal = j-INFO-PROC-LETT,
volume = "6",
number = "5",
pages = "158--161",
day = "??",
month = oct,
year = "1977",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See erratum \cite{Bui:1979:ESM} and comments
\cite{Day:1980:CSM}.",
acknowledgement = ack-nhfb,
classification = "C4170 (Differential equations)",
corpsource = "Dept. of Computer Sci., Concordia Univ., Montreal,
Que., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "differential equations; L-stable method; stiff
differential equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Bykat:1978:CHF,
author = "A. Bykat",
title = "Convex hull of a finite set of points in two
dimensions",
journal = j-INFO-PROC-LETT,
volume = "7",
number = "6",
pages = "296--298",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (52-04)",
MRnumber = "80b:68041",
MRreviewer = "D. T. Lee",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also comments
\cite{Devai:1979:CCH,Fournier:1979:CCH,Overmars:1980:FCB}.",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Math., Polytech. of North London, London,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm; convex hull; finite set of points;
topology; two dimensions",
treatment = "T Theoretical or Mathematical",
}
@Article{Morris:1979:SSM,
author = "J. M. Morris",
title = "A starvation-free solution to the mutual exclusion
problem",
journal = j-INFO-PROC-LETT,
volume = "8",
number = "2",
pages = "76--80",
day = "15",
month = feb,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See comments \cite{Annot:1986:CMS}.",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
corpsource = "Dept. of Computer Sci., Trinity Coll., Dublin,
Ireland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm; binary semaphores; multi-access systems;
mutual exclusion; programming theory; starvation",
treatment = "T Theoretical or Mathematical",
}
@Article{Aspvall:1979:LTA,
author = "Bengt Aspvall and Michael F. Plass and Robert Endre
Tarjan",
title = "A linear-time algorithm for testing the truth of
certain quantified {Boolean} formulas",
journal = j-INFO-PROC-LETT,
volume = "8",
number = "3",
pages = "121--123",
day = "15",
month = mar,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "80b:68050",
MRreviewer = "Henry S. Warren, Jr.",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum \cite{Aspvall:1982:ELT}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "2 CNF; 2 satisfiability; Boolean formulas; Boolean
functions; linear time algorithm; strongly connected
components; truth",
treatment = "T Theoretical or Mathematical",
}
@Article{Fournier:1979:CCH,
author = "Alain Fournier",
title = "Comments on convex hull of a finite set of points in
two dimensions {[Inform. Process. Lett. {\bf 7} (1978),
no. 6, 296--298; MR 80b:68041]}",
journal = j-INFO-PROC-LETT,
volume = "8",
number = "4",
pages = "173--173",
day = "30",
month = apr,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (52-04)",
MRnumber = "81a:68047",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See
\cite{Bykat:1978:CHF,Devai:1979:CCH,Overmars:1980:FCB}.",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Programs in Math. Sci., Univ of Texas, Dallas, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convex hull; finite set of points in two dimensions;
set theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Bui:1979:ESM,
author = "T. D. Bui",
title = "Erratum: {``On an {$L$}-stable method for stiff
differential equations''}",
journal = j-INFO-PROC-LETT,
volume = "8",
number = "4",
pages = "218--218",
day = "30",
month = apr,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Bui:1977:SMS,Day:1980:CSM}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Colbourn:1979:CSM,
author = "Charles J. Colbourn",
title = "The complexity of symmetrizing matrices",
journal = j-INFO-PROC-LETT,
volume = "9",
number = "3",
pages = "108--109",
day = "5",
month = oct,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (05B99)",
MRnumber = "81a:68045",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also correction \cite{Colbourn:1980:CCP}.",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; graph isomorphism; graph theory; matrix
algebra; polynomial time equivalent; symmetrizing
matrices",
treatment = "T Theoretical or Mathematical",
}
@Article{Devai:1979:CCH,
author = "F. D{\'e}vai and T. Szendr{\'e}nyi",
title = "Comments on convex hull of a finite set of points in
two dimensions",
journal = j-INFO-PROC-LETT,
volume = "9",
number = "3",
pages = "141--142",
day = "5",
month = oct,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See
\cite{Bykat:1978:CHF,Fournier:1979:CCH,Overmars:1980:FCB}.",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Computer and Automation Inst., Acad. of Sci.,
Budapest, Hungary",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "clustering algorithm; computer graphics; convex hull;
finite set; topology; two dimensions",
treatment = "T Theoretical or Mathematical",
}
@Article{Andrew:1979:AEA,
author = "A. M. Andrew",
title = "Another efficient algorithm for convex hulls in two
dimensions",
journal = j-INFO-PROC-LETT,
volume = "9",
number = "5",
pages = "216--219",
day = "16",
month = dec,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See corrigendum \cite{Andrew:1980:CAE}.",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Cybernetics, Univ. of Reading, Reading, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convex hulls; efficient algorithm; ordering algorithm;
programming theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Gordon:1980:DSS,
author = "Michael J. C. Gordon",
title = "The denotational semantics of sequential machines",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "1--3",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D15",
MRnumber = "81a:68061",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4230D (Sequential switching theory)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "denotational semantics; function space; sequential
machines",
treatment = "T Theoretical or Mathematical",
}
@Article{Olivie:1980:RBS,
author = "H. Olivi{\'e}",
title = "On the relationship between son-trees and symmetric
binary {$B$}-trees",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "4--8",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10",
MRnumber = "81a:68070",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C6120 (File
organisation)",
corpsource = "Interstedelijke Industriele Hogeschool
Antwerpen-Mechelen, Antwerpen, Belgium",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "balanced binary search trees; data processing; data
structures; dictionary; symmetric binary B trees; trees
(mathematics)",
treatment = "P Practical",
}
@Article{Rayward-Smith:1980:FLC,
author = "V. J. Rayward-Smith and R. N. Rolph",
title = "Finding Linear and Circular Sequences of Minimal and
Maximal Total Adjacency",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "9--13",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15 (68C25)",
MRnumber = "80j:68015",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C6130B (Graphics techniques)",
corpsource = "School of Computing Studies and Accountancy, Univ. of
East Anglia, Norwich, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "circular sequences; computer aided design; computer
aided geometric design; computer graphics; data base
design; mathematical techniques --- Combinational
Mathematics; maximal total adjacency; spatial
modelling",
treatment = "P Practical",
}
@Article{Honeyman:1980:TUI,
author = "Peter Honeyman and Richard E. Ladner and Mihalis
Yannakakis",
title = "Testing the universal instance assumption",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "14--19",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15 (68C25)",
MRnumber = "81a:68024",
bibdate = "Tue Nov 17 17:58:41 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Princeton Univ., Princeton, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "database management systems; DBMS; multivalued
dependencies; relational database management system;
universal instance assumption",
treatment = "P Practical",
}
@Article{Deb:1980:CFA,
author = "Ashoke Deb",
title = "Conflict-free access of arrays --- a counter example",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "20--20",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Memorial Univ. of
Newfoundland, St. Johns, Nfld., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "columns; conflict free access of arrays; file
organisation; memory modules; rows",
treatment = "P Practical",
}
@Article{Truszczynski:1980:OMS,
author = "Miros{\l}aw Truszczy{\'n}ski",
title = "Once more on storage for consecutive retrieval",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "21--24",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05",
MRnumber = "81a:68110",
bibdate = "Tue Nov 17 17:58:46 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Inst. of Math., Tech. Univ. of Warsaw, Warsaw,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "consecutive retrieval; file organisation; file
organization; shortest linear organization; storage",
treatment = "P Practical",
}
@Article{Goldschlager:1980:SEA,
author = "Leslie M. Goldschlager",
title = "A space efficient algorithm for the monotone planar
circuit value problem",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "25--27",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "81b:68044",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Queensland, St.
Lucia, Qld., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Boolean values; computational complexity; computer
programming --- Subroutines; feedback loops; logic
circuits, combinatorial; monotone planar circuit value
problem; parallel processing; space efficient
algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Lloyd:1980:LSB,
author = "Errol L. Lloyd",
title = "List Scheduling Bounds for {UET} Systems with
Resources",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "28--31",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C15",
MRnumber = "81a:68042",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also errata
\cite{Lloyd:1980:ELS,vanLeeuwen:1980:ELS}.",
acknowledgement = ack-nhfb,
classification = "912; C6130 (Data handling techniques)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "arbitrary list schedule; list processing; operations
research; optimal schedule; resources; task systems;
UET systems",
treatment = "P Practical",
}
@Article{Zaniolo:1980:MTF,
author = "Carlo Zaniolo",
title = "Mixed transitivity for functional and multivalued
dependencies in database relations",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "32--34",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 17:58:57 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Sperry Res. Center, Sudbury, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "combined functional; complete axiomatization; database
management systems; database relations; DBMS; mixed
transitivity; multivalued dependencies",
treatment = "P Practical",
}
@Article{Bui:1980:NIB,
author = "T. D. Bui",
title = "A note on an improved bisection algorithm",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "35--36",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Sleator:1980:TOA,
author = "Daniel D. K. D. B. Sleator",
title = "A $2.5$ times optimal algorithm for packing in two
dimensions",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "37--40",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (52A45)",
MRnumber = "81a:68052",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming",
}
@Article{Sarwate:1980:NUC,
author = "Dilip V. Sarwate",
title = "A note on: {``Universal classes of hash functions''
[J. Comput. System Sci. {\bf 18} (1979), no. 2,
143--154; MR 80f:68110a] by J. L. Carter and M. N.
Wegman}",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "41--45",
day = "12",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05",
MRnumber = "80f:68110b",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Anderson:1980:EPI,
author = "Bruce Anderson",
title = "Encoded Pointers --- an Interesting Data-Structure for
Modern {SIL}'s",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "47--50",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Dept. of Electrical Engng. Sci., Univ. of Essex,
Colchester, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming languages; data processing; data
structures; encoded pointers; sils; systems programming
languages",
treatment = "P Practical",
}
@Article{vanLeeuwen:1980:DDS,
author = "Jan {van Leeuwen} and Derick Wood",
title = "Dynamization of decomposable searching problems",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "51--56",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "81i:68091a",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "decomposable searching problems; degrees of freedom;
dynamic storage allocation facility; full dynamization;
information retrieval; optimized response times;
programming environment",
treatment = "P Practical",
}
@Article{Sabelfeld:1980:LTE,
author = "V. K. Sabel{\cprime}fel{\cprime}d",
title = "The logic-termal equivalence is polynomial-time
decidable",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "57--62",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (68C25)",
MRnumber = "81a:68039",
bibdate = "Tue Nov 17 17:59:08 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "graph node; information flow; logic term equivalence;
lt equivalence; polynomial time decidability; predicate
checks; programming theory; time upper bound",
treatment = "T Theoretical or Mathematical",
}
@Article{Passy:1980:SPT,
author = "Solomon Passy",
title = "Structured programs for {Turing} machines",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "63--67",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F10 (03D10)",
MRnumber = "81h:68080",
bibdate = "Tue Nov 17 17:59:18 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Math., Acad. of Sci., Sofia, Bulgaria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context free languages; context-free languages;
structured language; structured programming; Turing
machines",
treatment = "P Practical",
}
@Article{Wilson:1980:ACG,
author = "Thomas C. Wilson and Joseph Shortt",
title = "An {$O(\log n)$} algorithm for computing general
order-$k$ {Fibonacci} numbers",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "68--75",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (10A35)",
MRnumber = "81a:68053",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Univ. of Guelph, Guelph, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complete algorithm; Fibonacci numbers; intermediate
storage locations; iterative algorithm; iterative
methods; mathematics",
treatment = "T Theoretical or Mathematical",
}
@Article{Liang:1980:LBL,
author = "Frank M. Liang",
title = "A lower bound for on-line bin packing",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "76--79",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (90B05)",
MRnumber = "81e:68048",
MRreviewer = "Andrew Yao",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "heuristic algorithms; list of objects; list
processing; lower bound; NP completeness; online bin
packing; performance ratio; unit capacity bins",
treatment = "T Theoretical or Mathematical",
}
@Article{Blum:1980:EFB,
author = "Manuel Blum and Ashok K. Chandra and Mark N. Wegman",
title = "Equivalence of free {Boolean} graphs can be decided
probabilistically in polynomial time",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "80--82",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (68C25)",
MRnumber = "82d:68022",
MRreviewer = "Kabekode V. S. Bhat",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Boolean algebra; equivalence; free Boolean graphs;
graph theory; polynomial time; probability of error",
treatment = "T Theoretical or Mathematical",
}
@Article{Vitanyi:1980:AHS,
author = "Paul M. B. Vit{\'a}nyi",
title = "Achievable high scores of $\varepsilon$-moves and
running times in {DPDA} computations",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "83--86",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D35 (68C25 68F25)",
MRnumber = "81d:68071",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Math. Centrum, Amsterdam, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "automata theory; deterministic pushdown automata; DPDA
computations; high scores; loop; popping; running
times; stack",
treatment = "T Theoretical or Mathematical",
}
@Article{Santoro:1980:EFR,
author = "Nicola Santoro",
title = "Extending the Four {Russians}' Bound to General Matrix
Multiplication",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "87--88",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "81a:68051",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithms; Boolean matrix; bounded matrix size; Four
Russians' bound; general matrix multiplication; matrix
algebra",
treatment = "T Theoretical or Mathematical",
}
@Article{Samet:1980:PED,
author = "Hanan Samet and Leo Marcus",
title = "Purging in an Equality Data Base",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "89--95",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "81a:68026",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "code optimizers; data base systems; database
management systems; DBMS; equality data base; program
verifiers; proofs of equality; purging; register value;
removing information; symbolic execution systems;
symbolic machine execution; theorem provers",
treatment = "P Practical",
}
@Article{Ben-Ari:1980:SPR,
author = "Mordechai Ben-Ari",
title = "A simplified proof that regular resolution is
exponential",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "96--98",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "81g:68062",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Div. of Computer Sci., Tel Aviv Univ., Ramat Aviv,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "graph theory; regular resolution",
treatment = "T Theoretical or Mathematical",
}
@Article{Brandwajn:1980:SFT,
author = "Alexandre Brandwajn and Rene Joly",
title = "A scheme for a fault-tolerant virtual memory",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "99--103",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6120 (File organisation)",
corpsource = "Amdahl Corp., Sunnyvale, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; fault tolerant computing;
fault tolerant virtual memory; I/O components; main
memory; virtual storage",
treatment = "P Practical",
}
@Article{Pagan:1980:GCL,
author = "Frank G. Pagan",
title = "On the generation of compilers from language
definitions",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "104--107",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 17:59:29 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors)",
corpsource = "Computer Sci. Dept., Southern Illinois Univ.,
Carbondale, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "automatic programming; compilers; formal languages;
formal semantic definitions; language definitions;
metalanguage; program compilers; programming language",
treatment = "P Practical",
}
@Article{Jazayeri:1980:IID,
author = "M. Jazayeri",
title = "An improvement in the iterative data flow analysis
algorithm",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "2",
pages = "108--110",
day = "18",
month = mar,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Univ. of North Carolina,
Chapel Hill, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convergence; iterative data flow analysis algorithm;
software engineering; stability",
treatment = "P Practical",
}
@Article{Arora:1980:AMA,
author = "R. K. Arora and S. P. Rana",
title = "Analysis of the Module Assignment Problem in
Distributed Computing Systems with Limited Storage",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "111--115",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; distributed computing
systems; distributed processing; efficient heuristics;
limited storage; module assignment problem; optimal
solution techniques; storage allocation",
treatment = "P Practical",
}
@Article{Watanabe:1980:AAR,
author = "O. Watanabe",
title = "Another application of recursion introduction",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "116--119",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; automata theory; deterministic
pushdown automata; obvious algorithm; recursion
introduction; recursive calls; stack elimination
technique; tabulation method",
treatment = "P Practical",
}
@Article{Wallis:1980:EIA,
author = "Peter J. L. Wallis and Bernard W. Silverman",
title = "Efficient Implementation of the {Ada} Overloading
Rules",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "120--123",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6140D (High level languages)",
corpsource = "School of Math., Univ. of Bath, Bath, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Ada overloading rules; computer programming; parse
tree; procedure oriented languages",
treatment = "P Practical",
}
@Article{Hemerik:1980:FDL,
author = "C. Hemerik",
title = "Formal derivation of a list processing program",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "124--126",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6130 (Data handling
techniques)",
corpsource = "Dept. of Math., Technol. Univ., Eindhoven,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "formal language; formal languages; LISP; list
manipulation problem; list processing; list processing
program; systematic program development",
treatment = "P Practical",
}
@Article{Kirkpatrick:1980:NDO,
author = "David G. Kirkpatrick",
title = "A note on {Delaunay} and optimal triangulations",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "127--128",
day = "??",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68E99)",
MRnumber = "81e:68047",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Wang:1980:SNR,
author = "Patrick Shen-Pei Wang",
title = "Some new results on isotonic array grammars",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "129--131",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05 (68G10)",
MRnumber = "81e:68097",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Oregon, Eugene, OR,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "array languages; data processing; formal languages;
grammars; isotonic array grammars; patterns",
treatment = "P Practical",
}
@Article{vanEmdeBoas:1980:LBC,
author = "Peter {van Emde Boas}",
title = "On the {$\Omega(n\log n)$} lower bound for convex hull
and maximal vector determination",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "132--136",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (52-04 52A10 90C25)",
MRnumber = "83e:68034a",
MRreviewer = "Selim G. Akl",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also comments \cite{Avis:1980:CLB}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Cellary:1980:SMQ,
author = "Wojciech Cellary and Daniel Mayer",
title = "A simple model of query scheduling in distributed data
base systems",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "137--147",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160B (Distributed databases); C6160D
(Relational databases)",
corpsource = "Dept. of Appl. Math., Univ. of Nancy I, Nancy,
France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "access point; data base systems; data interchanges;
database management systems; DBMS; decomposition of
queries; distributed data base systems; distributed
processing; final response; optimization; query
scheduling; relational operations; storage point;
transportation network",
treatment = "P Practical",
}
@Article{Barnden:1980:CSD,
author = "J. A. Barnden",
title = "A characterization of systems derived from terminating
concurrent histories",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "148--152",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (68D90)",
MRnumber = "81b:68077",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "case graph; concurrency; determinacy; finite labelled
partially ordered set; graph theory; programming
theory; terminating concurrent histories",
treatment = "T Theoretical or Mathematical",
}
@Article{Czaja:1980:PSS,
author = "Ludwik Czaja",
title = "Parallel System Schemas and Their Relation to
Automata",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "153--158",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05",
MRnumber = "84c:68037",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; 722; 723; C4220 (Automata theory)",
corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "actions; authorization conditions; automata; automata
theory; Boolean functions; computer systems, digital;
finite automata; parallel system schemas; processors",
treatment = "T Theoretical or Mathematical",
}
@Article{Kessels:1980:RWP,
author = "J. L. W. I. Kessels",
title = "The readers and writers problem avoided",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "159--162",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Philips Res. Labs., Eindhoven, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "common data set; computer operating systems;
concurrent transactions; parallel processing;
programming theory; readers and writers problem",
treatment = "T Theoretical or Mathematical",
}
@Article{vanderNat:1980:FSA,
author = "M. {van der Nat}",
title = "A Fast Sorting Algorithm, a Hybrid of Distributive and
Merge Sorting",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "163--167",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 17:59:50 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "distributive partitioning approach; distributive sort;
fast sorting algorithm; floating point arithmetic;
general purpose sorting packages; merge sorting;
sorting",
treatment = "P Practical",
}
@Article{Andrew:1980:CAE,
author = "A. M. Andrew",
title = "Corrigendum: {``Another efficient algorithm for convex
hulls in two dimensions'' (Inform. Process. Lett. {\bf
9} (1979), no. 5, 216--219)}",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "3",
pages = "168--168",
day = "18",
month = apr,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Nov 16 21:38:58 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Andrew:1979:AEA}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Melville:1980:CDS,
author = "Robert Melville and David Gries",
title = "Controlled Density Sorting",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "169--172",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 18:00:22 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems programming; controlled density
sorting; insertion sort; sorting",
treatment = "P Practical",
}
@Article{Bertossi:1980:CSJ,
author = "Alan A. Bertossi",
title = "On the complexity of scheduling jobs on dedicated
resources to minimize set-up costs",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "173--177",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B35 (68C15)",
MRnumber = "82b:90063",
MRreviewer = "J{\'o}zef Grabowski",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4290 (Other
computer theory)",
corpsource = "Ist. di Sci dell'Informazione, Univ. di Pisa, Pisa,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computation theory; computational complexity; computer
metatheory; dedicated resources; drives; NP hardness;
optimisation; scheduling; scheduling jobs; volumes",
treatment = "T Theoretical or Mathematical",
}
@Article{Fraenkel:1980:CSA,
author = "Aviezri S. Fraenkel and Yaacov Yesha",
title = "Complexity of solving algebraic equations",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "178--179",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D15)",
MRnumber = "82a:68071",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic equations; Boolean conjunctive normal form;
computational complexity; NP complete; optimisation",
treatment = "T Theoretical or Mathematical",
}
@Article{Luccio:1980:CMC,
author = "F. Luccio and S. Mazzone",
title = "A cryptosystem for multiple communication",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "180--183",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See notes \cite{Meijer:1981:NCM,Hellman:1981:ACA}.",
acknowledgement = ack-nhfb,
classification = "723; B6120B (Codes); B6210L (Computer
communications); C5620 (Computer networks and
techniques); C6130 (Data handling techniques)",
corpsource = "Univ. of Pisa, Pisa, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "authentication; computer networks; cryptosystem;
cryptosystems; data transmission; encoding; multiple
communication; security of data",
treatment = "P Practical",
}
@Article{Lengauer:1980:SCP,
author = "Thomas Lengauer and Robert E. Tarjan",
title = "The space complexity of pebble games on trees",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "184--188",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68E10 90D42)",
MRnumber = "82c:68023",
MRreviewer = "R. E. Stearns",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "black and white pebble game; black pebble game;
directed acyclic graphs; directed graphs; game theory;
pebble games; space complexity; trees; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Farley:1980:LTT,
author = "Arthur M. Farley",
title = "Levelling Terrain Trees: a Transshipment Problem",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "189--192",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B10 (68C25)",
MRnumber = "81i:90072",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "406; 723; 912; C1160 (Combinatorial mathematics);
C1290H (Systems theory applications in
transportation)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Oregon, Eugene, OR, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "civil engineers; computer programming --- Subroutines;
discrete mathematics; graph theory; level road bed;
levelling; mathematical techniques --- Graph Theory;
mountainous terrain; operations research; road
networks; roads and streets; terrain trees;
transportation; transshipment problem; truck loads",
treatment = "T Theoretical or Mathematical",
}
@Article{Broy:1980:PDE,
author = "M. Broy and M. Wirsing",
title = "Program development: from enumeration to
backtracking",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "193--197",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen,
Munchen, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "backtracking; enumeration; program development;
programming techniques; programming theory; schematic
rules; software engineering",
treatment = "P Practical",
}
@Article{Burton:1980:RVI,
author = "F. W. Burton and G. N. Lewis",
title = "A robust variation of interpolation search",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "198--201",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "School of Computing Studies, Univ. of East Anglia,
Norwich, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary search; common data; computational costs; data
accesses; file organisation; interpolation search;
memory access costs; sorted list; synchronization;
table lookup; waiting costs",
treatment = "P Practical",
}
@Article{Savage:1980:MMT,
author = "Carla Savage",
title = "Maximum matchings and trees",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "202--205",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (68C25)",
MRnumber = "82a:68129",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., North Carolina State Univ.,
Raleigh, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; maximum matchings; search
spanning tree; trees; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Doran:1980:VSS,
author = "R. W. Doran and L. K. Thomas",
title = "Variants of the software solution to mutual
exclusion",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "206--208",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "82a:68042",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Amdahl Corp., Sunnyvale, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "critical section; indefinite blocking; mutual
exclusion; programming theory; sequential processes;
task",
treatment = "T Theoretical or Mathematical",
}
@Article{Overmars:1980:FCB,
author = "Mark H. Overmars and Jan {van Leeuwen}",
title = "Further comments on {A. Bykat}'s convex hull
algorithm: {``Convex hull of a finite set of points in
two dimensions'' [Inform. Process. Lett. {\bf 7}
(1978), no. 6, 296--298; MR 80b:68041]}",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "209--212",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (52-04)",
MRnumber = "82a:68080",
MRreviewer = "D. T. Lee",
bibdate = "Sun May 02 08:27:35 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See
\cite{Bykat:1978:CHF,Fournier:1979:CCH,Devai:1979:CCH}.",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Bykat's convex hull algorithm; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Meijer:1980:DAN,
author = "Henk Meijer and Selim G. Akl",
title = "The Design and Analysis of a New Hybrid Sorting
Algorithm",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "213--218",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "81h:68052",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Math. and Statistics, 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 theory; computer systems programming;
Distributive Partitioning; Hybrid sort; hybrid sorting
algorithm; probability distributions; sorting;
uniformly distributed inputs",
treatment = "P Practical",
}
@Article{Nakamura:1980:RTD,
author = "Akira Nakamura and Katsushi Inoue",
title = "A remark on two-dimensional finite automata: {``Some
properties of two-dimensional on-line tessellation
acceptors'' [Inform. Sci. {\bf 13} (1977), no. 2,
95--121; MR 80e:68143]}",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "219--222",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D20",
MRnumber = "81i:68082",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "finite automata; input arrays; square array inputs;
square array languages; two dimensional finite
automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1980:EIT,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On the emptiness of the intersection of two {D0S}
languages problem",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "223--225",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05 (03D35)",
MRnumber = "81h:68066",
bibdate = "Tue Nov 17 18:00:27 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "D0S languages; emptiness; formal languages;
intersection; lindenmeyer systems; transition mapping",
treatment = "P Practical",
}
@Article{Chung:1980:NPA,
author = "K. M. Chung and F. Luccio and C. K. Wong",
title = "A new permutation algorithm for bubble memories",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "226--230",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15 (68C25)",
MRnumber = "82a:68029",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C5210 (Logic design methods)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "logic design; magnetic bubble devices; magnetic bubble
memory; permutation algorithm",
treatment = "N New Development; P Practical",
}
@Article{Bohm:1980:CBE,
author = "Corrado B{\"o}hm and Antonio Mach{\`i} and Giovanna
Sontacchi",
title = "Complexity bounds for equivalence and isomorphism of
{Latin} squares",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "231--233",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (05B15)",
MRnumber = "82a:68066",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Istituto Matematico `G. Castelnuovo', Univ. di Roma,
Roma, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity bound; equivalence; graph theory;
isomorphism; latin squares; polynomial complexity;
worst case",
treatment = "T Theoretical or Mathematical",
}
@Article{Czaja:1980:DFP,
author = "Ludwik Czaja",
title = "Deadlock and Fairness in Parallel Schemas: a
Set-Theoretic Characterization and Decision Problems",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "234--239",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "82e:68027",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C1160 (Combinatorial mathematics); C4290
(Other computer theory)",
corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; deadlock; decision
problems; fairness; parallel processing; parallel
schemas; potential computation histories; priority
queue scheduling; queueing theory; scheduling; set
theory; uninterpreted parallel system schemas",
treatment = "T Theoretical or Mathematical",
}
@Article{Booth:1980:LLC,
author = "Kellogg S. Booth",
title = "Lexicographically least circular substrings",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "240--242",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E99",
MRnumber = "81g:68100",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; canonical form; graph isomorphism
algorithms; Knuth Morris Pratt algorithm; least
circular substrings; lexicographically least circular
shift; linear time pattern matching algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Buneman:1980:THP,
author = "Peter Buneman and Leon Levy",
title = "The {Towers} of {Hanoi} problem",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "243--244",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (05A99)",
MRnumber = "81j:68043",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm; algorithm theory; towers of Hanoi problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Inoue:1980:NDP,
author = "Katsushi Inoue and Itsuo Takanami",
title = "A note on decision problems for three-way
two-dimensional finite automata",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "4--5",
pages = "245--248",
day = "5",
month = jul,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05 (03D05)",
MRnumber = "81h:68036",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "decision problems; finite automata; three way two
dimensional finite automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Dijkstra:1980:TDD,
author = "Edsger W. Dijkstra and C. S. Scholten",
title = "Termination detection for diffusing computations",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "1--4",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B05",
MRnumber = "81h:68006",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory)",
corpsource = "Burroughs, Nuenen, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computation theory; computer metatheory; diffusing
computations; graph; graph theory; messages; node;
signalling scheme; termination detection",
treatment = "T Theoretical or Mathematical",
}
@Article{Dobosiewicz:1980:EVB,
author = "W{\l}odzimierz Dobosiewicz",
title = "An Efficient Variation of Bubble Sort",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "5--6",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithms; bubble sort; sorting",
treatment = "P Practical",
}
@Article{Allison:1980:SDP,
author = "D. C. S. Allison and M. T. Noga",
title = "Selection by distributive partitioning",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "7--8",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Virginia Polytech. Inst. and
State Univ., Blacksburg, VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "distributive partitioning; programming theory;
selection methods; time complexity; uniform
distributions",
treatment = "T Theoretical or Mathematical",
}
@Article{Krawczyk:1980:ECM,
author = "Tomasz Krawczyk",
title = "Error correction by mutational grammars",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "9--15",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10 (68F25)",
MRnumber = "81g:68021",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors)",
corpsource = "MERA-Inst. of Mathematical Machines, Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "error correction; fault tolerant computing; grammars;
mutational grammars; parser; program compilers",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bhat:1980:CTG,
author = "Kabekode V. S. Bhat",
title = "On the complexity of testing a graph for $n$-cube",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "16--19",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68E10)",
MRnumber = "82a:68064",
MRreviewer = "M. C. Golumbic",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; computational complexity; distance matrix;
graph; graph theory; n-cube",
treatment = "T Theoretical or Mathematical",
}
@Article{Grabowski:1980:DPV,
author = "Jan Grabowski",
title = "The decidability of persistence for vector addition
systems",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "20--23",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D90",
MRnumber = "82c:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Sektion Math., Humboldt-Univ. Berlin, Berlin, East
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computability and decidability; decision problem;
persistence; Petri net; vector addition systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Loui:1980:NPG,
author = "Michael C. Loui",
title = "A note on the pebble game",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "24--26",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68E10 90D42)",
MRnumber = "82c:68024",
MRreviewer = "R. E. Stearns",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "arithmetic expression evaluation; automata theory;
directed graphs; pebble game; Turing machine
simulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Day:1980:ISR,
author = "J. D. Day",
title = "On the internal {$S$}-stability of {Rosenbrock}
methods",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "27--30",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65L20",
MRnumber = "81k:65100",
MRreviewer = "F. Odeh",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290P (Differential equations); C4170 (Differential
equations)",
corpsource = "Div. of Engng., Gippsland Inst. of Advanced Education,
Churchill, Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convergence of numerical methods; differential
equations; internal S stability; Rosenbrock methods;
Runge Kutta methods; stiff differential equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Day:1980:CSM,
author = "J. D. Day",
title = "Comments on: {``On an {$L$}-stable method for stiff
differential equations'' [Inform. Process. Lett. {\bf
6} (1977), no. 5, 158--161; {MR \bf 56} \#10015] by T.
D. Bui}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "31--32",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65L05",
MRnumber = "82h:65052",
MRreviewer = "Richard Brown",
bibdate = "Sun May 02 08:27:00 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Bui:1977:SMS,Bui:1979:ESM}.",
acknowledgement = ack-nhfb,
classification = "B0290P (Differential equations); C4170 (Differential
equations)",
corpsource = "Div. of Engng., Gippsland Inst. of Advanced Education,
Churchill, Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convergence of numerical methods; differential
equations; l stability; Rosenbrook methods; Runge Kutta
methods; stiff differential equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Loizou:1980:CFA,
author = "G. Loizou",
title = "On a cycle finding algorithm",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "33--36",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Birkbeck Coll., Univ. of
London, London, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; cycle finding algorithm; Syslo's
algorithm; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Brown:1980:IBL,
author = "Donna J. Brown",
title = "An improved {BL} lower bound",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "37--39",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B05 (05B40 68B20)",
MRnumber = "82a:90044",
MRreviewer = "V. Yu. Me{\u{\i}}tus",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1290 (Applications of systems theory)",
corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bin packing; operations research",
treatment = "T Theoretical or Mathematical",
}
@Article{Peterson:1980:NCP,
author = "J. L. Peterson",
title = "A note on colored {Petri} nets",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "40--43",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "coloured Petri net; computation theory; disk drive OS;
graph theory; operating systems (computers); Turing
machines",
treatment = "P Practical",
}
@Article{Valiant:1980:CMP,
author = "L. G. Valiant",
title = "Computing multivariate polynomials in parallel",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "44--45",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (12-04 68B20)",
MRnumber = "81k:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Computer Sci. Dept., Edinburgh Univ., Edinburgh, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "multivariate polynomials; parallel processing;
polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Brent:1980:ABT,
author = "R. P. Brent",
title = "On the area of binary tree layouts",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "46--48",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C5210 (Logic design methods)",
corpsource = "Dept. of Computer Sci., Australian Nat. Univ.,
Canberra, ACT, Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary tree layouts; boundary; chip; convex curve;
convexity; leaves; logic design; packaging; trees
(mathematics); wires",
treatment = "T Theoretical or Mathematical",
}
@Article{Dyer:1980:FPA,
author = "Charles R. Dyer",
title = "A fast parallel algorithm for the closest pair
problem",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "49--52",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68G10 (68C25 68D20)",
MRnumber = "82b:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Computer Sci. Center, Univ. of Maryland, College Park,
MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bounded cellular array automaton; closest pair
problem; fast parallel algorithm; finite automata;
parallel processing; pyramid cellular automation",
treatment = "T Theoretical or Mathematical",
}
@Article{Devroye:1980:NFC,
author = "Luc Devroye",
title = "A note on finding convex hulls via maximal vectors",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "53--56",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (52-04 52A20)",
MRnumber = "82a:68070",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; convex hulls; distribution; maximal
vectors; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Lloyd:1980:ELS,
author = "E. L. Lloyd",
title = "Errata: {``List scheduling bounds for {UET} systems
with resources'' [Inform. Process. Lett. {\bf 10}
(1980), no. 1, 28--31; MR 81a:68042]}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "57--57",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C15",
MRnumber = "82a:68062",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Lloyd:1980:LSB}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{vanLeeuwen:1980:ELS,
author = "J. {van Leeuwen} and D. Wood",
title = "Errata: {``List scheduling bounds for {UET} systems
with resources'' [Inform. Process. Lett. {\bf 10}
(1980), no. 1, 28--31; MR 81a:68042]}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "1",
pages = "57--57",
day = "29",
month = aug,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "81i:68091b",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Lloyd:1980:LSB}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Banachowski:1980:CTR,
author = "Lech Banachowski",
title = "A complement to {Tarjan}'s result about the lower
bound on the complexity of the set union problem",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "59--65",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (68C25)",
MRnumber = "82c:68017",
MRreviewer = "O. D'Antona",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; lemmas; nonlinear lower
bound; set theory; set union problem; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Urbanek:1980:ACE,
author = "Friedrich J. Urbanek",
title = "An {$O(\log n)$} algorithm for computing the $n$th
element of the solution of a difference equation",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "66--67",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (10-04 10A35 10A40)",
MRnumber = "82g:68034a",
MRreviewer = "Yuri Breitbart",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290M (Numerical integration and differentiation);
C4160 (Numerical integration and differentiation)",
corpsource = "Inst. f{\"u}r Math. Logik und Formale Sprachen, Tech.
Univ. Wien, Wien, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm; binary sequences; difference equations;
linear homogeneous difference equations; nth element",
treatment = "T Theoretical or Mathematical",
}
@Article{Gries:1980:CFN,
author = "David Gries and Gary Levin",
title = "Computing {Fibonacci} numbers (and similarly defined
functions) in log time",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "68--69",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (10-04 10A35 10A40)",
MRnumber = "82g:68034b",
MRreviewer = "Yuri Breitbart",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290M (Numerical integration and differentiation);
C4160 (Numerical integration and differentiation)",
corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; difference equations;
Fibonacci numbers; linear homogeneous difference
equation; series (mathematics); time bound",
treatment = "T Theoretical or Mathematical",
}
@Article{Ebert:1980:NOE,
author = "J{\"u}rgen Ebert",
title = "A note on odd and even factors of undirected graphs",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "70--72",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (68C25)",
MRnumber = "81j:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Fachbereich Naturwissenschaften, Univ. Osnabruck,
Osnabruck, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "depth first search algorithm; even order graphs; graph
theory; maximal even factor; maximal odd factor;
undirected graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Liu:1980:ATL,
author = "Lishing Liu and Alan Demers",
title = "An algorithm for testing lossless join property in
relational databases",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "73--76",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15 (68C25)",
MRnumber = "82a:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "MITRE Corp., Bedford, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm; database management systems; lossless join
property testing; relational databases",
treatment = "T Theoretical or Mathematical",
}
@Article{Preparata:1980:AOV,
author = "Franco P. Preparata and Jean E. Vuillemin",
title = "Area-Time Optimal {VLSI} Networks for Multiplying
Matrices",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "77--80",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "713; 721; 723; B0210 (Algebra); B1265B (Logic
circuits); C1110 (Algebra); C5120 (Logic and switching
circuits)",
corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "area/time optimal networks; digital integrated
circuits; integrated circuits --- Very Large Scale
Integration; large scale integration; logic design;
matrix algebra; multiplying circuits; pipeline
processing; pipelining; recursively defined matrix
multiplier; VLSI networks",
treatment = "P Practical",
}
@Article{Chung:1980:MNS,
author = "K. M. Chung and F. Luccio and C. K. Wong",
title = "Minimum number of steps for permutation in a bubble
memory",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "81--83",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05 (68C25)",
MRnumber = "82a:68178",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B3120L (Magnetic bubble domain devices); C5320E
(Storage on stationary magnetic media)",
corpsource = "Wang Labs., Lowell, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bubble memory; computational complexity; lower bound;
magnetic bubble memories; optimal algorithm;
permutation",
treatment = "T Theoretical or Mathematical",
}
@Article{Yao:1980:NAE,
author = "Andrew C. Yao",
title = "A Note on the Analysis of Extendible Hashing",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "84--86",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05",
MRnumber = "82a:68180",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "average depth; average number of entries; bounds; data
access; extendible hashing; file organisation; hash
tables",
treatment = "T Theoretical or Mathematical",
}
@Article{Broy:1980:TSC,
author = "M. Broy",
title = "Transformational Semantics for Concurrent Programs",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "87--91",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10",
MRnumber = "81i:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. f{\"u}r Informatik Tech. Univ. Munchen, Munchen,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "axiomatic transformation rules; computer programming;
concurrent programs; formal languages; language of
guarded commands; multiprogramming; semantics;
sequential program",
treatment = "T Theoretical or Mathematical",
}
@Article{Johnson:1980:CVA,
author = "Robert B. {Johnson, Jr.}",
title = "The complexity of a {VLSI} adder",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "92--93",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94C99 (68C25)",
MRnumber = "81i:94047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B1265B (Logic circuits); C5120 (Logic and switching
circuits)",
corpsource = "Dept. of Maths., Univ. of Illinois, Urbana, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "adders; area/time complexity; binary addition;
computational complexity; digital integrated circuits;
large scale integration; lower bound; VLSI adder",
treatment = "T Theoretical or Mathematical",
}
@Article{Calmet:1980:IRP,
author = "J. Calmet and R. Loos",
title = "An improvement of {Rabin}'s probabilistic algorithm
for generating irreducible polynomials over {GF($p$)}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "94--95",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Inst. f{\"u}r Informatik I, Univ. Karlsruhe,
Karlsruhe, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; factorization algorithm;
irreducible polynomials over GF(p); polynomials;
probabilistic algorithm; probabilistic logic; SIAM J.
Comput",
treatment = "T Theoretical or Mathematical",
}
@Article{Colbourn:1980:CCP,
author = "Charles J. Colbourn and Brendan D. McKay",
title = "A correction to {Colbourn}'s paper on the complexity
of matrix symmetrizability: {``The complexity of
symmetrizing matrices'' [Inform. Process. Lett. {\bf 9}
(1979), no. 3, 108--109; MR 81a:68045]}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "96--97",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (65F30)",
MRnumber = "82a:68069",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Colbourn:1979:CSM}.",
acknowledgement = ack-nhfb,
classification = "B0210 (Algebra); C1110 (Algebra)",
corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; computational complexity; matrix algebra;
matrix symmetrizability problem; NP completeness",
treatment = "T Theoretical or Mathematical",
}
@Article{Kanellakis:1980:CCC,
author = "Paris C. Kanellakis",
title = "On the computational complexity of cardinality
constraints in relational databases",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "98--101",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15 (03D15 68C25)",
MRnumber = "82m:68041",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cardinality constraints; computational complexity;
database management systems; dependencies; lossless
join problem; NP completeness; relational databases",
treatment = "T Theoretical or Mathematical",
}
@Article{Luque:1980:TAM,
author = "E. Luque and A. Ripoll",
title = "Tuning Architecture via Microprogramming",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "102--109",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C5220 (Computer architecture)",
corpsource = "Dept. de Electricidad y Electronica, Facultad de
Ciencias, Univ. Autonoma de Barcelona, Barcelona,
Spain",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer architecture; computer architecture tuning;
control memory; microprogrammable computer;
microprogramming; tuning",
treatment = "P Practical",
}
@Article{Leiss:1980:NSS,
author = "E. Leiss",
title = "A note on a signature system based on probabilistic
logic",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "110--113",
day = "??",
month = oct,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6130 (Data handling
techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "data privacy; digitalised signature system;
probabilistic logic; requirements",
treatment = "A Application",
}
@Article{Leung:1980:NPS,
author = "Joseph Y.-T. Leung and M. L. Merrill",
title = "A note on preemptive scheduling of periodic, real-time
tasks",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "115--118",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C15",
MRnumber = "82d:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Northwestern Univ., Evanston, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "multiprogramming; periodic real-time tasks; preemptive
scheduling; scheduling",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Robson:1980:SAN,
author = "J. M. Robson",
title = "Storage allocation is {NP}-hard",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "119--125",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68B15 90B05 90C10)",
MRnumber = "82b:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150J (Operating systems)",
corpsource = "Dept. of Computer 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 = "computer operating systems; NP-hard; request/freeing
sequences; storage allocation",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Avis:1980:CLB,
author = "David Avis",
title = "Comments on a lower bound for convex hull
determination: {``On the $\Omega(n\log n)$ lower bound
for convex hull and maximal vector determination'' by
van Emde Boas} {[Inform. Process. Lett. {\bf 10}(3), 18
April 1980, pp. 132--136]}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "126--126",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (52-04 52A10 90C25)",
MRnumber = "83e:68034b",
MRreviewer = "Selim G. Akl",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{vanEmdeBoas:1980:LBC}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "McGill Univ., Montreal, Que., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; convex hull; linear decision
trees; lower bound; trees (mathematics)",
treatment = "G General Review",
}
@Article{Moura:1980:NGC,
author = "Arnaldo Moura",
title = "A note on grammatical covers",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "127--129",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "82d:68047",
MRreviewer = "A. V. An\={\i}s\={\i}mov",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, Berkeley, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context-free grammars; grammatical covers; Greibach
normal form; null string",
treatment = "T Theoretical or Mathematical",
}
@Article{Bailey:1980:FSS,
author = "T. A. Bailey and R. G. Dromey",
title = "Fast string searching by finding subkeys in subtext",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "130--133",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computing Sci., Univ. of Wollongong,
Wollongong, NSW, Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "characters; data handling; sequences; string search;
subkeys; subtext",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Romani:1980:SPP,
author = "Francesco Romani",
title = "Shortest-path problem is not harder than matrix
multiplication",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "134--136",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (90B10)",
MRnumber = "81k:68036",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also note \cite{Moran:1981:NSP}.",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics)",
corpsource = "Istituto di Elaborazione dell'Informazione, Pisa,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "all-pairs shortest-path problem; complexity; graph
theory; matrix algebra; matrix multiplication",
treatment = "T Theoretical or Mathematical",
}
@Article{Erkio:1980:IMS,
author = "H. Erkio",
title = "Internal merge sorting with delayed selection",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "137--140",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "delayed selection; essential logic; internal sorting;
key comparisons; merge sorting; merging; sorting",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Dershowitz:1980:SMA,
author = "N. Dershowitz",
title = "The {Schorr--Waite} marking algorithm revisited",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "141--143",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "correctness; correctness proving; directed graph;
directed graphs; nodes; programming theory;
Schorr--Waite marking algorithm",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Kinber:1980:IPD,
author = "E. B. Kinber",
title = "On inclusion problem for deterministic multitape
automata",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "3",
pages = "144--146",
day = "18",
month = nov,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05 (03D05 68F10)",
MRnumber = "82f:68055",
MRreviewer = "Michael Anshel",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computing Center, Latvian State Univ., Riga, Latvian
SSR, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computability and decidability; decidable inclusion;
deterministic automata; deterministic multitape
automata; inclusion problem; n-tape automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Laut:1980:SPI,
author = "A. Laut",
title = "Safe procedural implementations of algebraic types",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "147--151",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Inst. f{\"u}r Informatik., Tech. Univ. Munchen,
Munchen, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "abstract data types; algebraic types; data structures;
program specification; programming",
treatment = "P Practical",
}
@Article{Paredaens:1980:GLA,
author = "J. Paredaens and F. Ponsaert",
title = "Grant levels in an authorization mechanism",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "152--155",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS)); C7100
(Business and administration)",
corpsource = "Dept. of Math., Univ. Instelling Antwerpen, Wilrijk,
Belgium",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "authorization mechanism; database management systems;
database systems; grants; hierarchical structure;
management information systems; MIS; security of data",
treatment = "P Practical",
}
@Article{Frederickson:1980:PAS,
author = "Greg N. Frederickson",
title = "Probabilistic analysis for simple one- and
two-dimensional bin packing algorithms",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "156--161",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (52-04 52A45 60C05)",
MRnumber = "82i:68019",
MRreviewer = "R. Subramanian",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; bin packing algorithms; computer
science; expected performance; NP-complete;
probabilistic analysis",
treatment = "P Practical",
}
@Article{Ibarra:1980:NPC,
author = "Oscar H. Ibarra and Shlomo Moran and Louis E. Rosier",
title = "A note on the parallel complexity of computing the
rank of order $n$ matrices",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "162--162",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "82d:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; matrix algebra; order n
matrices; parallel complexity; rank",
treatment = "T Theoretical or Mathematical",
}
@Article{Hanson:1980:CIL,
author = "D. R. Hanson",
title = "Code improvement via lazy evaluation",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "163--167",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "code generation; lazy evaluation; peephole
optimisation; programming",
treatment = "P Practical",
}
@Article{terBekke:1980:CD,
author = "J. H. {ter Bekke}",
title = "Convertibility in databases",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "168--171",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Math., Delft Univ. of Technol., Delft,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convertibility; data semantics; database management
systems; DBMS; normalized relations; relational
databases",
treatment = "T Theoretical or Mathematical",
}
@Article{Pettorossi:1980:DAC,
author = "Alberto Pettorossi",
title = "Derivation of an {$O(k^2\,\log n)$} algorithm for
computing order-$k$ {Fibonacci} numbers from the
{$O(k^3\,\log n)$} matrix multiplication method",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "172--179",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "82a:68084",
MRreviewer = "Henry S. Warren, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "iterative methods; matrix algebra; O(k/sup 2/log n)
algorithm; O(k/sup 3/log n) matrix multiplication
method; order-k Fibonacci numbers; order-k homogeneous
linear recurrence relation",
treatment = "T Theoretical or Mathematical",
}
@Article{Williams:1980:CMC,
author = "M. H. Williams",
title = "Cubic map configurations",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "180--185",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown,
South Africa",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cartography; configurations; cubic maps; graph
colouring",
treatment = "T Theoretical or Mathematical",
}
@Article{Williams:1980:BSB,
author = "M. H. Williams",
title = "Batch sizes for the batching method of colouring
planar maps",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "186--189",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown,
South Africa",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "batching method; cubic maps; five colours; graph
colouring; planar maps",
treatment = "T Theoretical or Mathematical",
}
@Article{Majster-Cederbaum:1980:SRB,
author = "Mila E. Majster-Cederbaum",
title = "A simple relation between relational and predicate
transformer semantics for nondeterministic programs",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "190--192",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10",
MRnumber = "82m:68025",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "inst. f{\"u}r Informatik, Tech. Univ. Munchen,
Munchen, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "formal languages; nondeterministic programs; predicate
transformer semantics; relational semantics",
treatment = "T Theoretical or Mathematical",
}
@Article{Petreschi:1980:SAS,
author = "Rossella Petreschi and Bruno Simeone",
title = "A switching algorithm for the solution of quadratic
{Boolean} equations",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "193--198",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03G05 90C20 94C10)",
MRnumber = "82e:68044a",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum \cite{Petreschi:1981:ESA}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4230 (Switching theory)",
corpsource = "Math. Inst., Univ. of L'Aquila, Aquila, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Boolean algebra; NP completeness; quadratic Boolean
equations; switching algorithm; switching functions;
test problems; worst-case complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Arora:1980:HAP,
author = "R. K. Arora and S. P. Rana",
title = "Heuristic algorithms for process assignment in
distributed computing systems",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "199--203",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "distributed computing systems; distributed operating
systems; distributed processing; heuristic algorithms;
operating systems (computers); process assignment",
treatment = "P Practical",
}
@Article{Kawai:1980:FSP,
author = "Hiroya Kawai",
title = "A formal system for parallel programs in discrete time
and space",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "204--210",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10 (03B45 68B20)",
MRnumber = "82d:68009",
MRreviewer = "R{\"u}diger Valk",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Computation Center of Osaka Univ., Osaka, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Barcan formula; correctness; discrete time; formal
logic; formal system; natural number theory; natural
semantics; parallel processing; parallel programs;
programming theory; temporal system",
treatment = "T Theoretical or Mathematical",
}
@Article{tenHoopen:1980:CRR,
author = "J. {ten Hoopen}",
title = "Consecutive retrieval with redundancy: an optimal
linear and an optimal cyclic arrangement and their
storage space requirements",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "211--217",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05",
MRnumber = "82g:68092",
MRreviewer = "H. P. Kriegel",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C7250L (Non-bibliographic
retrieval systems)",
corpsource = "Subdept. of Appl. Math., Technol. Univ. Twente,
Enschede, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "consecutive retrieval; cyclic arrangement; file
organisation; finite set; information retrieval;
redundancy; repetitions; storage space requirements",
treatment = "P Practical",
}
@Article{Kandzia:1980:CBC,
author = "Peter Kandzia and Margret Mangelmann",
title = "On covering {Boyce-Codd} normal forms",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "218--223",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "82e:68023",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Inst. f{\"u}r Informatik und Praktische Math.,
Christian-Albrechts-Univ.Kiel, Kiel, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Boyce-Codd normal forms; database management systems;
DBMS; functional dependences; relational database",
treatment = "P Practical",
}
@Article{Pajunen:1980:TTL,
author = "Seppo Pajunen",
title = "On two theorems of {Lenstra}",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "224--228",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "10A25 (10-04)",
MRnumber = "82d:10015",
MRreviewer = "D. H. Lehmer",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Jammel:1980:ECD,
author = "Alfons J. Jammel and Helmut G. Stiegler",
title = "On expected costs of deadlock detection",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "4--5",
pages = "229--231",
day = "12",
month = dec,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (68C25)",
MRnumber = "82f:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informatik und Praktische Math. Kiel,
Christian-Albrechts-Univ., Kiel, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "acyclic graphs; computational complexity; deadlock
detection; directed graph; edges; system recovery",
treatment = "T Theoretical or Mathematical",
}
@Article{Mauceri:1981:FCC,
author = "S. Mauceri and A. Restivo",
title = "A family of codes commutatively equivalent to prefix
codes",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "1--4",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B45",
MRnumber = "82j:94021",
MRreviewer = "Aldo De Luca",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See letter to the editor \cite{Krichevsky:1982:LEF}.",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes)",
corpsource = "Istituto di Matematica, Univ. di Palermo, Palermo,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "encoding; information theory; prefix codes",
treatment = "T Theoretical or Mathematical",
}
@Article{Dudzinski:1981:SMS,
author = "Krzysztof Dudzi{\'n}ski and Andrzej Dydek",
title = "On a Stable Minimum Storage Merging Algorithm",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "5--8",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "82a:68115",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems programming; merging vectors;
sorting; stable algorithm; stable minimum storage
merging algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Lawler:1981:SPO,
author = "Eugene L. Lawler and Charles U. Martel",
title = "Scheduling Periodically Occurring Tasks on Multiple
Processors",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "9--12",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B35 (68B20 68C15)",
MRnumber = "82k:90064",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Computer Sci. Div., Univ. of California, Berkeley, CA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; feasible schedule; linear
programming; LP; multiple processors; nonperiodic
scheduling; parallel processing; parallel processors;
scheduling",
treatment = "P Practical",
}
@Article{Choffrut:1981:CPD,
author = "C. Choffrut",
title = "A closure property of deterministic context-free
languages",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "13--16",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "82a:68139",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "UER de Math., Univ. Paris VII, Paris, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "closure property; context-free languages;
deterministic context-free languages; free monoid;
longest common prefix",
treatment = "T Theoretical or Mathematical",
}
@Article{Tsao:1981:NIB,
author = "Nai Kuan Tsao",
title = "The numerical instability of {Bini}'s algorithm",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "17--19",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65F30",
MRnumber = "82i:65029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See reply \cite{Bini:1982:RPN}.",
acknowledgement = ack-nhfb,
classification = "723; 921; B0290H (Linear algebra); C4140 (Linear
algebra)",
corpsource = "Dept. of Computer 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 = "approximate matrix multiplication; Bini's algorithm;
complexity algorithm; computer programming ---
Subroutines; convergence of numerical methods;
mathematical techniques; matrix algebra; matrix
multiplication; numerical instability",
treatment = "T Theoretical or Mathematical",
}
@Article{Gabow:1981:LTR,
author = "Harold N. Gabow",
title = "A linear-time recognition algorithm for interval
dags",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "20--22",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C15",
MRnumber = "82b:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1290
(Applications of systems theory)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "directed graphs; interval dags; interval orders;
linear-time recognition algorithm; partial orders;
scheduling; unit-execution-time scheduling problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Denning:1981:MKG,
author = "Dorothy E. Denning and Fred B. Schneider",
title = "Master keys for group sharing",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "23--25",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B99",
MRnumber = "82d:94046",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also note \cite{Brouwer:1982:NMK}.",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes)",
corpsource = "Computer Sci. Dept., Purdue Univ., W. Lafayette, IN,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Diffie and Hellman's public-key distribution scheme;
encoding; group sharing; master key; Shamir's threshold
scheme",
treatment = "T Theoretical or Mathematical",
}
@Article{Hehner:1981:BTS,
author = "Eric C. R. Hehner",
title = "Bunch theory: a simple set theory for computer
science",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "26--30",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B05 (03E20 68E99)",
MRnumber = "82d:68007",
MRreviewer = "P. {\v{S}}t{\v{e}}p{\'a}nek",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computer science; formal languages; set theory; simple
set theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Whitesides:1981:AFC,
author = "S. H. Whitesides",
title = "An algorithm for finding clique cut-sets",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "31--32",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C40)",
MRnumber = "82a:68133",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics)",
corpsource = "Math. Dept., Dartmouth Coll., Hanover, NH, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "clique cut-sets; computer programming; graph theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Hell:1981:GMP,
author = "P. Hell and D. G. Kirkpatrick",
title = "On generalized matching problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "33--35",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C70 (68C25 90C10)",
MRnumber = "83i:05059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "augmenting path techniques; duality theorems;
generalized matching problems; graph theory;
NP-complete; polynomial algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Bruynooghe:1981:SCS,
author = "M. Bruynooghe",
title = "Solving combinatorial search problems by intelligent
backtracking",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "36--39",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Katholieke Univ. Leuven, Heverlee, Belgium",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "AT; combinatorial mathematics; combinatorial problems;
combinatorial search problems; intelligent
backtracking; optimisation",
treatment = "T Theoretical or Mathematical",
}
@Article{Lloyd:1981:CGS,
author = "Errol L. Lloyd",
title = "{Coffman--Graham} scheduling of {UET} task systems
with $0$-$1$ resources",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "40--45",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B35 (68C25)",
MRnumber = "83k:90056",
MRreviewer = "M. M. Sys{\l}o",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1290 (Applications of systems theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Coffman--Graham scheduling; minimal length
nonpreemptive schedules; scheduling; UET task systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Ceri:1981:UBN,
author = "S. Ceri and G. Pelagatti",
title = "An upper bound on the number of execution nodes for a
distributed join",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "46--48",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160B (Distributed
databases)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "database management systems; DBMS; distributed
databases; distributed join; distributed processing;
execution nodes; file organisation",
treatment = "T Theoretical or Mathematical",
}
@Article{Overmars:1981:SPD,
author = "Mark H. Overmars and Jan {van Leeuwen}",
title = "Some principles for dynamizing decomposable searching
problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "1",
pages = "49--53 (or 49--54??)",
day = "13",
month = feb,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (90B40)",
MRnumber = "82e:68063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "dynamization methods; dynamizing decomposable
searching problems; number systems; optimisation; query
times",
treatment = "T Theoretical or Mathematical",
}
@Article{Hatzopoulos:1981:OPD,
author = "M. Hatzopoulos and J. G. Kollias",
title = "Optimal policy for database backup and recovery",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "55--58",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "Unit of Appl. Math., Univ. of Athens, Athens, Greece",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "backup cycle; database management systems; DBMS;
optimal policy; recovery; renewal theory; system
recovery",
treatment = "P Practical",
}
@Article{Harland:1981:CLE,
author = "D. M. Harland",
title = "Concurrency in a language employing messages",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "59--62",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6140D (High level
languages)",
corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, St.
Andrews, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "concurrency; data structures; data types; dynamic
execution; dynamic parallelism; high level languages;
language; messages; parallel processing; process;
static definitions",
treatment = "P Practical",
}
@Article{Ingemarsson:1981:UAS,
author = "Ingemar Ingemarsson and C. K. Wong",
title = "A user authentication scheme for shared data based on
a trap-door one-way function",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "63--67",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques); C6160
(Database management systems (DBMS))",
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 = "accessible region; data base systems; database
management systems; DBMS; security of data; shared
data; trap-door one-way function; user authentication
scheme",
treatment = "P Practical",
xxtitle = "Use Authentication Scheme for Shared Data Based on a
Trap-Door One-Way Function",
}
@Article{Pansiot:1981:MSI,
author = "J. J. Pansiot",
title = "The {Morse} sequence and iterated morphisms",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "68--70",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E99 (10K10 28D15 54H20)",
MRnumber = "83d:68070",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Centre de Calcul de l'Esplanade, Strasbourg, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "alphabet; binary representation; binary sequences;
deletions; formal logic; infinite sequence; insertions;
iterated morphisms; mapping; morphisms; Morse
sequence",
treatment = "T Theoretical or Mathematical",
}
@Article{Borodin:1981:ESU,
author = "A. Borodin and L. J. Guibas and N. A. Lynch and A. C.
Yao",
title = "Efficient searching using partial ordering",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "71--75",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "82j:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Univ. of Toronto, Toronto, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Dilworth's theorem; information retrieval; membership
query; pairwise comparisons; partial ordering;
preprocessing cost; query; search cost; sorting",
treatment = "P Practical",
}
@Article{Schnorr:1981:HMP,
author = "C. P. Schnorr",
title = "How many polynomials can be approximated faster than
they can be evaluated?",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "76--78",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "12-04 (68C25)",
MRnumber = "82g:12002",
MRreviewer = "Maurice Mignotte",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4120 (Functional analysis); C4130 (Interpolation
and function approximation); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Math., Univ. Frankfurt, Frankfurt, West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic complexity; canonical computation;
computational complexity; function evaluation;
polynomials; universal sets; Zariski closed fields",
treatment = "T Theoretical or Mathematical",
}
@Article{Jaffar:1981:PAA,
author = "Joxan Jaffar",
title = "Presburger arithmetic with array segments",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "79--82",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C30",
MRnumber = "83g:68072",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "array indices; array segments; computability and
decidability; decision procedures; formal languages;
merging; Presburger arithmetic",
treatment = "T Theoretical or Mathematical",
}
@Article{Steinberg:1981:LSE,
author = "David Steinberg and Michael Rodeh",
title = "A layout for the shuffle-exchange network with
{$\Theta(N^2\log N)$} area",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "83--88",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "82d:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B1130 (General circuit analysis and synthesis
methods); B1265 (Digital electronics)",
corpsource = "Dept. of Appl. Math., Weizmann Inst., Rehovot,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bisection; circuit layout; interconnection networks;
large scale integration; network synthesis; permutation
networks; shuffle-exchange network; VLSI",
treatment = "P Practical",
}
@Article{Shiloach:1981:ALD,
author = "Yossi Shiloach",
title = "Another look at the degree constrained subgraph
problem",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "89--92",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C70 (05C35)",
MRnumber = "82e:05109",
MRreviewer = "Charles H. C. Little",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "IBM Israel Sci. Center, Haifa, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "alternating path technique; combinatorial approach;
degree constrained subgraph problem; edge-coloring
problems; edge-partitioning problem; graph theory;
linear programming; regular maximum matching problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Mehlhorn:1981:ODD,
author = "Kurt Mehlhorn and Mark H. Overmars",
title = "Optimal dynamization of decomposable searching
problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "93--98",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "82d:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "data structures; database management systems; DBMS;
decomposable searching problems; information retrieval;
optimal dynamization",
treatment = "P Practical",
}
@Article{Overmars:1981:GMA,
author = "Mark H. Overmars",
title = "General methods for ``all elements'' and ``all
pairs'' problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "99--102",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "82d:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "all elements problem; all pairs problem; data
structures; database management systems; DBMS;
information retrieval; searching problems",
treatment = "P Practical",
}
@Article{Micali:1981:TWD,
author = "Silvio Micali",
title = "Two-way deterministic finite automata are
exponentially more succinct than sweeping automata",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "103--105",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D05 68C40)",
MRnumber = "82d:68034",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Univ. of California, Berkeley, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; finite automata; formal languages; head
motion; input tape; nondeterminism; size of
description; sweeping automata; two way deterministic
finite automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Tompa:1981:EST,
author = "Martin Tompa",
title = "An extension of {Savitch}'s theorem to small space
bounds",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "106--108",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D15 68C40)",
MRnumber = "82d:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "alternating Turing machines; nondeterministic space
bounds; Savitch's theorem; small space bounds; Turing
machines",
}
@Article{Petreschi:1981:ESA,
author = "R. Petreschi and B. Simeone",
title = "Erratum: {``A switching algorithm for the solution of
quadratic {Boolean} equations''}",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "2",
pages = "109--109",
day = "13",
month = apr,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03G05 90C20 94C10)",
MRnumber = "82e:68044b",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Petreschi:1980:SAS}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Courcelle:1981:SAT,
author = "Bruno Courcelle",
title = "The simultaneous accessibility of two configurations
of two equivalent {DPDAs}",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "111--114",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D15 (68F10)",
MRnumber = "82i:68034",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "UER de Math. et d'Informatique, Univ. de Bordeaux I,
Talence, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "alternate stacking methods; automata theory;
deterministic automata; deterministic pushdown
automata; equivalence; simultaneous accessibility",
treatment = "T Theoretical or Mathematical",
}
@Article{Peterson:1981:MAM,
author = "G. L. Peterson",
title = "Myths about the mutual exclusion problem",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "115--116",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory)",
corpsource = "Dept. of Computer Sci., Univ. of Rochester, Rochester,
NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "busy-waiting; deadlock; mutual exclusion problem;
parallelism; protocols; queueing theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Leland:1981:HDG,
author = "W. Leland and R. Finkel and Li Qiao and M. Solomon and
L. Uhr",
title = "High density graphs for processor interconnection",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "117--120",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5620 (Computer
networks and techniques)",
corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computer networks; full duplex; graph theory; high
density graphs; interconnection graph; processor
interconnection; vertex",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1981:UWP,
author = "Ronald V. Book",
title = "The undecidability of a word problem: on a conjecture
of {Strong}, {Maggiolo-Schettini} and {Rosen}",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "121--122",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D03 (03D40 68C25)",
MRnumber = "82h:03035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computability and decidability; DOS systems; formal
languages; programs; recursion structure; recursive
procedure calls; restricted finite Thue systems;
substitutions; undecidability; word problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Lischke:1981:TTP,
author = "Gerhard Lischke",
title = "Two types of properties for complexity measures",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "123--126",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D15 68C30)",
MRnumber = "82f:68050",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Sektion Math., Friedrich-Schiller-Univ. Jena, Jena,
East Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity measures; computational complexity; Godel
numbering; partial recursive functions; step counting
functions",
treatment = "T Theoretical or Mathematical",
}
@Article{Wilhelm:1981:MTT,
author = "Reinhard Wilhelm",
title = "A modified tree-to-tree correction problem",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "127--132",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68C05)",
MRnumber = "83a:68060",
MRreviewer = "Henry S. Warren, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; formal languages; labels; minimum cost
tree mapping; tree-to-tree correction problem; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Fowler:1981:OPC,
author = "Robert J. Fowler and Michael S. Paterson and Steven L.
Tanimoto",
title = "Optimal packing and covering in the plane are
{NP}-complete",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "133--137",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C99 (05B40 52-04 52A45 68C25 68G10)",
MRnumber = "82e:05112",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "713; 714; 723; 913; C1160 (Combinatorial
mathematics); C4290 (Other computer theory); C6160
(Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "combinatorial problems; computation theory; computer
graphics; computer metatheory; covering; database
management systems; databases; fixed-size rectangles;
graph theory; image processing; integrated circuits ---
Computer Aided Design; intersection graph; NP
completeness; packing; scheduling; silicon chip",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Jaromczyk:1981:LDT,
author = "Jerzy W. Jaromczyk",
title = "Linear decision trees are too weak for convex hull
problem",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "138--141",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "52-04 (52A99 68C25)",
MRnumber = "82j:52001",
MRreviewer = "Klaus Lommatzsch",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4290 (Other
computer theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational geometry; convex hull problem; convexity
property; linear decision-tree model; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Bertoni:1981:ECC,
author = "Alberto Bertoni and Giancarlo Mauri",
title = "On Efficient Computation of the Coefficients of Some
Polynomials with Applications to Some Enumeration
Problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "142--145",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D05 05A15)",
MRnumber = "82i:68026",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "921; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Istituto di Cibernetica, Univ. di Milano, Milano,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "abstract data types; complexity; computational
complexity; data structures; efficient computation;
enumeration problems; mathematical techniques;
polynomials; Turing machine; Turing machines",
treatment = "T Theoretical or Mathematical",
}
@Article{Erni:1981:TTC,
author = "W. Erni and R. Lapsien",
title = "On the time and tape complexity of weak unification",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "146--150",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03B35 03D15 68G15)",
MRnumber = "82f:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4220 (Automata
theory)",
corpsource = "Inst. f{\"u}r Angewandte Math., Univ. Heidelberg,
Heidelberg, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm analysis; automata theory; computational
complexity; deterministic automata; deterministic
Turing machine; deterministic two-way push-down
automaton; finite tree; formal languages; random access
machine; single input head; tape complexity; theorem
proving; time complexity; trees (mathematics); Turing
machines; weak unification",
treatment = "T Theoretical or Mathematical",
}
@Article{Ancilotti:1981:ISS,
author = "P. Ancilotti and M. Boari",
title = "Information Streams Sharing a Finite Buffer:
Protection Problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "3",
pages = "151--159",
day = "13",
month = jun,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "712; 723; B6210L (Computer communications); C5610
(Computer interfaces)",
corpsource = "Istituto per l'Elaborazione dell'Informazione, CNR,
Pisa, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "access control mechanism; computer interfaces;
computer systems, digital; finite buffer; information
streams; mutual exclusion; parallelism; protection
problems; protocols; reliability problem; structure",
treatment = "T Theoretical or Mathematical",
}
@Article{Preparata:1981:TSP,
author = "Franco P. Preparata and Kenneth J. Supowit",
title = "Testing a simple polygon for monotonicity",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "161--164",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (51M20)",
MRnumber = "83d:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; analysis of algorithms;
computational geometry; geometry; monotonicity;
polygon; time solution",
treatment = "T Theoretical or Mathematical",
}
@Article{Eastman:1981:OBS,
author = "C. M. Eastman",
title = "Optimal bucket size for nearest neighbor searching in
$k$-$d$ trees",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "165--167",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15 (05-04 05C05 68C25)",
MRnumber = "83a:68021",
MRreviewer = "Selim G. Akl",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6120 (File
organisation); C6160 (Database management systems
(DBMS))",
corpsource = "Dept. of Math. and Computer Sci., Florida State Univ.,
Tallahassee, FL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "$k$-$d$ trees; data management; database management
systems; file organisation; file processing; multikey
searching; nearest neighbor searching; optimal bucket
size; programming theory; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Overmars:1981:WOI,
author = "M. H. Overmars and J. {van Leeuwen}",
title = "Worst-case optimal insertion and deletion methods for
decomposable searching problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "168--173",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "data structures; decomposable searching problems;
deletion methods; dynamic solutions; dynamizations;
nearest neighbor searching; programming theory; range
querying; worst case optimal insertion",
treatment = "P Practical",
}
@Article{Frougny:1981:SDN,
author = "C. Frougny",
title = "Simple deterministic {NTS} languages",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "174--178",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. de Picardie, Amiens, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Alg; context free languages; context-free languages;
deterministic NTS languages; expansive language; IRS",
treatment = "T Theoretical or Mathematical",
}
@Article{Meijer:1981:NCM,
author = "H. Meijer",
title = "A note on {``A cryptosystem for multiple
communication''} {[Inform. Process. Lett. {\bf
10}(4--5), 5 July 1980, pp. 180--183]}",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "179--181",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Luccio:1980:CMC,Hellman:1981:ACA}.",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes)",
corpsource = "Dept. of Math. and Statistics, Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cryptography; cryptosystem; cyphertext; data
communication systems; multiple communication; node;
plain-text attack; secret messages; security",
treatment = "T Theoretical or Mathematical",
}
@Article{Hellman:1981:ACA,
author = "M. E. Hellman",
title = "Another cryptanalytic attack on {``A cryptosystem for
multiple communication''} {[Inform. Process. Lett. {\bf
10}(4--5), 5 July 1980, pp. 180--183]}",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "182--183",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Luccio:1980:CMC,Meijer:1981:NCM}.",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes)",
corpsource = "Dept. of Electrical Engng., Stanford Univ., Stanford,
CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "authentification; cryptography; cryptosystem; data
communication systems; multiple communication; plain
text attack; security; text attack",
treatment = "T Theoretical or Mathematical",
}
@Article{Ottmann:1981:SGF,
author = "T. Ottmann and A. Salomaa and D. Wood",
title = "Sub-regular grammar forms",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "184--187",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Angewandte Informatik und Formale
Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "closure operations; computability and decidability;
decidable; form equivalence; grammars; grammatical
family; regular set; sub regular grammatical families;
unambiguous grammar form",
treatment = "T Theoretical or Mathematical",
}
@Article{Semba:1981:GAB,
author = "Ichir\=o Semba",
title = "Generation of all the balanced parenthesis strings in
lexicographical order",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "188--192",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05A05 (68C05)",
MRnumber = "83e:05008",
MRreviewer = "E. Rodney Canfield",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Pure and Appl. Sci., Coll. of General
Education, Univ. of Tokyo, Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "balanced parenthesis strings; combinatorial
mathematics; computational linguistics; lexicographical
order",
treatment = "T Theoretical or Mathematical",
}
@Article{deLuca:1981:CPF,
author = "Aldo {de Luca}",
title = "A combinatorial property of the {Fibonacci} words",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "193--195",
day = "??",
month = "????",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05A99 (20M05)",
MRnumber = "84i:05023",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Hehner:1981:IPV,
author = "E. C. R. Hehner and R. K. Shyamasundar",
title = "An implementation of {$P$} and {$V$}",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "196--198",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "concurrent processes; multiprocessing systems; mutual
exclusion; programming theory; protocols; semaphore
operations; synchronization",
treatment = "T Theoretical or Mathematical",
}
@Article{Maier:1981:HB,
author = "D. Maier and S. C. Salveter",
title = "Hysterical {$B$}-trees",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "199--202",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C6120 (File organisation)",
corpsource = "Computer Sci. Dept., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm complexity; data structures; deletes;
hysterical B trees; indexing; inserts; merges; splits;
trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Papadimitriou:1981:MEG,
author = "Christos H. Papadimitriou and Mihalis Yannakakis",
title = "On minimal {Eulerian} graphs",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "203--205",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90C08 (05C35 05C45)",
MRnumber = "83a:90103",
MRreviewer = "Claude Benzaken",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C1290 (Applications of
systems theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "graph theory; mathematical programming; minimal
Eulerian graphs; minimisation; NP completion;
operations research; travelling salesman problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Iri:1981:LTA,
author = "Masao Iri and Kazuo Murota and Shouichi Matsui",
title = "Linear-Time Approximation Algorithms for Finding the
Minimum-Weight Perfect Matching on a Plane",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "4",
pages = "206--209",
day = "13",
month = aug,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (05C70 68C05 90C10)",
MRnumber = "83e:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Univ.
of Tokyo, Hongo, Bunkyo-ku, Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "approximation algorithms; computational complexity;
computer programming; graph theory; graphics; matched
points; minimum-weight perfect matching; Monte Carlo
methods; plane",
treatment = "T Theoretical or Mathematical",
}
@Article{Mauney:1981:IIE,
author = "J. Mauney and C. N. Fischer",
title = "An improvement to immediate error detection in {Strong
LL(1)} parsers",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "211--212",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Univ. of Wisconsin-Madison, Madison, WI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; error detection; grammars; LL(1)
parsers; parsing; Strong LL(1) grammars",
treatment = "T Theoretical or Mathematical",
}
@Article{Konneker:1981:NHD,
author = "Lloyd K. Konneker and Yaakov L. Varol",
title = "A note on heuristics for dynamic organization of data
structures",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "213--216",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Southern Illinois Univ.,
Carbondale, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "access; data processing; data structures; dependence;
dynamic organization; heuristics; search algorithm;
self organising structures; simulation results",
treatment = "P Practical",
}
@Article{Snir:1981:CSQ,
author = "M. Snir",
title = "On the complexity of simplifying quadratic forms",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "217--220",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (15A63)",
MRnumber = "83d:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., New York Univ., New York, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Boolean functions; complexity; computational
complexity; evaluation; minimal number;
multiplications; NP-hard; polynomials; positive
coefficients; quadratic forms",
treatment = "T Theoretical or Mathematical",
}
@Article{Harland:1981:FIC,
author = "David M. Harland",
title = "On Facilities for Interprocess Communication",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "221--226",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Dept. of Computational Sci., Univ. of St. Andrews,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "communication facilities; computer systems, digital;
computers, digital --- Data Communication Systems;
computing system; deadlock; interprocess communication;
message passing mechanism; operating systems
(computers); OS; parallel processing; parallelism",
treatment = "P Practical",
}
@Article{Ibarra:1981:PAS,
author = "Oscar H. Ibarra and Shlomo Moran and Louis E. Rosier",
title = "Probabilistic Algorithms and Straight-Line Programs
for Some Rank Decision Problems",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "227--232",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (15A54 90C20)",
MRnumber = "82m:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 922; B0290H (Linear algebra); C4140 (Linear
algebra)",
corpsource = "Computer Sci. Dept., Inst. of Technol., Univ. of
Minnesota, Minneapolis, MN, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "addition; arithmetic expressions; computer programming
--- Subroutines; decision theory and analysis;
exponentiation; mathematical techniques --- Matrix
Algebra; matrices; matrix algebra; multiplication;
parenthesization; polynomial entries; polynomials;
positive integer constants; probabilistic algorithms;
rank decision problems; straight-line programs;
subtraction",
treatment = "T Theoretical or Mathematical",
}
@Article{Pansiot:1981:NPC,
author = "J.-J. Pansiot",
title = "A note on {Post}'s correspondence problem",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "233--233",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D03 (03D40 68C30)",
MRnumber = "83h:03054",
MRreviewer = "Michael Anshel",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Huang:1981:AIP,
author = "Bing Chao Huang",
title = "An algorithm for inverting a permutation",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "237--238",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B0290H (Linear algebra); C4140 (Linear
algebra)",
corpsource = "Dept. of Computer Sci., Jilin Univ., Changchun,
China",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; inverse; matrix algebra;
permutation; permutations",
treatment = "T Theoretical or Mathematical",
}
@Article{Winkowski:1981:PAO,
author = "Jozef Winkowski",
title = "Protocols of Accessing Overlapping Sets of Resources",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "239--243",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Inst. Podstaw Informatyki, PAN, Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; deadlock; fairness;
indivisible operations; local communication; operating
systems (computers); overlapping sets; protocols;
resource accessing; resources; sequential processes",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Crochemore:1981:OAC,
author = "Max Crochemore",
title = "An optimal algorithm for computing the repetitions in
a word",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "244--250",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (05A05)",
MRnumber = "83j:68035",
MRreviewer = "Eugene Levner",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. d'Informatique, Univ. de Haute-Normandie,
Mont-Saint-Aignan, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "formal languages; optimal algorithm; primitive
factors; repetitions; word",
treatment = "T Theoretical or Mathematical",
}
@Article{Vardi:1981:DPD,
author = "M. Y. Vardi",
title = "The decision problem for database dependencies",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "251--254",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D35 (68H05)",
MRnumber = "84a:03047",
MRreviewer = "George Tourlakis",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "data base systems; database dependencies; database
management systems; DBMS; decision problem; formal
logic; sentence",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ebert:1981:STC,
author = "J{\"u}rgen Ebert",
title = "A sensitive transitive closure algorithm",
journal = j-INFO-PROC-LETT,
volume = "12",
number = "5",
pages = "255--258",
day = "13",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (05C20 68E10)",
MRnumber = "83e:68023",
MRreviewer = "M. C. Golumbic",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Univ. Osnabruck, Osnabruck, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; directed graph; directed graphs;
non-null path; reachability; sensitive transitive
closure algorithm; transitive closure problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Watanabe:1981:FAF,
author = "Osamu Watanabe",
title = "A fast algorithm for finding all shortest paths",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "1--3",
day = "??",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C38 90B10 90C35)",
MRnumber = "83c:68084",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; mathematical techniques ---
Graph Theory",
}
@Article{Lewis:1981:ECF,
author = "Gilbert N. Lewis and Nancy J. Boynton and F. Warren
Burton",
title = "Expected Complexity of Fast Search with Uniformly
Distributed Data",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "4--7",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (68C25)",
MRnumber = "83c:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4100 (Numerical analysis); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of math. and Computer Sci., Michigan Technol.
Univ., Houghton, MI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "complexity; computational complexity; computer
programming; fast search; interpolation; probability;
uniform distribution; uniformly distributed data",
treatment = "T Theoretical or Mathematical",
}
@Article{Storer:1981:CFS,
author = "James A. Storer",
title = "Constructing Full Spanning Trees for Cubic Graphs",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "8--11",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C05)",
MRnumber = "83d:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4210 (Formal logic)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "circuit layout; communications networks; computer
programming; cubic graphs; full spanning trees; graph
theoretic problems; graph theory; internal nodes;
leaves; mathematical techniques --- Graph Theory; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1981:DPA,
author = "Oscar H. Ibarra and Shlomo Moran",
title = "Deterministic and probabilistic algorithms for maximum
bipartite matching via fast matrix multiplication",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "12--15",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05-04 05C70 68C25)",
MRnumber = "83c:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0240Z (Other topics in statistics); B0250
(Combinatorial mathematics); B0290H (Linear algebra);
C1140Z (Other topics in statistics); C1160
(Combinatorial mathematics); C4140 (Linear algebra);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ.of Minnesota,
Minneapolis, MN, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; computational complexity; deterministic
algorithms; fast matrix multiplication; graph theory;
matrix algebra; maximum bipartite matching; nonsingular
square submatrix; probabilistic algorithms;
probability",
treatment = "T Theoretical or Mathematical",
}
@Article{Korsh:1981:GBS,
author = "James F. Korsh",
title = "Greedy Binary Search Trees are Nearly Optimal",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "16--19",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (05C05 68C05)",
MRnumber = "83e:68080",
MRreviewer = "Eberhard L{\"u}dde",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "School of Business Administration, Temple Univ.,
Philadelphia, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary search trees; computer programming; greedy
search tree; probability; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Agrawala:1981:OSR,
author = "A. K. Agrawala and S. K. Tripathi",
title = "On the optimality of semidynamic routing schemes",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "20--22",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other topics in statistics); C1180
(Optimisation techniques); C1290F (Systems theory
applications in industry)",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "deterministic techniques; operations research;
optimality; optimisation; queueing theory; resource
allocation; semidynamic routing schemes; stochastic
processes; stochastic rules",
treatment = "T Theoretical or Mathematical",
}
@Article{Ramamohanarao:1981:HAT,
author = "K. Ramamohanarao and R. Sacks-Davis",
title = "Hardware Address Translation for Machines with a Large
Virtual Memory",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "23--29",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "address translation; computer systems programming;
file organisation; hardware address translation;
indexing; machines; virtual memory; virtual storage",
treatment = "A Application",
}
@Article{Senizergues:1981:NCC,
author = "G. Senizergues",
title = "A new class of {C.F.L.} for which the equivalence is
decidable",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "30--34",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83j:68090",
MRreviewer = "S. A. Greibach",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Gunn:1981:DCP,
author = "Hamish I. E. Gunn and David M. Harland",
title = "Degrees of Constancy in Programming Languages",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "35--38",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6140D (High level languages)",
corpsource = "Dept. of Computational Sci., Univ. of St.Andrews,
Fife, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming languages; constancy; dynamic
type checking; high level languages; programming
languages; static checking",
treatment = "A Application",
}
@Article{Stoyan:1981:APR,
author = "Yu. G. Stoyan and S. V. Smelyakov",
title = "An approach to the problems of routing optimization in
the regions of intricate shape",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "1",
pages = "39--43",
day = "27",
month = oct,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0260 (Optimisation techniques); C1180 (Optimisation
techniques); C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Machine-Building Problems, Acad. of Sci.,
Kharkov, Ukrainian SSR, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; computer-oriented model;
intricate shape; optimisation; optimization; routing",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Clerbout:1981:IDM,
author = "Mireille Clerbout and Michel Latteux",
title = "The inclusion of {D0L} in {MULTI-RESET}",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "45--47",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D22",
MRnumber = "83a:68069",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq,
France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context sensitive languages; D0L; formal languages;
L-systems; multi-reset",
treatment = "P Practical",
}
@Article{Makarov:1981:UDS,
author = "O. M. Makarov",
title = "Using duality for the synthesis of an optimal
algorithm involving matrix multiplication",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "48--49",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (65F30)",
MRnumber = "83h:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Biology of the South Seas, Sevastopol,
Ukrainian SSR, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bilinear forms; computational complexity; duality;
duality (mathematics); matrix algebra; matrix
multiplication; multiplicative complexity;
noncommutative ring; optimal algorithm",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hood:1981:RQO,
author = "R. Hood and R. Melville",
title = "Real-time queue operations in {Pure LISP}",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "50--54",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Delete; Insert; LISP; list; Pure LISP; Query; queue
operations; queueing theory; recopying",
treatment = "P Practical",
}
@Article{Atallah:1981:ABL,
author = "Mikhail J. Atallah and S. Rao Kosaraju",
title = "An adversary-based lower bound for sorting",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "55--57",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83a:68077",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Electrical Engng., Johns Hopkins Univ.,
Baltimore, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "adversary-based lower bound; Omega(n log n) lower
bound; programming theory; sorting",
treatment = "P Practical",
}
@Article{Rytter:1981:DSR,
author = "Wojciech Rytter",
title = "The dynamic simulation of recursive and stack
manipulating programs",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "58--63",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; computer programming;
dynamic simulation; program transformation; programming
theory; recursive programs; stack; stack manipulating
programs; time complexity",
treatment = "P Practical",
}
@Article{Regnier:1981:AHT,
author = "Mireille Regnier",
title = "On the Average Height of Trees in Digital Search and
Dynamic Hashing",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "64--66",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83a:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "Keys over a binary alphabet can be organized in
digital search trees, also called tries, permitting
fast retrieval and updating of information. A result is
proved relative to digital search trees in which
profiles of size at most b are stored sequentially in a
single leaf.",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm analysis; average height; computer
programming; data management; digital search; dynamic
hashing; file organisation; programming theory;
subfiles; trees; trees (mathematics)",
treatment = "P Practical",
}
@Article{SilvaFilho:1981:OCD,
author = "Ysmar V. {Silva Filho}",
title = "Optimal Choice of Discriminators in a Balanced $k$-$d$
Binary Search Tree",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "67--70",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (05C05 68B15)",
MRnumber = "83b:68074",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6160
(Database management systems (DBMS))",
corpsource = "Nucleo de Computacao Eletronica, Univ. Federal do Rio
de Janeiro, Rio de Janeiro, Brazil",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; cycling; data base systems;
database management systems; DBMS; discriminators; K-D
binary search tree; leaf-blocks; programming theory;
trees (mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Pan:1981:LBA,
author = "V. Ya. Pan",
title = "The lower bounds on the additive complexity of
bilinear problems in terms of some algebraic
quantities",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "71--72",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (12-04 68C20)",
MRnumber = "83g:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Advanced Study, Princeton, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "additive complexity; algebraic computational
complexity; algebraic quantities; bilinear problems;
computational complexity; tensor rank",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1981:NGC,
author = "Ronald V. Book",
title = "{NTS} grammars and {Church--Rosser} systems",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "73--76",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05 (03D03 03D05)",
MRnumber = "83d:68071",
MRreviewer = "Lutz Priese",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Church--Rosser systems; congruence classes; finite
Thue systems; finite union; grammars; NTS grammars",
treatment = "T Theoretical or Mathematical",
}
@Article{Vitter:1981:SMS,
author = "J. S. Vitter",
title = "A Shared-Memory Scheme for Coalesced Hashing",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "77--79",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 22 17:13:14 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Nakamura:1981:SRO,
author = "Akira Nakamura",
title = "Some Remarks on One-Pebble Rectangular Array
Acceptors",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "80--84",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D35",
MRnumber = "83g:68084",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "array languages; automata theory; formal models;
one-pebble rectangular array acceptors; pattern
recognition systems; picture recognition; two
dimensional automata",
treatment = "P Practical",
}
@Article{Moran:1981:NSP,
author = "Shlomo Moran",
title = "A note on: {``Shortest-path problem is not harder than
matrix multiplication'' [Inform. Process. Lett. {\bf
11} (1980), no. 3, 134--136; MR 81k:68036] by F.
Romani. With a reply by Romani}",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "85--86",
day = "13",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "83k:68036",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Romani:1980:SPP}.",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4140 (Linear
algebra); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Technion, Haifa, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; graph theory; matrix algebra; matrix
multiplication; shortest path problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1981:DED,
author = "Oscar H. Ibarra and Louis E. Rosier",
title = "On the Decidability of Equivalence for Deterministic
Pushdown Transducers",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "89--93",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F10 (03B25 03D05)",
MRnumber = "84j:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "alternate stacking; automata theory; computability and
decidability; decidability; deterministic automata;
deterministic pushdown transducers; equivalence; formal
language",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1981:WPP,
author = "Hideki Yamasaki",
title = "On Weak Persistency of {Petri} Nets",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "94--97",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D90",
MRnumber = "83g:68087",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Oh-Okayama, Meguroku, Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; automatic theory; computability and
decidability; computer metatheory; decidable; Petri
nets; projective images; reachability set; semi-linear
sets; set theory; weak persistency",
treatment = "T Theoretical or Mathematical",
}
@Article{Chan:1981:DFP,
author = "Tat Hung Chan",
title = "Deciding Freeness for Program Schemes with a Single
Unary Function",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "98--102",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05 (03B25 03D05 68C30)",
MRnumber = "83h:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "arities; complexity; computability and decidability;
computational complexity; computer metatheory; counter
reversals; decidable; finite automata; finite-reversal
multicounter machines; freeness; predicates; program
schemes; programming theory; single unary function",
treatment = "T Theoretical or Mathematical",
}
@Article{Barlow:1981:PMA,
author = "R. H. Barlow and D. J. Evans and J. Shanehichi",
title = "A parallel merging algorithm",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "103--106",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (68C05)",
MRnumber = "83h:68092",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Studies, Loughborough Univ. of
Technol., Loughborough, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems programming; four processor
asynchronous parallel computer; merging; parallel
merging algorithm; parallel processing",
treatment = "P Practical",
}
@Article{Hassin:1981:MFP,
author = "Refael Hassin",
title = "Maximum flow in $(s,\,t)$ planar networks",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "107--107",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B10",
MRnumber = "83g:90053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B0260
(Optimisation techniques); C1160 (Combinatorial
mathematics); C1180 (Optimisation techniques)",
corpsource = "Dept. of Statistics, Tel-Aviv Univ., Tel-Aviv,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "dual network; flow function; graph theory; minimum
cut; optimisation; planar networks; shortest paths",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1981:SCD,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On the subword complexity of {D0L} languages with a
constant distribution",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "108--113",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83i:68105",
MRreviewer = "Matti Linna",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "alphabet; computational complexity; constant
distribution; D0L languages; formal languages; linear
function; subword complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Bird:1981:JP,
author = "R. S. Bird",
title = "The jogger's problem",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "114--117",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C38)",
MRnumber = "83f:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1290
(Applications of systems theory)",
corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "combinatorial problems; finding cycles; graph theory;
jogger's problem; network of roads; operations
research; undesirability",
treatment = "T Theoretical or Mathematical",
}
@Article{Atkinson:1981:CTH,
author = "M. D. Atkinson",
title = "The cyclic {Towers of Hanoi}",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "118--119",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B05 (05A05)",
MRnumber = "83f:68004",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Statistics, Carleton Univ., Ottawa,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cyclic towers of Hanoi; inelastic method; interactive
systems; PASCAL; programming theory; recursive
programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Tolle:1981:CVC,
author = "Donald MacDavid Tolle and William E. Siddall",
title = "On the Complexity of Vector Computations in Binary
Tree Machines",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "120--124",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68B20)",
MRnumber = "83h:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Univ. of North Carolina, Chapel Hill, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; automata theory; binary tree
machines; complexity; computational complexity;
computer metatheory; memory; parallel processing;
processor; space-time tradeoffs; trees (mathematics);
vector computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Denning:1981:MMK,
author = "D. E. Denning and H. Meijer and F. B. Schneider",
title = "More on master keys for group sharing",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "125--126",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C0230 (Economic, social and
political aspects of computing); C6130 (Data handling
techniques)",
corpsource = "Computer Sci. Dept., Purdue Univ., West Lafayette, IN,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cryptography; encryption; group sharing; master keys",
treatment = "P Practical",
}
@Article{vandeSnepscheut:1981:SCB,
author = "J. L. A. {Van De Snepscheut}",
title = "Synchronous Communication Between Asynchronous
Components",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "3",
pages = "127--130",
day = "13",
month = dec,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Math., Eindhoven Univ. of Technol.,
Eindhoven, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "asynchronous components; communicating processes;
complex systems; complexity; components; computers,
digital; designing programs; hierarchical systems;
parallel processing; switching theory; synchronous
communication; tree; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Papadimitriou:1981:CPP,
author = "Christos H. Papadimitriou and Mihalis Yannakakis",
title = "The clique problem for planar graphs",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "131--133",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C10 05C35)",
MRnumber = "83e:68090",
MRreviewer = "Peter Eades",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "clique problem; computer programming; graph theory;
linear time; mathematical techniques --- Graph Theory;
planar graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Barth:1981:AIK,
author = "G. Barth",
title = "An Alternative for the Implementation of the
{Knuth-Morris-Pratt} Algorithm",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "134--137",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C6120 (File organisation); C7250L (Non-bibliographic
retrieval systems)",
corpsource = "Computer Sci. Dept., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "information retrieval; Knuth-Morris-Pratt algorithm;
PASCAL; string matching",
treatment = "P Practical",
}
@Article{Davis:1981:DCL,
author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock",
title = "Data Compression in Limited Capacity Microcomputer
Systems",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "138--141",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; 731; C6120 (File organisation); C6130 (Data
handling techniques); C7250L (Non-bibliographic
retrieval systems)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computers, microprocessor; data base systems; data
compression; data reduction; data reduction and
analysis; database; information retrieval; information
theory --- Data Compression; microcomputer systems;
storage capacity",
treatment = "P Practical",
}
@Article{Rytter:1981:TCL,
author = "Wojciech Rytter",
title = "Time complexity of languages recognized by one-way
multihead pushdown automata",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "142--144",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F10",
MRnumber = "83b:68088",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warzawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; context-free languages; finite automata;
input heads; one-way multihead pushdown automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1981:HLR,
author = "Wojciech Rytter",
title = "A hardest language recognized by two-way
nondeterministic pushdown automata",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "145--146",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F10",
MRnumber = "83b:68089",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "2NPDA; finite automata; formal languages; hardest
language; reading head; two-way nondeterministic
pushdown automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Sabelfeld:1981:TEL,
author = "V. K. Sabel{\cprime}fel{\cprime}d",
title = "Tree equivalence of linear recursive schemata is
polynomial-time decidable",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "147--153",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D05 05C05 68E10)",
MRnumber = "83e:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4220 (Automata theory)",
corpsource = "Computing Center, Novosibirsk, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "finite automata; function call; linear recursive
schemata; marking algorithm; polynomial-time decidable;
pushdown automata; tree equivalence; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Bertossi:1981:EHP,
author = "Alan A. Bertossi",
title = "The edge {Hamiltonian} path problem is {NP}-complete",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "157--159",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C45 (68C25 68E10)",
MRnumber = "83i:05054",
MRreviewer = "Narsingh Deo",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Italsiel SpA, Roma, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; edge Hamiltonian problem;
graph theory; graphs; NP-complete; undirected graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Siklossy:1981:EQE,
author = "L. Sikl\'{o}ssy",
key = "Sikl\'{o}ssy",
title = "Efficient query evaluation in relational data bases
with missing values",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "160--163",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "do not have article QA 76 I47",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; C6120 (File organisation); C6160D (Relational
databases); C7250L (Non-bibliographic retrieval
systems)",
corpsource = "Bell Labs., Naperville, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "data base systems; data structures; database
management systems; DBMS; information retrieval;
missing values; query retrieval; relational data
bases",
owner = "curtis",
treatment = "P Practical",
}
@Article{Blum:1981:CTW,
author = "M. Blum and R. M. Karp and O. Vornberger and C. H.
Papadimitriou and M. Yannakakis",
title = "The complexity of testing whether a graph is a
superconcentrator",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "164--167",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (05C20 68E10)",
MRnumber = "84f:68031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Univ. of California, Berkeley, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "complexity; coNP-complete; graph; graph theory; input
node; mathematical techniques; output node;
superconcentrator",
treatment = "T Theoretical or Mathematical",
}
@Article{Schwartz:1981:FMD,
author = "Jacob T. Schwartz",
title = "Finding the minimum distance between two convex
polygons",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "168--170",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "52-04 (68C25 90D26)",
MRnumber = "84a:52004",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Ancona:1981:NMI,
author = "M. Ancona and V. Gianuzzi",
title = "A new method for implementing {${\rm LR}(k)$} tables",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "171--176",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F25 (03D05)",
MRnumber = "83b:68090",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4210 (Formal logic)",
corpsource = "Inst. per la Matematica Applicata, CNR, Genova,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "grammars; lookahead strings; LR(k) tables; programming
languages; RTs; syntactic analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Edelsbrunner:1981:IOO,
author = "H. Edelsbrunner and H. A. Maurer",
title = "On the intersection of orthogonal objects",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "177--181",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (68G10)",
MRnumber = "83c:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C6120 (File organisation)",
corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of
Graz, Graz, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "data structures; geometrical objects; intersection;
interval tree; multidimensional algorithms; orthogonal
objects; query; range searching; range tree; rectangle
intersection; segment tree; time segment
intersections",
treatment = "P Practical",
}
@Article{Nakamura:1981:AIP,
author = "Akira Nakamura and Kunio Aizawa",
title = "Acceptors for isometric parallel context-free array
languages",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "182--186",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83e:68114",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "array acceptor; context-free languages; isometric
parallel context-free array languages; sequential
writing traversal array acceptor",
treatment = "T Theoretical or Mathematical",
}
@Article{Williams:1981:STE,
author = "M. H. Williams",
title = "A systematic test for extended operator precedence",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "187--190",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F25",
MRnumber = "83b:68092",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "compilers; extended operator precedence; grammar;
grammars; parsing; program compilers; syntax analysis;
systematic test",
treatment = "P Practical",
}
@Article{Yasuura:1981:WDC,
author = "Hiroto Yasuura",
title = "Width and Depth of Combinational Logic Circuits",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "191--194",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "721; C4240 (Programming and algorithm theory); C5210
(Logic design methods)",
corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata; Boolean function; Boolean functions;
combinational logic circuits; complexity measure;
complexity theory; computational complexity; depth
circuit; logic circuits, combinatorial; logic design;
parallelism",
treatment = "T Theoretical or Mathematical",
}
@Article{Freivalds:1981:PLR,
author = "R\=usi{\lfhook{n}}{\v{s}} Freivalds",
title = "Projections of languages recognizable by probabilistic
and alternating finite multitape automata",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "195--198",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F10",
MRnumber = "83b:68086",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Arora:1981:GPD,
author = "R. K. Arora and N. K. Sharma",
title = "Guarded Procedure: a Distributed Programming Concept",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "199--203",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; distributed processing;
distributed programming; processes; software
components",
treatment = "P Practical",
}
@Article{Guida:1981:MKR,
author = "G. Guida and M. Somalvico",
title = "Multi-problem-solving: knowledge representation and
system architecture",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "204--214",
day = "??",
month = "????",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C1230 (Artificial intelligence)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "artificial intelligence; knowledge representation;
learning; multi-problem-solving; searching; system
architecture",
treatment = "T Theoretical or Mathematical",
}
@Article{Troya:1981:AAR,
author = "J. M. Troya and A. Vaquero",
title = "An approximation algorithm for reducing expected head
movement in linear storage devices",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "218--220",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; C5320C (Storage on moving magnetic media)",
corpsource = "Dept. of Informatica y Automatica, Univ. Complutense,
Madrid, Spain",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "approximation algorithm; computer programming; data
storage, magnetic --- Storage Devices; expected head
movement; linear storage devices; magnetic disc and
drum storage; magnetic disc storage; magnetic tape
storage; Markov chain; records; time complexity;
weighted graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Schmitt:1982:CPF,
author = "Alfred Schmitt",
title = "On the computational power of the floor function",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "1--3",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C01 (68E05)",
MRnumber = "83c:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Fakultat f{\"u}r Informatik, Univ. Karlsruhe,
Karlsruhe, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational power; file organisation; floor
function; hashing techniques; relational operations;
running time",
treatment = "P Practical",
}
@Article{Chor:1982:AFF,
author = "Ben-Zion Chor",
title = "Arithmetic of finite fields",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "4--6",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "12C05 (12-04 68C25)",
MRnumber = "83h:12028",
MRreviewer = "Thomas Beth",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Math., Hebrew Univ. of Jerusalem, Jerusalem,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "arithmetic; factorization; finite fields; integers;
irreducible polynomial; polynomials",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Nath:1982:PAC,
author = "Dhruva Nath and S. N. Maheshwari",
title = "Parallel Algorithms for the Connected Components and
Minimal Spanning Tree Problems",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "7--11",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C05)",
MRnumber = "83c:68080",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C4210 (Formal logic); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Electrical Engng., Indian Inst. of Technol.,
New Delhi, India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; computer programming;
connected components; integers; interconnected
processors; mathematical techniques --- Graph Theory;
minimal spanning tree problems; parallel algorithms;
parallel processing; read; standard arithmetic
operations; time bound algorithms; trees (mathematics);
write",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Brouwer:1982:NMK,
author = "Andries E. Brouwer and Peter {van Emde Boas}",
title = "A note on: {``Master keys for group sharing'' [Inform.
Process. Lett. {\bf 12} (1981), no. 1, 23--25; MR
82d:94046] by D. E. Denning and F. B. Schneider}",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "12--14",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B99",
MRnumber = "83h:94019",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Denning:1981:MKG}.",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Pure Math., Math. Centre, Amsterdam,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cryptography; group keys; group sharing; master keys",
treatment = "P Practical",
}
@Article{Backhouse:1982:WNS,
author = "Ronald Backhouse",
title = "Writing a number as the sum of two squares: a new
solution",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "15--17",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "10-04 (10J05 68B10)",
MRnumber = "83d:10003",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "number; programming theory; squares; sum",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gelenbe:1982:SP,
author = "E. Gelenbe and D. Gardy",
title = "On the size of projections",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "18--21",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "LRI Univ. de Paris-Sud, Orsay, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "census data; data collection; database management
systems; DBMS; matrix; physics experiments;
projections; vectors",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gunn:1982:CTT,
author = "Hamish I. E. Gunn",
title = "Compile Time Type Checking of Structure Field
Accessing",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "22--25",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6110 (Systems analysis and programming);
C6140D (High level languages)",
corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, St.
Andrews, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algol-like language; compile time; computer
programming; h; high level languages; programming;
structure classes; structure field accessing; type
checking",
treatment = "P Practical",
}
@Article{Tarjan:1982:HCA,
author = "R. Endre Tarjan",
title = "A hierarchical clustering algorithm using strong
components",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "26--29",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); B6140C
(Optical information, image and video signal
processing); C1160 (Combinatorial mathematics); C1250
(Pattern recognition)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; edges; graph; graph theory;
hierarchical clustering algorithm; mathematical
techniques --- Graph Theory; pattern recognition;
rooted tree; strong components; vertex partitions",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Tarjan:1982:SAM,
author = "Robert Endre Tarjan",
title = "Sensitivity analysis of minimum spanning trees and
shortest path trees",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "30--33",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C05)",
MRnumber = "83c:68083",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See corrigendum \cite{Tarjan:1986:SAM}.",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C1310 (Control system
analysis and synthesis methods)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "edges; graph theory; minimality; minimum spanning
trees; network optimization; robustness; sensitivity
analysis; shortest path trees; subgraph; trees
(mathematics); undirected graph; vertices",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{vanLeeuwen:1982:ERR,
author = "Jan {van Leeuwen} and Maurice Nivat",
title = "Efficient recognition of rational relations",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "34--38",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10",
MRnumber = "83c:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "automata theory; complexity; deterministic computing
device; efficient recognition; inputs; nondeterministic
finite-state acceptor; rational relations; tuples",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ko:1982:SOP,
author = "Ker-I Ko",
title = "Some observations on the probabilistic algorithms and
{NP}-hard problems",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "39--43",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "83c:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0240Z (Other topics in statistics); B0260
(Optimisation techniques); C1140Z (Other topics in
statistics); C1180 (Optimisation techniques); C4130
(Interpolation and function approximation); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "circuit complexity; complexity classes; computational
complexity; nondeterministic computations; NP-complete
problem; NP-hard problems; optimisation; polynomial
time hierarchy; polynomials; probabilistic algorithms;
probability; Rabin-type algorithms",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Zaks:1982:GRA,
author = "Shmuel Zaks",
title = "Generation and ranking of {$K$}-ary trees",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "44--48",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C05)",
MRnumber = "83c:68088",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "generation; internal nodes; K-ary trees; lexicographic
order; ranking; trees; trees (mathematics); unranking",
treatment = "T Theoretical or Mathematical",
}
@Article{FarinasDelCerro:1982:SDM,
author = "L. {Fari{\~n}as Del Cerro}",
title = "A simple deduction method for modal logic",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "49--51",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03B35 (03B45)",
MRnumber = "83k:03019",
MRreviewer = "Steve Kuhn",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Univ. Toulouse Le Mirail, Toulouse, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "deduction method; formal logic; knowledge
representation; modal logic; programming theory;
theorem proving",
treatment = "P Practical",
}
@Article{Slisenko:1982:CFG,
author = "A. O. Slisenko",
title = "Context-free grammars as a tool for describing
polynomial-time subclasses of hard problems",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "52--56",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D15 68F05)",
MRnumber = "83h:68064",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "LOMI, Leningrad, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; context-free grammars;
context-free graph grammar; graph theory; graphs;
Hamiltonian circuit; hard problems; polynomial-time",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Graham:1982:SER,
author = "M. H. Graham and A. O. Mendelzon",
title = "Strong equivalence of relational expressions under
dependencies",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "57--62",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "database management systems; dependencies; query
equivalence; relational database; relational
expressions",
treatment = "P Practical",
}
@Article{Lagarias:1982:MSR,
author = "J. C. Lagarias and D. E. Swartwout",
title = "Minimal storage representations for binary relations",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "63--66",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "83h:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary relations; data encoding; data structures;
discrete mathematics; graph theory; graph-theoretic
terms; guest graphs; host graphs; logical data
structure; pointers; programming theory; sequential
movements; storage representations",
treatment = "T Theoretical or Mathematical",
}
@Article{Gini:1982:ASI,
author = "Guiseppina Gini",
title = "The automatic synthesis of iterative programs",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "67--73",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1230 (Artificial intelligence); C6110 (Systems
analysis and programming)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "artificial intelligence; automatic programming;
automatic synthesis; compiler; computer programming;
computer programs; FORTRAN; high-level descriptions;
iterative programs; PROSIT; synthesizer; target
programming language; transformation rules",
treatment = "P Practical",
}
@Article{Edelsbrunner:1982:PIS,
author = "H. Edelsbrunner and H. A. Maurer and D. G.
Kirkpatrick",
title = "Polygonal intersection searching",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "74--79",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (51-04)",
MRnumber = "83h:68093",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS)); C7250L
(Non-bibliographic retrieval systems)",
corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of
Graz, Graz, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "concrete complexity; database management systems;
DBMS; edges; geometric searching; geometric transforms;
information retrieval; multidimensional searching;
polygon intersection; polygon intersection searching;
query polygon; simple plane polygons; triangular range
search",
treatment = "P Practical",
}
@Article{Bergstra:1982:STL,
author = "J. A. Bergstra and J.-J. Ch. Meyer",
title = "A simple transfer lemma for algebraic specifications",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "80--85",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic specifications; algebraic structures; data
structures; data types; domains; initial algebra
semantics; signatures; specifications; transfer lemma",
treatment = "P Practical",
}
@Article{Upfal:1982:FCP,
author = "Eliezer Upfal",
title = "Formal correctness proofs of a nondeterministic
program",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "86--92",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10",
MRnumber = "83g:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "nondeterministic program; programming theory; total
correctness",
treatment = "T Theoretical or Mathematical",
}
@Article{Kucera:1982:PCC,
author = "Lud{\v{e}}k Ku{\v{c}}era",
title = "Parallel computation and conflicts in memory access",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "2",
pages = "93--96",
day = "20",
month = apr,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20 (05C50 68C25)",
MRnumber = "83g:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum and addendum
\cite{Kucera:1983:EAP}.",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Charles Univ., Prague, Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "conflicts; graph algorithms; intensive interprocessor
communication; memory access; operating systems
(computers); OS; parallel computation; parallel
processing",
treatment = "P Practical",
}
@Article{Yokomori:1982:TRN,
author = "Takashi Yokomori and Derick Wood and Klaus-J{\"o}rn
Lange",
title = "A three-restricted normal form theorem for {ETOL}
languages",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "97--100",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83g:68115",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum \cite{Yokomori:1985:ETR}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Unit for Computer Sci., McMaster Univ., Hamilton,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "1-restricted ETOL systems; ETOL languages; formal
languages; recursively enumerable sets;
three-restricted normal form",
treatment = "P Practical",
}
@Article{Tarhio:1982:LPS,
author = "Jorma Tarhio",
title = "{LR} Parsing of Some Ambiguous Grammars",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "101--103",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F25",
MRnumber = "83h:68140",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "ambiguous grammars; computer programming languages;
context information; context-sensitive grammars; input
buffer; LR parsing",
treatment = "P Practical",
}
@Article{Watjen:1982:AVE,
author = "Dietmar W{\"a}tjen and Werner Struckmann",
title = "An algorithm for verifying equations of morphisms in a
category",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "104--108",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (18A23)",
MRnumber = "83g:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl f{\"u}r Informatik, Tech. Univ.
Braunschweig, Braunschweig, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; category theory; morphisms; natural
transformations; verification",
treatment = "T Theoretical or Mathematical",
}
@Article{King:1982:OAS,
author = "K. N. King and Barbara Smith-Thomas",
title = "An optimal algorithm for sink-finding",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "109--111",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68E10)",
MRnumber = "83h:68058",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4140 (Linear
algebra)",
corpsource = "School of Information and Computer Sci., Georgia Inst.
of Technol., Atlanta, GA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "adjacency matrix; directed graph; graph theory;
incoming edge; matrix algebra; optimal algorithm;
outgoing edges; sink-finding",
treatment = "T Theoretical or Mathematical",
}
@Article{Lassez:1982:FPT,
author = "J.-L. Lassez and V. L. Nguyen and E. A. Sonenberg",
title = "Fixed point theorems and semantics: a folk tale",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "112--116",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10 (03D20)",
MRnumber = "83f:68008",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept., of Computer Sci., Univ. of Melbourne,
Parkville, Melbourne, Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; fixed point theory; recursion;
semantics",
treatment = "T Theoretical or Mathematical",
}
@Article{Barlow:1982:PMD,
author = "R. H. Barlow and D. J. Evans and J. Shanehchi",
title = "Parallel multisection for the determination of the
eigenvalues of symmetric quindiagonal matrices",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "117--118",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4140 (Linear algebra)",
corpsource = "Dept. of Computer Studies, Loughborough Univ. of
Technol., Loughborough, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bisection point; eigenvalues; eigenvalues and
eigenfunctions; intervals; known non-empty intervals;
matrix algebra; parallel multisection; sequential
solutions; symmetric quindiagonal matrices; symmetric
tridiagonal systems",
treatment = "P Practical",
}
@Article{Rohrich:1982:HQW,
author = "Johannes R{\"o}hrich",
title = "A hybrid of {Quicksort} with {$O(n \log n)$} worst
case complexity",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "119--123",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83g:68093",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informatik II, Univ. Karlsruhe,
Karlsruhe, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "average time; computational complexity; computer
programming; Quicksort; worst case complexity",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Edelsbrunner:1982:ESR,
author = "Herbert Edelsbrunner and Mark H. Overmars",
title = "On the equivalence of some rectangle problems",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "124--127",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (52-04 68K05)",
MRnumber = "83f:68063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of
Graz, Graz, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; counting variant; dominance
searching; equivalence; rectangle problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Elgot:1982:SSA,
author = "Calvin C. Elgot and Alan J. Perlis and Lawrence
Snyder",
title = "A syntax-free semantics for the {APL} operators",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "128--131",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Math. Sci. Dept., IBM TJ 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 = "APL operators; computer programming languages; index;
membership; programming theory; reduction; scalar
product; scan; structural transformations; syntax-free
semantics",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ridjanovic:1982:DDD,
author = "Dzenan Ridjanovic and Michael L. Brodie",
title = "Defining Database Dynamics with Attribute Grammars",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "132--138",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "attribute grammars; data base systems; database
dynamics; database integrity constraints; grammars;
programming language; semantics; syntax",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Korsh:1982:GNO,
author = "J. F. Korsh",
title = "Growing nearly optimal binary search trees",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "139--143",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Temple Univ., Philadelphia,
PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary search trees; nearly optimal trees; probability
distributions; trees (mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bini:1982:RPN,
author = "Dario Bini",
title = "Reply to the paper: {``The numerical instability of
Bini's algorithm'' [Inform. Process. Lett. {\bf 12}
(1981), no. 1, 17--19; MR 82i:65029] by N. K. Tsao}",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "3",
pages = "144--145",
day = "16",
month = may,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65F30 (68C05)",
MRnumber = "83h:65054",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Tsao:1981:NIB}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Jakobsson:1982:EHB,
author = "M. Jakobsson",
title = "Evaluation of a hierarchical bit-vector compression
technique",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "147--149",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Univ. of Vaasa, Vaasa, Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "file organisation; hierarchical bit-vector compression
technique; indexes; inverted files",
treatment = "P Practical",
}
@Article{Orenstein:1982:MTU,
author = "Jack A. Orenstein",
title = "Multidimensional Tries Used for Associative
Searching",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "150--157",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C7250L
(Non-bibliographic retrieval systems)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "associative searching; data processing; data
structure; data structures; information retrieval; kd
tree; kd trie; updating",
treatment = "P Practical",
}
@Article{Umeo:1982:DOW,
author = "Hiroshi Umeo and Kenichi Morita and Kazuhiro Sugata",
title = "Deterministic One-Way Simulation of Two-Way Real-Time
Cellular Automata and its Related Problems",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "158--161",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D20 (03D05 03D15)",
MRnumber = "83h:68077",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Junior Coll. Div., Osaka Electro-Communication Univ.,
Neyagawa-shi, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; circular cellular automata;
computational complexity; deterministic one-way
cellular automation; finite automata; parallel
processing; two-way real-time cellular automata",
treatment = "P Practical",
}
@Article{Beretta:1982:MCE,
author = "G. Beretta",
title = "{Monte Carlo} estimation of numerical stability in
fast algorithms for systems of bilinear forms",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "162--167",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "ETH, Zurich, Switzerland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "bilinear forms; complex numbers; convergence of
numerical methods; fast algorithms; matrices; Monte
Carlo estimation; Monte Carlo methods; numerical
stability; quaternions; roundoff error; Strassen
algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Franchi-Zannettacci:1982:ETS,
author = "Paul Franchi-Zannettacci",
title = "An extension to trees of the {Sardinas} and
{Patterson} algorithm",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "168--173",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B45 (68E10)",
MRnumber = "84a:94019",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B6120B (Codes)",
corpsource = "UER de Math. et Informatique, Univ. de Bordeaux I,
Talence, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "codes, symbolic; computer programming; encoding;
homomorphism; Sardinas and Patterson algorithm; trees;
trees (mathematics); variable length codes theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Demolombe:1982:GDR,
author = "R. Demolombe",
title = "Generalized division for relational algebraic
language",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "174--178",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05",
MRnumber = "83h:68154",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "ONERA-CERT, Toulouse, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic operators; database management systems;
DBMS; generalized division operator; relational
algebraic language; tuples",
treatment = "P Practical",
}
@Article{Doberkat:1982:AEH,
author = "Ernst-E. E. Doberkat",
title = "Asymptotic estimates for the higher moments of the
expected behavior of straight insertion sort",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "179--182",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83g:68091",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Math. and Computer Sci., Clarkson Coll. of
Technol., Potsdam, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Bernoulli numbers; expected behavior; higher moments;
programming theory; sorting; straight insertion sort",
treatment = "T Theoretical or Mathematical",
}
@Article{Fischer:1982:LBT,
author = "Michael J. Fischer and Nancy A. Lynch",
title = "A lower bound for the time to assure interactive
consistency",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "183--186",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "83g:68037",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C5600 (Data
communication equipment and techniques)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "communication; computation theory; computer
metatheory; distributed processing; faulty processors;
interactive consistency",
treatment = "T Theoretical or Mathematical",
}
@Article{Jou:1982:CRR,
author = "Jiann H. Jou and Patrick C. Fischer",
title = "The complexity of recognizing {$3{\rm NF}$} relation
schemes",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "187--190",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68H05)",
MRnumber = "83h:68057",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6160D
(Relational databases)",
corpsource = "Univ. of Texas, Dallas, TX, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "3NF relation schemes; Boyce-Codd normal form;
complexity; database management systems; DBMS; decision
problem; NP-complete; polynomial time; programming
theory; relational database scheme; third normal form",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Minker:1982:ELR,
author = "Jack Minker and Guy Zanon",
title = "An extension to linear resolution with selection
function",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "191--194",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68G15 (03B35)",
MRnumber = "83i:68141",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "interference system; linear resolution;
LUST-resolution; programming theory; selection
function; theorem proving",
treatment = "T Theoretical or Mathematical",
}
@Article{Aspvall:1982:ELT,
author = "Bengt Aspvall and Michael F. Plass and Robert Endre
Tarjan",
title = "Erratum: {``A linear-time algorithm for testing the
truth of certain quantified {Boolean} formulas''
[Inform. Process. Lett. {\bf 8} (1979), no. 3,
121--123; MR 80b:68050]}",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "4",
pages = "195--195",
day = "13",
month = jun,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "83g:68058",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Aspvall:1979:LTA}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{DeFelice:1982:TC,
author = "Clelia {De Felice}",
title = "On the triangle conjecture",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "197--200",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B45 (20M35 68E99)",
MRnumber = "84b:94025",
MRreviewer = "Jean-Eric Pin",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B6110 (Information theory); C1260 (Information
theory)",
corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "codes; free monoids; information theory; triangle
conjecture",
treatment = "T Theoretical or Mathematical",
}
@Article{Burton:1982:LST,
author = "F. Warren Burton",
title = "A linear space translation of functional programs to
{Turner} combinators",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "201--204",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03B40 (68B10)",
MRnumber = "84b:03027",
MRreviewer = "M. Coppo",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "School of Computing Studies and Accountancy, Univ. of
East Anglia, Norwich, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "distributed evaluation; functional programs; lambda
calculus; linear space translation; programming theory;
Turner combinators",
treatment = "T Theoretical or Mathematical",
}
@Article{Burton:1982:EFI,
author = "F. Warren Burton",
title = "An efficient functional implementation of {FIFO}
queues",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "205--206",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "922; C1140C (Queueing theory); C4240 (Programming
and algorithm theory)",
corpsource = "School of Computing Studies and Accountancy, Univ. of
East Anglia, Norwich, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "argument; data structures; efficient functional
implementation; FIFO queues; probability; programming
theory; queueing theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Nijholt:1982:NSS,
author = "Anton Nijholt",
title = "A note on the sufficiency of {Soko{\l}owski}'s
criterion for context-free languages",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "207--207",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83k:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Informatics, Nijmegen Univ., Nijmegen,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context-free languages; context-free-ness; pumping
lemmas; Sokolowski's criterion; sufficiency",
treatment = "P Practical",
}
@Article{Reddy:1982:MCC,
author = "P. G. Reddy and Subhash Bhalla and B. E. Prasad",
title = "A model of concurrency control in distributed database
systems",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "208--213",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160B (Distributed databases)",
corpsource = "Computer Centre, Indian Inst. of Technol., Delhi, New
Delhi, India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "concurrency control; data base systems; database
management systems; distributed database systems;
distributed processing; pure birth process; seizing
locks; update algorithm",
treatment = "P Practical",
}
@Article{Shanthikumar:1982:RAG,
author = "J. G. Shanthikumar",
title = "A recursive algorithm to generate joint probability
distribution of arrivals from exponential sources
during a random time interval",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "214--217",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65U05 (60K25)",
MRnumber = "84a:65111",
MRreviewer = "Lennart R\.ade",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; 922; C1140C (Queueing theory); C7310
(Mathematics computing)",
corpsource = "Dept. of Industrial Engng. and Operations Res.,
Syracuse Univ., Syracuse, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "arrivals; computational analysis; computer systems,
digital; customer arrivals; exponential sources; joint
probability distribution; probability --- Queueing;
probability distribution; queueing systems; queueing
theory; random time interval; recursive algorithm;
reliability",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hart:1982:PIM,
author = "Johnson M. Hart",
title = "Permutation Inversions and Multidimensional Cumulative
Distribution Functions",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "218--222",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05",
MRnumber = "83m:68059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Modicon Div., Gould Inc., Andover, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; empirical cumulative
distribution function; multidimensional cumulative
distribution functions; parallel processing; parallel
processors; permutation inversions; programming theory;
recursive multidimensional divide-and-conquer;
sorting",
treatment = "T Theoretical or Mathematical",
}
@Article{Carlson:1982:ETS,
author = "David A. Carlson and John E. Savage",
title = "Extreme time-space tradeoffs for graphs with small
space requirements",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "223--227",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (05C20 05C70 68E10)",
MRnumber = "83m:68072",
MRreviewer = "T. R. S. Walsh",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C1160 (Combinatorial
mathematics); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Computer Sci., Brown Univ., Providence, RI,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; directed acyclic graph; game
theory; graph theory; graphs; pebble game; small space
requirements",
treatment = "T Theoretical or Mathematical",
}
@Article{Bar-Yehuda:1982:CFP,
author = "Reuven Bar-Yehuda and Uzi Vishkin",
title = "Complexity of finding $k$-path-free dominating sets in
graphs",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "228--232",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (05C20 68E10)",
MRnumber = "84m:68032",
MRreviewer = "P. Ramanan",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Israel Inst. of Technol., Haifa,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; dominating vertex set;
enumeration; graph theory; graphs; k-path-free
dominating sets; NP-complete",
treatment = "T Theoretical or Mathematical",
}
@Article{Savage:1982:DFS,
author = "Carla Savage",
title = "Depth-First Search and the Vertex Cover Problem",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "233--235",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C35)",
MRnumber = "83m:68126",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., North Carolina State Univ.,
Raleigh, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "approximation algorithms; combinatorial algorithms;
computational complexity; computer programming; depth
first search; graph theory; minimum cover; nonleaf
vertices; NP-complete; undirected graph; vertex cover
problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Zemanek:1982:OVM,
author = "Heinz Zemanek",
title = "Obituary: {Victor Mikha{\u{\i}}lovich Glushkov}
(1923--1982)",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "236--237",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "01A70",
MRnumber = "84h:01093",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
subject = "A.0 General Literature, GENERAL,
Biographies/Autobiographies \\ K.2 Computing Milieux,
HISTORY OF COMPUTING, People",
}
@Article{Krichevsky:1982:LEF,
author = "R. E. Krichevsky",
title = "Letter to the editor: {``A family of codes
commutatively equivalent to prefix codes'' [Inform.
Process. Lett. {\bf 12} (1981), no. 1, 1--4; MR
82j:94021] by S. Mauceri and A. Restivo}",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "5",
pages = "238--238",
day = "23",
month = jul,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B45",
MRnumber = "83m:94021",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Mauceri:1981:FCC}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Luccio:1982:LAD,
author = "F. Luccio and L. Pagli",
title = "A linear algorithm to determine minimal spanning
forests in chain graphs",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "1--4",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C70)",
MRnumber = "83m:68122",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. of Pisa,
Pisa, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "chain graphs; edges; graph theory; linear algorithm;
minimal spanning forests; stars; subgraph",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1982:NTW,
author = "Wojciech Rytter",
title = "A note on two-way nondeterministic pushdown automata",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "5--9",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05 (03D05)",
MRnumber = "83m:68098",
MRreviewer = "Akira Nakamura",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "finite automata; input heads; matrices; random access
machine; time complexity; two-way nondeterministic
pushdown automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Bermond:1982:TLG,
author = "J.-C. Bermond and C. Delorme and J.-J. Quisquater",
title = "Tables of large graphs with given degree and
diameter",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "10--13",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C30 (68E10 94C15)",
MRnumber = "84a:05038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5620 (Computer
networks and techniques)",
corpsource = "Univ. de Paris-Sud, Orsay, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computer networks; edge set; graph theory;
interconnection networks; large graphs; network
architecture; undirected graph; vertex set",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Stockmeyer:1982:NCS,
author = "Larry J. Stockmeyer and Vijay V. Vazirani",
title = "{NP}-completeness of some generalizations of the
maximum matching problem",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "14--19",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D15 05C35)",
MRnumber = "84b:68049",
MRreviewer = "Bernard M. E. Moret",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "communication network testing; computational
complexity; decision problem; graph theory; maximum
matching problem; NP-completeness",
treatment = "T Theoretical or Mathematical",
}
@Article{Bron:1982:MMU,
author = "C. Bron and E. J. Dijkstra and S. D. Swierstra",
title = "A memory management unit for the optimal exploitation
of a small address space",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "20--22",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6150J (Operating
systems)",
corpsource = "Dept. of Appl. Maths., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "address mapping; memory management unit; optimal
exploitation; OS; segmentation; shared address space;
small address space; storage management; storage
management and garbage collection; virtual memory",
treatment = "P Practical",
}
@Article{Leung:1982:ODR,
author = "C. H. C. Leung",
title = "Optimal database reorganisation: some practical
difficulties",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "23--27",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "database management systems; database reorganisation;
DBMS; file structure; performance measurement;
simulation",
treatment = "P Practical",
}
@Article{Syslo:1982:LAR,
author = "Maciej M. Sys{\l}o",
title = "A labeling algorithm to recognize a line digraph and
output its root graph",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "28--30",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C20 68C25)",
MRnumber = "83k:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Computer Sci. Dept., Washington State Univ., Pullman,
WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "graph theory; labeling algorithm; line digraph; root
graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Greenberg:1982:EPA,
author = "Albert C. Greenberg and Richard E. Ladner and Michael
S. Paterson and Zvi Galil",
title = "Efficient Parallel Algorithms for Linear Recurrence
Computation",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "31--35",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (03D15)",
MRnumber = "84i:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "arithmetic circuit; field; linear recurrence
computation; matrix multiplication; numerical analysis;
parallel algorithms; parallel processing; semiring",
treatment = "T Theoretical or Mathematical",
}
@Article{Winkler:1982:CMD,
author = "Peter M. Winkler",
title = "On computability of the mean deviation",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "36--38",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C30",
MRnumber = "84a:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Maths., Emory Univ., Atlanta, GA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computability; computability and decidability;
computational complexity; mean deviation; statistical
analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1982:NST,
author = "Karel {Culik, II} and Derick Wood",
title = "A note on some tree similarity measures",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "39--42",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C05)",
MRnumber = "83k:68059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "dendrograms; distance measure; parsers; search trees;
string-to-string correction problem; syntax-error
repairing; tree similarity measures; trees
(mathematics); unlabelled trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Levy:1982:ILS,
author = "Leon S. Levy",
title = "An improved list-searching algorithm",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "1",
pages = "43--45",
day = "19",
month = aug,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (68C05)",
MRnumber = "83k:68055",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Bell Labs., Whippany, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "detecting cycles; linear list; list processing;
list-searching algorithm",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Manacher:1982:SFA,
author = "G. K. Manacher",
title = "Steady-paced-output and fractional-on-line algorithms
on a {RAM}",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "47--52",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Statistics and Computer Sci., Univ. of
Illinois, Chicago, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; fractional-on-line algorithms;
real-time algorithm; steady-paced",
treatment = "T Theoretical or Mathematical",
}
@Article{Eastman:1982:PSN,
author = "C. M. Eastman and M. Zemankova",
title = "Partially Specified Nearest Neighbor Searches Using
$k$-$d$ Trees",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "53--56",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (05C05 68H05)",
MRnumber = "83k:68053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6160
(Database management systems (DBMS))",
corpsource = "Dept. of Maths. and Computer Sci., Florida State
Univ., Tallahassee, FL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "$k$-$d$ trees; computational complexity; computer
programming; database management systems; nearest
neighbor query; nearest neighbor searches; partially
specified; searching; time complexity; trees
(mathematics)",
notes = "nicht weiter spannend and Unterscheidung: best match -
nearest neighbour and nicht f{\"u}r Text-Retrieval",
treatment = "T Theoretical or Mathematical",
}
@Article{Jouannaud:1982:MO,
author = "Jean Pierre Jouannaud and Pierre Lescanne",
title = "On Multiset Orderings",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "57--63",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10 (06A10)",
MRnumber = "83m:68019",
MRreviewer = "Henner Kr{\"o}ger",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Centre de Recherche en Informatique de Nancy, Nancy,
France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; Dershowitz-Manna ordering;
monotonicity; multiset orderings; programming theory;
set theory; well-founded orderings",
treatment = "T Theoretical or Mathematical",
}
@Article{Walsh:1982:THR,
author = "T. R. Walsh",
title = "The {Towers of Hanoi} revisited: moving the rings by
counting the moves",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "64--67",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05",
MRnumber = "83j:68039",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "artificial intelligence; iterative methods; n-ring
Towers of Hanoi; non-recursive algorithm; Towers of
Hanoi",
treatment = "P Practical",
}
@Article{Main:1982:PCF,
author = "Michael G. Main",
title = "Permutations are not context-free: an application of
the {Interchange Lemma}",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "68--71",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83m:68139",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Washington State Univ.,
Pullman, WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context-free languages; Interchange Lemma; nonempty
string; permutation; permutation-containing strings",
treatment = "T Theoretical or Mathematical",
}
@Article{Goldberg:1982:ATA,
author = "Allen Goldberg and Paul Purdom and Cynthia Brown",
title = "Average Time Analyses of Simplified {Davis--Putnam}
Procedures",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "72--75",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03B05 03B35 03D15)",
MRnumber = "84d:68038a",
MRreviewer = "Gh. Grigora{\cedla{s}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also corrigendum \cite{Goldberg:1983:CAT}.",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory --- Programming Theory; computer
programming; Davis--Putnam procedures; polynomial
average behavior; programming theory; pure literal
rule; satisfiability problem; time analyses",
treatment = "T Theoretical or Mathematical",
}
@Article{Lukaszewicz:1982:UG,
author = "Leon {\L}ukaszewicz",
title = "Universal {Grammars}",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "76--80",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83k:68074",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C6140 (Programming
languages)",
corpsource = "Inst. of Computer Sci., Polish Acad. of Sci.,
Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Attribute Grammars; automata theory; formal
specification of syntaxes; grammars; practical
applications; Production Systems; programming
languages; semantics of programming languages;
Transformational Grammars; UGs; Universal Grammars; Van
Wijngaarden Grammars; Vienna Definition Language",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Wegener:1982:BPA,
author = "Ingo Wegener",
title = "Best possible asymptotic bounds on the depth of
monotone functions in multivalued logic",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "81--83",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03B50 (03D15 68C20)",
MRnumber = "84c:03049",
MRreviewer = "V. B. Alekseev",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt/Main, West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "asymptotic bounds; m-valued logic; many-valued logics;
monotone functions; multivalued logic",
treatment = "T Theoretical or Mathematical",
}
@Article{Balcazar:1982:NTL,
author = "J. L. Balcazar and J. Diaz",
title = "A note on a theorem by {Ladner}",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "84--86",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D05 03D15)",
MRnumber = "84d:68035",
MRreviewer = "Gh. Grigora{\cedla{s}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Facultat d'Informatica, Univ. Politecnica de
Barcelona, Barcelona, Spain",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "formal languages; Ladner; languages; non-comparable
languages; NP; NP-complete; P",
treatment = "T Theoretical or Mathematical",
}
@Article{Schoor:1982:FAS,
author = "Amir Schoor",
title = "Fast Algorithm for Sparse Matrix Multiplication",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "2",
pages = "87--89",
day = "6",
month = sep,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65F30",
MRnumber = "83k:65031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B0290H (Linear algebra); C4140 (Linear
algebra); C4240 (Programming and algorithm theory)",
corpsource = "School of Maths., Tel Aviv Univ., Tel Aviv, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; computer programming; fast
algorithm; matrix algebra; sparse matrices; sparse
matrix multiplication; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Spyratos:1982:HTD,
author = "Michael Spyratos",
title = "A homomorphism theorem for data base mappings",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "91--96",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "83m:68046",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Systems Engng. and Computing Sci., Carleton
Univ., Ottawa, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "data base mappings; data base updates; database
management systems; DBMS; equivalence classes;
homomorphism theorem; integrity constraints; lossless
decompositions; view definition",
treatment = "P Practical",
}
@Article{Nijholt:1982:RBG,
author = "Anton Nijholt",
title = "On the relationship between the {${\rm LL}(k)$} and
{${\rm LR}(k)$} grammars",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "97--101",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83k:68076",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Informatics, Faculty of Sci., Nijmegen Univ.,
Nigmegen, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "formal languages; grammars; LL(k) grammars; LR(k)
grammars; parsing",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1982:TCU,
author = "Wojciech Rytter",
title = "Time complexity of unambiguous path systems",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "102--104",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (68D05 68F05)",
MRnumber = "83m:68062",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "2dpda's; complexity; context-free languages; finite
automata; pushdown automata; schema; unambiguous path
systems",
treatment = "P Practical",
}
@Article{Reddy:1982:RCC,
author = "P. G. Reddy and S. Bhalla and B. E. Prasad",
title = "Robust, centralized certifier based concurrency
control for distributed databases",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "105--110",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160B (Distributed databases)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "certifiers; concurrency control; database management
systems; DBMS; distributed databases; distributed
processing; read write conflict; restarts;
synchronization",
treatment = "P Practical",
}
@Article{Korczynski:1982:CCD,
author = "Waldemar Korczy{\'n}ski and J{\'o}zef Winkowski",
title = "A communication concept for distributed systems",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "111--114",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "83k:68016",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Zaklad Matematyki Wyzsza Szkola Pedagogiczna,
Czestochowa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "communication concept; distributed processing;
distributed systems; indivisibility; local memories;
operating systems (computers); OS; protocols",
treatment = "P Practical",
}
@Article{Cheung:1982:SME,
author = "To-Yat Cheung",
title = "A statistical model for estimating the number of
records in a relational database",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "115--118",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Computer Sci., Univ. of Ottawa, Ottawa, Ont.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "cardinality; database management systems; DBMS; join;
number of records; projection; query processing;
relational database; statistical model; storage costs",
treatment = "P Practical",
}
@Article{Gonzalez:1982:SNL,
author = "Teofilo F. Gonzalez and Donald B. Johnson",
title = "Sorting numbers in linear expected time and optimal
extra space",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "119--124",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83k:68054",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Math. Sci. Program, Univ. of Texas, Dallas, TX, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "linear expected time; optimal extra space; sorting;
sorts",
treatment = "P Practical",
}
@Article{Imai:1982:FCC,
author = "Hiroshi Imai",
title = "Finding connected components of an intersection graph
of squares in the {Euclidean} plane",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "125--128",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C10 68C25)",
MRnumber = "83k:68060",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math. Engng. and Instrumentation Phys.,
Faculty of Engng., Univ. of Tokyo, Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; connected components;
Euclidean plane; graph theory; intersection graph;
polygons; square problem; squares",
treatment = "T Theoretical or Mathematical",
}
@Article{Dijkstra:1982:ITA,
author = "Edsger W. Dijkstra and A. J. M. {van Gasteren}",
title = "An Introduction to Three Algorithms for Sorting in
Situ",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "129--134",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83k:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Burroughs Corp., Nuenen, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "heapsort; insertion sort; Insertion sort, heapsort,
smoothsort; smoothsort; sorting",
treatment = "P Practical",
}
@Article{Becker:1982:PAV,
author = "M. Becker and W. Degenhardt and J. Doenhardt and S.
Hertel and G. Kaninke and W. Keber and K. Mehlhorn and
S. N{\"a}her and H. Rohnert and T. Winter",
title = "A probabilistic algorithm for vertex connectivity of
graphs",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "3",
pages = "135--136",
day = "11",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C40)",
MRnumber = "83k:68056",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Angewandte Math. und Informatik, Univ. des Saarlandes,
Saarbrucken, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "error probability; graph theory; graphs; probabilistic
algorithm; undirected graph; vertex connectivity",
}
@Article{Morris:1982:ACG,
author = "F. L. Morris",
title = "Another compacting garbage collector",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "139--142",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "School of Computer and Information Sci., Syracuse
Univ., Syracuse, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "compacting garbage collector; linear-time solutions;
list processing; nodes; pointers; roots; segments;
storage management; threading",
treatment = "P Practical",
}
@Article{Bergstra:1982:TTA,
author = "J. A. Bergstra and J. V. Tucker",
title = "Two Theorems About the Completeness of {Hoare}'s
Logic",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "143--149",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10 (03B45)",
MRnumber = "84f:68008",
MRreviewer = "Stephen L. Bloom",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "completeness; completion theorem; computer metatheory
--- Programming Theory; computer programming; data type
specifications; Hoare's logic; normal form theorem;
partial correctness; Peano arithmetic; programming
theory; refinements; strongest post condition; while-
programs; while-programs",
treatment = "T Theoretical or Mathematical",
}
@Article{Maluszynski:1982:GU,
author = "Jan Ma{\l}uszy{\'n}ski and J{\"o}rgen Fischer
Nilsson",
title = "Grammatical Unification",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "150--158",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50 (03B35 18C10)",
MRnumber = "85a:68102",
MRreviewer = "Bernard M. E. Moret",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; 723; C4210 (Formal logic)",
corpsource = "Software Systems Res. Center, Linkoping Univ.,
Linkoping, Sweden",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory --- Context Free Grammars; computer
metatheory --- Programming Theory; computer
programming; context free grammars; context-free
grammars; Horn clause logic programming; logic
programming; Prolog systems; resolution logic; symbolic
structures; theorem proving; unification",
treatment = "T Theoretical or Mathematical",
}
@Article{Mostowski:1982:DSA,
author = "A. W{\l}odzimierz Mostowski",
title = "Determinancy of sinking automata on infinite trees and
inequalities between various {Rabin}'s pair indices",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "159--163",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05",
MRnumber = "83k:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Univ. of Gdansk, Gdynia, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "automata theory; deterministic automata; inequalities;
infinite trees; Rabin's pair indices; sinking automata;
trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Inoue:1982:NAL,
author = "Katsushi Inoue and Itsuo Takanami and Hiroshi
Taniguchi",
title = "A note on alternating on-line {Turing} machines",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "164--168",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C40",
MRnumber = "83k:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "alternating on-line Turing machines; automata theory;
complexity measure; computational complexity;
deterministic Turing machines; leaf-size; parallel
computation; parallel processing; Turing machines",
treatment = "T Theoretical or Mathematical",
}
@Article{Hoshi:1982:CEM,
author = "Mamoru Hoshi and Toshitsugu Yuba",
title = "A counter example to a monotonicity property of
$k$-$d$ trees",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "169--173",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83m:68111",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Faculty of Engng., Chiba Univ., Chiba, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "$k$-$d$ trees; computer programming --- Algorithms;
data processing; data structures; external nodes;
monotonicity property; one-dimensional binary search
tree; partition; trees (mathematics)",
treatment = "P Practical",
}
@Article{Ceri:1982:SMN,
author = "S. Ceri and G. Pelagatti",
title = "A solution method for the non-additive resource
allocation problem in distributed system design",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "174--178",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6160B (Distributed databases)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; database management
systems; DBMS; distributed database system; distributed
processing; distributed system design; files; graph;
graph theory; maximum flow-minimum cut; optimization
model; resource allocation; resource allocation
problem",
treatment = "P Practical",
}
@Article{Goh:1982:RPE,
author = "L. Goh and D. Rotem",
title = "Recognition of Perfect Elimination Bipartite Graphs",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "179--182",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C70)",
MRnumber = "84a:68057",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "bipartite graphs; computer programming ---
Subroutines; Gaussian elimination; graph theory;
mathematical techniques; perfect elimination; perfect
elimination bipartite graphs; recognition algorithm;
sparse matrices",
treatment = "T Theoretical or Mathematical",
}
@Article{Sharir:1982:FCS,
author = "Micha Sharir",
title = "Fast Composition of Sparse Maps",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "183--185",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05 (68B15)",
MRnumber = "83k:68021",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "School of Math. Sci., Tel Aviv Univ., Tel Aviv,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; analysis of algorithms; composition;
computer programming --- Subroutines; data processing;
data structures; sparse maps",
treatment = "T Theoretical or Mathematical",
}
@Article{Slater:1982:LAN,
author = "Peter J. Slater",
title = "A linear algorithm for the number of degree
constrained subforests of a tree",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "4",
pages = "186--188",
day = "31",
month = oct,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C05 05C30)",
MRnumber = "84a:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Math. Dept., Univ. of Alabama, Huntsville, AL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; b-matching; degree constrained
subforests; linear algorithm; linear-time algorithm;
positive integer-valued function; spanning subforests;
tree; trees (mathematics); vertex disjoint paths;
vertices",
treatment = "T Theoretical or Mathematical",
}
@Article{Leipala:1982:OMI,
author = "Timo Leip{\"a}l{\"a}",
title = "On Optimal Multilevel Indexed Sequential Files",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "191--195",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "83m:68112",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Inst. for Appl. Math., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "block; data processing; file organisation; index
searching; indices; jump searching; key value; optimal
design; static multilevel indexed sequential files;
target key",
treatment = "P Practical",
}
@Article{Highnam:1982:EPC,
author = "P. T. Highnam",
title = "The ears of a polygon",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "196--198",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "52-04 (68C05)",
MRnumber = "84b:52002",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory)",
corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computation theory; computational geometry; computer
metatheory; ears; fast algorithm; polygon;
triangulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Szepietowski:1982:FPA,
author = "Andrzej Szepietowski",
title = "A finite $5$-pebble-automaton can search every maze",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "199--204",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D20",
MRnumber = "84e:68055",
MRreviewer = "I. Mezn{\'\i}k",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Math., Tech. Univ. of Gdansk, Gdansk,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "finite 5-pebble-automaton; finite automata; finite
automaton; labyrinth; maze",
treatment = "T Theoretical or Mathematical",
}
@Article{Wegner:1982:SLL,
author = "Lutz M. Wegner",
title = "Sorting a linked list with equal keys",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "205--208",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "84b:68082",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Inst. f{\"u}r Angewandte Informatik und Formale
Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "abstract algorithm; algorithm analysis; algorithm
theory; equal keys; linked list; Quicksort; sorting;
TRISORT",
treatment = "P Practical",
}
@Article{Lueker:1982:DSD,
author = "George S. Lueker and Dan E. Willard",
title = "A data structure for dynamic range queries",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "209--213",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "84b:68015",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Information and Computer Sci., Univ. of
California, Irvine, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "balanced trees; data structure; data structures;
database management systems; DBMS; deletions; dynamic
range queries; file organisation; insertions;
retrievals; searching; updates",
treatment = "P Practical",
}
@Article{Motoki:1982:NUB,
author = "Tatsuya Motoki",
title = "A note on upper bounds for the selection problem",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "214--219",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05 (05A05 68C25)",
MRnumber = "84c:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Information Sci., Ibaraki Univ., Hitachi,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "comparisons; computational complexity; optimum
sorting; selection problem; sorting; upper bounds;
worst-case minimum",
treatment = "P Practical",
}
@Article{Lewis:1982:UCC,
author = "Harry R. Lewis and Richard Statman",
title = "Unifiability is complete for co-{NLogSpace}",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "220--222",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (68E10)",
MRnumber = "83m:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Aiken Computation Lab., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "co-NLogSpace; computational complexity; data
structures; unification algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Wang:1982:NHT,
author = "Patrick Shen-pei Wang",
title = "A new hierarchy of two-dimensional array languages",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "223--226",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "83m:68143",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Wang Labs., Lowell, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "array patterns; automata theory; Extended Regular
Array Languages; formal languages; grammars; Linear
Array Languages; two-dimensional array languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Tamminen:1982:EHO,
author = "Markku Tamminen",
title = "Extendible Hashing with Overflow",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "227--232",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "83m:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "A strategy of including an overflow capability into
extendable hashing (EXHASH) is defined. It is shown
that both an O(1) expected access cost and an O(N)
expected storage cost are achieved by using this
mechanism.",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Lab. of Information Processing 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 = "computer programming; data handling; expected access
cost; expected storage cost; hashing; overflow;
performance analysis; table lookup",
treatment = "P Practical",
}
@Article{Stout:1982:DSL,
author = "Quentin F. Stout",
title = "Drawing Straight Lines with a Pyramid Cellular
Automaton",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "233--237",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D20 (68G10)",
MRnumber = "84a:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Math. Sci., State Univ. of New York, Binghamton, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computer programming --- Algorithms;
digitized picture; efficient algorithm; exact line
problem; finite automata; image processing; picture
processing; pyramid cellular automaton; self organising
automata; straight line",
treatment = "T Theoretical or Mathematical",
}
@Article{Farley:1982:DMC,
author = "Arthur M. Farley and Andrzej Proskurowski",
title = "Directed Maximal-Cut Problems",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "238--241",
day = "10",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C20 05C35 68C25)",
MRnumber = "83m:68120",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Oregon, Eugene, OR, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "acyclic directed graphs; algorithm theory; computer
programming --- Algorithms; directed graphs; directed
trees; mathematical techniques; maximal-cut problems;
NP-complete",
treatment = "T Theoretical or Mathematical",
}
@Article{MeyeraufderHeide:1983:ICC,
author = "Friedhelm {Meyer Auf Der Heide}",
title = "Infinite Cube-Connected Cycles",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "1--2",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "84e:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150J (Operating systems)",
corpsource = "Fachbereich Informatik, Johann Wolfgang Goethe-Univ.,
Frankfurt am Main, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; cube-connected
cycles-networks; infinite network; parallel
computation; parallel processing",
treatment = "P Practical",
}
@Article{Bertossi:1983:PSP,
author = "Alan A. Bertossi and Maurizio A. Bonuccelli",
title = "Preemptive Scheduling of Periodic Jobs in Uniform
Multiprocessor Systems",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "3--6",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C15",
MRnumber = "84e:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4290 (Other computer theory); C6150J
(Operating systems)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. di Pisa,
Pisa, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; job deadline;
multiprocessing programs; periodic jobs; preemptive
scheduling; release time; scheduling; uniform
multiprocessor systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1983:SCL,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On the Subword Complexity of Locally Catenative {DOL}
Languages",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "7--9",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "85d:68043",
MRreviewer = "I. Hal Sudborough",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This paper throughout has `DOL' (Dee Oh Ell) instead
of `D0L' (Dee Zero Ell), but the latter seems to be
correct: even the author's next paper
\cite{Ehrenfeucht:1983:SCF} uses the latter form.",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; D0L; formal languages; locally
catenative D0L languages; positive integers; subword
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Kantabutra:1983:TSC,
author = "Vitit Kantabutra",
title = "Traveling salesman cycles are not always subgraphs of
{Vorono{\u{\i}}} duals",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "11--12",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C38)",
MRnumber = "84e:68073",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4290 (Other
computer theory)",
corpsource = "Dept. of Electrical Engng., Johns Hopkins Univ.,
Baltimore, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computation theory; computational geometry; computer
metatheory; Euclidean traveling salesman cycle; graph
theory; subgraph; Voronoi duals",
treatment = "T Theoretical or Mathematical",
}
@Article{Fagin:1983:ADF,
author = "Ronald Fagin and Moshe Y. Vardi",
title = "{Armstrong} Databases for Functional and Inclusion
Dependencies",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "13--19",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68H05 (68B15)",
MRnumber = "84c:68086",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Armstrong databases; database management systems;
database systems; DBMS; direct product; faithfulness;
finite databases; functional dependencies; inclusion
dependencies; logic; tuples",
treatment = "P Practical",
}
@Article{Perko:1983:RDS,
author = "A. Perko",
title = "A representation of disjoint sets with fast
initialization",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "21--21",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6120
(File organisation)",
corpsource = "Inst. for Math., Univ. of Jyvaskyla, Jyvaskyla,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "compilers; data structures; disjoint sets; fast
initialization; FORTRAN; programming",
treatment = "P Practical",
}
@Article{Clarkson:1983:MGA,
author = "Kenneth L. Clarkson",
title = "A modification of the greedy algorithm for vertex
cover",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "23--25",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C35)",
MRnumber = "84c:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Stanford Univ., Stanford, CA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; combinatorial problems;
computational complexity; general weighted graphs;
graph theory; greedy algorithm; performance ratio;
vertex cover",
treatment = "T Theoretical or Mathematical",
}
@Article{Latteux:1983:LS,
author = "Michel Latteux",
title = "On a language without star",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "27--30",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "84f:68059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. de Lille 1, Villeneuve d'Ascq, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "AFL; context free languages; context-free languages;
formal languages; language; rational cone; star
operation",
treatment = "P Practical",
}
@Article{Metivier:1983:ARS,
author = "Yves M{\'e}tivier",
title = "About the rewriting systems produced by the {Knuth
Bendix} completion algorithm",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "31--34",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C01",
MRnumber = "84c:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Univ. de Bordeaux I, Talence, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; confluent; F algebra; Knuth Bendix
completion algorithm; nonetherian; proper; rewriting
systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Guting:1983:SOP,
author = "Ralf Hartmut G{\"u}ting",
title = "Stabbing {$C$}-Oriented Polygons",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "35--40",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "52-04 (68C25)",
MRnumber = "84e:52002",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl Informatik VI, Univ. Dortmund, Dortmund,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "c-oriented objects; computational complexity;
computational geometry; computer programming; polygons;
stabbing number; time optimal algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Wegener:1983:RMF,
author = "Ingo Wegener",
title = "Relating monotone formula size and monotone depth of
{Boolean} functions",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "41--42",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (94C10)",
MRnumber = "84c:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Informatik, Johann Wolfgang Goethe-Univ.,
Frankfurt am Main, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary functions; Boolean functions; Boolean network
complexity; complexity measures; computational
complexity; formula size; logarithm; monotone basis;
monotone depth; monotone formula size",
treatment = "T Theoretical or Mathematical",
}
@Article{Lester:1983:AAQ,
author = "Lewis Neale Lester",
title = "Accuracy of Approximating Queueing Network Departure
Processes with Independent Renewal Processes",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "1",
pages = "43--48",
day = "24",
month = jan,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; 922; B0240C (Queueing theory); C1140C
(Queueing theory)",
corpsource = "Aeronautical Res. Labs., Melbourne, Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; diffusion models;
independent renewal processes; interarrival time SCV;
probability --- Queueing; queueing network departure
processes; queueing theory; simulation results",
treatment = "T Theoretical or Mathematical",
}
@Article{Jedrzejowicz:1983:ECR,
author = "Joanna J{\polhk{e}}drzejowicz",
title = "On the enlargement of the class of regular languages
by the shuffle closure",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "51--54",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "84g:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Math., Univ. of Gdansk, Gdansk, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "class; context sensitive languages; enumerable
languages; flow languages; formal languages; lock;
regular languages; shuffle closure; signal",
treatment = "P Practical",
}
@Article{Hartmanis:1983:SS,
author = "Juris Hartmanis",
title = "On sparse sets in {${\rm NP}-{\rm P}$}",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "55--60",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15 (03D15)",
MRnumber = "85d:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; formal languages; NP; set theory; sparse
sets",
treatment = "P Practical",
}
@Article{Allison:1983:SMC,
author = "Lloyd Allison",
title = "Stable Marriages by Coroutines",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "61--65",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1290 (Applications of systems theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Western Australia,
Nedlands, WA, Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; computer programming; coroutines;
operations research; pairing problems; recursive
algorithm; stable marriage problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Fraser:1983:GTC,
author = "Christopher W. Fraser",
title = "A generalization of two code ordering optimizations",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "67--70",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "branches; code ordering optimizations; code
straightening; codes, symbolic; compilers; control
structures; execution ordering; labels; loads;
optimisation; program compilers; program counter loads;
stores",
treatment = "P Practical",
}
@Article{Eichholz:1983:OND,
author = "S. Eichholz",
title = "Optimal networks for distributing nonsequential
programs",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "71--74",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C5620 (Computer networks and techniques); C6110
(Systems analysis and programming)",
corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen, Munich,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "application problems; computer networks; CONCURRENT
PASCAL; CSP; digital computers; distributing
nonsequential programs; DP; finite, undirected graph;
graph theory; MESA; MODULA; parallel processing;
parallelism; programming languages",
treatment = "P Practical",
}
@Article{Chazelle:1983:DPO,
author = "Bernard Chazelle",
title = "A decision procedure for optimal polyhedron
partitioning",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "75--78",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "52A15",
MRnumber = "84m:52004",
MRreviewer = "B. Sahoo",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "combinatorial argument; computability and
decidability; computational geometry; decidability;
decision procedure; geometric structure; optimal
polyhedron partitioning; polygon",
treatment = "T Theoretical or Mathematical",
}
@Article{Alpern:1983:KEU,
author = "B. Alpern and F. B. Schneider",
title = "Key exchange using keyless cryptography",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "79--81",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6210L (Computer communications);
C5620 (Computer networks and techniques); C6130 (Data
handling techniques)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computer network; computer networks; cryptography;
keyless cryptography; protocols; secret keys",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hofri:1983:STH,
author = "Micha Hofri",
title = "Should the Two-Headed Disk Be Greedy? --- Yes, It
Should",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "83--85",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4290 (Other computer theory); C5320 (Digital
storage); C6150J (Operating systems)",
corpsource = "Dept. of Computer 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 = "data processing; magnetic disc and drum storage; mean
seek time; movable arms; multihead disk; operating
systems (computers); optimal anticipatory position; OS;
scheduling; two headed disk; write requests",
treatment = "P Practical",
}
@Article{Gusfield:1983:CED,
author = "Dan Gusfield",
title = "Connectivity and edge-disjoint spanning trees",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "87--89",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C40",
MRnumber = "84e:05069",
MRreviewer = "R. E. Pippert",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4290 (Other
computer theory); C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Computer Sci., Yale Univ., New Haven, CT,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computer networks; edge connectivity; edge-disjoint
spanning trees; graph theory; graph vulnerability;
undirected graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Walsh:1983:ISB,
author = "T. R. Walsh",
title = "Iteration strikes back---at the cyclic {Towers} of
{Hanoi}",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "91--93",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C05",
MRnumber = "84g:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; cyclic order; cyclic Towers of
Hanoi; iterative algorithm; pegs",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibaraki:1983:LCT,
author = "T. Ibaraki and N. Katoh",
title = "On-line computation of transitive closures of graphs",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "95--97",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (05C20)",
MRnumber = "84e:68071",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math. and Phys., Kyoto Univ., Kyoto,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; directed graphs; graphs; online
computation; transitive closures",
treatment = "T Theoretical or Mathematical",
}
@Article{Wood:1983:MDP,
author = "Christopher R. Wood and Eduardo B. Fernandez and Tomas
Lang",
title = "Minimization of Demand Paging for the {LRU} Stack
Model of Program Behavior",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "2",
pages = "99--104",
day = "26",
month = feb,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B20",
MRnumber = "84d:68031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Dept. of Electrical Engng., Univ. of Miami, Coral
Gables, FL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "allocated pages; computer programming; demand paging;
fixed-space replacement algorithm; LRU stack model;
minimization; optimization problem; page faults;
probability distribution; program behavior; programming
theory; storage allocation; VS",
treatment = "T Theoretical or Mathematical",
}
@Article{Constable:1983:PPS,
author = "Robert L. Constable",
title = "Programs as proofs: a synopsis",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "105--112",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B10 (03F99)",
MRnumber = "84e:68009",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "constructive proofs; formal logic; PL/CV; precision;
programming logics; programming methodology;
programming theory; programs",
treatment = "T Theoretical or Mathematical",
}
@Article{McGlinn:1983:SBT,
author = "Robert J. McGlinn",
title = "Is {SSS}$^*$ better than alpha-beta",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "113--120",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10",
MRnumber = "85a:68151",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C1230 (Artificial
intelligence)",
corpsource = "Dept. of Computer Sci., Southern Illinois Univ.,
Carbondale, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "alpha-beta; artificial intelligence; game tree;
minimax techniques; minimax value; SSS*; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Soisalon-Soininen:1983:CAC,
author = "Eljas Soisalon-Soininen",
title = "On computing approximate convex hulls",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "121--126",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "52-04 (52A10)",
MRnumber = "84g:52001",
MRreviewer = "V. Medek",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "approximate convex hulls; computing; linear time
algorithm; planar approximation algorithm; point sets;
set theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1983:TCL,
author = "Wojciech Rytter",
title = "Time Complexity of Loop-Free Two-Way Pushdown
Automata",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "127--129",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F10 (68C25)",
MRnumber = "84e:68098",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computational complexity; languages;
loop-free two-way pushdown automata; nondeterministic
pushdown automata; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Tamminen:1983:AT,
author = "Markku Tamminen",
title = "Analysis of {$N$}-trees",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "131--137",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E05",
MRnumber = "84e:68064",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Lab. of Information Processing 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 = "access efficiency; computer programming; distributive
sorting; mathematical techniques --- Trees; N-trees;
programming theory; recursive bucket methods; search
cost; sorting; storage; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Yuba:1983:CML,
author = "Toshitsugu Yuba and Yoshinori Yamaguchi and Toshio
Shimada",
title = "A control mechanism of a {Lisp}-based data-driven
machine",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "139--143",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C5220 (Computer architecture)",
corpsource = "Electrotech. Lab., Ibaraki, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer architecture; computer systems, digital ---
Parallel Processing; control mechanism; data-driven
machine; EM-3; ETL data-driven Machine-3; high level
language machine; Lisp-based; multiprocessing systems;
parallelism; symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Agrawal:1983:UHD,
author = "Rakesh Agrawal and David J. Dewitt",
key = "Agrawal \& Dewitt",
title = "Updating Hypothetical Data Bases",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "145--146",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6160
(Database management systems (DBMS))",
corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "crash recovery; database management systems; database
systems; differential files; hypothetical database,
update, crash recovery, differential files, log;
hypothetical databases; log; programming theory;
update",
owner = "mckenzie; robyn",
treatment = "T Theoretical or Mathematical",
}
@Article{Rystsov:1983:PCP,
author = "I. K. Rystsov",
title = "Polynomial complete problems in automata theory",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "147--151",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03D05 03D15)",
MRnumber = "84g:68031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Cybernetics, Acad. of Sci., Kiev, Ukrainian
SSR, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "automata theory; computational complexity;
deterministic finite state automata; finite automata;
polynomial complete; regular languages intersection",
treatment = "T Theoretical or Mathematical",
}
@Article{Casanova:1983:TFS,
author = "Marco A. Casanova",
title = "The theory of functional and subset dependencies over
relational expressions",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "3",
pages = "153--160",
day = "15",
month = apr,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05 (03B10)",
MRnumber = "84e:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C6160D (Relational
databases)",
corpsource = "Pontificia Univ. Catolica do Rio de Janeiro, Rio de
Janeiro, Brazil",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "analytic tableaux method; database design; database
management systems; database systems; formal languages;
functional dependencies; relational expressions; subset
dependences",
treatment = "T Theoretical or Mathematical",
}
@Article{Deleage:1983:ATL,
author = "J. L. Del{\'e}age",
title = "An application of a transfer lemma",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "161--163",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "84i:68124",
MRreviewer = "S. A. Greibach",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "LITP Univ. de Paris 7, Paris, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context-free languages; formal languages; full AFL;
nondegenerated iterative pair; substitution; transfer
lemma",
treatment = "P Practical",
}
@Article{Hertel:1983:SBP,
author = "Stefan Hertel",
title = "{Smoothsort}'s Behavior on Presorted Sequences",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "165--170",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "85a:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Fachbereich Angewandte Math. und Informatik, Univ. des
Saarlandes, Saarbrucken, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems programming; inversions;
number-of-inversions-measure; presorted sequences;
programming theory; running time; smoothsort; sorting",
treatment = "P Practical",
}
@Article{Frederickson:1983:SUT,
author = "Greg N. Frederickson",
title = "Scheduling Unit-Time Tasks with Integer Release Times
and Deadlines",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "171--173",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C15 (68C25 90B35)",
MRnumber = "84m:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.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{Lloyd:1983:SDR,
author = "Errol L. Lloyd",
title = "On a Simple Deadlock Recovery Problem",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "175--178",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N25",
MRnumber = "85a:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Dept. of Computer Sci., Univ. of Pittsburgh,
Pittsburgh, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; computer systems, digital ---
Multiprocessing; deadlock recovery problem; minimum
cost recovery; network flow problem; polynomial time
algorithm; system failure; system recovery",
treatment = "P Practical",
}
@Article{Crochemore:1983:OTF,
author = "Max Crochemore and Michel {Le Rest} and Philippe
Wender",
title = "An optimal test on finite unavoidable sets of words",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "179--180",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "85a:68088",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "Lab. d'Informatique, Univ. de Haute Normandie,
Mont-Saint-Aignan, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "encoding; finite unavoidable set; finite unavoidable
sets of words; graph theory; maximal length; optimal
test",
treatment = "T Theoretical or Mathematical",
}
@Article{Yap:1983:HAS,
author = "Chee K. Yap",
title = "A hybrid algorithm for the shortest path between two
nodes in the presence of few negative arcs",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "181--182",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10 (05C35 90B10)",
MRnumber = "85b:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., New York,
NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Bellman-Ford algorithms; computational complexity;
computer programming; Dijkstra; direct graph; directed
graphs; hybrid algorithm; negative arcs; parallel
processing; shortest path",
treatment = "T Theoretical or Mathematical",
}
@Article{Tsuda:1983:GFM,
author = "Takao Tsuda and Takashi Sato and Takaaki Tatsumi",
title = "Generalization of {Floyd}'s model on permuting
information in idealized two-level storage",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "183--188",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "84m:68015",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6130 (Data handling
techniques)",
corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "data handling; data structures; Floyd's model;
idealized two-level storage; permuting information;
processing large data structures",
treatment = "P Practical",
}
@Article{Fushimi:1983:IOE,
author = "Masanori Fushimi",
title = "Increasing the orders of equidistribution of the
leading bits of the {Tausworthe} sequence",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "189--192",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65C10",
MRnumber = "85a:65011",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C7890 (Other special applications of computing)",
corpsource = "Faculty of Engng., Univ. of Tokyo, Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic method; equidistribution; Lehmer's
congruential generator; maximal-length linearly
recurring sequence; orders of equidistribution; pseudo
random number generation; random number generation;
Tausworthe sequence",
treatment = "P Practical",
}
@Article{Chazelle:1983:IAF,
author = "Bernard Chazelle",
title = "An improved algorithm for the fixed-radius neighbor
problem",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "193--198",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (52-04 90B05)",
MRnumber = "85m:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C6120 (File
organisation); C7250L (Non-bibliographic retrieval
systems)",
corpsource = "Dept. of Computer Sci., Brown Univ., Providence, RI,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "balanced search tree; computer programming; fast
algorithms; fixed radius; fixed-radius neighbor
problem; graph theory; information retrieval;
logarithmic query time; partitioning; planar point
location; Preparata's algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1983:SRT,
author = "Wojciech Rytter",
title = "A simulation result for two-way pushdown automata",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "199--202",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68D05 (68F10)",
MRnumber = "84m:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C4220 (Automata theory);
C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computational complexity;
deterministic automata; formal languages; languages;
pushdown automata; pyramidal structure; random access
machine; space complexity; surface configurations;
two-way pushdown automata; uniform cost criterion",
treatment = "P Practical",
}
@Article{Bossi:1983:DCA,
author = "A. Bossi and N. Cocco and L. Colussi",
title = "A divide-and-conquer approach to general context-free
parsing",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "203--208",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "85a:68098",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Univ. di Padova, Padova, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; Chomsky normal form; context-free
grammars; divide-and-conquer; general context-free
parsing; recursive procedure",
treatment = "P Practical",
}
@Article{Schoning:1983:S,
author = "Uwe Sch{\"o}ning",
title = "On the structure of {$\Delta^p_2$}",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "209--211",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D15 (68Q25)",
MRnumber = "85a:03054",
MRreviewer = "Gh. Grigora{\c{s}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informatik, Univ. Stuttgart, Stuttgart,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computational complexity; decidable; DELTA/sub 2//sup
p/; intractability; NP-complete set; Turing machines;
Turing reducibility",
treatment = "P Practical",
}
@Article{Goldberg:1983:CAT,
author = "Allen Goldberg and Paul Purdom and Cynthia Brown",
title = "Corrigendum: {``Average time analyses of simplified
Davis--Putnam procedures'' [Inform. Process. Lett. {\bf
15} (1982), no. 2, 72--75]}",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "4",
pages = "213--213",
day = "13",
month = may,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (03B05 03B35 03D15)",
MRnumber = "84d:68038b",
MRreviewer = "Gh. Grigora{\cedla{s}}",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Goldberg:1982:ATA}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Dijkstra:1983:DTD,
author = "Edsger W. Dijkstra and W. H. J. Feijen and A. J. M.
{van Gasteren}",
title = "Derivation of a Termination Detection Algorithm for
Distributed Computations",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "217--219",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B05 (68C05)",
MRnumber = "84m:68005",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B6210L (Computer communications); C5620
(Computer networks and techniques); C6150J (Operating
systems)",
corpsource = "Burroughs, AL Nuenen, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; distributed computations;
distributed processing; networks; protocols;
termination detection algorithm",
treatment = "P Practical",
}
@Article{Duda:1983:ECP,
author = "Andrzej Duda",
title = "The effects of checkpointing on program execution
time",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "221--229",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B05",
MRnumber = "84m:68006",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150G (Diagnostic, testing, debugging and
evaluating systems)",
corpsource = "Dept. of Complex Control Systems, Polish Acad. of
Sci., Gliwice, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "checkpointing; computer programming; elapsed time;
expected execution time; program diagnostics; program
execution time",
treatment = "P Practical",
}
@Article{Carpi:1983:SSF,
author = "Arturo Carpi",
title = "On the size of a square-free morphism on a three
letter alphabet",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "231--235",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05 (20M05)",
MRnumber = "84m:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "formal languages; square-free morphism; three letter
alphabet",
treatment = "P Practical",
}
@Article{Murtagh:1983:ETC,
author = "F. Murtagh",
title = "Expected-time complexity results for hierarchic
clustering algorithms which use cluster centres",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "237--241",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25 (62H30 68G10)",
MRnumber = "84j:68025",
MRreviewer = "Vijay V. Raghavan",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C7250
(Information storage and retrieval)",
corpsource = "Dept. of Computer Sci., Univ. Coll. Dublin, Dublin,
Ireland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm improvements; centroid methods; cluster
centres; complexity; computational complexity; computer
programming; dynamic searching; expected-time
performance; hierarchic clustering algorithms;
information retrieval; interpreting data; median
method; nearest neighbours; probabilistic algorithms;
structuring; time complexity; trees; Ward's method",
treatment = "P Practical",
}
@Article{Ozawa:1983:CSM,
author = "K. Ozawa",
title = "Considerations on the similarity measures between
index terms",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "243--246",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C7240 (Information analysis and indexing); C7250C
(Bibliographic retrieval systems)",
corpsource = "Information Sci. Center, Osaka Electro-Communication
Univ., Osaka, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "automatic clustering; clustering criterion; documents;
index terms; indexing; information retrieval;
insensitive measure; similarity measures; Tanimoto
measure",
treatment = "P Practical",
}
@Article{Cohen:1983:NFA,
author = "Jacques Cohen",
title = "A note on a fast algorithm for sparse matrix
multiplication",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "247--248",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65F50 (65V05)",
MRnumber = "84m:65057",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Computer Sci. Program, Brandeis Univ., Waltham, MA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "analysis of algorithms; fast algorithm; matrix
algebra; program transformations; sparse matrix
multiplication",
treatment = "T Theoretical or Mathematical",
}
@Article{Zahorjan:1983:EBT,
author = "John Zahorjan and Barbara J. Bell and Kenneth C.
Sevcik",
title = "Estimating Block Transfers When Record Access
Probabilities are Non-Uniform",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "249--252",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "block transfer; database; database management systems;
database systems; DBMS; direct access; record access
probabilities; sequentially accessed files",
treatment = "P Practical",
}
@Article{Tarjan:1983:UBS,
author = "Robert Endre Tarjan",
title = "Updating a Balanced Search Tree in {$O(1)$}
Rotations",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "253--257",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "85a:68026",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C7250 (Information
storage and retrieval)",
corpsource = "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 search tree; data processing; information
retrieval; red black trees; rotations; search trees;
trees (mathematics)",
treatment = "P Practical",
}
@Article{Kriegel:1983:ISB,
author = "H. P. Kriegel and Y. S. Kwong",
title = "Insertion-Safeness in Balanced Trees",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "259--264",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B15",
MRnumber = "84m:68013",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C7250 (Information
storage and retrieval)",
corpsource = "Lehrstuhl Informatik VI, Univ. Dortmund, Dortmund,
West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "average case results; balanced trees; data processing;
data structures; information retrieval; insertion;
keys; random insertion; safe node; trees
(mathematics)",
treatment = "P Practical",
}
@Article{Freund:1983:IAO,
author = "Rudolf Freund",
title = "Init and {Anf} operating on $\omega$-languages",
journal = j-INFO-PROC-LETT,
volume = "16",
number = "5",
pages = "265--269",
day = "10",
month = jun,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F05",
MRnumber = "84m:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Math. Logik und Formale Spachen, Tech.
Univ. Wien, Wien, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "ANF; context-free languages; finite-string languages;
formal languages; Init; omega-Kleene closure;
omega-languages; regular languages",
treatment = "P Practical",
}
@Article{Er:1983:CSO,
author = "M. C. Er",
title = "Computing Sums of Order-$k$ {Fibonacci} Numbers in Log
Time",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "1--5",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "11Y55 (11B39 68Q25)",
MRnumber = "85b:11124",
MRreviewer = "Samuel S. Wagstaff, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1110 (Algebra); C1160 (Combinatorial
mathematics)",
corpsource = "Dept. of Computing Sci., Univ. of Wollongong,
Wollongong, NSW, Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; Fibonacci numbers; log time;
matrix; matrix algebra; number theory; order-k
Fibonacci numbers; sums",
treatment = "T Theoretical or Mathematical",
}
@Article{Willett:1983:TKS,
author = "Michael Willett",
title = "Trapdoor Knapsacks without Superincreasing Structure",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "7--11",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A60 (68P20)",
MRnumber = "85e:94020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C0230 (Economic, social and political aspects
of computing); C1260 (Information theory); C1290
(Applications of systems theory)",
corpsource = "Dept. of Math., Univ. of North Carolina, Greensboro,
NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; cryptography; information
theory; knapsacks; Merkle--Hellman public-key schemes;
operations research; polynomial-time algorithm;
superincreasing structure; trapdoor",
treatment = "T Theoretical or Mathematical",
}
@Article{Cesarini:1983:ACC,
author = "F. Cesarini and G. Soda",
title = "An algorithm to construct a compact {$B$}-tree in case
of ordered keys",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "13--16",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C1260
(Information theory)",
corpsource = "Istituto di Informatica e Sistemistica, Univ. of
Florence, Florence, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "compact B-tree; computer programming; construction
algorithm; cryptography; data processing --- Data
Structures; ordered keys; overflow movings; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Richards:1983:SDH,
author = "Ronald C. Richards",
title = "Shape Distribution of Height-Balanced Trees",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "17--20",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1140Z (Other topics in statistics); C1160
(Combinatorial mathematics); C1260 (Information
theory)",
corpsource = "IBM Corp., Houston, TX, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "approximate probabilities; computer programming; data
processing --- Data Structures; height-balanced trees;
information theory; node trees; probabilities;
probability; tree shapes; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Tirri:1983:SRP,
author = "Henry R. Tirri",
title = "Simulation, Reduction and Preservation of Correctness
Properties of Parallel Systems",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "21--27",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q60 (03B45 03B70)",
MRnumber = "85e:68063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computation homomorphism; computer systems, digital;
correctness properties; parallel systems; preservation;
programming theory; reduction; simulation; temporal
logic",
treatment = "T Theoretical or Mathematical",
}
@Article{Broy:1983:DSC,
author = "Manfred Broy",
title = "Denotational Semantics of Communicating Processes
Based on a Language for Applicative Multiprogramming",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "29--35",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68F20 (68B10)",
MRnumber = "84m:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen,
Munchen, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "applicative multiprogramming; communicating processes;
computer systems programming; denotational semantics;
formal languages; language; loosely-coupled systems;
nondeterministic stream-processing functions; semantic
target language; synchronous systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Tarjan:1983:IAH,
author = "Robert E. Tarjan",
title = "An improved algorithm for hierarchical clustering
using strong components",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "37--41",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68E10 (68C25)",
MRnumber = "84m:68056",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B6140C (Optical information, image and video
signal processing); C1160 (Combinatorial mathematics);
C1250 (Pattern recognition)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "asymmetric similarity measure; cluster analysis;
computer programming; directed graphs; graph;
hierarchical clustering; pattern recognition; strong
components; time algorithm; weighted edges",
treatment = "T Theoretical or Mathematical",
}
@Article{Rana:1983:DSD,
author = "S. P. Rana",
title = "A distributed solution of the distributed termination
problem",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "43--46",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68B05",
MRnumber = "84m:68007",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C5620 (Computer networks and techniques);
C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "asynchronous communications; computer programming;
computer systems, digital --- Distributed; distributed
processing; distributed solution; distributed
termination problem; symmetric solution",
treatment = "T Theoretical or Mathematical",
}
@Article{Williams:1983:ESS,
author = "M. H. Williams",
title = "Is an Exit Statement Sufficient?",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "47--51",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming languages; conditional
statements; exit statement; goto statement; loops;
structured programming",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Croitoru:1983:PSG,
author = "Cornelius Croitoru and Emilian Suditu",
title = "Perfect Stables in Graphs",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "1",
pages = "53--56",
day = "19",
month = jul,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C70 (68Q25)",
MRnumber = "85k:05083",
MRreviewer = "P. E. O'Neil",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Dept. of Math., Univ. of IASI, IASI, Romania",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "graph theory; graphs; mathematical programming;
mathematical techniques; NP- complete; perfect
matching; perfect stable; polynomial; vertex",
treatment = "T Theoretical or Mathematical",
}
@Article{Nawrocki:1983:CSL,
author = "Jerzy R. Nawrocki",
title = "Contiguous Segmentation with Limited Compacting",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "57--62",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C6150J (Operating
systems)",
corpsource = "Regional Computer Center, Tech. Univ. of Poznan,
Poznan, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "address mapping; computer operating systems;
contiguous segmentation; limited compacting; memory
management; multi-segment virtual memory; real-time
systems; storage management; virtual storage",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Magazine:1983:OIC,
author = "Michael J. Magazine",
title = "Optimality of Intuitive Checkpointing Policies",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "63--66",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "921; C1140Z (Other topics in statistics); C1180
(Optimisation techniques); C1290F (Systems theory
applications in industry)",
corpsource = "Dept. of Management Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "intuitive checkpointing; management science;
mathematical programming; optimality; optimisation;
probabilistic process; probability; system operation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Shing:1983:OOB,
author = "Man-Tak Shing",
title = "Optimum Ordered Bi-Weighted Binary Trees",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "67--70",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "85f:68013",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Dept. of Computer Sci., Univ. of California, Santa
Barbara, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "bi-weighted binary trees; children; computer
programming; dynamic programming; left son;
mathematical programming, dynamic; nonnegative numbers;
optimisation; optimum ordered; parent; right son;
symmetric ordering; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Vyskoc:1983:NPI,
author = "Jozef Vysko{\v{c}}",
title = "A note on the power of integer division",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "71--72",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (15A15)",
MRnumber = "85g:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4140 (Linear algebra)",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "asymptotically optimal algorithms; computational
complexity; integer division; matrix algebra; matrix
multiplication; nonnegative integers; number theory;
permanent; polynomial multiplication; polynomials;
time-complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Tong:1983:FAF,
author = "Po Tong and E. L. Lawler",
title = "A faster algorithm for finding edge-disjoint
branchings",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "73--76",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05C20 68R10)",
MRnumber = "85a:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics)",
corpsource = "Computer Sci. Dept., Univ. of California, Berkeley,
CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; directed graphs; directed
multigraph; edge-disjoint branchings; faster algorithm;
vertices",
treatment = "T Theoretical or Mathematical",
}
@Article{Shamir:1983:ECT,
author = "Adi Shamir",
title = "Embedding Cryptographic Trapdoors in Arbitrary
Knapsack Systems",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "77--79",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A60",
MRnumber = "85e:94019",
MRreviewer = "Tai Yang Hwang",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1260 (Information theory); C1290Z (Other
applications of systems theory); C6130 (Data handling
techniques)",
corpsource = "Dept. of Appl. Maths., Weizmann Inst. of Sci.,
Rehovot, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "arbitrary knapsack systems; cryptographic trapdoors;
cryptography; information theory; modular
multiplications; operations research; public-key
cryptography",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Willard:1983:LLW,
author = "Dan E. Willard",
title = "Log-Logarithmic Worst-Case Range Queries are Possible
in Space {$\Theta (N)$}",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "81--84",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "85a:68027",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1140C (Queueing theory); C1160 (Combinatorial
mathematics); C4130 (Interpolation and function
approximation); C4210 (Formal logic); C6120 (File
organisation)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "data processing; data structure; data structures;
distinct nonnegative integers; interpolation;
log-logarithmic queries; queueing theory; random access
machine; specified bound; trees (mathematics);
worst-case range queries",
treatment = "T Theoretical or Mathematical",
}
@Article{Kobuchi:1983:SDS,
author = "Youichi Kobuchi",
title = "Stability of desynchronized {0L} systems",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "85--90",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "85i:68027",
MRreviewer = "K. P. Lee",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Biophys., Kyoto Univ., Kyoto, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "alphabet; desynchronized 0L systems; formal languages;
generative grammars; grammars; homogeneous treatment;
parallellism; stability; synchronization; system
operation",
treatment = "T Theoretical or Mathematical",
}
@Article{DeBra:1983:AHD,
author = "Paul {De Bra} and Jan Paredaens",
title = "An Algorithm for Horizontal Decompositions",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "91--95",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160D (Relational databases)",
corpsource = "Dept. of Maths., Univ. of Antwerp, Wilrijk, Belgium",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "database management systems; database systems;
exception handling mechanism; functional dependency;
horizontal decompositions; relational database model;
vertical decomposition",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bertossi:1983:FHC,
author = "Alan A. Bertossi",
title = "Finding {Hamiltonian} Circuits in Proper Interval
Graphs",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "97--101",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10",
MRnumber = "85a:68143",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics)",
corpsource = "Dipartimento di Informatica, Univ. di Pisa, Pisa,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "circular arc graph; cliques; computational complexity;
computer programming; edges; graph theory; Hamiltonian
circuits; mathematical techniques --- Graph Theory;
node disjoint paths; optimal; polynomial time; property
interval graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Schorr:1983:PPD,
author = "Amir Schorr",
title = "Physical Parallel Devices are not Much Faster Than
Sequential Ones",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "103--106",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68C25",
MRnumber = "84m:68040",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4130 (Interpolation and function
approximation); C4230D (Sequential switching theory);
C4240 (Programming and algorithm theory); C5420
(Mainframes and minicomputers)",
corpsource = "Nat. Semiconductor Ltd, Herzlia, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; computer systems, digital;
formal languages; language; parallel devices; parallel
processing; physical parallel devices; polynomials;
sequential devices; sequential machines;
time-complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Kucera:1983:EAP,
author = "Lud{\v{e}}k Ku{\v{c}}era",
title = "Erratum and addendum to: {``Parallel computation and
conflicts in memory access'' [Inform. Process. Lett.
{\bf 14} (1982), no. 2, 93--96; MR 83g:68038]}",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "2",
pages = "107--107",
day = "24",
month = aug,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (05C50 68N25)",
MRnumber = "85a:68054",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Kucera:1982:PCC}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Martin:1983:PTF,
author = "J. J. Martin",
title = "Precise typing and filters",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "109--112",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Virginia Polytech. Inst. and State Univ., Blacksburg,
VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "abstract types; data types; filters; natural domains;
precise typing; programming theory; run time errors;
type checking",
treatment = "T Theoretical or Mathematical",
}
@Article{Farinas:1983:STT,
author = "Luis Fari{\~n}as",
title = "Space as time",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "113--115",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q55 (03B45 03B70)",
MRnumber = "85g:68041",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Langages et Syst{\`e}mes Informatiques, Univ. de
Toulouse Le Mirail, Toulouse, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "axiomatization; formal logic; mutual exclusion
problem; observation; two-dimensional temporal logic",
treatment = "T Theoretical or Mathematical",
}
@Article{Lifschitz:1983:NCP,
author = "Vladimir Lifschitz and Leon Pesotchinsky",
title = "A note on the complexity of a partition algorithm",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "117--120",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (90C09)",
MRnumber = "85h:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. Sci., Univ. of Texas, El Paso, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; analysis of algorithms;
computational complexity; computer programming;
partition algorithms; partition problem; PARTS;
worst-case behaviour",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1983:SCF,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On the Subword Complexity of $m$-Free {D0L}
Languages",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "121--124",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "85f:68043",
MRreviewer = "K. P. Lee",
bibdate = "Sun May 02 08:27:19 1999",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Ehrenfeucht:1983:SCL}.",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Univ. of Colorado, Boulder, CO,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computational complexity; DOL
language; formal languages; m-free DOL languages;
subword complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Skyum:1983:MWB,
author = "Sven Skyum",
title = "A measure in which {Boolean} negation is exponentially
powerful",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "125--128",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15 (94C10)",
MRnumber = "85g:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Boolean algebra; Boolean negation; combinatorial
complexity theory; computational complexity; negation;
projections; restricted representations",
treatment = "T Theoretical or Mathematical",
}
@Article{Weiser:1983:RSB,
author = "Mark Weiser",
title = "Reconstructing Sequential Behavior from Parallel
Behavior Projections",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "129--135",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Univ. of Maryland, College Park,
MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; computer systems, digital ---
Parallel Processing; data flow; data flow slices;
formal languages; parallel processing; parallelism;
regular expressions; slicing; vectorization",
treatment = "T Theoretical or Mathematical",
}
@Article{Yokomori:1983:SLP,
author = "Takashi Yokomori and Aravind K. Joshi",
title = "Semi-Linearity, {Parikh}-Boundedness and Tree Adjunct
Languages",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "137--143",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (03B65 03D05)",
MRnumber = "85f:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
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
languages; Parikh-bounded languages;
Parikh-boundedness; semilinearity; TAG; TAL; tree
adjunct grammars; tree adjunct languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Seroussi:1983:ACM,
author = "Gadiel Seroussi and Fai Ma",
title = "On the Arithmetic Complexity of Matrix {Kronecker}
Powers",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "145--148",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (65F30)",
MRnumber = "85a:68079",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Math. Sci. Dept., 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 = "algebraic computational complexity; arithmetic
complexity; computational complexity; computer
programming; inductive computation; matrix Kronecker
powers",
treatment = "T Theoretical or Mathematical",
}
@Article{Choffrut:1983:FPD,
author = "C. Choffrut and K. {Culik, II}",
title = "Folding of the Plane and the Design of Systolic
Arrays",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "149--153",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35",
MRnumber = "85m:68013",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C5220 (Computer architecture)",
corpsource = "Univ. Paris VII, U.E.R. de Math., Paris, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "folding; geometric transformation; logic circuits;
parallel processing; systolic arrays; VLSI",
treatment = "T Theoretical or Mathematical",
}
@Article{Mili:1983:VPI,
author = "Ali Mili",
title = "Verifying Programs by Induction on Their Data
Structure: General Format and Applications",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "155--160",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q60",
MRnumber = "85a:68124",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. d'Informatique, Univ. Laval, Quebec City, Que.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; correctness; intermittent
assertion method; Noetherian induction; program
correctness proving; program verification; programming
theory; subgoal induction method",
treatment = "T Theoretical or Mathematical",
}
@Article{Wyrostek:1983:CPP,
author = "Piotr Wyrostek",
title = "On the {``correct prefix property''} in precedence
parsers",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "161--165",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "85a:68112",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum \cite{Wyrostek:1984:ECP}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Regional Computer Centre `Cyfronet', Krakow, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "correct prefix property; CPP; grammars; language
processors; precedence grammars; precedence parser;
Rhodes' parser; syntactic analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Zheng:1983:DMA,
author = "Zhi Jie Zheng",
title = "The duodirun merging algorithm: a new fast algorithm
for parallel merging",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "167--168",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "85f:68014",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Computer Architecture, Inst. of Computer
Technol., Acad. Sinica, Beijing, China",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "duodirun; duodirun merging; merging; parallel merging;
regularity; sorting; symmetry",
treatment = "T Theoretical or Mathematical",
}
@Article{Williams:1983:PAP,
author = "M. H. Williams",
title = "The problem of absolute privacy",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "3",
pages = "169--171",
day = "5",
month = oct,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150J (Operating systems)",
corpsource = "Computer Sci. Dept., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer operating systems; data privacy; data
processing --- Security of Data; data security; file
protection; operating systems (computers); security of
data",
treatment = "G General Review; P Practical",
}
@Article{Clocksin:1983:RFQ,
author = "W. F. Clocksin",
title = "Real-Time Functional Queue Operations Using the
Logical Variable",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "173--175",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 922; C6120 (File organisation)",
corpsource = "Univ. of Oxford, Oxford, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "backtracking; computer programming; data structures;
functional queue operations; logic programming; logical
variable; probability --- Queueing Theory; programming;
queue operations; queueing theory; unification",
treatment = "T Theoretical or Mathematical",
}
@Article{Bartholdi:1983:FHB,
author = "John J. {Bartholdi, III} and Loren K. Platzman",
title = "A fast heuristic based on space filling curves for
minimum-weight matching in the plane",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "177--180",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B6140C (Optical information, image and video
signal processing); C1250 (Pattern recognition); C1290Z
(Other applications of systems theory)",
corpsource = "School of Industrial and Systems Engng., 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 = "approximation algorithms; computer programming; good
matching; linear expected time; minimum weight
matching; minimum-weight matching; operations research;
picture processing; plane; probability distribution;
sorting; space filling curves; travelling salesman
problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Makinen:1983:BTU,
author = "Erkki M{\"a}kinen",
title = "Boundedness Testing for Unambiguous Context-Free
Grammars",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "181--183",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "85i:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci. and Computer Sci., Univ. of
Tampere, Tampere, Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; bounded language; boundedness
testing; context-free grammars; decidability problems;
exponential time complexity; left Szilard language;
linear grammars; polynomial time algorithm; unambiguous
context-free grammars",
treatment = "T Theoretical or Mathematical",
}
@Article{Shmueli:1983:DCD,
author = "Oded Shmueli",
title = "Dynamic Cycle Detection",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "185--188",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10 (05-04 05C20 68N25)",
MRnumber = "85b:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 922; C6150J (Operating systems)",
corpsource = "Dept. of Computer 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 = "centralized continuous deadlock detection; database
systems; deadlock; depth first search; directed acyclic
graph; directed graphs; dynamically changing
environment; edge addition; operating systems
(computers); OS; probability; resource contention;
system recovery",
treatment = "P Practical",
}
@Article{Ramesh:1983:LPF,
author = "S. Ramesh and S. L. Mehndiratta",
title = "The liveness property of on-the-fly garbage
collector---a proof",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "189--195",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q60 (68Q10)",
MRnumber = "85i:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., Bombay,
India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; correctness proof; freelist;
liveness property; on-the-fly garbage collector;
parallel programs; programming theory; storage
management",
treatment = "P Practical",
}
@Article{Gangolli:1983:TPM,
author = "Anil R. Gangolli and Steven L. Tanimoto",
title = "Two Pyramid Machine Algorithms for Edge Detection in
Noisy Binary Images",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "197--202",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; B6140C (Optical information, image and
video signal processing); C1250 (Pattern recognition)",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, 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 detection; fast
algorithms; image processing; noisy binary images;
parallel hierarchical cellular array processor;
parallel processing; picture processing; pyramid
machine algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Blum:1983:NPC,
author = "Norbert Blum",
title = "A note on the ``parallel computation thesis''",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "203--205",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (03D10 03D15 68Q15)",
MRnumber = "85d:68023",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Angewandte Math. und Informatik, Univ. des Saarlandes,
Saarbrucken, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; parallel computation thesis; parallel
machines; parallel processing; programming theory;
simulation; space-bounded computers; Turing machines",
treatment = "T Theoretical or Mathematical",
}
@Article{Atallah:1983:LTA,
author = "Mikhail J. Atallah",
title = "A linear time algorithm for the {Hausdorff} distance
between convex polygons",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "207--209",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (52A37)",
MRnumber = "85j:68101",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
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 = "algorithm analysis; computational complexity;
computational geometry; computer programming; convex
polygons; Euclidean distance; Hausdorff distance;
linear time algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Mayoh:1983:MPP,
author = "Brian H. Mayoh",
title = "Models of Programs and Processes",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "211--214",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10",
MRnumber = "85b:68016",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6110 (Systems analysis and programming)",
corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory; diagrams; equation sets;
flowcharting; flowcharts; graphs; Milner agents;
parallel processing; Petri nets; Pratt processes;
processes; programming; programs",
treatment = "P Practical",
}
@Article{Lautemann:1983:BPH,
author = "Clemens Lautemann",
title = "{BPP} and the polynomial hierarchy",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "215--217",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D15 (68Q05 68Q15)",
MRnumber = "85j:03063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Inst. f{\"u}r Software and Theoretische Informatik,
Tech. Univ. Berlin, Berlin, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; bounded error probability; BPP;
polynomial hierarchy; polynomial time bound;
probabilistic Turing machine; pure counting arguments;
Turing machines",
treatment = "T Theoretical or Mathematical",
}
@Article{Guibas:1983:CAN,
author = "Leo J. Guibas and Jorge Stolfi",
title = "On computing all north-east nearest neighbors in the
{$L_1$} metric",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "219--223",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (68Q25)",
MRnumber = "85b:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
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 = "computational complexity; computational geometry;
computer programming; L/sub 1/ metric; minimum spanning
tree; northeast nearest neighbors",
treatment = "T Theoretical or Mathematical",
}
@Article{Hikita:1983:LCS,
author = "Teruo Hikita",
title = "Listing and Counting Subtrees of Equal Size of a
Binary Tree",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "4",
pages = "225--229",
day = "8",
month = nov,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10 (05C05 05C30 68P10)",
MRnumber = "85k:68076",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Dept. of Maths., Tokyo Metropolitan Univ., Tokyo,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary tree; computer programming; counting; data
structures; listing; mathematical techniques --- Trees;
rooted ordered binary trees; subtrees; trees
(mathematics)",
treatment = "P Practical",
}
@Article{Rohl:1983:FLQ,
author = "J. S. Rohl",
title = "A faster lexicographical {$N$} queens algorithm",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "231--233",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Western Australia,
Nedlands, WA, Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; computer programming;
lexicographical order; N queens problem; permutations;
Rohl's procedure",
treatment = "T Theoretical or Mathematical",
}
@Article{Yu:1983:UDC,
author = "Yao Tin Yu and Mohamed G. Gouda",
title = "Unboundedness Detection for a Class of Communicating
Finite-State Machines",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "235--240",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (68M10)",
MRnumber = "85c:68017",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; 723; C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; bounded communication; communicating
machines; communication protocols; computer programming
--- Algorithms; deadlock detection; finite automata;
finite-state machines; protocols; reachability;
unboundness detection",
treatment = "T Theoretical or Mathematical",
}
@Article{Myers:1983:ARA,
author = "Eugene W. Myers",
title = "An applicative random-access stack",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "241--248",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N05 (68P05)",
MRnumber = "86a:68008",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "applicative algorithms; auxiliary linking structure;
computer programming; data structures; RA-stack;
random-access stack; singly-linked list; stack data
abstraction",
treatment = "T Theoretical or Mathematical",
}
@Article{Fischer:1983:SRF,
author = "Michael J. Fischer and Michael S. Paterson",
title = "Storage Requirements for Fair Scheduling",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "249--250",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (68Q60)",
MRnumber = "85h:68017",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 913; C4240 (Programming and algorithm theory);
C5380 (Other aspects of storage devices and
techniques); C6150J (Operating systems)",
corpsource = "Dept. of Computer 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 = "algorithm theory; analysis of algorithms; bounds;
computer programming; fair scheduling; parallel
computation; parallel processing; scheduling; storage",
treatment = "T Theoretical or Mathematical",
}
@Article{Nishihara:1983:ACA,
author = "Seiichi Nishihara and Katsuo Ikeda",
title = "Address Calculation Algorithms for Ordered Sets of
Combinations",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "251--253",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Information Sci. and Electronics, Univ. of
Tsukuba, Ibaraki, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "address calculation algorithms; algorithm theory;
combinations; computer programming; lexicographically
ordered combinations; ordered sets",
treatment = "T Theoretical or Mathematical",
}
@Article{Barnard:1983:RDP,
author = "D. T. Barnard",
title = "Recursive descent parsing using implementation
languages requiring definition before use",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "255--258",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computing and Information Sci., Queen's
Univ., Kingston, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "ALGOL scope rules; code generation; compilers;
context-sensitive constraint checking; grammar;
grammars; implementation languages; parser; recursive
descent parsing",
treatment = "T Theoretical or Mathematical",
}
@Article{Ida:1983:SFA,
author = "T. Ida",
title = "Some {FP} algebra with {Currying} operation",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "259--261",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Information Sci. Lab., Inst. of Phys. and Chem. Res.,
Saitama, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic equations; bu; Currying operation; FP
algebra; FP system; functional programming; programming
theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Kolla:1983:WOS,
author = "Reiner Kolla",
title = "Where-Oblivious is not Sufficient",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "263--268",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35",
MRnumber = "85h:68026",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "713; 714; 921; C4240 (Programming and algorithm
theory)",
corpsource = "Inst. f{\"u}r Angewandte Math. und Informatik, Univ.
des Saarlandes, Saarbrucken, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "complexity theory; computational complexity;
input-output schedule; integrated circuits, VLSI; large
scale integration; Thompson's model; Thompson's VLSI
model; VLSI; when-oblivious; where-oblivious",
treatment = "T Theoretical or Mathematical",
}
@Article{Tsin:1983:GPS,
author = "Yung H. Tsin and Francis Y. Chin",
title = "A general program scheme for finding bridges",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "269--272",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10 (05C40 68Q20)",
MRnumber = "85i:68039",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computing Sci., Univ. of Alberta, Edmonton,
Alta., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "analysis of algorithms; bridges; combinatorial
problems; computer programming; graph theory;
mathematical techniques --- Graph Theory; optimal
parallel algorithms; optimal sequential algorithms;
parallel computation; program scheme; undirected
graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Asai:1983:CPI,
author = "Hitohisa Asai",
title = "A consideration of a practical implementation for a
new convergence division",
journal = j-INFO-PROC-LETT,
volume = "17",
number = "5",
pages = "273--281",
day = "15",
month = dec,
year = "1983",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65V05 (68M05)",
MRnumber = "85d:65077",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C5230 (Digital arithmetic methods)",
corpsource = "Computer Sci. Dept., Christopher Newport Coll.,
Newport News, VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; convergence division; digital
arithmetic; division algorithm; performance time; table
size",
treatment = "P Practical",
}
@Article{Kasyanov:1984:LC,
author = "V. N. Kas{\cprime}yanov",
title = "Loop Cleaning",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "1--6",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N05",
MRnumber = "85e:68005",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150C (Compilers, interpreters and other
processors)",
corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "compilers; computer programming; equivalent program
transformations; large block schema; loop; loop
cleaning; optimisation; program compilers; program
optimizations; recursive procedure body",
treatment = "P Practical",
}
@Article{Magott:1984:PEC,
author = "Jan Magott",
title = "Performance Evaluation of Concurrent Systems Using
{Petri} Nets",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "7--13",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q90",
MRnumber = "85f:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics); C5420
(Mainframes and minicomputers)",
corpsource = "Inst. of Cybernetics, Tech. Univ. Wroclaw, Wroclaw,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; concurrent systems;
exponential complexity; graph theory; LP; mathematical
techniques --- Graph Theory; minimal cycle time;
NP-complete; parallel processing; performance
evaluation; Petri nets; polynomial algorithm",
treatment = "P Practical",
}
@Article{Saoudi:1984:ITL,
author = "A. Saoudi",
title = "Infinitary Tree Languages Recognized by
$\omega$-automata",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "15--19",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D05 (68Q05 68Q45)",
MRnumber = "85e:03092",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C1160 (Combinatorial mathematics); C4210
(Formal logic); C4220 (Automata theory)",
corpsource = "Univ. de Paris VII, Paris, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "AFL-like operations; automata theory; formal
languages; infinite Sigma-trees; omega-automata;
omega-languages; Rabin's automata; regular recursive
schemas; top-down infinite tree automata; trees
(mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Kreowski:1984:NNR,
author = "Hans-J{\"o}rg Kreowski and Grzegorz Rozenberg",
title = "Note on node-rewriting graph grammars",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "21--24",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "85f:68053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Fachbereich Math. und Informatik, Tech. Univ. Bremen,
Bremen, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Berlin approach; gluing; grammars; graph theory; NLC
approach; node-labeled undirected; node-rewriting graph
grammars",
treatment = "T Theoretical or Mathematical",
}
@Article{Rowe:1984:DIS,
author = "Neil C. Rowe",
title = "Diophantine Inference on a Statistical Database",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "25--31",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Naval Postgraduate School,
Monterey, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "database management systems; database systems; DBMS;
inferences; queryable values; simultaneous Diophantine
equations; statistical aggregates; statistical
analysis; statistical database",
treatment = "P Practical",
}
@Article{Topor:1984:TDD,
author = "Rodney W. Topor",
title = "Termination Detection for Distributed Computations",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "33--36",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C1160 (Combinatorial mathematics); C6150J
(Operating systems)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; computer systems, digital;
concurrency; CSP; distributed computations; distributed
processing; graph theory; operating systems
(computers); OS; program derivation; termination",
treatment = "P Practical",
}
@Article{Atallah:1984:PSO,
author = "Mikhail J. Atallah",
title = "Parallel Strong Orientation of an Undirected Graph",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "37--39",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (05C20 68R10)",
MRnumber = "85j:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); 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 = "common memory; computer programming --- Algorithms;
computer systems, digital --- Parallel Processing;
graph theory; mathematical techniques; operating
systems (computers); parallel processing; parallel
solutions; read conflicts; shared memory model; strong
orientation; undirected graph; write conflicts",
treatment = "P Practical",
}
@Article{Chin:1984:MVD,
author = "Francis Chin and Cao An Wang",
title = "Minimum vertex distance between separable convex
polygons",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "41--45",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (52-04)",
MRnumber = "85f:68090",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computing Sci., Univ. of Alberta, Edmonton,
Alta., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; graph theory; minimum vertex
distance; optimal algorithm; separable convex
polygons",
treatment = "T Theoretical or Mathematical",
}
@Article{Jin:1984:LPG,
author = "Xiao Long Jin",
title = "Large Processors are Good in {VLSI} Chips",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "47--49",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35",
MRnumber = "85c:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "713; 714; B0250 (Combinatorial mathematics); B1130
(General circuit analysis and synthesis methods); B2570
(Semiconductor integrated circuits)",
corpsource = "Dept. of Telecommunication, Shanghai Inst. of Railway
Technol., Shanghai, China",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "circuit layout; graph theory; I/O port; integrated
circuits, VLSI; large scale integration; monolithic
integrated circuits; separator",
treatment = "T Theoretical or Mathematical",
}
@Article{Yodogawa:1984:NAG,
author = "Eiji Yodogawa",
title = "A note on array grammars",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "51--54",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U10 (68Q45)",
MRnumber = "85k:68098",
MRreviewer = "Rani Siromoney",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Musachino Electrical Communication Lab., Nippon
Telegraph and Telephone Public Corp., Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "array grammars; digital picture processing; grammars;
isometric array grammars; mathematical models; shearing
effect; two-dimensional phrase-structure grammars",
treatment = "P Practical",
}
@Article{Geist:1984:PCD,
author = "R. Geist",
title = "Perception-based configuration design of computer
systems",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "1",
pages = "55--57",
day = "20",
month = jan,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture)",
corpsource = "Dept. of Computer Sci., Duke Univ., Durham, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "computer architecture; computer systems; configuration
design; perceived mean; student perceptions",
treatment = "P Practical",
}
@Article{Dyer:1984:PAM,
author = "M. E. Dyer and A. M. Frieze",
title = "A partitioning algorithm for minimum weighted
{Euclidean} matching",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "59--62",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (68R05 90C35)",
MRnumber = "85h:68018",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B6140C (Optical information, image and video
signal processing); C1250 (Pattern recognition)",
corpsource = "Dept. of Maths. and Statistics, Teesside Polytech.,
Middlesbrough, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; fast expected running time;
minimum weighted Euclidean matching; partitioning
algorithm; pattern recognition; picture processing;
unit square",
treatment = "T Theoretical or Mathematical",
}
@Article{Hull:1984:PVS,
author = "M. Elizabeth C. Hull",
title = "A parallel view of stable marriages",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "63--66",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "School of Computer Sci., Ulster Polytech.,
Newtownabbey, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; coroutine; data structures;
parallel processing; parallelism; recursion; stable
marriages",
treatment = "P Practical",
}
@Article{Schlorer:1984:ISC,
author = "Jan Schl{\"o}rer",
title = "Insecurity of Set Controls for Statistical Databases",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "67--71",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques); C6160
(Database management systems (DBMS))",
corpsource = "Klinische Dokumentation, Univ. Ulm, Ulm, West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "database management systems; database systems; DBMS;
inference controls; insecure; query set; security of
data; set controls; statistical databases; statistics",
treatment = "P Practical",
}
@Article{Turpin:1984:EBB,
author = "Russell Turpin and Brian A. Coan",
title = "Extending Binary {Byzantine Agreement} to Multivalued
{Byzantine Agreement}",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "73--76",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Information Research Associates, Austin, TX, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary Byzantine agreement; computer programming ---
Algorithms; computer systems, digital; distributed
processing; distributed systems; fault tolerance;
multivalued Byzantine agreement; multivalued domain;
operating systems (computers); OS",
treatment = "P Practical",
}
@Article{Holenderski:1984:NSV,
author = "Leszek Holenderski",
title = "A note on specifying and verifying concurrent
processes",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "77--85",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (68Q60)",
MRnumber = "86c:68021",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Univ. of Warsaw, Warsaw,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "alphabet symbols; binary semaphores; computer systems,
digital; concurrent computations; concurrent processes;
correctness proof; finite alphabet; finite sequences;
parallel processing; programming theory; sequential
processes; shuffle; specifying; unbounded semaphore;
verifying",
treatment = "T Theoretical or Mathematical",
}
@Article{Katsuno:1984:WDN,
author = "Hirofumi Katsuno",
title = "When Do Non-Conflict-Free Multivalued Dependency Sets
Appear?",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "87--92",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "86h:68028",
MRreviewer = "W. W. Armstrong",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160D (Relational databases)",
corpsource = "Musashino Electrical Communication Lab., NTT, Tokyo,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Armstrong relation; Cartesian product; conflict-free
sets; data dependencies; database management systems;
database systems; database theory; distributed
databases; functional dependency; integrity
constraints; multivalued dependency sets; relational
database",
treatment = "P Practical",
}
@Article{Ihm:1984:LPP,
author = "Heung-Soon S. Ihm and Simeon C. Ntafos",
title = "On Legal Path Problems in Digraphs",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "93--98",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10 (05-04 05C20)",
MRnumber = "85h:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C4240 (Programming and algorithm theory);
C6150G (Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "ISC Corporation, Spokane, WA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computationally intractable; computer programming ---
Algorithms; digraphs; directed graphs; impossible
paths; legal path problems; mathematical techniques; NP
completeness; program testing; programming theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Scarioni:1984:PAE,
author = "F. Scarioni and H. G. Speranza",
title = "A probabilistic analysis of an error-correcting
algorithm for the {Towers} of {Hanoi} puzzle",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "99--103",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "87j:68057",
MRreviewer = "Derick Wood",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1290 (Applications of systems theory)",
corpsource = "Dept. of Maths., Univ. of Milan, Milano, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "disks; error-correcting algorithm; iterative methods;
legal move; needles; operations research; probabilistic
analysis; towers of Hanoi Puzzle",
treatment = "T Theoretical or Mathematical",
}
@Article{Miyano:1984:RTW,
author = "Satoru Miyano",
title = "Remarks on Two-Way Automata with Weak-Counters",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "105--107",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (68Q45)",
MRnumber = "86g:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Maths., Kyushu Univ., Fukuoka, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "add; automata theory; counter; deterministic automata;
nonnegative integer; recognition power; subtract;
two-way automata; weak-counter; zero test",
treatment = "P Practical",
}
@Article{Lee:1984:CCM,
author = "C. C. Lee and D. T. Lee",
title = "On a Circle-Cover Minimization Problem",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "2",
pages = "109--115",
day = "28",
month = feb,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "85h:68080",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; B0250 (Combinatorial mathematics); B0260
(Optimisation techniques); C1160 (Combinatorial
mathematics); C1180 (Optimisation techniques)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Northwestern Univ., Evanston, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "circle-cover minimization problem; circular-arcs;
computational geometry; computer programming; graph
theory; minimisation; minimum cover problem; union",
treatment = "T Theoretical or Mathematical",
}
@Article{Wilf:1984:BET,
author = "Herbert S. Wilf",
title = "Backtrack: an {$O(1)$} expected time algorithm for the
graph coloring problem",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "119--121",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05C15 68R10)",
MRnumber = "86c:68036",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Maths., Univ. of Pennsylvania, Philadelphia,
PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "backtrack algorithm; computer programming; decision
problem; decision theory and analysis; graph coloring
problem; graph colouring; mathematical techniques ---
Graph Theory; O(1) expected time algorithm; search
tree; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Zemel:1984:ALM,
author = "Eitan Zemel",
title = "An {$O(n)$} algorithm for the linear multiple choice
{Knapsack} problem and related problems",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "123--128",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90C08 (68Q25)",
MRnumber = "85h:90083",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B0260 (Optimisation techniques); C1180 (Optimisation
techniques)",
corpsource = "J.L. Kellogg Graduate School of Management,
Northwestern Univ., Evanston, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convex programming; geometric location models; linear
multiple choice Knapsack problem; linear programming;
O(n) algorithm; rectilinear norm",
treatment = "T Theoretical or Mathematical",
}
@Article{Moller-Nielsen:1984:EFS,
author = "Peter Moller-Nielsen and Jorgen Staunstrup",
title = "Experiments with a Fast String Searching Algorithm",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "129--135",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; computer programming; fast string
searching algorithm; MultiMaren multiprocessor;
multiprocessing systems; multiprocessor; string
searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Remmers:1984:TDL,
author = "J. H. Remmers",
title = "A technique for developing loop invariants",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "137--139",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Maths. and Computer Sci., Eastern Michigan
Univ., Ypsilanti, MI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary search; linear search; loop invariants
development; postcondition; precondition; programming
theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Alia:1984:FVC,
author = "G. Alia and F. Barsi and E. Martinelli",
title = "A fast {VLSI} conversion between binary and residue
systems",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "141--145",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B1130B (Computer-aided circuit analysis and design);
B2570 (Semiconductor integrated circuits); C7410D
(Electronic engineering computing)",
corpsource = "Istituto di Elaborazione dell'Informazione, CNR, Pisa,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "binary number systems; circuit layout CAD; circuit
layouts; fast VLSI conversion; large scale integration;
residue systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Berkowitz:1984:CDS,
author = "Stuart J. Berkowitz",
title = "On Computing the Determinant in Small Parallel Time
Using a Small Number of Processors",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "147--150",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65W05 (68Q15)",
MRnumber = "85k:65111",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto,
Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "arbitrary commutative ring; characteristic polynomial;
computational complexity; computer systems, digital;
determinant; parallel algebraic circuit complexity;
parallel time; polynomials; processors; upper bounds",
treatment = "T Theoretical or Mathematical",
}
@Article{Turan:1984:CCG,
author = "Gy{\"o}rgy Tur{\'a}n",
title = "The critical complexity of graph properties",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "151--153",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15 (05C99 68R10 94C15)",
MRnumber = "86d:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. for Okonometrie und Operations Res., Rheinische
Friedrich-Wilhelms-Univ., Bonn, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Boolean function; computational complexity; critical
complexity; graph properties; graph theory; parallel
complexity; parallel processing",
treatment = "T Theoretical or Mathematical",
}
@Article{Apostolico:1984:PMM,
author = "A. Apostolico and R. Giancarlo",
title = "Pattern matching machine implementation of a fast test
for unique decipherability",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "155--158",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C1160 (Combinatorial mathematics); C1250
(Pattern recognition); C1260 (Information theory)",
corpsource = "ISI, Univ. of Salerno, Salerno, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "codes; fast implementation; graph theory; pattern
matching machine; pattern recognition; Sardinas-
Patterson-Even test; unique decipherability",
treatment = "N New Development; T Theoretical or Mathematical",
}
@Article{Cormack:1984:AAH,
author = "Gordon V. Cormack and R. Nigel Horspool",
title = "Algorithms for Adaptive {Huffman} Codes",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "159--165",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A29 (94B30)",
MRnumber = "86g:94032",
MRreviewer = "N. L. Aggarwal",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1260 (Information theory)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "adaptive Huffman codes algorithms; binary tree; codes;
codes, symbolic; computer programming --- Algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Miola:1984:AAA,
author = "Alfonso Miola",
title = "Algebraic approach to $p$-adic conversion of rational
numbers",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "167--171",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "11A63 (11Y99 68Q99)",
MRnumber = "86d:11012",
MRreviewer = "J. C. Lagarias",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Istituto di Analisi dei Sistemi ed Informatica, CNR,
Roma, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algebraic approach; approximation method; continued
fraction expansion; direct mappings; Hensel-codes;
inverse mappings; number theory; p-adic conversion;
rational numbers",
treatment = "T Theoretical or Mathematical",
}
@Article{Lickteig:1984:NBR,
author = "Thomas Lickteig",
title = "A note on border rank",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "3",
pages = "173--178",
day = "30",
month = mar,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (65F30)",
MRnumber = "86c:68040",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Maths. Inst., Univ. T{\"u}bingen, T{\"u}bingen, West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "border rank; closed condition; computational
complexity; structural tensor; tensors",
treatment = "T Theoretical or Mathematical",
}
@Article{Cioni:1984:PDD,
author = "Gianna Cioni and Antoni Kreczmar",
title = "Programmed Deallocation without Dangling Reference",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "179--187",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation)",
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 = "algorithmic approach; computer programming languages;
constant time; dangling reference; data processing ---
Security of Data; dynamic languages; free frames
structure; parallel computation; programmed
deallocation strategy; programming theory; run-time
systems; searching; storage management",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Moffat:1984:PQA,
author = "Alistair Moffat and Tadao Takaoka",
title = "A priority queue for the all pairs shortest path
problem",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "189--193",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 922; C1140C (Queueing theory); C6120 (File
organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Canterbury,
Christchurch, New Zealand",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "all pairs shortest path problem; array priority queue;
computational model; computer programming ---
Algorithms; data operations; data processing --- Data
Structures; data structure; data structures; Dijkstra's
shortest path algorithm; parallel chains data
structure; path costs; pointer manipulations; priority
queue; probability; queueing theory; restricted
situation; Yen's bound",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Allison:1984:TSP,
author = "D. C. S. Allison and M. T. Noga",
title = "The {$L_1$} traveling salesman problem",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "195--199",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C1290 (Applications
of systems theory)",
corpsource = "Dept. of Computer Sci., Virginia Polytech. Inst. and
State Univ., Blacksburg, VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "convex hull; decomposition procedure; heuristic
programming; initial subtour; L/sub 1/ traveling
salesman problem; operations research; polynomial-time
heuristics; tour optimality",
treatment = "T Theoretical or Mathematical",
}
@Article{Tiekenheinrich:1984:LBM,
author = "J{\"u}rgen Tiekenheinrich",
title = "A $4n$-lower bound on the monotone network complexity
of a one-output {Boolean} function",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "201--202",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94C10",
MRnumber = "85m:94048",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "4n-lower bound; binary functions; Boolean functions;
majority-function; monotone network complexity;
one-output Boolean function",
treatment = "T Theoretical or Mathematical",
}
@Article{Mannila:1984:SLA,
author = "Heikki Mannila and Esko Ukkonen",
title = "A simple linear-time algorithm for in situ merging",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "203--208",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "bounded workspace; computer programming ---
Algorithms; computer systems programming;
divide-and-conquer algorithm; linear-time algorithm;
merging; ordered lists; programming theory; sorting;
sublinear workspace",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1984:NCI,
author = "Susumu Yamasaki and Mikio Yoshida and Shuji Doshita
and Mikito Hirata",
title = "A new combination of input and unit deductions for
{Horn} sentences",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "209--213",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68T15 (03B35)",
MRnumber = "86c:68072",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory; formal languages; formal logic;
Horn sentences; input; input refutation; logic
programs; theorem proving; unit deductions; variable
substitution procedures",
treatment = "T Theoretical or Mathematical",
}
@Article{Best:1984:FC,
author = "Eike Best",
title = "Fairness and conspiracies",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "215--220",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q90 (68Q10)",
MRnumber = "85h:68053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum \cite{Best:1984:EFC}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "GMD-Fi, St. Augustin, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "concurrent programs; conspiracies; fairness; formal
logic; multiprocessing programs; nets; Petri nets",
treatment = "T Theoretical or Mathematical",
}
@Article{Lifschitz:1984:VPG,
author = "Vladimir Lifschitz",
title = "On verification of programs with {GOTO} statements",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "221--225",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q60 (03B70)",
MRnumber = "86h:68120",
MRreviewer = "Andrzej Blikle",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Univ. of Texas, El Paso, TX,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "annotated program; complete proofs; correctness proof;
de Bruin; equivalence; GOTO statements; Hoare's logic;
informal proof; intermittent assertions; programming
theory; programs; syntax",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Ohya:1984:FVA,
author = "T. Ohya and M. Iri and K. Murota",
title = "A fast {Voronoi}-diagram algorithm with quaternary
tree bucketing",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "227--231",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Univ.
of Tokyo, Tokyo, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; fast practical algorithm;
generators; incremental method; preprocessing
procedure; quaternary tree bucketing; robust; trees
(mathematics); Voronoi-diagram algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Atzeni:1984:FDR,
author = "Paolo Atzeni and Nicola M. Morfuni",
title = "Functional Dependencies in Relations with Null
Values",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "4",
pages = "233--238",
day = "14",
month = may,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160D (Relational databases)",
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 = "database management systems; database systems;
framework; functional dependencies; functional
dependency; generality; inference rules; naturalness;
null values; relational database; relational databases;
relational model; semantics",
treatment = "T Theoretical or Mathematical",
}
@Article{Monien:1984:DTW,
author = "B. Monien",
title = "Deterministic Two-Way One-Head Pushdown Automata are
Very Powerful",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "239--242",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D05 68Q15)",
MRnumber = "85j:68034",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Univ. of Paderborn, Paderborn, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "2DPDA; automata theory; complexity classes;
computational complexity; finite automata; formal
languages; one-letter input alphabet; pushdown
automata; two-letter alphabet; unary encoding",
treatment = "T Theoretical or Mathematical",
}
@Article{Fle:1984:MIT,
author = "M. P. Fl{\'e} and G. Roucairol",
title = "Multiserialization of Iterated Transactions",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "243--247",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10 (68N25)",
MRnumber = "85j:68018",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Lab. de Recherche en Informatique, Univ. Paris-Sud,
Orsay, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "concurrency; concurrent transactions; data base
systems; database management systems; database systems;
deadlock; iterated transactions; mutual exclusion;
operating system; serializability; serialization",
treatment = "T Theoretical or Mathematical",
}
@Article{Barth:1984:ACT,
author = "Gerhard Barth",
title = "An analytical comparison of two string searching
algorithms",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "249--256",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "85m:68012",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Informatik, Univ. Kaiserslautern,
Kaiserslautern, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; average case analysis; average case
complexities; combinatorial algorithms; comparisons;
complexity; computer programming; heuristics; KMP
algorithm; Knuth-Morris-Pratt algorithm; Markov chain
theory; pattern matching algorithms; string searching
algorithms; trial-and-error",
treatment = "T Theoretical or Mathematical",
}
@Article{Vardi:1984:NLD,
author = "Moshe Y. Vardi",
title = "A note on lossless database decompositions",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "257--260",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "86a:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "database management systems; dependencies; lossless
database decompositions; lossless join; relation
schemes",
treatment = "T Theoretical or Mathematical",
}
@Article{Goodman:1984:CMD,
author = "Nathan Goodman and Y. C. Tay",
title = "A characterization of multivalued dependencies
equivalent to a join dependency",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "261--266",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "85m:68007",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Boston Univ., Boston, MA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "acyclic database schemas; acyclicity; conflict-free
cover; database management systems; database systems;
JD; join dependencies; join dependency; multivalued
dependencies; MVDS; subset property",
treatment = "T Theoretical or Mathematical",
}
@Article{Blazewicz:1984:SIP,
author = "J. Blazewicz and J. Weglarz and M. Drabowski",
title = "Scheduling independent $2$-processor tasks to minimize
schedule length",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "267--273",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Inst. Automatyki, Politech. Poznanska, Poznan,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; deterministic scheduling
theory; independent 2- processor tasks; microprocessor
systems; parallel processing; preemptive scheduling;
schedule-length; scheduling",
treatment = "T Theoretical or Mathematical",
}
@Article{Trakhtenbrot:1984:SET,
author = "M. B. Trakhtenbrot",
title = "Some Equivalent Transformations of Recursive Programs
Based on Their Schematic Properties",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "275--283",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q55 (68N05)",
MRnumber = "86g:68116",
MRreviewer = "Ir{\`e}ne Guessarian",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "complexity; computer metatheory; computer programming
--- Theory; equivalent transformations; program
transformation; programming theory; recursive programs;
schematic properties",
treatment = "T Theoretical or Mathematical",
}
@Article{Courcelle:1984:SNR,
author = "Bruno Courcelle",
title = "Some negative results concerning {DPDAs}",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "285--289",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05",
MRnumber = "86i:68030",
MRreviewer = "Yasuyoshi Inagaki",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Univ. Bordeaux-I, Dept. of Maths., Talence, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "deterministic pushdown automaton; DPDA; equivalence;
finite automata; mapping; rational transduction;
regularity",
treatment = "T Theoretical or Mathematical",
}
@Article{Tazawa:1984:CRP,
author = "Shinsei Tazawa",
title = "On the consecutive retrieval property for generalized
binary queries",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "291--293",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P20",
MRnumber = "86j:68025",
MRreviewer = "Fabrizio Luccio",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C6120 (File
organisation)",
corpsource = "Faculty of Sci. and Technol., Kinki Univ., Osaka,
Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "attributes; binary queries; consecutive retrieval
property; CR-sequence; CRP; file organisation; file
organization; lower bound; retrieval time; storage
space",
treatment = "T Theoretical or Mathematical",
}
@Article{Friesen:1984:SSS,
author = "D. K. Friesen and M. A. Langston",
title = "A storage-size selection problem",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "295--296",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "86b:68019",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Computer Sci. Dept., 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 = "algorithm theory; approximation algorithms; bin
packing problem; bin size; computer programming; memory
allocation; storage allocation; storage-size selection;
wasted space; worst-case analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Zak:1984:LEF,
author = "Stanislav {\v{Z}}{\'a}k",
title = "Letter to the editor: {``Finitary and infinitary
interpretations of languages'' [Math. Systems Theory
{\bf 15} (1981/82), no. 3, 251--265; MR 83h:68119] by
H. A. Maurer, A. Salomaa and D. Wood}",
journal = j-INFO-PROC-LETT,
volume = "18",
number = "5",
pages = "297--298",
day = "18",
month = jun,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (05C15)",
MRnumber = "85k:68052",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Madduri:1984:EBA,
author = "Hari Madduri and Raphael Finkel",
title = "Extension of the {Banker}'s Algorithm for Resource
Allocation in a Distributed Operating System",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "1--8",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90119-4",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901194",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "banker's algorithm; Banker's algorithm; computer
operating systems; computer programming; computer
systems, digital --- Distributed; deadlock avoidance;
deadlocks; distributed environment; operating systems
(computers); resource allocation",
treatment = "T Theoretical or Mathematical",
}
@Article{Oyamaguchi:1984:SRS,
author = "Michio Oyamaguchi",
title = "Some Remarks on Subclass Containment Problems for
Several Classes of {DPDA}'s",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "9--12",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90120-0",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D05 68Q45)",
MRnumber = "86d:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901200",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Faculty of Engng., Mie Univ., Tsu-shi, Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; deterministic automata; deterministic
pushdown automata; deterministic pushdown automaton;
DPDA; necessary stacking derivation; subclass
containment; subclass containment problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Woo:1984:PDP,
author = "Nam Sung Woo and Carl H. Smith and Ashok Agrawala",
title = "A proof of the determinacy property of the data flow
schema",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "13--16",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90121-2",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q99",
MRnumber = "85m:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901212",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "abstract semantics; APPLY actors; computer metatheory;
data flow determinacy; data flow schema; determinacy;
deterministic automata; SWITCH actors",
treatment = "T Theoretical or Mathematical",
}
@Article{Parker:1984:CCS,
author = "J. R. Parker",
title = "On Converting Character Strings to Integers",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "17--19",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90122-4",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901224",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Calgary, Calgary,
Alta., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "character strings; character to integer conversion;
computer programming; integer overflow; programming
theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Bechtold:1984:UEH,
author = "Ulrich Bechtold and Klaus K{\"u}spert",
title = "On the Use of Extendible Hashing without Hashing",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "21--26",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90123-6",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901236",
abstract = "The authors report on the use of decimal numbers coded
in EBCDIC which are stored in the EXHASH table without
prior randomization. Thus, they do not distinguish
between keys and pseudokeys. This allows for the
sequential processing of records in key order which is
commonly needed in database applications. The
performance of the method is compared to that of
perfect randomization by means of simulation series.
The results indicate that packed decimal keys can be
used in EXHASH without randomization, whereas the use
of unpacked decimal keys necessitates randomization to
avoid an intolerable growth of the EXHASH directory.
The storage utilization in the leaves (hash buckets),
however, is shown to be fairly high both in the case of
packed and of unpacked decimal pseudokeys.",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Dept of Computer Sci., Univ. of Kaiserslautern,
Kaiserslautern, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "data processing; data records; data structures;
decimal numbers; direct access; dynamic hashing;
EBCDIC; extendible hashing; extensibility; hash table;
hashing; perfect randomization method; randomization;
unpacked decimal numbers",
treatment = "T Theoretical or Mathematical",
}
@Article{Faigle:1984:MCT,
author = "Ulrich Faigle and Rainer Schrader",
title = "Minimizing Completion Time for a Class of Scheduling
Problems",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "27--29",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90124-8",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90B35",
MRnumber = "85h:90062",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901248",
acknowledgement = ack-nhfb,
classification = "913; 921; C6150J (Operating systems)",
corpsource = "Dept. of Operations Res., Rheinische
Friedrich-Wilhelms-Univ., Bonn, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "greedy algorithm; N-free ordered sets; optimization;
precedence constraints; scheduling; setup minimization;
weighted linear scheduling problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Savitch:1984:PRT,
author = "Walter J. Savitch and Paul M. B. Vit{\'a}nyi",
title = "On the Power of Real-Time Two-Way Multihead Finite
Automata with Jumps",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "31--35",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90125-X",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D05)",
MRnumber = "85j:68036",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/002001908490125X",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, San Diego, La Jolla, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; finite automata; jumps;
nondeterminism; number of heads; real-time finite
automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Bertossi:1984:DSS,
author = "Alan A. Bertossi",
title = "Dominating sets for split and bipartite graphs",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "37--40",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90126-1",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05C35 68R10)",
MRnumber = "86a:68034",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901261",
acknowledgement = ack-nhfb,
classification = "921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dipartimento di Informatica, Univ. di Pisa, Pisa,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "bipartite graphs; chordal graphs; dominating set;
graph theory; mathematical techniques; minimum
cardinality dominating set; split graphs; undirected
graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Subrahmanyam:1984:EFL,
author = "P. A. Subrahmanyam and J.-H. You",
title = "On Embedding Functions in Logic",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "41--46",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90127-3",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68T25",
MRnumber = "86b:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901273",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory);
C6140D (High level languages)",
corpsource = "Dept. of Computer Sci., Univ. of Utah, Salt Lake City,
UT, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming languages; embedding functions;
first-order predicate logic; functions; high level
languages; infinite data structures; knowledge-based
inferencing; lazy reduction; logic; logic-based
languages; pattern-driven reduction; programming
theory; Prolog; reduction mechanism; search-based
computations; software engineering; terminating
computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Akl:1984:OAP,
author = "Selim G. Akl",
title = "An optimal algorithm for parallel selection",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "47--50",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90128-5",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "85j:68017",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901285",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computing and Information 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 theory; computational complexity; computer
programming; computer systems, digital --- Parallel
Processing; optimal total cost; parallel selection",
treatment = "T Theoretical or Mathematical",
}
@Article{Manber:1984:PLB,
author = "Udi Manber",
title = "A probabilistic lower bound for checking disjointness
of sets",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "51--53",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90129-7",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "86d:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901297",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Wisconsin, Madison,
WI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; computational complexity; computer
programming; disjointness; probabilistic algorithms;
probabilistic choices; probability of error; time
speedup",
treatment = "T Theoretical or Mathematical",
}
@Article{Spirakis:1984:SNH,
author = "Paul Spirakis and Chee K. Yap",
title = "Strong {NP}-hardness of moving many discs",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "1",
pages = "55--59",
day = "26",
month = jul,
year = "1984",
CODEN = "IFPLAT",
DOI = "http://dx.doi.org/10.1016/0020-0190(84)90130-3",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (68Q25)",
MRnumber = "86a:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0020019084901303",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., New York,
NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "algorithm theory; computational complexity;
coordination problems; discs; Many (Moving) Bodies
Problem; Many Discs Problem; motion; robot system",
treatment = "T Theoretical or Mathematical",
}
@Article{Alt:1984:PMR,
author = "Helmut Alt and Kurt Mehlhorn and J. Ian Munro",
title = "Partial Match Retrieval in Implicit Data Structures",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "61--65",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10 (68Q25)",
MRnumber = "86g:68018",
MRreviewer = "Ernst-Erich Doberkat",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "combinatorial problems; data processing; data
structures; database management systems; DBMS; implicit
data structures; information retrieval; keys; partial
match query",
treatment = "P Practical",
}
@Article{Martin:1984:PFA,
author = "Alain J. Martin and Martin Rem",
title = "A presentation of the {Fibonacci} algorithm",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "67--68",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "11Y55 (05-04 05A10 11B39)",
MRnumber = "85m:11093",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., California Inst. of Technol.,
Pasadena, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Fibonacci algorithm; mathematics",
treatment = "P Practical",
}
@Article{McKeown:1984:CPM,
author = "G. P. McKeown and V. J. Rayward-Smith",
title = "Communication Problems on {MIMD} Parallel Computers",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "69--73",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C5220 (Computer architecture); C5420
(Mainframes and minicomputers)",
corpsource = "School of Computing Studies and Accountancy, Univ. of
East Anglia, Norwich, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary n-cube; bottlenecks; communication problems;
computer architecture; computer systems, digital; hot
potato principle; MIMD parallel computers; networks;
parallel processing; VLSI",
treatment = "P Practical",
}
@Article{Palvia:1984:ABA,
author = "Prashant Palvia and Salvatore T. March",
title = "Approximating Block Accesses in Database
Organizations",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "75--79",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4290 (Other computer theory); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Computer and Information Sci., Temple Univ.,
Philadelphia, PA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "block accesses; blocking factor; computation theory;
database management systems; database organizations;
database systems; DBMS; design; query",
treatment = "T Theoretical or Mathematical",
}
@Article{Luque:1984:ILP,
author = "E. Luque and A. Ripoll",
title = "Integer Linear Programming for Microprograms Register
Allocation",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "81--85",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; 921; C1180 (Optimisation techniques);
C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
corpsource = "Dept. de Electricidad y Electronica, Univ. Autonoma de
Barcelona, Barcelona, Spain",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer architecture --- Microprogramming; control
flow; execution time; global internal register
allocation; integer linear programming; integer
programming; linear programming; mathematical
programming, linear; microcoded; microprogramming;
microprograms register allocation; register allocation;
relative frequencies; step executions; storage
allocation",
treatment = "T Theoretical or Mathematical",
}
@Article{Klupsz:1984:LAD,
author = "Ewa Klupsz",
title = "A linear algorithm of a deadlock avoidance for
nonpreemptible resources",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "87--94",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N25",
MRnumber = "86d:68015",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150J (Operating systems)",
corpsource = "Inst. of Biocybernetics and Biomed. Engng., Polish
Acad. of Sci., Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; deadlock avoidance; fault
tolerant computing; Habermann's algorithm; linear
algorithm; maximum requests; multitype resource
systems; nonpreemptible resources; parallel processing;
partitioning processes; resource allocation",
treatment = "P Practical",
}
@Article{Lotti:1984:ATT,
author = "Grazia Lotti",
title = "Area-time tradeoff for rectangular matrix
multiplication in {VLSI} models",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "95--98",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35 (65F30 94C05)",
MRnumber = "86a:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "B1130B (Computer-aided circuit analysis and design);
B1265B (Logic circuits); C5210 (Logic design methods);
C7410D (Electronic engineering computing)",
corpsource = "Dipartimento di Informatica, Univ. di Pisa, Pisa,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "area time complexity; CAD; circuit layout CAD;
integrated logic circuits; large scale integration;
logic design; matrix algebra; rectangular matrix
multiplication; VLSI models",
treatment = "T Theoretical or Mathematical",
}
@Article{Lipski:1984:MPA,
author = "Witold {Lipski, Jr.}",
title = "An {$O(n \log n)$ Manhattan} path algorithm",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "99--102",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "86b:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Lab. de Recherche en Informatique, Univ. de Paris-Sud,
Orsay, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "complexity; computational complexity; computational
geometry; computer programming; data structure;
decision tree model; Manhattan path algorithm; O(n log
n) Manhattan path algorithm; segments; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Weyuker:1984:CDF,
author = "E. J. Weyuker",
title = "The complexity of data flow criteria for test data
selection",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "103--109",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Dept. of Computer Sci., New York Univ., New York, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "complexity; computational complexity; data flow
analysis; data flow criteria; optimizing compilers;
program testing; reliability; test data selection",
treatment = "P Practical",
}
@Article{Wyrostek:1984:ECP,
author = "Piotr Wyrostek",
title = "Erratum: {``On the `correct prefix property' in
precedence parsers'' [Inform. Process. Lett. {\bf 17}
(1983), no. 3, 161--165, MR 85a:68112]}",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "2",
pages = "111--111",
day = "31",
month = aug,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "85j:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Wyrostek:1983:CPP}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Regional Computer Center, Krakow, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "context free grammars; context-free grammars; correct
prefix property; precedence parsers; program
compilers",
treatment = "P Practical",
}
@Article{Shamir:1984:CCV,
author = "A. Shamir and C. P. Schnorr",
title = "Cryptanalysis of Certain Variants of {Rabin}'s
Signature Scheme",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "113--115",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P25 (94A60)",
MRnumber = "86e:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "cleartext attacks; cryptanalysis; cryptography;
digital signatures; natural perturbation techniques;
protect; Rabin's signature scheme",
treatment = "T Theoretical or Mathematical",
}
@Article{Treat:1984:EGS,
author = "Joseph M. Treat and Timothy A. Budd",
title = "Extensions to Grid Selector Composition and
Compilation in {APL}",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "117--123",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C6150C (Compilers, interpreters and other
processors)",
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 = "APL; APL compilation; compilation; computer operating
systems; grid selector composition; grid selector
functions; program compilers; scalar operators;
universal selector",
treatment = "T Theoretical or Mathematical",
}
@Article{Avis:1984:NPS,
author = "David Avis",
title = "Non-Partitionable Point Sets",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "125--129",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P05 (68U05)",
MRnumber = "86j:68014",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics)",
corpsource = "School 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 = "data processing; data structures; discrete
mathematics; finite set; nonpartitionable point sets;
set theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Eades:1984:AGS,
author = "Peter Eades and Brendan McKay",
title = "An algorithm for generating subsets of fixed size with
a strong minimal change property",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "131--133",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R05 (05A05)",
MRnumber = "86d:68058",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics)",
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; combinatorial algorithm; computer
programming; fixed size; generating subsets; Hamilton
path; minimal change algorithm; set; set theory; strong
minimal change property; subset generation",
treatment = "T Theoretical or Mathematical",
}
@Article{Johnson:1984:FSM,
author = "Dale Johnson and Barrett R. Bryant",
title = "Formal Syntax Methods for Natural Language",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "135--143",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 901; C4210 (Formal logic)",
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 = "context-sensitive syntax; English; formal methods;
grammars; information science; natural language;
natural languages; syntactic analysis; two-level
grammar; Vienna Definition Language",
treatment = "T Theoretical or Mathematical",
}
@Article{Kowaltowski:1984:ASM,
author = "Tomasz Kowaltowski and Antonio Palma",
title = "Another Solution of the Mutual Exclusion Problem",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "145--146",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. de Ciencia da Computacao, Univ. Estadual de
Campinas, SP, Brazil",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer systems, digital; mutual exclusion problem;
programming theory; protocols; scheduler; search loop",
treatment = "T Theoretical or Mathematical",
}
@Article{Gupta:1984:SSA,
author = "R. G. Gupta and V. S. P. Srivastava",
title = "On Synthesis of Scheduling Algorithms",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "147--150",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (68N25 90B35)",
MRnumber = "86i:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 913; C4240 (Programming and algorithm theory)",
corpsource = "Sch. of Comput. and Syst. Sci., Jawaharlal Nehru
Univ., New Delhi, India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; computer programming; program
transformation techniques; scheduling; scheduling ---
Computer Applications; scheduling algorithms;
synthesis; synthesis of algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Biskup:1984:SVT,
author = "Joachim Biskup",
title = "Some Variants of the Take-Grant Protection Model",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "151--156",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N25",
MRnumber = "86i:68010",
MRreviewer = "James W. Snively, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4290 (Other computer theory)",
corpsource = "Informatik III, Dortmund Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "access control facilities; computation theory;
computer systems; data processing; operating systems
(computers); shared resources; take-grant protection
model",
treatment = "T Theoretical or Mathematical",
}
@Article{Maio:1984:EAC,
author = "D. Maio and M. R. Scalas and P. Tiberio",
title = "On Estimating Access Costs in Relational Databases",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "157--161",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; C4250 (Database theory)",
corpsource = "Bologna Univ., Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "access costs; clustering; database systems; database
theory; query optimization; relational databases;
tuples; uniform distribution",
treatment = "T Theoretical or Mathematical",
}
@Article{Best:1984:EFC,
author = "Eike Best",
title = "Erratum: {``Fairness and conspiracies'' [Inform.
Process. Lett. {\bf 18} (1984), no. 4, 215--220; MR
85h:68053]}",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "3",
pages = "162--162",
day = "19",
month = oct,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q90 (68Q10)",
MRnumber = "86i:68101",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Best:1984:FC}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Rytter:1984:LCF,
author = "Wojciech Rytter",
title = "On Linear Context-Free Languages and One-Way Multihead
Automata",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "163--166",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (68Q15 68Q45)",
MRnumber = "86c:68019",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Warsaw Inst of Informatics, Warsaw,
Pol",
classification = "721; 723; C4210 (Formal logic); C4220 (Automata
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; computer programming --- Algorithms;
Context Free Languages; context-free languages; finite
automata; linear context-free languages;
nondeterministic finite automata; one-way finite
automata; one-way multihead automata; pushdown
automata; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Chrobak:1984:PTM,
author = "M. Chrobak and B. S. Chlebus",
title = "Probabilistic {Turing} Machines and Recursively
Enumerable {Dedekind} Cuts",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "167--171",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D10 (03D25 68Q05 68Q75)",
MRnumber = "86m:03069",
MRreviewer = "George Tourlakis",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Polish Acad of Science, Inst of Mathematics,
Warsaw, Pol",
classification = "721; C4220 (Automata theory)",
corpsource = "Inst. of Maths., 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 design; automata theory; Dedekind cut;
languages; probabilistic methods; probabilistic Turing
machine; probabilistic Turing machines; PTM; recursive
real number; recursively enumerable Dedekind cuts;
semantics; Turing machines",
treatment = "T Theoretical or Mathematical",
}
@Article{Darondeau:1984:TFP,
author = "Ph. Darondeau and L. Kott",
title = "Towards a Formal Proof System for $\omega$-Rational
Expressions",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "173--177",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q60 (03D05 68Q45)",
MRnumber = "86i:68087",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "CNRS, Inst de Recherche en Informatique et
Syst{\`e}mes Al{\'e}atoires, Rennes, Fr",
affiliationaddress = "CNRS, Inst de Recherche en Informatique et
Syst{\`e}mes Al{\'e}atoires, Rennes, Fr",
classification = "721; C4210 (Formal logic)",
corpsource = "CNRS, IRISA, Rennes I Univ., France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "abbreviated omega-languages; automata theory;
equality; equivalence proof; finitary rational
expressions; finite alphabet; Formal Languages; formal
languages; formal proof system; machine behaviours;
omega-languages; omega-rational expressions;
omega-rational languages; Salomaa's theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Chrobak:1984:NBR,
author = "Marek Chrobak",
title = "A note on bounded-reversal multipushdown machines",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "179--180",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (68Q45)",
MRnumber = "86f:68013",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Polish Acad of Science, Inst of Mathematics,
Warsaw, Pol",
classification = "721; C4210 (Formal logic)",
corpsource = "Inst. of Maths., Polish Acad. of Sci., Warsaw,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; bounded-reversal multipushdown
machines; formal languages; multicounter machines;
multipushdown machines; regular languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Grune:1984:HPA,
author = "Dick Grune",
title = "How to produce all sentences from a two-level
grammar",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "181--185",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "86c:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Free Univ, Dep of Mathematics \& Computer
Science, Amsterdam, Neth",
classification = "721; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Maths. and Comput. Sci., Free Univ.,
Amsterdam, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; automata theory; Chomsky Type 0 languages;
formal languages; formalisms; Grammars; grammars;
interpreters; languages; programming languages;
programming theory; sentence generator; theory;
two-level grammar; two-level grammars; type 0
languages; VW-grammars",
review = "ACM CR 8507-0640",
subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Grammars and Other Rewriting Systems,
Grammar types \\ D.3 Software, PROGRAMMING LANGUAGES,
Formal Definitions and Theory \\ F.4.3 Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Formal Languages, Operations on languages \\ F.4.2
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Grammars and Other Rewriting Systems,
Parsing",
treatment = "T Theoretical or Mathematical",
}
@Article{Carpi:1984:CSW,
author = "Arturo Carpi",
title = "On the Centers of the Set of Weakly Square-Free Words
on a Two Letter Alphabet",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "187--190",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (20M05)",
MRnumber = "86c:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Istituto Nazionale di Alta Matematica F. Severi,
Rome, Italy",
classification = "721; C4210 (Formal logic)",
corpsource = "Istituto Nazionale di Alta Matematica F. Severi, Roma,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; decidability; Formal Languages;
formal languages; power-free words; power-freeness;
square-free words; two letter alphabet; weakly
square-free words",
treatment = "T Theoretical or Mathematical",
}
@Article{Kral:1984:SE,
author = "J. Kral",
title = "On software equations",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "191--196",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Ceske Vysoke Uconi Technike, Inst for Computation
Techniques, Prague, Czech",
affiliationaddress = "Ceske Vysoke Uconi Technike, Inst for
Computation Techniques, Prague, Czech",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. for Comput. Tech., CVUT, Praha, Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer software; data bodies; empirical laws;
measurement; programming; programming methodology;
programming theory; software equations; software
metrics; software products",
review = "ACM CR 8506-0496",
subject = "D.2 Software, SOFTWARE ENGINEERING, Metrics",
treatment = "T Theoretical or Mathematical",
}
@Article{Kallay:1984:CIC,
author = "Michael Kallay",
title = "The complexity of incremental convex hull algorithms
in {${\bf R}^d$}",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "197--197",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (52-04 68Q25)",
MRnumber = "86c:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Oklahoma, Norman, OK, USA",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Eng. Div., Israel Aircraft Ind. Ltd., Ben Gurion Int.
Airport, Tel Aviv, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; complexity;
computational complexity; computer programming; convex
polytopes; dimensions; incremental convex hull
algorithms; real space",
treatment = "T Theoretical or Mathematical",
}
@Article{Leung:1984:ASU,
author = "Clement H. C. Leung",
title = "Approximate storage utilisation of {$B$}-trees: a
simple derivation and generalisations",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "199--201",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Coll, Dep of Computer Science, London,
Engl",
classification = "723; C4290 (Other computer theory); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Univ. Coll., London, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "B*-trees; b-trees; B-trees; data processing; Data
Structures; data structures; minimum fullness factor;
storage management; storage utilisation; storage
utilization; trees; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Walsh:1984:HES,
author = "T. R. Walsh",
title = "How Evenly Should One Divide to Conquer Quickly?",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "203--208",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (68P10)",
MRnumber = "86g:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Western Ontario, Dep of Computer
Science, London, Ont, Can",
classification = "723; 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/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; balanced division;
balancing; comparisons; computer programming;
divide-and-conquer; divide-and-conquer algorithms;
iterative merge-sorting; merge sorting; subproblems;
time complexity; time-cost",
treatment = "T Theoretical or Mathematical",
}
@Article{Dowdy:1984:TCR,
author = "Lawrence W. Dowdy and Derek L. Eager and Karen D.
Gordon and Lawrence V. Saxton",
title = "Throughput Concavity and Response Time Convexity",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "4",
pages = "209--212",
day = "12",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68M20 (68N25)",
MRnumber = "86i:68006",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Vanderbilt Univ, Computer Science Dep,
Nashville, TN, USA",
classification = "722; 723; C4290 (Other computer theory); C5470
(Performance evaluation and testing)",
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 = "computer systems programming --- Multiprogramming;
computer systems, digital; multiprogramming;
multiprogramming level; Performance; performance
evaluation; performance measures; product-form
networks; response time; response time convexity;
single-class closed queueing networks; system
parameters; system's performance; throughput;
throughput concavity",
treatment = "T Theoretical or Mathematical",
}
@Article{Karhumaki:1984:IME,
author = "Juhani Karhum{\"a}ki and Derick Wood",
title = "Inverse Morphic Equivalence on Languages",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "213--218",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "86g:68090",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Turku, Dep of Mathematics, Turku, Finl",
classification = "721; C1160 (Combinatorial mathematics); C4210
(Formal logic)",
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; equality set; equivalence classes;
existential version; Formal Languages; formal
languages; homomorphism; inverse morphic equivalence;
languages; morphisms; universal version",
treatment = "T Theoretical or Mathematical",
}
@Article{Frederickson:1984:LTA,
author = "Greg N. Frederickson",
title = "On Linear-Time Algorithms for Five-Coloring Planar
Graphs",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "219--224",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05C15 68R10)",
MRnumber = "86g:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Purdue Univ, Dep of Computer Sciences, West
Lafayette, IN, USA",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
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; Euler's formula;
five-coloring planar graphs; graph coloring; graph
colouring; Graph Theory; linear-time algorithms;
mathematical techniques; planar graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Makinen:1984:DPC,
author = "Erkki M{\"a}kinen",
title = "On Derivation Preservation",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "225--228",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "86f:68021",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Tampere, Dep of Mathematical Sciences \&
Computer Science, Tampere, Finl",
affiliationaddress = "Univ of Tampere, Dep of Mathematical Sciences \&
Computer Science, Tampere, Finl",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci. and 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; Context Free Grammars; context-free
grammars; derivations; grammatical covering;
homomorphism; nonterminal alphabets; parsing",
treatment = "T Theoretical or Mathematical",
}
@Article{Wood:1984:CPR,
author = "Derick Wood",
title = "The contour problem for rectilinear polygons",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "229--236",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "86h:68165",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Waterloo, Data Structuring Group,
Waterloo, Ont, Can",
classification = "723; C4190 (Other numerical 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 = "Algorithms; computational geometry; computer
programming; contour problem; disjoint set union;
optimal algorithm; rectilinear convex; rectilinear
polygons; scan-line paradigm; scanline; segment tree;
space algorithm; sweep plane; time algorithm;
visibility tree",
treatment = "T Theoretical or Mathematical",
}
@Article{Bourret:1984:HES,
author = "Paul Bourret",
title = "How to Estimate the Sizes of Domains",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "237--243",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Office Natl d'Etudes et de Recherches Aerospatiales,
Cent d'Etudes et de Recherches en Informatique,
Toulouse, Fr",
affiliationaddress = "Office Natl d'Etudes et de Recherches
Aerospatiales, Cent d'Etudes et de Recherches en
Informatique, Toulouse, Fr",
classification = "723; 922; C1140Z (Other topics in statistics); C4250
(Database theory)",
corpsource = "ONERA, Centre d'Etudes et de Recherches en Inf.,
Toulouse, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "confidence interval; data base; database systems;
database theory; domains of attributes; estimation;
relational databases; relational DBMS; statistical
analysis; statistical method; statistical methods",
treatment = "T Theoretical or Mathematical",
}
@Article{Tourlakis:1984:INT,
author = "George Tourlakis",
title = "An inductive number-theoretic characterization of
{NP}",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "245--247",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D15 (68Q15)",
MRnumber = "87a:03073",
MRreviewer = "A. M. Dawes",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "York Univ, Dep of Computer Science \&
Mathematics, Downsview, Ont, Can",
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Math., Atkinson Coll., York
Univ., Downsview, Ont., Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "characterization; computational complexity;
computational difficulty; computer metatheory; extended
positive rudimentary relations; NP; number theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Vyskoc:1984:NBM,
author = "Jozef Vysko{\v{c}}",
title = "A note on {Boolean} matrix multiplication",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "249--251",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "86m:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C4210 (Formal logic)",
corpsource = "Trnavska, Zilina, Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; Boolean algebra; boolean matrix
multiplication; computer programming; interval
sparsity; interval tree; mathematical techniques ---
Matrix Algebra",
treatment = "T Theoretical or Mathematical",
}
@Article{McKenzie:1984:PBD,
author = "Pierre McKenzie",
title = "Permutations of Bounded Degree Generate Groups of
Polynomial Diameter",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "253--254",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (20B99 68Q40 68R05)",
MRnumber = "86h:68077",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Toronto, Dep of Computer Science,
Toronto, Ont, Can",
classification = "921; C1110 (Algebra); C1160 (Combinatorial
mathematics); 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 = "bounded degree generate groups; Combinatorial
Mathematics; combinatorial mathematics; combinatorial
problems; computational complexity; group theory;
mathematical techniques; permutation group; polynomial
diameter",
treatment = "T Theoretical or Mathematical",
}
@Article{Gursel:1984:AOS,
author = "Goker Gursel and Peter Scheuermann",
title = "Asserting the optimality of serial {SJRPs} in
processing simple queries in chain networks",
journal = j-INFO-PROC-LETT,
volume = "19",
number = "5",
pages = "255--260",
day = "26",
month = nov,
year = "1984",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "San Diego State Univ, Dep of Mathematical
Sciences, San Diego, CA, USA",
classification = "723; C4250 (Database theory)",
corpsource = "Dept. of Math. Sci., San Diego State Univ., CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; chain networks; communication links; data
transmission; database systems; database theory;
Distributed; distributed database systems; local data
processing; performance; processing simple queries;
query processing; semi-joins; serial SJRPs",
review = "ACM CR 8509-0855",
subject = "H.2.4 Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems \\ H.2.4 Information
Systems, DATABASE MANAGEMENT, Systems, Query processing
\\ C.2.1 Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Duboc:1985:SPC,
author = "Christine Duboc",
title = "Some Properties of Commutation in Free Partially
Commutative Monoids",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "1--4",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "20M05 (68Q99)",
MRnumber = "86h:20092",
MRreviewer = "S. M. Goberstein",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ de Rouen, Lab d'Informatique, Rouen, Fr",
classification = "721; 723; C4210 (Formal logic)",
corpsource = "Lab. d'Info., Rouen Univ., Mont-Saint-Aignan, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; commutation; computer metatheory;
Formal Languages; formal languages; free partially
commutative monoids; shuffle product",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1985:CRE,
author = "Ronald V. Book and Friedrich Otto",
title = "Cancellation Rules and Extended Word Problems",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "5--11",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (03D03)",
MRnumber = "87d:68054",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Santa Barbara, Dep of Mathematics,
Santa Barbara, CA, USA",
affiliationaddress = "Univ of California, Santa Barbara, Dep of
Mathematics, Santa Barbara, CA, USA",
classification = "721; B6120B (Codes); B6150 (Communication system
theory)",
corpsource = "Dept. of Maths., 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; cancellation rules; Church--Rosser
property; church-rosser property; computer metatheory;
congruences; cryptography; extended word problems;
Formal Languages; formal model; name-stamp protocols;
protocols; public key encryption; rewriting process;
secure network communication; Thue systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Mirzaian:1985:SMS,
author = "A. Mirzaian and E. Arjomandi",
title = "Selection in $x + y$ and Matrices with Sorted Rows and
Columns",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "13--17",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "86i:68017",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "York Univ, Dep of Computer Science, Downsview,
Ont, Can",
classification = "723; C4140 (Linear algebra); C4240 (Programming and
algorithm theory); C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., York Univ., Downsview, Ont.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; Cartesian sum; columns;
computer programming; computer systems programming ---
Sorting; constant time factor; divide-and-conquer
technique; matrices; matrix algebra; order related
problems; selection problem; sorted rows; sorting;
statistics; VLSI",
treatment = "T Theoretical or Mathematical",
}
@Article{Makinen:1985:NUR,
author = "Erkki M{\"a}kinen",
title = "A note on undercover relation",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "19--21",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50 (03D05)",
MRnumber = "86h:68101",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Tampere, Dep of Mathematical Sciences \&
Computer Science, Tampere, Finl",
affiliationaddress = "Univ of Tampere, Dep of Mathematical Sciences \&
Computer Science, Tampere, Finl",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci. and 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; Context Free Grammars; context-free
grammars; decidability; decidability result;
grammatical covering; homomorphism equivalence;
parsing; undercover relation",
treatment = "T Theoretical or Mathematical",
}
@Article{McKeown:1985:SPM,
author = "G. P. McKeown",
title = "A special purpose {MIMD} parallel processor",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "23--27",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of East Anglia, Sch of Computing Studies \&
Accountancy, Norwich, Engl",
affiliationaddress = "Univ of East Anglia, Sch of Computing Studies \&
Accountancy, Norwich, Engl",
classification = "722; 723; C5440 (Multiprocessing systems)",
corpsource = "Sch. of Comput. Studies and Accountancy, East Anglia
Univ., Norwich, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "asynchronous iterative scheme; band matrix; chordal
ring network; computer systems, digital; local
communication; MIMD parallel computers; Parallel
Processing; parallel processing; special purpose MIMD
parallel processor; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Rao:1985:ALC,
author = "S. Upendra Rao and A. K. Majumdar",
title = "An algorithm for local compaction of horizontal
microprograms",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "29--33",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Metal Box India Ltd, Systems Dep, Kharagpur,
India",
classification = "722; 723; C6110 (Systems analysis and programming);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Metal Box India Ltd., Kharagpur, India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "compilers; computer architecture; computer programming
--- Algorithms; computer systems, digital --- Parallel
Processing; data dependency; data reduction; heuristic
algorithms; horizontal microprograms; local compaction;
local microcode compaction; micro-operations;
microprogramming; Microprogramming; parallel
processing; parallelism; program compilers; resource
conflict; word minimisation",
treatment = "P Practical",
}
@Article{Passy:1985:PDC,
author = "Solomon Passy and Tinko Tinchev",
title = "{PDL} with data constants",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "35--41",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q55 (03B70)",
MRnumber = "86i:68079",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Sofia Univ, Sector of Mathematical Logic, Sofia,
Bulg",
classification = "723; C4210 (Formal logic)",
corpsource = "Maths. Fac., Sofia Univ., Bulgaria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory --- Programming Theory; computer
programming; CPDL; data constants; data identity;
formal logic; Kripke complete; propositional dynamic
logic; Theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Meira:1985:LAS,
author = "Silvio Lemos Meira",
title = "A linear applicative solution for the set union
problem",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "43--45",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Kent at Canterbury, Computing Lab,
Canterbury, Engl",
classification = "723; C1160 (Combinatorial mathematics); C4210
(Formal logic)",
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 = "adjectivisation; algorithm complexity; Algorithms;
applicative languages; computer programming; computer
programming languages --- Theory; formal languages;
imperative set union problem; linear applicative
solution; set theory; set union problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Bounas:1985:DDS,
author = "Adam C. Bounas",
title = "Direct determination of a ``seed'' binary matrix",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "47--50",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A60 (94A15)",
MRnumber = "86g:94038",
MRreviewer = "S. Guia{\c{s}}u",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Greek Atomic Energy Commission, Computer Science
Dep, Attiki, Greece",
classification = "723; 922; B6120B (Codes); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Min. of Res. and Technol.,
Greek Atomic Energy Comm., Attiki, Greece",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary matrix; cryptography; data transformation;
generalized feedback shift register pseudorandom number
generator; keys; mathematical statistics --- Random
Number Generation; pseudorandom number generators;
random number generation; seed matrices; seed matrix;
stream enciphering",
treatment = "T Theoretical or Mathematical",
}
@Article{Jajodia:1985:ERN,
author = "Sushil Jajodia",
title = "On Equivalence of Relational and Network Database
Models",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "1",
pages = "51--54",
day = "2",
month = jan,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "86h:68027",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Missouri-Columbia, Dep of Computer
Science, Columbia, MO, USA",
classification = "723; C4250 (Database theory); C6160B (Distributed
databases); C6160D (Relational databases)",
corpsource = "Dept. of Comput. Sci., Missouri Univ., Columbia, MO,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "database systems; database theory; distributed
processing; equivalence; functional dependencies;
loop-free Bachman diagrams; multivalued dependencies;
network database models; network databases; relational
databases; relational structures",
treatment = "T Theoretical or Mathematical",
}
@Article{Bilardi:1985:VOA,
author = "G. Bilardi and F. P. Preparata",
title = "The {VLSI} optimality of the {AKS} sorting network",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "55--59",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign, Coordinated
Science Lab, Urbana, IL, USA",
affiliationaddress = "Univ of Illinois at Urbana-Champaign,
Coordinated Science Lab, Urbana, IL, USA",
classification = "723; B1130B (Computer-aided circuit analysis and
design); B2570 (Semiconductor integrated circuits);
C7410D (Electronic engineering computing)",
corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "aks sorting network; AKS sorting network; area-time
trade-off; circuit CAD; computer programming ---
Algorithms; computer systems programming; computer
systems, digital --- Parallel Processing; computing
environment; parallel processing; Sorting; synchronous
VLSI model of computation; VLSI; VLSI optimality",
treatment = "P Practical",
}
@Article{Plaisted:1985:USE,
author = "David A. Plaisted",
title = "The undecidability of self-embedding for term
rewriting systems",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "61--64",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50 (03D35 68T15)",
MRnumber = "86f:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign, Dep of Computer
Science, Urbana, IL, USA",
affiliationaddress = "Univ of Illinois at Urbana-Champaign, Dep of
Computer Science, 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 = "computer metatheory; computer programming languages
--- Theory; decidability; programming theory;
self-embedding; self-embedding property; term rewriting
systems; theorem proving; undecidability; uniform
termination property",
treatment = "T Theoretical or Mathematical",
}
@Article{VandeSnepscheut:1985:EEQ,
author = "Jan L. A. {Van de Snepscheut}",
title = "Evaluating Expressions with a Queue",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "65--66",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "California Inst of Technology, Dep of Computer
Science, Pasadena, CA, USA",
classification = "723; C4240 (Programming and algorithm theory);
C6150C (Compilers, interpreters and other processors)",
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 = "caudafix expression; code generation; compilation;
computer metatheory --- Programming Theory; computer
programming; expression evaluation; literals;
mechanical evaluation; program compilers; programming
theory; queue; queueing theory; Theory",
treatment = "T Theoretical or Mathematical",
}
@Article{McLean:1985:CBS,
author = "John McLean",
title = "A comment on the `basic security theorem' of {Bell}
and {LaPadula}",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "67--70",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "US Naval Research Lab, Computer Science \& Systems
Branch, Washington, DC, USA",
affiliationaddress = "US Naval Research Lab, Computer Science \&
Systems Branch, Washington, DC, USA",
classification = "404; 722; 723; C4240 (Programming and algorithm
theory); C6130 (Data handling techniques)",
corpsource = "Naval Res. Lab., Washington, DC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "basic security theorem; computer systems, digital ---
Military Purposes; data processing; programming theory;
prototype military computer systems; security model;
security of data; Security of Data",
treatment = "T Theoretical or Mathematical",
}
@Article{Noshita:1985:TTC,
author = "Kohei Noshita",
title = "Translation of {Turner} combinators in ${O(n \log n)}$
space",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "71--74",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (03B40)",
MRnumber = "86e:68051",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Electro-Communications, Dep of Computer
Science, Chofu, Jpn",
classification = "723; C4220 (Automata 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 = "algorithms; automata; automata theory; complexity;
computer metatheory; computer programming; functional
programming; lambda calculus; lambda expressions;
performance; reduction machine; theory; Theory; turner
combinators; Turner combinators; verification",
review = "ACM CR 8510-0919",
subject = "D.1 Software, PROGRAMMING TECHNIQUES, Applicative
(Functional) Programming \\ F.2 Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems \\ F.4.1 Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Lambda calculus and related
systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Widmayer:1985:OAM,
author = "P. Widmayer and C. K. Wong",
title = "An optimal algorithm for the maximum alignment of
terminals",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "75--82",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown
Heights, NY, USA",
classification = "714; 723; B1130B (Computer-aided circuit analysis
and design); C4230 (Switching 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 = "alignment of terminals; Computer Aided Design;
computer programming --- Algorithms; graph theory;
integrated circuits, VLSI; maximum alignment;
minimisation of switching nets; optimal algorithm;
terminals; VLSI wiring; wires",
treatment = "T Theoretical or Mathematical",
}
@Article{Thatte:1985:CBT,
author = "Satish R. Thatte",
title = "On the Correspondence Between Two Classes of Reduction
Systems",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "83--85",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q65 (68Q55)",
MRnumber = "87i:68053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan, Dep of Computer \& Communication
Sciences, Ann Arbor, MI, USA",
affiliationaddress = "Univ of Michigan, Dep of Computer \&
Communication Sciences, Ann Arbor, MI, USA",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Comput. and Commun. Sci., Michigan Univ., Ann
Arbor, MI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "C/sub I/ system; C/sub II/ system; computer
metatheory; computer programming languages;
constructors; grammars; HOPE; reduction systems;
semantic models; semantics; sequential evaluation
strategies; term rewriting; Theory",
treatment = "P Practical",
}
@Article{Harel:1985:MLV,
author = "David Harel and David Peleg",
title = "More on Looping Vs. Repeating in Dynamic Logic",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "87--90",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q55 (03B70 03D35)",
MRnumber = "86k:68065",
MRreviewer = "G. Mirkowska",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Weizmann Inst of Science, Dep of Applied
Mathematics, Rehovot, Isr",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory --- Programming Theory; computer
programming; dynamic logic; expressiveness; formal
logic; looping; program verification; relative power;
repeating; Theory; validity; verification",
treatment = "T Theoretical or Mathematical",
}
@Article{Auzins:1985:SEE,
author = "A. J. Auzins and E. B. Kinber",
title = "On Separation of the Emptiness and Equivalence
Problems for Program Schemes",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "91--93",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D35)",
MRnumber = "86k:68013",
MRreviewer = "A. Ya. Dikovski{\u{\i}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Latvian State Univ, Computing Cent, Riga, USSR",
classification = "723; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Comput. Center, Latvian State Univ., Riga, Latvian
SSR, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory --- Programming Theory; computer
programming; decidability; deterministic automata;
emptiness; emptiness problem; equivalence problem;
equivalence problems; input tape; one-way deterministic
pushdown automata; program schemes; programming theory;
Theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Beauquier:1985:CAI,
author = "D. Beauquier and D. Perrin",
title = "Codeterministic Automata on Infinite Words",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "95--98",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D05 68Q45)",
MRnumber = "86i:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Paris 7, Lab d'Informatique Theorique et
Programmation, Paris, Fr",
classification = "721; C4220 (Automata theory)",
corpsource = "Paris 7 Univ., France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; codeterministic automata;
deterministic automata; finite automata; finite
codeterministic automaton; infinite words; reverse
deterministic automaton",
treatment = "T Theoretical or Mathematical",
}
@Article{Ukkonen:1985:UBS,
author = "Esko Ukkonen",
title = "Upper bounds on the size of {${\rm LR}(k)$} parsers",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "99--103",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "86j:68076",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Helsinki, Dep of Computer Science,
Helsinki, Finl",
classification = "721; C4210 (Formal logic)",
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 = "automata theory; compilers; context-free grammars;
grammar; Grammars; LR(k) parsers; trivial upper bound;
upper bounds",
treatment = "T Theoretical or Mathematical",
}
@Article{Main:1985:ISC,
author = "Michael G. Main",
title = "An infinite square-free {co-CFL}",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "105--107",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Colorado at Boulder, Dep of Computer
Science, Boulder, CO, USA",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
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; infinite complement; infinite square-free
co-CFL; pumping lemmas; repetitions; square-containing
strings",
treatment = "T Theoretical or Mathematical",
}
@Article{Kak:1985:HDT,
author = "Subhash C. Kak",
title = "How to Detect Tampering of Data",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "2",
pages = "109--110",
day = "15",
month = feb,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Louisiana State Univ, Baton Rouge, Dep of Electrical
\& Computer Engineering, Baton Rouge, LA, USA",
affiliationaddress = "Louisiana State Univ, Baton Rouge, Dep of
Electrical \& Computer Engineering, Baton Rouge, LA,
USA",
classification = "723; 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 = "codes, symbolic --- Error Detection; data processing;
nested coding; Security of Data; security of data;
tampering; tampering of data",
treatment = "P Practical",
}
@Article{Njau:1985:DDC,
author = "Ernest C. Njau",
title = "Details of Distortions in the Computed {Fourier}
Transforms of Signals. {Part I}. {Short} Periodic
Signals",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "111--113",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A11",
MRnumber = "86j:94014",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Int Cent for Theoretical Physics, Trieste,
Italy",
classification = "723; 731; 921; B0230 (Integral transforms); B6140
(Signal processing and detection); C1130 (Integral
transforms); C1260 (Information theory)",
corpsource = "Int. Centre for Theor. Phys., Trieste, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computed Fourier transforms; Digital Techniques;
Fourier transforms; frequency-broadening; mathematical
transformations --- Fourier Transforms; peak precision;
short periodic signals; signal processing; spectral
analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Sontag:1985:RAP,
author = "Eduardo D. Sontag",
title = "Real Addition and the Polynomial Hierarchy",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "115--120",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D15 (03B25 68Q15)",
MRnumber = "87b:03082",
MRreviewer = "Andreas Brandst{\"a}dt",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rutgers Univ, Dep of Mathematics, New Brunswick,
NJ, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "addition; computational complexity; computer
metatheory; deterministic line complexity; kth
alternation level; mathematical techniques; nonempty
polyhedron; number theory; polyhedral geometry;
polynomial hierarchy; Polynomials; polynomials; prenex
form; quantifier elimination; real addition; real
numbers",
treatment = "T Theoretical or Mathematical",
}
@Article{Chan:1985:NRD,
author = "Mee Yee Chan",
title = "A note on redundant {Disk Modulo} allocation",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "121--123",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Hong Kong, Cent of Computer Studies \&
Applications, Hong Kong",
classification = "723; C6120 (File organisation)",
corpsource = "Centre of Comput. Studies and Applications, Hong Kong
Univ., Hong Kong",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary buckets; buckets; complete file replication;
data processing; database systems; file organisation;
File Organization; magnetic disc storage; multidisk
file design; multidisk file problem; multiple disks;
optimal performance; partial match file design; partial
match query; redundancy; redundant buckets; redundant
Disk Modulo file allocations; worst case result",
treatment = "T Theoretical or Mathematical",
}
@Article{Martin:1985:PAC,
author = "Alain J. Martin",
title = "The probe: an addition to communication primitives",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "125--130",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (68N20)",
MRnumber = "87d:68026a",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also erratum \cite{Martin:1985:EPA}.",
acknowledgement = ack-nhfb,
affiliationaddress = "California Inst of Technology, Computer Science
Dep, Pasadena, CA, USA",
classification = "722; 723; C6140D (High level languages); C6150J
(Operating systems)",
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 = "bounded buffers; communication primitives; computer
programming languages; computer systems, digital ---
Distributed; CSP; distributed computation; distributed
processing; fairness; guarded commands; multiprocessing
programs; operating systems (computers); probe;
programming language kernel; programming languages;
semantics; semaphores; stack; timer constructs",
treatment = "T Theoretical or Mathematical",
}
@Article{Lodi:1985:SSH,
author = "E. Lodi and F. Luccio",
title = "Split Sequence Hash Search",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "131--136",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "In all hash methods, the search for a key K starts
with the comparison between K and the key L stored in
the table position corresponding to the hash address of
K. If K does not equal L, the search proceeds through a
sequence of cells. It is proposed here to split this
sequence in two parts, to be traced for K greater than
L, or K less than L. The advantage of sequence
splitting is studied for the hash techniques of
chaining, and open addressing. The average numbers of
probes for successful and unsuccessful searches are
strongly reduced over standard methods, in particular
for chaining and linear probing, at the cost of a very
modest algorithm complication.",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ di Pisa, Dipartimento di Informatica, Pisa,
Italy",
classification = "723; C6120 (File organisation); 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 = "chaining; collision resolution; computer programming;
data processing --- Data Structures; data structures;
file organisation; hash address; hash methods; hashing;
linear probing; open addressing; searching; split
sequence hash search; table lookup; table position;
table searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Cole:1985:PMA,
author = "Richard Cole and Chee K. Yap",
title = "A parallel median algorithm",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "137--139",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "86k:68004",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "New York Univ, Courant Inst of Mathematical
Sciences, New York, NY, USA",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; comparison model;
computer programming; computer systems, digital ---
Parallel Processing; deterministic algorithm; parallel
algorithm; parallel median algorithm; parallel
processing; statistics",
treatment = "T Theoretical or Mathematical",
}
@Article{Makinen:1985:UPC,
author = "Erkki M{\"a}kinen",
title = "An undecidable problem for context-free grammars",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "141--142",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "87a:68098",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Tampere, Dep of Mathematical Sciences \&
Computer Science, Tampere, Finl",
affiliationaddress = "Univ of Tampere, Dep of Mathematical Sciences \&
Computer Science, Tampere, Finl",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci. and Comput. Sci., Tampere Univ.,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "ambiguity; automata theory; Context Free Grammars;
context-free grammars; context-free languages;
decidability; felt Szilard languages; GNF; undecidable
problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Tsin:1985:OPP,
author = "Yung Hyang Tsin",
title = "An optimal parallel processor bound in strong
orientation of an undirected graph",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "143--146",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Memorial Univ of Newfoundland, Dep of Computer
Science, St. John's, Newfoundl, Can",
affiliationaddress = "Memorial Univ of Newfoundland, Dep of Computer
Science, St. John's, Newfoundl, Can",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm 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 = "algorithm theory; analysis of algorithms; assigning
directions; computer programming --- Algorithms;
computer systems, digital --- Parallel Processing;
dense graphs; Graph Theory; graph theory; mathematical
techniques; optimal parallel processor; parallel graph
algorithm; parallel processing; parallel processor;
PRAM; SIMD shared memory model; spanning trees; strong
orientation; trees (mathematics); undirected graph;
vertex set",
treatment = "T Theoretical or Mathematical",
}
@Article{Awerbuch:1985:NDD,
author = "Baruch Awerbuch",
title = "A new distributed depth-first-search algorithm",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "147--150",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "IBM, Israel Scientific Cent, Haifa, Isr",
classification = "722; 723; C4230 (Switching theory); C4240
(Programming and algorithm theory); C5690 (Other data
communication equipment and techniques)",
corpsource = "IBM-Israel Sci. Center, Haifa, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; asynchronous
communication network; communication complexity;
computer programming; computer systems, digital ---
Distributed; distributed depth-first-search algorithm;
distributed processing; graph theory; time
complexities; undirected communication graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Shallit:1985:NTF,
author = "Jeffrey Shallit and Adi Shamir",
title = "Number-Theoretic Functions Which are Equivalent to
Number of Divisors",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "151--153",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "11Y16 (68Q25)",
MRnumber = "86k:11076",
MRreviewer = "Hale F. Trotter",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Chicago, Dep of Computer Science,
Chicago, IL, USA",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4290 (Other computer
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 = "computer metatheory; mathematical techniques; Mobius
function; Moebius function; Number Theory; number
theory; number-theoretic functions; oracle; positive
integral divisors; prime factorization",
treatment = "T Theoretical or Mathematical",
}
@Article{Volger:1985:SRA,
author = "Hugo Volger",
title = "Some Results on Addition\slash Subtraction Chains",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "155--160",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "11Y55 (68Q40)",
MRnumber = "87c:11124",
MRreviewer = "Kevin S. McCurley",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of T{\"u}bingen, Mathematical Inst,
T{\"u}bingen, West Ger",
classification = "921; C1160 (Combinatorial mathematics); C5230
(Digital arithmetic methods)",
corpsource = "Math. Inst., T{\"u}bingen Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "addition/subtraction chains; digital arithmetic;
mathematical techniques; number theory; upper bounds",
treatment = "T Theoretical or Mathematical",
}
@Article{Beynon:1985:CBF,
author = "W. M. Beynon and C. S. Iliopoulos",
title = "Computing a Basis for a Finite {Abelian} $p$-Group",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "3",
pages = "161--163",
day = "8",
month = apr,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q40 (20K01)",
MRnumber = "87a:68086",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Warwick, Dep of Computer Science,
Coventry, Engl",
classification = "723; 921; 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 = "algorithmic group theory; Algorithms; basis;
computational complexity; computer programming; finite
Abelian p-group; finite abelian p-group; group theory;
mathematical techniques",
treatment = "T Theoretical or Mathematical",
}
@Article{Welzl:1985:CVG,
author = "Emo Welzl",
title = "Constructing the Visibility Graph for $n$-Line
Segments in ${O}(n^2)$ Time",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "167--171",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "86m:68135",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Leiden State Univ, Inst of Applied Mathematics \&
Computer Science, Leiden, Neth",
affiliationaddress = "Leiden State Univ, Inst of Applied Mathematics
\& Computer Science, Leiden, Neth",
classification = "723; 921; C1160 (Combinatorial mathematics); C4190
(Other numerical methods)",
corpsource = "Inst. for Inf. Proc., Tech. Univ. of Graz, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational geometry; computer programming ---
Algorithms; Graph Theory; graph theory; line segments;
mathematical techniques; n-line segments;
nontransparent obstacles; O(n/sup 2/) time; shortest
path; undirected graph; visibility graph",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Joseph:1985:PRC,
author = "Mathai Joseph",
title = "On a Problem in Real-Time Computing",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "173--177",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Tata Inst of Fundamental Research, Computer
Science Group, Bombay, India",
classification = "722; 723; C1140C (Queueing theory); C5470
(Performance evaluation and testing)",
corpsource = "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 = "buffered computation; computer systems, digital; peak
processing load; Performance; performance evaluation;
processor sharing; queueing theory; real-time
computing; real-time systems; response time; response
times",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Santoro:1985:IBS,
author = "Nicola Santoro and Jeffrey B. Sidney",
title = "Interpolation-Binary Search",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "179--181",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10",
MRnumber = "86m:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Carleton Univ, Sch of Computer Science, Ottawa,
Ont, Can",
classification = "723; C4130 (Interpolation and function
approximation); 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 = "Algorithms; computational complexity; computer
programming; interpolation; interpolation-binary
system; multiple complexity objective; O(log log n)
time; O(log n) time; ordered array; ordered arrays;
searching",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Rangarajan:1985:FDE,
author = "K. Rangarajan and S. Arun-Kumar",
title = "Fair Derivations in {E0L} Systems",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "183--188",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (68Q50)",
MRnumber = "86k:68055",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Madras Christian Coll, Dep of Mathematics,
Madras, India",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Math., Madras Christian Coll., India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; context-free derivations;
context-free languages; E0L systems; fair derivations;
fairness; Formal Languages; formal languages; l-system;
L-systems; synchronized E0L systems; termination;
terminations",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Morgan:1985:GLT,
author = "Carroll Morgan",
title = "Global and Logical Time in Distributed Algorithms",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "189--194",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Oxford, Programming Research Group,
Oxford, Engl",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Programming Res. Group, Oxford Univ., UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; computer programming;
computer systems, digital; distributed algorithms;
distributed auction system Enchere; distributed
computation; distributed processing; distributed
snapshot algorithm; fair agreement algorithm; global
time; logical time; saved checkpoint",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Wise:1985:RMQ,
author = "David S. Wise",
title = "Representing Matrices as Quadtrees for Parallel
Processors",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "195--199",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65W05 (65Fxx)",
MRnumber = "86j:65204",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Indiana Univ, Dep of Computer Science,
Bloomington, IN, USA",
classification = "722; 723; C4140 (Linear algebra); C6120 (File
organisation)",
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 = "algorithm selection; computer systems, digital ---
Parallel Processing; data processing; Data Structures;
data structures; homogeneous tree data structure;
matrix algebra; multiprocessing; numerical methods;
parallel processing; parallel processors; parallel-
processing architectures; quadtrees; sparse matrices;
sparse matrix representation; trees (mathematics)",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Keil:1985:FHC,
author = "J. Mark Keil",
title = "Finding {Hamiltonian} Circuits in Interval Graphs",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "201--206",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05C45 68R10)",
MRnumber = "87a:68082",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Saskatchewan, Dep of Computational
Science, Saskatoon, Sask, Can",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm 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 = "circuit theory; computational complexity; computer
programming --- Algorithms; Graph Theory; graph theory;
Hamiltonian circuits; intersection graph; interval
graphs; linear time algorithm; mathematical techniques;
NP-complete",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{VanGils:1985:HCF,
author = "W. J. {Van Gils}",
title = "How to Cope with Faulty Processors in a Completely
Connected Network of Communicating Processors",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "207--213",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Philips Research Lab, Eindhoven, Neth",
classification = "722; 723; C5440 (Multiprocessing systems)",
corpsource = "Phillips Res. Lab., Eindhoven, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Byzantine Generals problem; Byzantine generals
problem; communicating processors; completely connected
network; computer programming --- Algorithms; computer
systems, digital; conflicting information; Distributed;
fault tolerant computing; faulty processors;
malfunctioning processors; multiprocessing systems;
transmitting processor",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Iliopoulos:1985:AAP,
author = "Costas S. Iliopoulos",
title = "Analysis of Algorithms on Problems in General
{Abelian} Groups",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "215--220",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q40 (20-04 20K05)",
MRnumber = "86m:68072",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Warwick, Dep of Computer Science,
Coventry, Engl",
classification = "723; C1110 (Algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comp. Sci., Warwick Univ., Coventry, UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "abelian groups; Algorithms; analysis of algorithms;
complete basis; computational complexity; computer
programming; general Abelian groups; group theory;
worst-case time complexity polynomial",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Yehudai:1985:NCD,
author = "Amiram Yehudai",
title = "A note on chains of deterministic pushdown
transducers",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "4",
pages = "221--222",
day = "10",
month = may,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Los Angeles, Dep of Computer
Science, Los Angeles, CA, USA",
affiliationaddress = "Univ of California, Los Angeles, Dep of Computer
Science, Los Angeles, CA, USA",
classification = "721; C4210 (Formal logic)",
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 = "abstract model; automata theory; bounds; deterministic
context-free; deterministic pushdown transducers;
deterministic pushdown transducers.; DPDTs; formal
languages; hierarchy; multipass compilers; polynomial;
program compilers",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Slusarek:1985:NDS,
author = "Maciej Slusarek",
title = "A note on the dynamic storage allocation problem",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "223--227",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Warsaw, Inst of Informatics, Warsaw,
Pol",
classification = "723; 921; C4240 (Programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Inst. of Inf., Warsaw Univ., Warsaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "approximation algorithm; arrival times; computational
complexity; computer operating systems; dynamic storage
allocation; dynamic storage allocation problem;
mathematical techniques --- Combinatorial Mathematics;
memory cells; operations research; Storage Allocation;
storage allocation; work variables allocation;
worst-case ratio",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Reif:1985:DFS,
author = "John H. Reif",
title = "Depth-First Search is Inherently Sequential",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "229--234",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10 (68Q15)",
MRnumber = "86k:68007",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Harvard Univ, Aiken Computation Lab, Cambridge,
MA, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Div. of Appl. Sci., Harvard Univ., Cambridge, MA,
USA",
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; depth-first search; deterministic
log-space reductions; deterministic polynomial time;
directed graphs; graph theory; mathematical techniques
--- Graph Theory; parallel computation; parallel
processing; polynomial time complete; rooted graph;
sequential algorithms",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Vishkin:1985:EPS,
author = "Uzi Vishkin",
title = "On Efficient Parallel Strong Orientation",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "235--240",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "New York Univ, Dep of Computer Science, New
York, NY, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., New York Univ., 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; concurrent-read concurrent-write;
concurrent-read exclusive-write; connected bridgeless
undirected graph; digraph; graph algorithm; Graph
Theory; graph theory; mathematical techniques; parallel
algorithm; parallel processing; parallel random access
machines; parallel random excess machines; parallel
strong orientation; pram; PRAM; PRAMs",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Hartmanis:1985:IRA,
author = "Juris Hartmanis",
title = "Independence Results About Context-Free Languages and
Lower Bounds",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "241--248",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15 (03D05)",
MRnumber = "88a:68036",
MRreviewer = "E. B. Kinber",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca,
NY, USA",
classification = "721; C4210 (Formal logic); 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 = "automata theory; complexity; computational complexity;
computations; Context Free Languages; context-free
languages; formal system; grammar; independence
results; logical structure; lower bounds; recursive
representation",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Bitner:1985:SMD,
author = "James R. Bitner",
title = "Storing Matrices on Disk for Efficient Row and Column
Retrieval",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "249--254",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Texas at Austin, Dep of Computer
Sciences, Austin, TX, USA",
classification = "723; 921; C6120 (File organisation)",
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 = "access costs; column retrieval; computer programming
--- Algorithms; data storage, digital; disk storage;
lower bound; matrix algebra; matrix storage; Matrix
storage; optimisation; optimization; page fetcher; row
retrieval; storage management; virtual storage",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Devroye:1985:NET,
author = "Luc Devroye",
title = "A note on the expected time required to construct the
outer layer",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "255--257",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (68Q25)",
MRnumber = "86k:68100",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "McGill Univ, Sch of Computer Science, Montreal,
Que, Can",
classification = "723; 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/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; computational complexity; computer
programming; divide-and-conquer algorithm; expected
time; outer layer",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Papadimitriou:1985:ASP,
author = "Christos H. Papadimitriou",
title = "An algorithm for shortest-path motion in three
dimensions",
journal = j-INFO-PROC-LETT,
volume = "20",
number = "5",
pages = "259--263",
day = "12",
month = jun,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (68Q25)",
MRnumber = "86k:68102",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Stanford Univ, Dep of Computer Science,
Stanford, CA",
classification = "723; C1160 (Combinatorial mathematics); 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 = "algorithm theory; computer programming --- Algorithms;
graph theory; path planning; polyhedral obstacles;
polynomial approximation scheme; position control;
robotics; shortest-path motion",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Samet:1985:BC,
author = "Hanan Samet",
title = "Bidirectional Coroutines",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "1--6",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland at College Park, Dep of Computer
Science, College Park, MD, USA",
affiliationaddress = "Univ of Maryland at College Park, Dep of
Computer Science, College Park, MD, USA",
classification = "723; C6110 (Systems analysis and programming);
C6140D (High level languages)",
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 = "bidirectional coroutine; bidirectional coroutines;
computer programming languages; control structures;
data structures; hierarchical coroutines; high level
languages; master slave control; programming;
programming languages; resume master; resume slave;
semicoroutines; subroutines; suspend mechanism",
pubcountry = "Netherlands A01",
treatment = "P Practical",
}
@Article{Hromkovic:1985:AMM,
author = "Juraj Hromkovi{\v{c}}",
title = "Alternating Multicounter Machines with Constant Number
of Reversals",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "7--9",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D05 68Q15)",
MRnumber = "87h:68035",
MRreviewer = "Gh. Grigora{\c{s}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Comenius Univ, Dep of Theoretical Cybernetics,
Bratislava, Czech",
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Theor. Cybernetics, Comenius Univ.,
Bratislava, Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "alternating multicounter machines; automata theory;
computational complexity; constant number of reversals;
multihead automata; multipushdown machine;
nondeterminism; recursively enumerable sets; reversal
number bound; single-letter alphabet; space bound;
Turing machines",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Negri:1985:JDM,
author = "M. Negri and G. Pelagatti",
title = "Join During Merge: an Improved Sort Based Algorithm",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "11--16",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Politecnico di Milano, Dipartimento di
Elettronica, Milan, Italy",
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dipartimento di Elettronica, Politecnico di Milano,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming --- Algorithms; database systems;
join; join during merge; join-during-merge; merging;
sort based algorithm; sort-based algorithms; sorting;
subfiles",
pubcountry = "Netherlands A03",
treatment = "P Practical",
}
@Article{Guralnik:1985:AUR,
author = "Gerald Guralnik and Charles Zemach and Tony Warnock",
title = "An algorithm for uniform random sampling of points in
and on a hypersphere",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "17--21",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65C10 (65W05)",
MRnumber = "86k:65010",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Los Alamos Natl Lab, Los Alamos, NM, USA",
classification = "723; 913; 922; C1140Z (Other topics in statistics);
C4240 (Programming and algorithm theory)",
corpsource = "Los Alamos Nat. Lab., NM, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; Box Muller method; computation times;
computer programming; computer simulation; generalized
polar coordinates; high-speed computers; hypersphere;
Monte Carlo methods; n-dimensional sphere; points;
programming theory; sampling; statistical analysis;
topology; uniform random sampling; vector programming",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Pagli:1985:SAH,
author = "Linda Pagli",
title = "Self-Adjusting Hash Tables",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "23--25",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "The idea of self organizing data is applied to hash
tables. Two different heuristics are proposed here,
both based on the idea of moving the keys more
frequently requested as close as possible to their own
hash address.",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Pisa, Dep of Computer Science, Pisa,
Italy",
classification = "723; 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 = "analysis of algorithms; computer programming ---
Algorithms; data processing; data structures; Data
Structures; file organisation; files; hash tables;
quadratic search; search algorithms; self organizing
data; self-adjusting hash tables",
pubcountry = "Netherlands A05",
treatment = "P Practical",
}
@Article{Kapur:1985:WCC,
author = "Deepak Kapur and Mukkai S. Krishnamoorthy",
title = "Worst-Case Choice for the Stable Marriage Problem",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "27--30",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R05 (05A05 90B10)",
MRnumber = "87b:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also comment \cite{Pujari:1987:CWC}.",
acknowledgement = ack-nhfb,
affiliationaddress = "GE, Computer Science Branch, Schenectady, NY,
USA",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Comput. Sci. Branch, General Electric Corp. Res. and
Dev., Schenectady, NY, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; computer programming;
coroutine solution; parallel algorithm; parallel
processing; stable marriage problem; worst-case
choice",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Oh:1985:NRL,
author = "Se Man Oh and J. C. H. Park",
title = "A note on removing loops from table-driven code
generators",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "31--34",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Korea Advanced Inst of Science \& Technology, Dep of
Computer Science, Seoul, South Korea",
affiliationaddress = "Korea Advanced Inst of Science \& Technology,
Dep of Computer Science, Seoul, South Korea",
classification = "723; C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors)",
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 = "Algorithms; ambiguity; compilers; computer
programming; grammars; LALR(1) look-ahead set; LALR(1)
parse tables; look ahead set; loop detection and
elimination; looping configuration; parsing; program
compilers; removing loops; table-driven code
generation; table-driven code generators; target codes;
transition table",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Yung:1985:SUK,
author = "Mordechai M. Yung",
title = "A secure and useful `keyless cryptosystem'",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "35--38",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Columbia Univ, Dep of Computer Science, New
York, NY, USA",
classification = "723; B6120B (Codes); C6130 (Data handling
techniques)",
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 = "authentication; communication environments;
cryptography; data transmission; encryption; key
generation protocol; keyless cryptography; protocol;
protocols; security",
pubcountry = "Netherlands A08",
treatment = "P Practical",
}
@Article{Edelsbrunner:1985:FEP,
author = "H. Edelsbrunner and H. A. Maurer",
title = "Finding Extreme Points in Three Dimensions and Solving
the Post-Office Problem in the Plane",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "39--47",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "87a:68148",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technical Univ of Graz, Inst for Information
Processing, Graz, Austria",
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Inst. for Inf. Process., Tech. Univ. of Graz,
Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; computational geometry; computer
programming; data structures; extreme points; geometric
search problem; graph theory; multi-dimensional
searching; point location problems; post-office
problem; three dimensions",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Wegener:1985:OSP,
author = "Ingo Wegener",
title = "Optimal search with positive switch cost is
{NP}-hard",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "49--52",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P10 (68Q25 90C39)",
MRnumber = "87d:68019",
MRreviewer = "Ernst-Erich Doberkat",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Frankfurt, Fachbereich Informatik,
Frankfurt am Main, West Ger",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt, West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; computer programming; NP-hard;
NP-hardness; optimal search; positive switch cost;
programming; programming theory",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Yokomori:1985:ETR,
author = "Takashi Yokomori and Derick Wood and Klaus-J{\"o}rn
Lange",
title = "Erratum: {``A three-restricted normal form theorem for
{ETOL} languages'' [Inform. Process. Lett. {\bf 14}
(1982), no. 3, 97--100; MR 83g:68115]}",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "1",
pages = "53--53",
day = "10",
month = jul,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "87f:68054",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Yokomori:1982:TRN}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Lumelsky:1985:FCD,
author = "Vladimir J. Lumelsky",
title = "On Fast Computation of Distance Between Line
Segments",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "55--61",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "GE, Information Systems Lab, Schenectady, NY,
USA",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Inf. Syst. Lab., Gen. Elect. Co., Schenectady, NY,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; CAD systems; computational geometry;
computer programming; distance between line segments;
fast computation; finite length straight lines;
geometrical data; image processing; infinite length
straight lines; information processing; MinD
computation; minimum distance; minimum Euclidean
distance; optimization; robotics; special algorithms;
straight line segments; VLSI design",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Rauchle:1985:EDC,
author = "Thomas Rauchle and Sam Toueg",
title = "Exposure to Deadlock for Communicating Processes is
Hard to Detect",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "63--68",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca,
NY, USA",
classification = "722; 723; B6150 (Communication system theory); C4240
(Programming and algorithm theory); C6150G (Diagnostic,
testing, debugging and evaluating systems)",
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 = "communicating processes; communication protocol
correctness; computational complexity; computer
communications software; computer metatheory; computer
systems, digital; deadlock; deadlock exposure;
Distributed; finite-state model; global deadlock
states; global state analysis; operating systems
(computers); programming theory; protocols;
PSPACE-hard; system recovery; theorem proving;
unbounded FIFO channels; unbounded non-FIFO channels",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaldewaij:1985:DSA,
author = "Anne Kaldewaij",
title = "On the Decomposition of Sequences into Ascending
Subsequences",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "69--69",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05A05)",
MRnumber = "87b:68047",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
affiliationaddress = "Eindhoven Univ of Technology, Dep of Mathematics
\& Computing Science, Eindhoven, Neth",
classification = "723",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory --- Programming Theory; computer
programming; decomposition of sequences; longest
upsequence; Theory",
}
@Article{Hromkovic:1985:LLB,
author = "Juraj Hromkovi{\v{c}}",
title = "Linear Lower Bounds on Unbounded Fan-In {Boolean}
Circuits",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "71--74",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15 (94C10)",
MRnumber = "87a:68063",
MRreviewer = "Ingo Wegener",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Comenius Univ, Dep of Theoretical Cybernetics,
Bratislava, Czech",
classification = "721; 723; C4230 (Switching theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Theor. Cybern., Comenius Univ., Bratislava,
Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Boolean function; Boolean functions; circuit
complexity; combinational complexity; complexity
theory; computational complexity; computer metatheory
--- Boolean Functions; exponential lower bounds; linear
lower bounds; logic circuits, combinatorial; lower
bounds; nonpolynomial lower bounds; unbounded fan-in
boolean circuits; unbounded fan-in Boolean circuits;
WRAM",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Janiga:1985:NFM,
author = "Ladislav Janiga and V{\'a}clav Koubek",
title = "A note on finding minimum cuts in directed planar
networks by parallel computations",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "75--78",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10",
MRnumber = "87c:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; 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 = "computational complexity; computer systems, digital
--- Parallel Processing; definitions; directed graphs;
directed planar networks; Graph Theory; mathematical
techniques; minimum cuts; parallel computations;
parallel processing; proofs; propositions",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Bini:1985:FPP,
author = "Dario Bini and Victor Ya. Pan",
title = "Fast Parallel Polynomial Division via Reduction to
Triangular {Toeplitz} Matrix Inversion and to
Polynomial Inversion Modulo a Power",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "79--81",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65W05 (12-04 68Q40)",
MRnumber = "86m:65167",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Pisa, Dep of Informatics, Pisa, Italy",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Inf., Pisa Univ., Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Boolean circuits; Boolean functions; computational
complexity; computer programming --- Algorithms;
computer systems, digital --- Parallel Processing; fast
parallel polynomial division; mathematical techniques;
matrix algebra; parallel polynominal division; parallel
processing; polynomial inversion modulo A power;
polynomial inversion modulo a power; Polynomials;
polynomials; reduction to triangular Toeplitz matrix
inversion; remainder of two polynomials; triangular
Toeplitz matrix inversion; uniform arithmetic",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Watjen:1985:FAT,
author = "Dietmar W{\"a}tjen",
title = "Feedback Automata and Their Languages",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "83--86",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "87b:68062",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ Braunschweig, Inst f{\"u}r
Theoretische und Praktische Informatik, Braunschweig,
West Ger",
affiliationaddress = "Technische Univ Braunschweig, Inst f{\"u}r
Theoretische und Praktische Informatik, Braunschweig,
West Ger",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. f{\"u}r Theor. und Praktische Inf., Tech. Univ
Braunschweig, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; context-free languages; deterministic
automata; deterministic models; epsilon-free regular
languages; families of languages; feedback automata;
feedback automata languages; feedback-controlled
models; Formal Languages",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Vitanyi:1985:STO,
author = "Paul M. B. Vit{\'a}nyi",
title = "Square Time is Optimal for Simulation of One Pushdown
Store or One Queue by an Oblivious One-Head Tape Unit",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "87--91",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (68Q15)",
MRnumber = "87a:68050",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cent for Mathematics \& Computer Science,
Amsterdam, Neth",
classification = "721; C1140C (Queueing theory); C4220 (Automata
theory)",
corpsource = "Centre for Math. and Comput. Sci., Amsterdam,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; Kolmogorov complexity; multitape
Taring machine; multitape Turing machines; oblivious
one-head tape unit; one queue; pushdown store
simulation; pushdown stores; queueing theory;
simulation of one pushdown store; Turing machines",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Nguyen:1985:IMC,
author = "Van Nguyen",
title = "The incompleteness of {Misra} and {Chandy}'s proof
systems",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "93--96",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q60 (03B70)",
MRnumber = "87f:68069",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca,
NY, USA",
classification = "722; 723; 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 = "communicating processes; computer metatheory; computer
systems, digital; Distributed; distributed processing;
networks of communicating processes; programming
theory; proof systems",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Martin:1985:FME,
author = "Alain J. Martin and Jerry R. Burch",
title = "Fair mutual exclusion with unfair {$P$} and {$V$}
operations",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "97--100",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N25",
MRnumber = "87h:68015",
MRreviewer = "N. N. Mirenkov",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "California Inst of Technology, Dep of Computer
Science, Pasadena, CA, USA",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Deput. of Compt. 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; computer systems, digital;
Distributed; distributed processing; Domino Rule; fair
mutual exclusion; fairness; mutual exclusion; P and V
operations; programming theory; split binary
semaphores; theorem proving; unfair P and V
operations",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Lautemann:1985:LTB,
author = "Clemens Lautemann and Friedhelm {Meyer auf der
Heide}",
title = "Lower Time Bounds for Integer Programming with Two
Variables",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "101--105",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90C10",
MRnumber = "87b:90089",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technische Univ Berlin, Berlin, West Ger",
classification = "921; B0250 (Combinatorial mathematics); B0260
(Optimisation techniques); C1160 (Combinatorial
mathematics); C1180 (Optimisation techniques)",
corpsource = "Tech. Univ., Berlin, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algebraic arguments; floor function; integer
coordinates; integer programming; integer programming
problem; lower bounds; lower time bounds; mathematical
programming; trees (mathematics); variables",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Martin:1985:EPA,
author = "Alain J. Martin",
title = "Erratum: {``The probe: an addition to communication
primitives''}",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "2",
pages = "107--107",
day = "16",
month = aug,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (68N20)",
MRnumber = "87d:68026b",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Martin:1985:PAC}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Thompson:1985:VDM,
author = "Clark D. Thompson",
title = "{VLSI} Design with Multiple Active Layers",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "109--111",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Berkeley, Div of Computer
Science, Berkeley, CA, USA",
classification = "712; 714; 723; B1130 (General circuit analysis and
synthesis methods); B2570 (Semiconductor integrated
circuits)",
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 = "area time complexity; commercial VLSI design tools;
Computer Aided Design; computer arithmetic; integrated
circuits; integrated circuits, VLSI; multiple active
layers; multiple-active-layer VLSI chips;
multiple-layer layout; multiple-to-single layer
transformation; network synthesis; redesign process;
semiconducting silicon --- Applications; silicon;
single-layer layout; transistors; VLSI; VLSI design",
pubcountry = "Netherlands A01",
treatment = "P Practical",
}
@Article{Kothari:1985:GAA,
author = "Suresh C. Kothari and K. V. S. Ramarao",
title = "General Algorithms for the Address Calculation of
Lexicographically Ordered Tuples",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "113--116",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Iowa State Univ, Dep of Computer Science, Ames,
IA, USA",
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation)",
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 = "address calculation; algorithm theory; Algorithms;
algorithms; computer programming; data structures;
lexicographically ordered tuples; tuple entities",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Lee:1985:PGD,
author = "D. T. Lee and Y. T. Ching",
title = "The power of geometric duality revisited",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "117--122",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (52-04 68Q25)",
MRnumber = "87m:68070",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Northwestern Univ, Dep of Electrical Engineering \&
Computer Science, Evanston, IL, USA",
affiliationaddress = "Northwestern Univ, Dep of Electrical Engineering
\& Computer Science, Evanston, IL, USA",
classification = "723; C4190 (Other numerical methods); C4240
(Programming and algorithm theory); C6130 (Data
handling techniques)",
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; computational complexity; computational
geometry; computer programming; computer systems
programming --- Sorting; duality (mathematics);
geometric duality; optimal algorithm; sorting;
two-dimensional sorting; two-dimensional sorting
problem",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{JaJa:1985:ILB,
author = "Joseph J{\'a}J{\'a} and Jean Takche",
title = "Improved Lower Bounds for Some Matrix Multiplication
Problems",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "123--127",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "87e:68043",
MRreviewer = "Claus-Peter Schnorr",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland at College Park, Electrical
Engineering Dep, College Park, MD, USA",
affiliationaddress = "Univ of Maryland at College Park, Electrical
Engineering Dep, College Park, MD, USA",
classification = "723; 921; C4140 (Linear algebra); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Electr. Eng., Maryland Univ., College Park,
MD, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algebraic complexity; Algorithms; arithmetic
complexity; bilinear forms; complexity; computational
complexity; computer programming; fast algorithms;
lower bounds; mathematical techniques --- Matrix
Algebra; matrix algebra; matrix multiplication; matrix
multiplication problems; special matrix multiplication
problems",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Herman:1985:DS,
author = "Ted Herman and K. Mani Chandy",
title = "On Distributed Search",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "129--133",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (68M10 90C35)",
MRnumber = "87c:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Texas at Austin, Dep of Computer
Science, Austin, TX, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
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 = "asynchronous network; computer programming ---
Algorithms; directed graph; distributed algorithm;
distributed computation; distributed program;
distributed search; distributed system; dynamic
programming; feasible solution; graph algorithms; graph
theory; mathematical programming, dynamic;
optimization; optimization problems; optimum solution;
parallel search; threshold",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Jantzen:1985:NSO,
author = "M. Jantzen",
title = "A note on a special one-rule {semi-Thue} system",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "135--140",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03D03 (03D40 68Q45)",
MRnumber = "87h:03058",
MRreviewer = "John P. Helm",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Hamburg, Fachbereich Informatik, Hamburg,
West Ger",
classification = "721; 723; C4210 (Formal logic)",
corpsource = "Fachbereich Inf., Hamburg Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory --- Formal Languages; canonical;
Church Rosser; church-rosser systems; computer
metatheory; finite semi-Thue system; formal languages;
grammars; monoid; one-rule semi-Thue system; semi-Thue
system; string rewriting; string rewriting system;
string transformation systems; Thue system; uniquely
terminating; word problem",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Budd:1985:CRR,
author = "Timothy A. Budd",
title = "Creation and Reflexive Rights in Grammatical
Protection Systems",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "141--145",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68N25",
MRnumber = "87a:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Arizona, Dep of Computer Science,
Tucson, AZ, USA",
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C4290 (Other
computer theory); C6150J (Operating systems)",
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 = "command invocations; computational complexity;
computer operating systems; computer programming ---
Algorithms; creation rights; grammatical protection
systems; graph theory; operating system protection
mechanism; operating systems (computers); polynomial
time algorithm; reflexive rights; safety; upper bound;
upper bounds",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Vitanyi:1985:LBT,
author = "Paul M. B. Vit{\'a}nyi",
title = "An $n^{1.618}$ lower bound on the time to simulate one
queue or two pushdown stores by one tape",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "147--152",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D10 03D15 68Q15)",
MRnumber = "87j:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Cent for Mathematics \& Computer Science, Dep of
Computer Science, Amsterdam, Neth",
affiliationaddress = "Cent for Mathematics \& Computer Science, Dep of
Computer Science, Amsterdam, Neth",
classification = "721; 922; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Centre for Math. and Comput.
Sci., Amsterdam, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computational complexity; Kolmogorov
complexity; lower bound; lower bounds; multitape Turing
machines; on-line; one-head tape Turing machine; online
simulation by single-head tape units; probability ---
Queueing Theory; pushdown stores; queue; queueing
theory; time complexity; Turing machines; Turing
Machines",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Yoo:1985:ATC,
author = "Chae Woo Yoo",
title = "An approach to the transportation of computer
software",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "153--157",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Soong Jun Univ, Dep of Computer Science, Seoul,
South Korea",
classification = "723; C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Comput. Sci., Soong Jun Univ., Seoul, South
Korea",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "compiler; computer operating systems; computer
software; decompilation; detranslation; program
compilers; software crisis; software methodologies;
software portability; software transport system;
software transportation; STS",
pubcountry = "Netherlands A09",
treatment = "P Practical",
}
@Article{Codenotti:1985:VIF,
author = "B. Codenotti and F. Romani and G. Lotti",
title = "{VLSI} Implementation of Fast Solvers for Band Linear
Systems with Constant Coefficient Matrix",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "3",
pages = "159--163",
day = "5",
month = sep,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65F05 (65N10 65W05 68Q35)",
MRnumber = "87g:65039",
MRreviewer = "Ian Gladwell",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNR, Istituto di Elaborazione dell'Informazione,
Pisa, Italy",
classification = "714; 921; B0290H (Linear algebra); B0290Z (Other
numerical methods); B2570 (Semiconductor integrated
circuits); C4140 (Linear algebra); C4190 (Other
numerical methods); C4240 (Programming and algorithm
theory); C5220 (Computer architecture)",
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 = "area complexity; band linear system; band linear
systems; boundary value problems; computational
complexity; computer architecture; constant coefficient
matrix; DFT; diagonal matrices; difference method;
elliptic equation; fast solvers; integrated circuits,
VLSI --- Design; linear transform; linear transforms;
mathematical techniques --- Vectors; mathematical
transformations; matrix algebra; optimal VLSI designs;
transforms; VLSI; VLSI implementation",
pubcountry = "Netherlands A10",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Guting:1985:FDI,
author = "Ralf Hartmut G{\"u}ting",
title = "Fast Dynamic Intersection Searching in a Set of
Isothetic Line Segments",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "165--171",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Dortmund, Dortmund, West Ger",
classification = "723; 921; C1160 (Combinatorial mathematics); C4130
(Interpolation and function approximation); C6130B
(Graphics techniques)",
corpsource = "Lehrstuhl Informatik, Dortmund Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; computational geometry; computer
programming; halfobject technique; intersection
searching; intersection searching problem; isothetic
line segments; mathematical techniques --- Trees; query
segment; range tree; segment tree; space requirements;
trees (mathematics); update time; vertical line
segments",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Laumond:1985:EAP,
author = "Jean-Paul Laumond",
title = "Enumeration of Articulation Pairs of a Planar Graph",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "173--179",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNRS, Lab d'Automatique et d'Analyse des
Syst{\`e}mes, Toulouse, Fr",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Lab. d'Automatique et d'Analyse des Systems, CNRS,
Toulouse, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; articulation pairs; computer
programming --- Algorithms; connectivity; enumeration;
Graph Theory; graph theory; mathematical techniques;
planar graph; topological representations",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Alpern:1985:DL,
author = "Bowen Alpern and Fred B. Schneider",
title = "Defining Liveness",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "181--185",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Dep of Computer Sciences, Ithaca,
NY, USA",
classification = "723; 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 = "computer metatheory; computer programming --- Theory;
concurrency; concurrent programs; formal definition;
liveness; liveness properties; Programming Theory;
programming theory; safety; topological
characterization; topology",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Atkinson:1985:ZPC,
author = "M. D. Atkinson",
title = "On Zigzag Permutations and Comparisons of Adjacent
Elements",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "187--189",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05A05 68R05)",
MRnumber = "87c:68027",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Carleton Univ, Sch of Computer Science, Ottawa,
Ont, Can",
classification = "723; 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 = "adjacent elements; algorithm theory; Algorithms;
computer programming; elementary algorithm; zigzag
permutations",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Robert:1985:SAL,
author = "Yves Robert and Maurice Tchuente",
title = "A systolic array for the longest common subsequence
problem",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "191--198",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35 (68Q20)",
MRnumber = "87m:68046",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNRS, Lab TIM3, St. Martin d'Heres, Fr",
classification = "722; 723; B1130B (Computer-aided circuit analysis
and design); B2570 (Semiconductor integrated circuits);
C7410D (Electronic engineering computing)",
corpsource = "Inst. IMAG, CNRS, Saint Martin d'Heres, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "circuit CAD; computer architecture; computer
programming --- Algorithms; longest common subsequence
problem; longest common subsequent problem; systolic
array; VLSI",
pubcountry = "Netherlands A05",
treatment = "P Practical",
}
@Article{Keedy:1985:EUS,
author = "J. L. Keedy and B. Freisleben",
title = "On the Efficient Use of Semaphore Primitives",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "199--205",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Technische Hochschule Darmstadt, Inst f{\"u}r
Praktische Informatik, Darmstadt, West Ger",
affiliationaddress = "Technische Hochschule Darmstadt, Inst f{\"u}r
Praktische Informatik, Darmstadt, West Ger",
classification = "723; C6150J (Operating systems)",
corpsource = "Inst. f{\"u}r Praktische Informatik, Tech. Hochshule
Darmstadt, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "commutative queuing routines; computer operating
systems; critical block exit problem; event counts;
indivisible machine instructions; operating systems
(computers); OS; P operations; semaphore primitives;
sequencers; simultaneous P operations; synchronization;
system kernel; user scheduling; V operations",
pubcountry = "Netherlands A06",
treatment = "P Practical",
}
@Article{Hsiao:1985:KBS,
author = "Ching C. Hsiao and Nien-Tsu Shen",
title = "$k$-Fold Bitonic Sort on a Mesh-Connected Parallel
Computer",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "207--212",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Amdahl Corp, Sunnyvale, CA, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C6130 (Data handling techniques)",
corpsource = "Amdahl Corp., Sunnyvale, CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "bitonic sort; computational complexity; computer
systems programming; computer systems, digital; data
folding schemes; data items; k-fold bitonic sort;
memory locations; mesh-connected parallel computer;
parallel processing; SIMD computer; Sorting; sorting;
working registers",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Marchetti-Spaccamela:1985:DAC,
author = "A. Marchetti-Spaccamela and G. Romano",
title = "On Different Approximation Criteria for Subset Product
Problems",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "4",
pages = "213--218",
day = "7",
month = oct,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05C35)",
MRnumber = "87d:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ di Roma 'La Sapienza', Dipartimento d'Informatica
e Sistemistica, Rome, Italy",
affiliationaddress = "Univ di Roma 'La Sapienza', Dipartimento
d'Informatica e Sistemistica, Rome, Italy",
classification = "921; C1180 (Optimisation techniques); C4130
(Interpolation and function approximation); C4240
(Programming and algorithm theory)",
corpsource = "Dipartimento d'Informatica e Sistematica, Roma Univ.,
Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; approximation criteria;
approximation theory; dominance rule; mathematical
techniques --- Approximation Theory; optimisation;
optimization; product objective function; subsequent
product problems; subset product problems",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Meyer:1985:ISM,
author = "Bertrand Meyer",
title = "Incremental String Matching",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "219--227",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Dep of Computer Science,
Santa Barbara, CA, USA",
classification = "723; 903; C6120 (File organisation); C6130 (Data
handling techniques); C7250 (Information storage and
retrieval)",
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 = "analysis of algorithms; bibliographic search; computer
programming --- Algorithms; data handling; data
processing --- Word Processing; data structures; finite
automaton; incremental diagram construction;
incremental string matching; Information Retrieval;
information retrieval; information science; program
correctness; string matching; transition diagram",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Magott:1985:PES,
author = "Jan Magott",
title = "Performance Evaluation of Systems of Cyclic Sequential
Processes with Mutual Exclusion Using {Petri} Nets",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "229--232",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technical Univ of Wroclaw, Inst of Engineering
Cybernetics, Wroclaw, Pol",
classification = "722; 723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing)",
corpsource = "Inst. of Eng. Cybern., Tech. Univ. of Wroclaw,
Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; computer systems, digital;
concurrent systems; cyclic sequential processes; graph
theory; multiprocessing systems; mutual exclusion;
Performance; performance evaluation; Petri nets; time
factor",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kfoury:1985:UPP,
author = "A. J. Kfoury",
title = "The unwind property for programs with bounded memory",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "233--238",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q55",
MRnumber = "87a:68116",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Boston Univ, Dep of Computer Science, Boston,
MA, USA",
classification = "723; 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 = "bounded memory; computer metatheory --- Programming
Theory; computer programming; formal logic; logics of
programs; program logic; program schemes; programming
theory; programs with bounded memory; Theory;
truth-table property; unwind property",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Dobosiewicz:1985:NNS,
author = "W{\l}odzimierz Dobosiewicz",
title = "A note on natural selection",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "239--243",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Guelph, Dep of Computing \& Information
Science, Guelph, Ont, Can",
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Guelph Univ., Ont.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "auxiliary memory reservoir; computer programming ---
Algorithms; computer systems programming; external
sorting; mergesort; merging; natural selection;
replacement selection; Sorting; sorting",
pubcountry = "Netherlands A04",
treatment = "P Practical",
}
@Article{Duris:1985:TCA,
author = "Pavol {\v{D}}uri{\v{s}} and Ondrej S\'ykora and Imrich
V{\v{r}}{\soft{t}}o and Clark D. Thompson",
title = "Tight Chip Area Lower Bounds for Discrete {Fourier}
and {Walsh-Hadamard} Transformations",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "245--247",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35 (94A11)",
MRnumber = "87d:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Slovak Acad of Sciences, Computing Cent,
Bratislava, Czech",
classification = "714; 921; B1265B (Logic circuits); B2570
(Semiconductor integrated circuits); 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 = "chip area; chip area lower bounds; computational
complexity; digital arithmetic; discrete Fourier
transformations; discrete Fourier transforms; Fourier
transforms; integrated circuits, VLSI; integrated logic
circuits; mathematical transformations; Theory; tight
linear lower bounds; VLSI; VLSI circuits; VLSI
complexity; Walsh-Hadamard transformations;
Walsh-Hadamard transforms",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Supowit:1985:DSP,
author = "Kenneth J. Supowit",
title = "Decomposing a Set of Points into Chains, with
Applications to Permutation and Circle Graphs",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "249--252",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05C35 68R10 68U05)",
MRnumber = "87b:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ, Dep of Electrical Engineering \&
Computer Science, Princeton, NJ, USA",
affiliationaddress = "Princeton Univ, Dep of Electrical Engineering \&
Computer Science, Princeton, NJ, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4190
(Other numerical methods); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Princeton
Univ., NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "analysis of algorithms; circle graphs; coloring
algorithm; computational complexity; computational
geometry; computer programming --- Algorithms; graph
coloring; graph colouring; Graph Theory; mathematical
techniques; minimum coloring; permutation graphs; time
algorithm",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Derigs:1985:EDL,
author = "Ulrich Derigs",
title = "An Efficient {Dijkstra}-Like Labeling Method for
Computing Shortest Odd\slash Even Paths",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "253--258",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Rheinische Friedrich-Wilhelms-Univ Bonn, Abteilung
Operations Research, Bonn, West Ger",
affiliationaddress = "Rheinische Friedrich-Wilhelms-Univ Bonn,
Abteilung Operations Research, Bonn, West Ger",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Abteilung Operations Res., Rheinische
Friedrich-Wilhelms-Univ. Bonn, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computation theory; computer programming ---
Algorithms; Dijkstra-like labeling method; Graph
Theory; graph theory; labeling algorithm; matching;
matching algorithm; mathematical techniques; shortest
odd/even paths; shortest paths",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Birkhoff:1985:DRA,
author = "Ingrid J. M. Birkhoff",
title = "A direct routing algorithm for the bit-reversal
permutation on a shuffle-exchange network",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "259--268",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Utrecht, Dep of Computer Science,
Utrecht, Neth",
classification = "722; 723; C4230 (Switching theory)",
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-reversal permutation; computer programming ---
Algorithms; computer systems, digital; direct routing
algorithm; explicit control matrix; interconnection
network; interconnection networks; parallel
computations; Parallel Processing; parallel processing;
perfect shuffle; routing scheme; shuffle-exchange
network; switching networks",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Mannila:1985:FAR,
author = "Heikki Mannila and Kurt Mehlhorn",
title = "A fast algorithm for renaming a set of clauses as a
{Horn} set",
journal = j-INFO-PROC-LETT,
volume = "21",
number = "5",
pages = "269--272",
day = "18",
month = nov,
year = "1985",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Helsinki, Dep of Computer Science,
Helsinki, Finl",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
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 = "computational complexity; computer metatheory;
computer programming --- Algorithms; dense graph;
depth-first search; formal logic; horn clause; Horn
clause; Horn set; polynomial-time algorithm; positive
literal; renaming; renaming clauses",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Chatelin:1986:TAM,
author = "Philippe Chatelin",
title = "On Transformations of Algorithms to Multiply $2 \times
2$ Matrices",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "1--5",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20",
MRnumber = "87c:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "CNRS, Lab d'Informatique Fondamentale et
d'Intelligence Artificielle, St. Martin d'Heres, Fr",
affiliationaddress = "CNRS, Lab d'Informatique Fondamentale et
d'Intelligence Artificielle, St. Martin d'Heres, Fr",
classification = "723; 921; C1110 (Algebra); C4140 (Linear algebra)",
corpsource = "Lab. d'Inf. Fondamentale et d'Intelligence
Artificielle, CNRS, Saint Martin d'Heres, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algebraic calculus; algebraic complexity; algorithms;
Algorithms; computer programming; invariant
transformation; mathematical techniques --- Matrix
Algebra; matrix algebra; matrix multiplication;
noncommutative polynomials; optimal algorithm; program
transformation; sets of bilinear forms; Strassen
algorithm; Winograd algorithm",
pubcountry = "Netherlands A01",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on matrices \\ I.2.2 Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Automatic
Programming, Program transformation",
treatment = "T Theoretical or Mathematical",
}
@Article{Berstel:1986:EIM,
author = "Jean Berstel",
title = "Every iterated morphism yields a {co-CFL}",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "7--9",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45",
MRnumber = "87e:68055",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Pierre et Marie Curie, LITP, Paris, Fr",
classification = "721; C4210 (Formal logic)",
corpsource = "LITP, 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 = "automata theory; Context Free Languages; context-free
language; context-free languages; iterated morphism;
languages; permutation-free ward; permutation-free
word; theory; verification",
pubcountry = "Netherlands A02",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Classes defined by
grammars or automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Pan:1986:TBA,
author = "Victor Ya. Pan",
title = "The Trade-Off Between the Additive Complexity and the
Asynchronicity of Linear and Bilinear Algorithms",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "11--14",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "87c:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "State Univ of New York at Albany, Computer
Science Dep, Albany, NY, USA",
classification = "723; 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 = "additive complexity; algorithms; Algorithms;
asynchronous algorithms; bilinear algorithms; bilinear
forms; computational complexity; computer programming;
linear algorithm; linear algorithms; linearly
independent linear forms; measurement; verification",
pubcountry = "Netherlands A03",
subject = "F.2.3 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Tradeoffs among Complexity
Measures \\ I.1.2 Computing Methodologies, ALGEBRAIC
MANIPULATION, Algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Baumgarten:1986:TPC,
author = "Bernd Baumgarten and Peter Ochsenschl{\"a}ger",
title = "On termination and phase changes in the presence of
unreliable communication",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "15--20",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Gesellschaft f{\"u}r Mathematik und
Datenverarbeitung,Inst f{\"u}r Systemtechnik,
Darmstadt, West Ger",
affiliationaddress = "Gesellschaft f{\"u}r Mathematik und
Datenverarbeitung,Inst f{\"u}r Systemtechnik,
Darmstadt, West Ger",
classification = "722; 723; C4220 (Automata theory); C5620 (Computer
networks and techniques)",
corpsource = "Inst. f{\"u}r Systemtech., Gesellschaft f{\"u}r Math.
und Datenverarbeitung, Darmstadt, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computer systems, digital;
Distributed; distributed processing; distributed
systems; global termination; interprocess
communication; parallel processing; phase changes;
termination; theory; unreliable communication;
verification",
pubcountry = "Netherlands A04",
subject = "D.4.7 Software, OPERATING SYSTEMS, Organization and
Design, Distributed systems \\ F.1.1 Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
Computation, Automata \\ D.4.1 Software, OPERATING
SYSTEMS, Process Management, Synchronization",
treatment = "T Theoretical or Mathematical",
}
@Article{Clarkson:1986:LPT,
author = "Kenneth L. Clarkson",
title = "Linear Programming in ${O}(n \times 3^{d^2})$ time",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "21--24",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "90C05 (65K05)",
MRnumber = "87h:90126",
MRreviewer = "John J. Dinkel",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (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; combinational problems; combinatorial
mathematics; combinatorial problems; computational
complexity; computer programming; linear programming;
mathematical programming, linear; multidimensional
search problem; theory; time bound",
pubcountry = "Netherlands A05",
subject = "G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization, Linear programming \\ G.2.1 Mathematics
of Computing, DISCRETE MATHEMATICS, Combinatorics \\
F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Complexity Classes",
treatment = "T Theoretical or Mathematical",
}
@Article{Lingas:1986:GDT,
author = "Andrzej Lingas",
title = "The {Greedy} and {Delauney} triangulations are not bad
in the average case",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "25--31",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Linkoping Univ, Dep of Computer \& Information
Science, Linkoping, Swed@",
classification = "723; C4240 (Programming and algorithm theory)",
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 = "Algorithms; algorithms; computation theory; computer
programming; Delaunay triangulation; Delauney
triangulation; greedy triangulation; Greedy
triangulation; minimum weight triangulation; theory;
triangulation algorithms; verification; Voronoi
diagram",
pubcountry = "Netherlands A06",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms \\ G.3 Mathematics
of Computing, PROBABILITY AND STATISTICS",
treatment = "T Theoretical or Mathematical",
}
@Article{Rosier:1986:NPA,
author = "Louis E. Rosier",
title = "A Note on {Presburger} Arithmetic with Array Segments,
Permutation and Equality",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "33--35",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q05 (03D35 03F35)",
MRnumber = "87f:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Texas at Austin, Dep of Computer
Science, 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 = "array segments; assertion language; computational
complexity; computer metatheory; computer programming
languages; decision problem; finite length array
segments; languages; PERM; Presburger arithmetic;
programming languages; programming theory;
satisfiability problem; Theory; validity problem;
verification",
pubcountry = "Netherlands A07",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Decision problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Krivanek:1986:HUN,
author = "Mirko K{\v{r}}iv{\'a}nek",
title = "Hexagonal unit network---a tool for proving the
{NP-completeness} results of geometric problems",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "37--41",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (68Q25 90B10)",
MRnumber = "87d:68100",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Research Inst of Mathematical Machines, Prague,
Czech",
classification = "723; 921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory)",
corpsource = "Res. Inst. of Math. Machines, Praha, Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; computer metatheory;
Euclidean clustering; geometric problems; geometric
programming; graph theory; hexagonal unit network;
languages; mathematical techniques --- Graph Theory;
NP-completeness; polynominal transformations;
verification",
pubcountry = "Netherlands A08",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Decision problems
\\ G.2.2 Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Jacobs:1986:TRT,
author = "Christiaan T. M. Jacobs and Peter {Van Emde Boas}",
title = "Two Results on Tables",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "43--48",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (68P10)",
MRnumber = "87g:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "A. C. Yao has determined the maximal size of a finite
universe U such that it is possible to store all
subsets A of U with k elements in a table of k slots in
such a way that membership in A can be determined in a
single probe. In his model it is assumed that all
elements of A are physically stored in the table. If
this assumption is relaxed and arbitrary elements in U
can be stored in order to encode subsets A, then Yao's
upper bound is no longer valid. It fails for trivial
reasons only: a single probe lookup strategy only
exists when it is possible to encode arbitrary subsets
of U by a bitmap. Our second results is an improvement
of the optimal program size for perfect hash functions,
solving an open problem from Slot and Van Emde Boas.",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Amsterdam, Dep of Mathematics \&
Computer Science, Amsterdam, Neth",
annote = "The last author spells his name both as Van and van in
the same paper.",
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation); C6130 (Data handling techniques)",
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; computer metatheory; data
processing; Data Structures; file organisation; hash
function; optimal program size; perfect hashing;
single-probe table lookup; table lookup; theory;
verification",
pubcountry = "Netherlands A09",
subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations \\ F.2.2 Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Sorting and
searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Kriauciukas:1986:TPP,
author = "V. Kriau{\v{c}}iukas",
title = "Tree-Like Parse and Polynomial Subclasses of Search
Problems",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "1",
pages = "49--54",
day = "2",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliation = "Lithuanian SSR Acad of Sciences, Inst of Mathematics
\& Cybernetics, Vilnius, USSR",
affiliationaddress = "Lithuanian SSR Acad of Sciences, Inst of
Mathematics \& Cybernetics, Vilnius, USSR",
classification = "721; 921; C4210 (Formal logic); C4240 (Programming
and algorithm theory)",
corpsource = "Inst. of Math. and Cybern., Acad. of Sci., Vilnius,
Lithuanian SSR, USSR",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; automata theory; computational complexity;
Context Free Grammars; context-free grammars;
context-free graph grammar; languages; mathematical
techniques --- Graph Theory; NP-complete problems;
object structurability; polynomial subclasses;
polynomial time; search problems; structured objects;
theory; tree-like parse; trees (mathematics);
verification",
pubcountry = "Netherlands A10",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ I.2.8 Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Graph and tree
search strategies \\ F.4.2 Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
Other Rewriting Systems, Grammar types \\ G.2.2
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Trees \\ F.4.2 Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
Other Rewriting Systems, Parsing",
treatment = "T Theoretical or Mathematical",
}
@Article{Stojmenovic:1986:NAC,
author = "Ivan Stojmenovi{\'{c}} and Eljas Soisalon-Soininen",
title = "A Note on Approximate Convex Hulls",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "55--56",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "87e:68109",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Novi Sad, Novi Sad, Yugosl",
classification = "723; C4130 (Interpolation and function
approximation); C4240 (Programming and algorithm
theory)",
corpsource = "Inst. of Math., Novi Sad Univ., Yugoslavia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; approximate convex hulls;
approximation algorithms; approximation scheme;
computation theory; computer programming; curve
fitting; linear time algorithm; verification",
pubcountry = "Netherlands A01",
subject = "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Minimax approximation and algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Israeli:1986:IPA,
author = "Amos Israeli and Y. Shiloach",
title = "An Improved Parallel Algorithm for Maximal Matching",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "57--60",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (68R10)",
MRnumber = "87g:68023",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (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; algorithms; computational complexity;
computer programming; computer systems, digital ---
Parallel Processing; CRCW-PRAM; graph matching; graph
theory; graphs; mathematical techniques --- Graph
Theory; maximal matching; parallel algorithm;
performance; undirected graphs; verification",
pubcountry = "Netherlands A02",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms \\ G.1.0 Mathematics of
Computing, NUMERICAL ANALYSIS, General, Parallel
algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Pattern matching",
treatment = "T Theoretical or Mathematical",
}
@Article{Dai:1986:ELM,
author = "Ke-Chang Dai",
title = "{EDISON-80}, a language for modular programming of
parallel processes",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "61--72",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Jiao-Tung Univ, Shanghai, China",
classification = "722; 723; C6115 (Programming support); C6140D (High
level languages)",
corpsource = "Jiao-Tung Univ., Shanghai, China",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "compilation facility; computer programming languages;
computer systems, digital --- Parallel Processing;
design; EDISON-80; high level languages; high-level
languages; Intel development system; interpreted
language; languages; modular programming; nontrivial
system software; parallel processing; programming
environment; programming environments; programming
language; separate compilation",
pubcountry = "Netherlands A03",
review = "ACM CR 8609-0798",
subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, EDISON \\ D.3.3 Software, PROGRAMMING
LANGUAGES, Language Constructs, Concurrent programming
structures \\ D.2.2 Software, SOFTWARE ENGINEERING,
Tools and Techniques, Modules and interfaces \\ D.3.4
Software, PROGRAMMING LANGUAGES, Processors",
treatment = "P Practical",
}
@Article{Grigoriadis:1986:LBC,
author = "M. D. Grigoriadis and B. Kalantari",
title = "A Lower Bound to the Complexity of {Euclidean} and
Rectilinear Matching Algorithms",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "73--76",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (68P10)",
MRnumber = "87d:68040",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rutgers Univ, 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 = "Algorithms; algorithms; complexity; computational
complexity; computer programming; Euclidean matching;
Euclidean matching algorithms; graph theory; graphs;
heuristic algorithm; lower bound; lower bounds;
mathematical techniques --- Graph Theory; performance;
rectilinear matching; rectilinear matching algorithms;
spanning trees; time complexity; undirected graphs;
verification",
pubcountry = "Netherlands A04",
review = "ACM CR 8611-1025",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms \\ F.2.2 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Pattern matching \\ I.2.8 Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search, Heuristic methods",
treatment = "T Theoretical or Mathematical",
}
@Article{Israeli:1986:FSR,
author = "Amos Israeli and A. Itai",
title = "A fast and simple randomized parallel algorithm for
maximal matching",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "77--80",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "87d:68041",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(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; algorithms; computational complexity;
computer programming; CRCW-PRAM; graph theory; graphs;
input graph; mathematical techniques --- Graph Theory;
maximal matching; parallel algorithm; parallel
processing; parallel randomized algorithm; randomized
parallel algorithm; undirected graphs; verification",
pubcountry = "Netherlands A05",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms \\ G.2.2 Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Pattern matching",
treatment = "T Theoretical or Mathematical",
}
@Article{Martel:1986:LBP,
author = "Charles U. Martel",
title = "Lower bounds on parallel algorithms for finding the
first maximal independent set",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "81--85",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "87d:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Davis, CA, USA",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Div. of Comput. Sci., California Univ., CA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computational complexity;
computer programming; computer systems, digital ---
Parallel Processing; deterministic algorithm; first
maximal independent set; lower bound; lower bounds;
maximal independent set; oracles; parallel algorithm;
parallel algorithms; parallel processing; performance;
sequential structure; theory",
pubcountry = "Netherlands A06",
review = "ACM CR 8705-0388",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures \\ F.1.2
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Modes of Computation, Parallelism \\ F.1.3 Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES,
Complexity Classes \\ G.2.2 Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Graph algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Cialdea:1986:SRP,
author = "Marta Cialdea",
title = "Some remarks on the possibility of extending
resolution proof procedures to intuitionistic logic",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "87--90",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "03B45 (03B20 03B35 68T15)",
MRnumber = "87j:03016",
MRreviewer = "G. E. Mints",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNRS, Toulouse, Fr",
classification = "723; C1230 (Artificial intelligence); C4210 (Formal
logic)",
corpsource = "Langages et Syst. Inf., Univ. Paul Sabatier, Toulouse,
France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory; computer science; constructive
logic; formal languages; Formal Logic; formal logic;
formal semantics; intuitionistic logic; languages;
modal logic; resolution proof procedures; theorem
proving; theory; verification",
pubcountry = "Netherlands A07",
subject = "I.2.3 Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving,
Nonmonotonic reasoning and belief revision \\ F.4.3
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Formal Languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Goralcik:1986:VN,
author = "Pavel Goral{\v{c}}{\'\i}k and V{\'{a}}clav Koubek",
title = "Verifying nonrigidity",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "91--95",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05C99 08A35 68Q15 68Q40)",
MRnumber = "88a:68051",
MRreviewer = "H.-J. Hoehnke",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Charles Univ, Prague, Czech",
classification = "921; C4240 (Programming and algorithm theory)",
corpsource = "Fac. of Math. and Phys., Charles Univ., Praha,
Czechoslovakia",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algebra; algorithms; computational complexity; finite
algebra; homomorphisms; languages; mathematical
techniques; nonrigid; nonrigidity problem; NP-complete;
NP-completeness; rigidity; theory; verification",
pubcountry = "Netherlands A08",
subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS,
Numerical Linear Algebra \\ F.4.3 Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Formal Languages, Algebraic language theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Snir:1986:EBA,
author = "Marc Snir",
title = "Exact Balancing is not Always Good",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "97--102",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25",
MRnumber = "87i:68031",
MRreviewer = "Colin J. H. McDiarmid",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Math. and Comput. Sci., Hebrew Univ. of
Jerusalem, Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; Algorithms; algorithms; binary tree;
computer programming; divide-and-conquer algorithms;
exact balancing; optimum tree; recurrence relations;
trees (mathematics); verification",
pubcountry = "Netherlands A09",
review = "ACM CR 8612-1108",
subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Recurrences and difference equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Webster:1986:CDE,
author = "Max B. Webster and Paul W. Baker",
title = "A Class of Differential Equations for Testing Variable
Step-Size Integration",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "2",
pages = "103--107",
day = "18",
month = jan,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of New South Wales, Kensington, Aust",
classification = "723; 921; C1120 (Mathematical analysis); C4160
(Numerical integration and differentiation); C4170
(Differential equations)",
corpsource = "Sch. of Electr. Eng. and 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 = "computer programming; differential equations;
experimentation; harmonic equation; integration;
integration subroutines; mathematical techniques ---
Differential Equations; nonlinear differential
equations; performance; Subroutines; testing; variable
step-size numerical integration; variable-step-size
integration",
pubcountry = "Netherlands A10",
review = "ACM CR 8608-0729",
subject = "G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS,
Ordinary Differential Equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Kumar:1986:PFQ,
author = "P. {Srinivas Kumar} and M. Manohar",
title = "On Probability of Forest of Quadtrees Reducing to
Quadtrees",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "109--111",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "ISRO Satellite Cent, Bangalore, India",
classification = "723; 921; C1140Z (Other topics in statistics); C6120
(File organisation); C6130B (Graphics techniques)",
corpsource = "ISRO Satellite Center, Bangalore, India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "binary image; computer graphics; data processing ---
Data Structures; data structures; design; forest of
quadtrees; FQT; image data structures; image
processing; mathematical techniques --- Trees;
probability; QT; quadtrees; space efficiency; theory",
pubcountry = "Netherlands A01",
subject = "I.3.m Computing Methodologies, COMPUTER GRAPHICS,
Miscellaneous \\ E.1 Data, DATA STRUCTURES, Trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Ambos-Spies:1986:IPT,
author = "Klaus Ambos-Spies",
title = "Inhomogeneities in the polynomial-time degrees: the
degrees of super sparse sets",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "113--117",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15",
MRnumber = "88e:68036",
MRreviewer = "Ronald V. Book",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Dortmund, Dortmund, West Ger",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl f{\"u}r Inf. II, Dortmund Univ., West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "complexity; computational complexity; computer
metatheory; many-one reducibility; NP; NP-sets;
polynomial-time degrees; polynomial-time
reducibilities; relative complexity; super sparse sets;
theory; verification",
pubcountry = "Netherlands A02",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous \\ F.1.3 Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Complexity Classes,
Reducibility and completeness",
treatment = "T Theoretical or Mathematical",
}
@Article{Aurenhammer:1986:ODW,
author = "Franz Aurenhammer",
title = "The one-dimensional weighted {Vorono{\u{\i}}diagram}",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "119--123",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "87h:68140",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technical Univ of Graz, Graz, Aust",
classification = "723; C4190 (Other numerical methods); C4240
(Programming and algorithm theory)",
corpsource = "Inst. for Inf. Processing, IIG, Tech. Univ. of Graz,
Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; collinear WVDs; computation theory;
computational geometry; computer metatheory; computer
programming --- Algorithms; Euclidean plane; geometric
interpretation; optimal algorithm; theory; upper
bounds; verification; weighted points; weighted Voronoi
diagram",
pubcountry = "Netherlands A03",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations \\
G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous",
treatment = "T Theoretical or Mathematical",
}
@Article{Carpi:1986:SWP,
author = "Arturo Carpi and Aldo {De Luca}",
title = "Square-free words of partially commutative free
monoids",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "125--131",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (20M05 20M35)",
MRnumber = "87g:68035",
MRreviewer = "Andr{\'e} Lentin",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Rome, Rome, Italy",
annote = "Cannot tell if second author name is `de Luca' or `De
Luca'; title and author on first page are all caps, and
index has `De Luca, A.'.",
classification = "721; C4290 (Other computer theory)",
corpsource = "Inst. of Fundamental Math., Rome Univ., Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computational linguistics;
decidability; Formal Languages; languages; partially
commutative free monoids; square-free elements;
square-free words; theory; verification",
pubcountry = "Netherlands A04",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous \\ F.4.3 Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal
Languages, Algebraic language theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Hattori:1986:NGS,
author = "Yoshio Hattori",
title = "Nonisomorphic graphs with the same {$T$}-polynomial",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "133--134",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "05C50 (15A15)",
MRnumber = "87g:05157",
MRreviewer = "E. J. Farrell",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Kyoto Univ, Kyoto, Jpn",
classification = "921; C1160 (Combinatorial mathematics)",
corpsource = "Inst. of Atomic Energy, Kyoto Univ., Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Graph Theory; graph theory; graphs; mathematical
techniques; nonisomorphic graphs; spanning trees;
t-polynomial; T-polynomial; theory; undirected graph",
pubcountry = "Netherlands A05",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Gire:1986:TDP,
author = "F. Gire",
title = "Two decidability problems for infinite words",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "135--140",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (03D05)",
MRnumber = "87f:68044",
MRreviewer = "Karel Culik II",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "LITP, Paris, Fr",
classification = "721; C4210 (Formal logic); C4290 (Other computer
theory)",
corpsource = "LITP, Paris 7 Univ., France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; computational linguistics;
decidability; decidability problems; emptiness problem;
Formal Languages; infinitary language; infinitary
rational relation; infinite words; languages;
omega-equality set; omega-post correspondence problem;
post correspondence problem; theory; verification",
pubcountry = "Netherlands A06",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Algebraic language
theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Hughes:1986:NRL,
author = "R. John Muir Hughes",
title = "A Novel Representation of Lists and its Application to
the Function `Reverse'",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "141--144",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Chalmers Technical Univ, Goteborg, Swed",
classification = "723; C6130 (Data handling techniques)",
corpsource = "Inst. for Dataprocessing, Chalmers Tech. Univ.,
Goteborg, Sweden",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming; data processing; data
representation; Data Structures; first-class functions;
functional programming; list processing; naive reverse;
program transformation; programming; reverse function;
theory",
pubcountry = "Netherlands A07",
subject = "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous
\\ E.1 Data, DATA STRUCTURES, Lists \\ I.1.1 Computing
Methodologies, ALGEBRAIC MANIPULATION, Expressions and
Their Representation, Representations (General and
Polynomial)",
treatment = "P Practical",
}
@Article{Schwer:1986:RPN,
author = "Sylvianne R. Schwer",
title = "On the rationality of {Petri} net languages",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "145--146",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q45 (68Q90)",
MRnumber = "87f:68051",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNRS, Talence, Fr",
classification = "721; C1160 (Combinatorial mathematics)",
corpsource = "Bordeaux 1 Univ., Talence, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "automata theory; graph theory; languages; Petri net;
Petri net languages; pumping lemma; rationality;
theory; verification",
pubcountry = "Netherlands A08",
subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Models of Computation, Unbounded-action
devices \\ F.4.3 Theory of Computation, MATHEMATICAL
LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic
language theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1986:SCD,
author = "Lin Chen",
title = "{$O(1)$} space complexity deletion for {AVL} trees",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "147--149",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Fudan Univ, Shanghai, China",
classification = "723; 921; C1160 (Combinatorial mathematics); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Fudan Univ., Shanghai, China",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithmic complexity; Algorithms; algorithms; AVL
trees; binary search tree; computational complexity;
computer metatheory; computer programming; data
structures; mathematical techniques --- Trees; node
deletion; space complexity; space complexity deletion;
theory; trees (mathematics)",
pubcountry = "Netherlands A09",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms \\ E.1 Data, DATA
STRUCTURES, Trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Cockayne:1986:ECS,
author = "E. J. Cockayne and D. E. Hewgill",
title = "Exact computation of {Steiner} Minimal Trees in the
plane",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "151--156",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05C05 68Q25 68R10)",
MRnumber = "87m:68027",
MRreviewer = "D. T. Lee",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Victoria, Victoria, BC, Can",
classification = "723; 921; C1160 (Combinatorial mathematics); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Math., Victoria Univ., BC, Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computability; computational
complexity; computer programming; mathematical
techniques --- Trees; Steiner minimal tree; Steiner
Minimal Trees; Steiner points; theory; trees
(mathematics); verification",
pubcountry = "Netherlands A10",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Shock:1986:CMC,
author = "Robert C. Shock",
title = "Computing the minimum cover of functional
dependencies",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "157--159",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Wright State Univ, Dayton, OH, USA",
classification = "723; C4240 (Programming and algorithm theory); C4250
(Database theory)",
corpsource = "Dept. of Comput. Sci., 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; computability; computer programming ---
Algorithms; database systems; database theory;
functional dependencies; minimum cover; nonredundant
cover; Relational; theory; verification",
pubcountry = "Netherlands A11",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous",
treatment = "T Theoretical or Mathematical",
}
@Article{Kallay:1986:CHM,
author = "Michael Kallay",
title = "Convex hull made easy",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "3",
pages = "161--161",
day = "3",
month = mar,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Israel Aircraft Industries Ltd, Isr",
classification = "921; C1180 (Optimisation techniques)",
corpsource = "Div. of Eng., Israel Aircraft Ind. Ltd., Israel",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "convex hull; linear program; linear programming;
linear-time preprocessing; mathematical programming,
linear; theory; verification",
pubcountry = "Netherlands A12",
subject = "G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization, Linear programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Jaumard:1986:EAT,
author = "Brigitte Jaumard and Michel Minoux",
title = "An Efficient Algorithm for the Transitive Closure and
a Linear Worst-Case Complexity Result for a Class of
Sparse Graphs",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "163--169",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05-04 68R10)",
MRnumber = "87g:68025",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rutgers State Univ of New Jersey, New Brunswick,
NJ, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Hill Center for the Math. Sci., Rutgers State Univ. of
New Jersey, New Brunswick, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; arcs; circuit-free graph;
complexity of algorithms; computational complexity;
computer programming; computer programming languages
--- List Processing; data processing --- Data
Structures; data structures; directed graph; efficient
algorithm; graph theory; in-degrees; linear worst-case
complexity result; list processing; low density
circuitless graphs; low density graphs; mathematical
techniques --- Graph Theory; sparse graphs; theory;
transitive closure; transitive closure of A graph;
vertices",
pubcountry = "Netherlands A01",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory \\ F.1.3 Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Complexity Classes",
treatment = "T Theoretical or Mathematical",
}
@Article{Keil:1986:TDI,
author = "J. Mark Keil",
title = "Total domination in interval graphs",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "171--174",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Saskatchewan, Saskatoon, Sask, Can",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Saskatchewan Univ., Sask.,
Canada",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; complexity of algorithm;
computational complexity; computer programming; graph
theory; intersection graph; interval graph; interval
graphs; linear algorithm; mathematical techniques ---
Graph Theory; one-to-one correspondence; theory; total
domination problem; verification; vertices",
pubcountry = "Netherlands A02",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Panny:1986:NHM,
author = "Wolfgang Panny",
title = "A note on the higher moments of the expected behavior
of straight insertion sort",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "175--177",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Wirtschaftsuniversitaet Wien, Vienna, Austria",
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Abteilung for Math. Methoden der Stat.,
Wirtschaftsuniv. Wien, Austria",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm analysis; algorithm theory; algorithms;
analysis of algorithms; asymptotic behaviour; computer
programming --- Algorithms; computer systems
programming; higher moments; insertion sort;
inversions; permutations; random variable; runtime; RV;
Sorting; sorting; sorting algorithms; straight
insertion sort; theory",
pubcountry = "Netherlands A03",
subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm analysis \\ I.1.2 Computing Methodologies,
ALGEBRAIC MANIPULATION, Algorithms, Analysis of
algorithms \\ G.2.1 Mathematics of Computing, DISCRETE
MATHEMATICS, Combinatorics, Permutations and
combinations \\ F.2.2 Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sorting and searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Hamburg:1986:TTV,
author = "Mark C. Hamburg",
title = "Two Tagless Variations on the {Deutsch--Schorr--Waite}
Algorithm",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "179--183",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Michigan Univ., Ann Arbor, MI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computer programming; computer
programming languages --- List Processing; data
management; data processing --- Data Structures; data
structures; Deutsch--Schorr--Waite algorithm;
Deutsch-Schorr-Wait algorithm; directed graphs; list
processing; loop invariants; mathematical techniques
--- Graph Theory; storage management; tag bit; tag-free
marking algorithms; theory",
pubcountry = "Netherlands A04",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms \\ G.4 Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm analysis
\\
I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Loui:1986:ECN,
author = "Michael C. Loui and Teresa A. Matsushita and Douglas
B. West",
title = "Election in a Complete Network with a Sense of
Direction",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "185--187",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See corrigendum \cite{Loui:1988:CEC}.",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana,
IL, USA",
classification = "718; 722; 723; C1140E (Game theory); C1160
(Combinatorial mathematics)",
corpsource = "Coll. of Eng., Illinois Univ., Urbana, IL, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; asynchronous processors; bidirectional
link; communication complexity; complete network;
computer networks; computer programming --- Algorithms;
computer systems, digital --- Distributed; computers,
digital --- Data Communication Systems; decision
theory; distributed algorithm; distributed algorithms;
Electron Problem; graph theory; Hamiltonian cycle;
message complexity; sense of direction; theory",
pubcountry = "Netherlands A05",
subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Models of Computation, Unbounded-action
devices \\ G.2.2 Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Carlsson:1986:SFS,
author = "Svante Carlsson",
title = "{{\sc Splitmerge}}: a fast stable merging algorithm",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "189--192",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Lund Univ, Lund, Swed",
classification = "723; C1160 (Combinatorial mathematics); 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 = "algorithm analysis; algorithms; analysis of
algorithms; average-case behaviour; computational
complexity; computer programming --- Algorithms;
computer systems programming; Merging; merging; merging
algorithm; ordered lists; SPLITMERG; stable merging;
stable merging algorithms; stable way; theory;
worst-case behaviour",
pubcountry = "Netherlands A06",
subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm analysis \\ I.1.2 Computing Methodologies,
ALGEBRAIC MANIPULATION, Algorithms, Analysis of
algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sorting and searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Codenotti:1986:NVC,
author = "B. Codenotti and G. Lotti",
title = "A note on the {VLSI} counter",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "193--195",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Istituto di Elaborazione dell'Informazione,
Pisa, Italy",
classification = "713; 714; B1265B (Logic circuits); B2570
(Semiconductor integrated circuits); C4240 (Programming
and algorithm theory)",
corpsource = "Istituto di Elaborazione, Pisa, Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "area-time complexity; area-time complexity of VLSI
circuits; computational complexity; counting circuits;
delay time; Design; design; electronic circuits,
counting; integrated circuits, VLSI --- Design; lower
bound; number of elements; parallel counter; theory;
upper bound; VLSI; VLSI counter; VLSI model; VLSI
network",
pubcountry = "Netherlands A07",
subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Complexity Classes \\ C.5.4 Computer Systems
Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI
Systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Gajewska:1986:DHO,
author = "Hania Gajewska and Robert E. Tarjan",
title = "Deques with heap order",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "197--200",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723; 922; C1140C (Queueing 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 = "auxiliary heap; complexity of algorithms; computer
programming --- Algorithms; data processing; Data
Structures; data structures; deque; double-ended queue;
heap order; priority queue; priority queues;
probability --- Queueing Theory; queueing theory;
real-valued key; theory; verification; worst-case
time",
pubcountry = "Netherlands A08",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ E.4 Data, CODING AND
INFORMATION THEORY, Data compaction and compression",
treatment = "T Theoretical or Mathematical",
}
@Article{Richards:1986:DCG,
author = "Dana Richards",
title = "Data compression and {Gray}-code sorting",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "201--205",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA",
classification = "723; 731; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "codes, symbolic; comparison based sorting;
comparison-based sorting; computer systems programming
--- Sorting; data compression; data processing --- File
Organization; differencing; full mixed-radix case; gray
codes; Gray-code sorting; radix sorting; sorting;
storage management; theory; verification",
pubcountry = "Netherlands A09",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ E.4 Data, CODING AND
INFORMATION THEORY, Data compaction and compression",
treatment = "T Theoretical or Mathematical",
}
@Article{Choi:1986:CQP,
author = "Key-Sun S. Choi and Gil Chang Kim",
title = "A Controlled Quantification in Parsing of {Montague}
Grammar",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "207--216",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Korea Advanced Inst of Science \& Technology,
Seoul, South Korea",
classification = "721; 723; C4210 (Formal logic); C4290 (Other
computer theory)",
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 = "algorithms; automata theory; Computational
Linguistics; computational linguistics; computer
programming --- Algorithms; context-free rule;
controlled quantification; controlled semantic
equivalence parsing; CSEP; English sentence; grammars;
intensional logical formulas; languages; logical
translation; Montague grammar; natural language
processing; parsing; parsing algorithm; parsing
algorithms; PTQ; syntactic rules; theory",
pubcountry = "Netherlands A10",
subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Grammars and Other Rewriting Systems,
Parsing",
treatment = "T Theoretical or Mathematical",
}
@Article{Highnam:1986:OAF,
author = "P. T. Highnam",
title = "Optimal Algorithms for Finding the Symmetries of a
Planar Point Set",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "219--222",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05",
MRnumber = "87h:68144",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA",
classification = "723; C4190 (Other numerical methods)",
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 = "Algorithms; algorithms; asymptotically optimal
algorithm; computational geometry; computer
programming; linear pattern-matching; mirror symmetry;
optimal algorithms; planar point set; rotational
symmetries; string matching; symmetry; theory;
verification",
pubcountry = "Netherlands A01",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems and
computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Pawagi:1986:APU,
author = "Shaunak Pawagi and I. V. Ramakrishnan",
title = "An {$O(\log n)$} algorithm for parallel update of
minimum spanning trees",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "223--229",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q25 (05C05 68R10 90B10)",
MRnumber = "87h:68072",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Maryland, College Park, MD, USA",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
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; computer programming --- Algorithms;
computer systems, digital --- Parallel Processing;
graph algorithms; Graph Theory; graph theory;
mathematical techniques; minimum spanning trees; O(log
n) algorithm; parallel algorithms; parallel processing;
parallel random access machine; parallel update;
theory; trees (mathematics); verification",
pubcountry = "Netherlands A02",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees \\ G.2.2 Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Graph algorithms
\\
G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Li:1986:SMC,
author = "Ming Li and Yaacov Yesha",
editor = "G. R. Andrews",
title = "String-Matching Cannot Be Done by a Two-Head One-Way
Deterministic Finite Automaton",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "231--235",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20",
MRnumber = "87h:68058",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
series = "22",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Ithaca, NY, USA",
classification = "721; C4220 (Automata 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 = "automata theory; finite automata; k-head finite
automata; Kolmogorov complexity; lower bounds;
string-matching; theory; Turning machine; two-head
one-way deterministic finite automaton; verification",
pubcountry = "Netherlands A03",
subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Models of Computation, Automata \\ F.2.2
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Evans:1986:ETS,
author = "John B. Evans",
title = "Experiments with Trees for the Storage and Retrieval
of Future Events",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "237--242",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Hong Kong, Hong Kong",
classification = "723; 921; C1160 (Combinatorial mathematics); C6120
(File organisation); C6130 (Data handling techniques)",
corpsource = "Centre of Comput. Studies and Applications, Hong Kong
Univ., Hong Kong",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer programming --- Algorithms; computer
simulation; data handling; data processing; Data
Structures; data structures; discrete event simulation;
discrete-event simulation; event scheduling; events
retrieval; events storage; experimentation;
mathematical techniques --- Trees; theory;
tree-balancing; trees; trees (mathematics)",
pubcountry = "Netherlands A04",
subject = "I.6.1 Computing Methodologies, SIMULATION AND
MODELING, Simulation Theory, Types of simulation
(continuous and discrete) \\ I.1.2 Computing
Methodologies, ALGEBRAIC MANIPULATION, Algorithms,
Analysis of algorithms \\ I.2.8 Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Graph and tree
search strategies",
treatment = "T Theoretical or Mathematical",
}
@Article{Gupta:1986:ASU,
author = "G. K. Gupta and B. Srinivasan",
title = "Approximate storage utilization of {$B$}-trees",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "243--246",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Monash Univ, Clayton, Aust",
classification = "723; 921; C1160 (Combinatorial mathematics); C6120
(File organisation)",
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 = "approximate storage utilisation; b-trees; B-trees;
data processing; Data Structures; data structures;
mathematical techniques --- Trees; storage management;
storage utilization; theory; trees (mathematics)",
pubcountry = "Netherlands A05",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Bourret:1986:LUB,
author = "Paul Bourret and R. {Souza de Oliveira}",
title = "Lower and upper bounds of the sizes of domains:
estimates and experiments",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "247--253",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "ONERA, Toulouse, Fr",
classification = "723; 922; C6160D (Relational databases)",
corpsource = "ONERA, Centre d'Etudes et de Recherches en Inf.,
Toulouse, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "database systems; domain size; estimates computation;
experimentation; lower bounds; Relational; relational
databases; statistical method; statistical methods;
theory; upper bounds",
pubcountry = "Netherlands A06",
subject = "H.2.m Information Systems, DATABASE MANAGEMENT,
Miscellaneous \\ G.3 Mathematics of Computing,
PROBABILITY AND STATISTICS",
treatment = "T Theoretical or Mathematical",
}
@Article{Bernstein:1986:DSC,
author = "Herbert J. Bernstein",
title = "Determining the shape of a convex $n$-sided polygon by
using $2n+k$ tactile probes",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "255--260",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (68Q20)",
MRnumber = "87h:68141",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "New York Univ, New York, NY, USA",
classification = "723; C4190 (Other numerical methods); C4240
(Programming and algorithm theory)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, 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 --- Algorithms; computer
vision; convex n-sided polygon; convex polygons;
design; robotics; tactile probes; theory;
verification",
pubcountry = "Netherlands A07",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations \\
I.2.9 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Robotics, Sensors",
treatment = "T Theoretical or Mathematical",
}
@Article{Keller:1986:STP,
author = "Arthur M. Keller",
title = "Set-Theoretic Problems of Null Completion in
Relational Databases",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "261--265",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "87h:68026",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
abstract = "When considering using databases to represent
information, the relationship between two facts where
one may imply the other needs to be addressed. In
relational databases, this question becomes whether
null completion is assumed. That is, does a (possibly
partially-defined) tuple imply the existence of tuples
that are ``less informative'' than the original tuple.
We show that no relational algebra, that assumes
equivalence under null completion, can include
set-theoretic operators that are compatible with
ordinary set theory. Thus, the approach of x-relations
is incompatible with the axioms of a boolean algebra.",
acknowledgement = ack-nhfb,
affiliationaddress = "Stanford Univ, Stanford, CA, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C6160D
(Relational databases)",
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 = "Boolean algebra; database systems; incomplete
information; mathematical techniques --- Set Theory;
null completion; null values; Relational; relational
databases; set theory; set-theoretic operators; theory;
verification; x-relation",
pubcountry = "Netherlands A08",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous \\ H.2.m Information Systems, DATABASE
MANAGEMENT, Miscellaneous \\ H.2.1 Information Systems,
DATABASE MANAGEMENT, Logical Design",
treatment = "T Theoretical or Mathematical",
}
@Article{Manolopoulos:1986:BSI,
author = "Yannis Manolopoulos",
title = "Batched Search of Index Sequential Files",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "267--272",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Thessaloniki, Thessaloniki, Greece",
classification = "723; 903; C6160 (Database management systems
(DBMS))",
corpsource = "Dept. of Electr. Eng., Thessaloniki Univ., Greece",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "batched search; database management systems; database
systems; index sequential files; information retrieval
systems --- Online Searching; on-line search;
Performance; performance; query; theory; verification",
pubcountry = "Netherlands A09",
subject = "H.2.m Information Systems, DATABASE MANAGEMENT,
Miscellaneous \\ H.3.3 Information Systems, INFORMATION
STORAGE AND RETRIEVAL, Information Search and
Retrieval, Search process \\ F.2.2 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Pattern matching",
treatment = "P Practical",
}
@Article{Alanko:1986:CCT,
author = "Timo O. Alanko and R. L. Smelianski",
title = "On the calculation of control transition probabilities
in a program",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "5",
pages = "273--276",
day = "??",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Helsinki, Helsinki, Finl",
classification = "723; C4240 (Programming and algorithm theory)",
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 = "computer metatheory --- Programming Theory; computer
programming; control transition probabilities;
control-flow analysis; control-flow graph; program
behavior; program behaviour; programming theory;
Theory; theory",
pubcountry = "Netherlands A10",
subject = "F.3.3 Theory of Computation, LOGICS AND MEANINGS OF
PROGRAMS, Studies of Program Constructs",
treatment = "T Theoretical or Mathematical",
}
@Article{Lickteig:1986:GEO,
author = "Thomas Lickteig",
title = "{Gaussian} elimination is optimal for solving linear
equations in dimension two",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "277--279",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "65F10 (12-04 68Q25)",
MRnumber = "87k:65040",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ T{\"u}bingen, T{\"u}bingen, West Ger",
classification = "723; 921; C4140 (Linear algebra); C4240 (Programming
and algorithm theory)",
corpsource = "Math. Inst., T{\"u}bingen Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computational complexity; dimension two; Gaussian
elimination; linear equations; mathematical
programming; mathematical techniques; matrix algebra;
matrix operations; straight-line programs; theory;
verification",
pubcountry = "Netherlands A01",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on matrices \\ F.1.3 Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES,
Complexity Classes, Reducibility and completeness",
treatment = "T Theoretical or Mathematical",
}
@Article{Hanatani:1986:SCD,
author = "Yoshito Hanatani and Ronald Fagin",
title = "A Simple Characterization of Database Dependency
Implication",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "281--283",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "87h:68025",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ de Paris-Sud, Orsay, Fr",
classification = "723; C4250 (Database theory)",
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/",
journalabr = "Inf Process Lett",
keywords = "database dependency implication; database systems;
database theory; functional dependency; logical
implication; multivalued dependency; Relational;
relational database; relational databases;
set-theoretic characterization; theory; verification",
pubcountry = "Netherlands A02",
subject = "H.2.m Information Systems, DATABASE MANAGEMENT,
Miscellaneous \\ G.2.m Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous",
treatment = "T Theoretical or Mathematical",
}
@Article{Parberry:1986:RRI,
author = "Ian Parberry",
title = "On recurrent and recursive interconnection patterns",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "285--289",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q35 (68R10)",
MRnumber = "87h:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Pennsylvania State Univ, University Park, PA,
USA",
classification = "722; 723; 921; C4220 (Automata theory); C5440
(Multiprocessing systems)",
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/",
journalabr = "Inf Process Lett",
keywords = "algorithms; computer systems, digital; cube-connected
cycles; finite automata; graph theory; mathematical
techniques --- Graph Theory; Parallel Processing;
parallel processing; recurrent interconnection pattern;
recurrent interconnection patterns; recursive
interconnection patterns; shuffle-exchange; synchronous
parallel computers; theory; trivalent graphs;
verification",
pubcountry = "Netherlands A03",
subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Modes of Computation, Parallelism \\ G.2.2
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Graph algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Gusfield:1986:EAA,
author = "Dan Gusfield and Leonard Pitt",
title = "Equivalent approximation algorithms for node cover",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "291--294",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05-04 05C70 68R10)",
MRnumber = "87m:68029",
MRreviewer = "Mukkai S. Krishnamoorthy",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Yale Univ, New Haven, CT, USA",
classification = "723; 921; C1160 (Combinatorial mathematics)",
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 = "Algorithms; algorithms; computer programming;
equivalent approximation algorithms; graph theory;
heuristic approach; linear time factor-of-two
approximation algorithm; mathematical techniques ---
Graph Theory; node cover; node cover problem; theory;
undirected graph; verification",
pubcountry = "Netherlands A04",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms \\ G.1.2 Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation",
treatment = "T Theoretical or Mathematical",
}
@Article{Aizawa:1986:DIA,
author = "Kunio Aizawa and Akira Nakamura",
title = "Direction-independent application of productions on
two-dimensional arrays",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "295--301",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q50",
MRnumber = "88a:68068",
MRreviewer = "Rani Siromoney",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Hiroshima Univ, Higashi-Hiroshima, Jpn",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Appl. Math., Hiroshima Univ., Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "array grammars; automata theory; context free
grammars; context-free grammars; direction-independent
2-D grammars; direction-independent grammars; finite
automata; generative powers; Grammars; graph grammars;
languages; parallel grammars; parallel processing;
production rule; productions; theory; two-dimensional
arrays; verification",
pubcountry = "Netherlands A05",
subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Grammars and Other Rewriting Systems,
Grammar types \\ F.4.3 Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal
Languages, Classes defined by grammars or automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Dehne:1986:AME,
author = "Frank Dehne",
title = "{$O(n^{1/2})$} algorithms for the maximal elements and
{ECDF} searching problem on a mesh-connected parallel
computer",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "303--306",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Wuerzburg, Wuerzburg, West Ger",
classification = "722; 723; C4190 (Other numerical methods); C4220
(Automata theory); C4240 (Programming and algorithm
theory)",
corpsource = "Lehrstuhl f{\"u}r Inf. I, Wurzburg Univ., West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computational complexity;
computational geometry; computer programming;
computers, digital --- Parallel Processing; ECDF
searching; ECDF searching problem; Euclidean plane;
finite automata; mech-connected parallel computer;
mesh-connected parallel computer; parallel algorithms;
parallel complexity; parallel processing; theory;
verification",
pubcountry = "Netherlands A06",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms \\ F.2.2 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations \\ F.2.2 Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sorting and searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Apt:1986:LAV,
author = "Krzysztof R. Apt and Dexter C. Kozen",
title = "Limits for automatic verification of finite-state
concurrent systems",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "307--309",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10 (03B70)",
MRnumber = "87m:68018",
MRreviewer = "L{\'a}szl{\'o} Csirmaz",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown
Heights, NY, USA",
classification = "723; C4220 (Automata theory); 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 = "automatic verification; computer metatheory ---
Programming Theory; computer programming; finite
automata; finite-state concurrent program; finite-state
concurrent systems; logics of programs; parallel
processing; program correctness; program verification;
programming theory; schematic programs; Theory; theory;
verification",
pubcountry = "Netherlands A07",
subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program
Verification \\ F.3.1 Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Specifying and Verifying and
Reasoning about Programs, Logics of programs \\ F.3.1
Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Mechanical verification \\ D.4.1 Software, OPERATING
SYSTEMS, Process Management, Concurrency",
treatment = "T Theoretical or Mathematical",
}
@Article{Arora:1986:DTD,
author = "R. K. Arora and S. P. Rana and M. N. Gupta",
title = "Distributed termination detection algorithm for
distributed computations",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "311--314",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q10",
MRnumber = "87j:68034a",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See also comments
\cite{Tan:1986:CDT,Arora:1988:MCD}.",
acknowledgement = ack-nhfb,
affiliationaddress = "Indian Inst of Technology, Hauz Khas, India",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5620 (Computer networks and techniques)",
corpsource = "Dept. of Comput. Sci. and Engng., Indian Inst. of
Technol., New Delhi, India",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computer programming; computer
systems, digital --- Distributed; correctness
arguments; detection algorithm; distributed
computations; distributed processing; distributed
program; distributed termination; distributed
termination detection; programming theory; symmetric
algorithm; theory; verification",
pubcountry = "Netherlands A08",
subject = "D.4.4 Software, OPERATING SYSTEMS, Communications
Management \\ D.4.7 Software, OPERATING SYSTEMS,
Organization and Design, Distributed systems \\ H.2.4
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Sattolo:1986:AGR,
author = "Sandra Sattolo",
title = "An Algorithm to Generate a Random Cyclic Permutation",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "315--317",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05-04 05A05 68R05)",
MRnumber = "87g:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ di Udine, Udine, Italy",
classification = "723; 922; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Istituto di Matematica, Udine Univ., Italy",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm correctness; algorithms; Algorithms;
chi-square distribution test; combinational problems;
combinatorial mathematics; complexity; computational
complexity; computer programming; probability ---
Random Processes; random cyclic permutation; theory;
verification",
pubcountry = "Netherlands A09",
subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Combinatorial algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1986:HVB,
author = "Ernst L. Leiss and Chamaiporn Jitmedha",
title = "Horizontally and vertically bounded propagation of
privileges",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "319--327",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Houston, Houston, TX, USA",
classification = "723; C4250 (Database theory); C6160 (Database
management systems (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 = "algorithms; authorization systems; bounded propagation
of privileges; data processing --- Security of Data;
database management systems; database systems; database
theory; horizontal bounds; security of data; theory;
vertical bounds",
pubcountry = "Netherlands A10",
subject = "H.2.0 Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection \\ D.4.6
Software, OPERATING SYSTEMS, Security and Protection",
treatment = "T Theoretical or Mathematical",
}
@Article{Takaoka:1986:OPM,
author = "Tadao Takaoka",
title = "An On-Line Pattern Matching Algorithm",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "6",
pages = "329--330",
day = "30",
month = may,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Ibaraki, Hitachi, Jpn",
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Inf. Sci., Ibaraki Univ., Japan",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computer programming; data
handling; on-line editor; on-line pattern matching
algorithm; pattern input; pattern matching algorithm;
reading input symbols; response time; text editor; text
editors; theory",
pubcountry = "Netherlands A11",
subject = "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
Editing \\ I.5.4 Computing Methodologies, PATTERN
RECOGNITION, Applications, Computer vision",
treatment = "G General Review",
}
@Article{Rytter:1986:SCU,
author = "Wojciech Rytter",
title = "The Space Complexity of the Unique Decipherability
Problem",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "1--3",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Salerno, Italy",
classification = "723; 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 = "algorithms; alphabet; code-set; codewords;
computational complexity; computer metatheory;
decomposition; formal languages; graph accessibility
problem; languages; nonunique decipherability; space
complexity; theory; unique decipherability problem;
uniquely decipherable; verification",
pubcountry = "Netherlands A01",
subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Models of Computation, Automata \\ F.4.3
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Formal Languages, Algebraic language theory
\\ D.3.3 Software, PROGRAMMING LANGUAGES, Language
Constructs, Abstract data types",
treatment = "T Theoretical or Mathematical",
}
@Article{Lin:1986:LEL,
author = "Ferng-Ching Lin and Wei Kuan Shih",
title = "Long edges in the layouts of shuffle-exchange and
cube-connected cycles graphs",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "5--9",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68R10",
MRnumber = "87i:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Natl Taiwan Univ, Taipei, Taiwan",
classification = "714; 723; 921; B1130B (Computer-aided circuit
analysis and design); C4210 (Formal logic); C7410D
(Electronic engineering computing)",
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 = "circuit layout CAD; Computer Aided Design;
cube-connected cycles; cube-connected cycles graphs;
graph layout; graph theory; integrated circuits, VLSI;
layouts; mathematical techniques --- Graph Theory;
shuffle exchange cycles graphs; shuffle-exchange;
theory; verification; VLSI; VLSI layout",
pubcountry = "Netherlands A02",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory \\ F.2.2 Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout \\ C.5.4
Computer Systems Organization, COMPUTER SYSTEM
IMPLEMENTATION, VLSI Systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Tinhofer:1986:BSS,
author = "G. Tinhofer and H. Schreck",
title = "The Bounded Subset Sum Problem is Almost Everywhere
Randomly Decidable in {$O(N)$}",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "11--17",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technische Univ M{\"u}nchen, Munich, West Ger",
classification = "723; 921; C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Math., Tech. Univ. Munchen, West
Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; bounded subset sum problem; computer
programming --- Algorithms; decidability; dynamic
programming; dynamic programming algorithm; general
knapsack problems; mathematical programming;
probabilistic algorithm; randomised greedy algorithm;
verification",
pubcountry = "Netherlands A03",
subject = "G.3 Mathematics of Computing, PROBABILITY AND
STATISTICS, Probabilistic algorithms (including Monte
Carlo)",
treatment = "T Theoretical or Mathematical",
}
@Article{Schmeck:1986:MEL,
author = "Hartmut Schmeck",
title = "On the maximum edge length in {VLSI} layouts of
complete binary trees",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "19--23",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Christian-Albrechts-Univ, Kiel, West Ger",
classification = "714; 723; 921; B0250 (Combinatorial mathematics);
B1130B (Computer-aided circuit analysis and design);
B2570 (Semiconductor integrated circuits); C1160
(Combinatorial mathematics); C7410D (Electronic
engineering computing)",
corpsource = "Inst. f{\"u}r Inf. und Praktische Math.,
Christian-Albrechts-Univ., Kiel, West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "asymptotically optimal layout; circuit layout CAD;
complete binary trees; Computer Aided Design; computer
programming --- Algorithms; H-tree layout; integrated
circuits, VLSI; mathematical techniques --- Trees;
maximum edge length; theory; trees (mathematics);
verification; VLSI; VLSI layouts",
pubcountry = "Netherlands A04",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout \\ G.2.2 Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees
\\
B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids,
Layout",
treatment = "T Theoretical or Mathematical",
}
@Article{Balcazar:1986:I,
author = "Jos{\'e} L. Balc{\'a}zar",
title = "On {$\Delta^{\rm P}_2$}-immunity",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "25--28",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q15 (03D15)",
MRnumber = "87i:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Politecnica de Cataluna, Barcelona, Spain",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Fac. de 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 = "complexity; complexity classes; computational
complexity; computer metatheory; Delta /sub 2//sup
P/-immunity; immune sets; polynomial-time hierarchy;
set theory; theory; verification",
pubcountry = "Netherlands A05",
subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Modes of Computation, Relativized
computation",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1986:NEP,
author = "Karel {Culik, II} and Juhani Karhum{\"a}ki",
title = "A Note on the Equivalence Problem of Rational Formal
Power Series",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "29--31",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q70 (03D35 16A78)",
MRnumber = "88b:68138",
MRreviewer = "Dani{\`e}le Beauquier",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classification = "723; 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/",
journalabr = "Inf Process Lett",
keywords = "automata theory; communicative semiring; computer
metatheory; decidability; equality theorem; equivalence
problem; K-Sigma-automata; languages; rational formal
power series; theory; verification",
pubcountry = "Netherlands A06",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Algebraic language
theory \\ F.1.1 Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Models of Computation, Automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Kakuta:1986:PRC,
author = "K. Kakuta and H. Nakamura and S. Iida",
title = "A Parallel Reference Counting Algorithm",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "33--37",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Toyahashi Univ of Technology, Toyohashi, Jpn",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of
Technol., Japan",
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 programming languages --- lisp;
computer systems, digital --- Parallel Processing;
garbage collection; languages; parallel processing;
parallel reference counting algorithm; theory",
pubcountry = "Netherlands A07",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms \\ D.3.2 Software,
PROGRAMMING LANGUAGES, Language Classifications, LISP",
treatment = "T Theoretical or Mathematical",
}
@Article{Falkowski:1986:NQP,
author = "Bernd-J{\"u}rgen J. Falkowski and Lothar Schmitz",
title = "A Note on the Queens' Problem",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "39--46",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ der Bundeswehr M{\"u}nchen, West Ger",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Fakultat f{\"u}r Inf., Munchen Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithm theory; algorithms; Algorithms; computer
programming; eight queens; queens' problem; theory;
verification",
pubcountry = "Netherlands A08",
subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Permutations and combinations \\ G.2.1
Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Combinatorial algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Vikas:1986:DAA,
author = "O. M. Vikas and Suresh Kumar Basandra",
title = "Data algebra and its application in database design",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "1",
pages = "47--54",
day = "20",
month = jul,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P15",
MRnumber = "87h:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Indian Inst of Technology, Kanpur, India",
classification = "723; C6120 (File organisation); C6160 (Database
management systems (DBMS))",
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 mappings; canonical form; data algebra; data
items; data models; data structures; database design;
database management systems; database systems; Design;
design; hierarchical models; network models; relational
models; theory",
pubcountry = "Netherlands A09",
subject = "H.2.1 Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models",
treatment = "P Practical",
}
@Article{Lavallee:1986:FDM,
author = "Ivan Lavall{\'e}e and G{\'e}rard Roucairol",
title = "A Fully Distributed (Minimal) Spanning Tree
Algorithm",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "55--62",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20 (05C05 68R10)",
MRnumber = "87k:68055",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Paris-Sud, Orsay, Fr",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C5620 (Computer networks and techniques)",
corpsource = "LRI, Univ. Paris-Sud, Orsay, France",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; asynchronous distributed algorithm;
communication; computer programming --- Algorithms;
computer systems, digital --- Distributed; concurrency;
connected undirected graph; cooperation; distributed
algorithm; distributed network; distributed processing;
edges; fully distributed spanning tree algorithm; Graph
Theory; mathematical techniques; measurement; minimum
spanning tree; minimum spanning tree algorithm;
minimum-weighted spanning tree; nodes; performance;
processes; theory; trees (mathematics)",
pubcountry = "Netherlands A01",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms \\ G.2.2 Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees
\\ G.2.2 Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Graph algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Apostolico:1986:IWC,
author = "Alberto Apostolico",
title = "Improving the worst-case performance of the
{Hunt-Szymanski} strategy for the longest common
subsequence of two strings",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "63--69",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68Q20",
MRnumber = "87j:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Purdue Univ, West Lafayette, IN, USA",
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation)",
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 = "(a,b)-trees; Algorithms; algorithms; cardinality;
computational complexity; computer programming;
computer systems programming --- Merging; data
processing --- Data Structures; data structures;
design; dictionaries; dominant matches; finger-trees;
Hunt-Szymanski algorithm; Hunt-Szymanski strategy;
linear; linear lists; longest common subsequence;
merging; minimal candidates; performance; primitive
operations; strings; theory; time bound; verification;
worst-case performance",
pubcountry = "Netherlands A02",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms \\ D.3.3 Software,
PROGRAMMING LANGUAGES, Language Constructs, Data types
and structures",
treatment = "T Theoretical or Mathematical",
}
@Article{Rohnert:1986:SPP,
author = "Hans Rohnert",
title = "Shortest paths in the plane with convex polygonal
obstacles",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "71--76",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68U05 (68Q25)",
MRnumber = "87j:68106",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Saarbr{\"u}cken, Saarbr{\"u}cken, West
Ger",
classification = "723; 921; C4190 (Other numerical methods); C4240
(Programming and algorithm theory)",
corpsource = "Saarbrucken Univ., West Germany",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "Algorithms; algorithms; computational complexity;
computational geometry; computer programming; convex
polygonal obstacles; Euclidean plane; mathematical
techniques --- Geometry; preprocessing time; query
points; shortest paths; theory; verification;
vertices",
pubcountry = "Netherlands A03",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Path and circuit problems \\ F.2.2 Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Hoogerwoord:1986:IMI,
author = "Rob R. Hoogerwoord",
title = "An Implementation of Mutual Inclusion",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "77--80",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Dept. of Math., Eindhoven Univ. of Technol.,
Eindhoven, Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "computer metatheory --- Programming Theory; computer
programming; computer systems, digital --- Parallel
Processing; cyclic programs; deadlock; multiprocessing
programs; mutual inclusion; parallel composition;
semaphore operations; synchronisation; synchronization;
theory; Theory; verification",
pubcountry = "Netherlands A04",
subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management,
Synchronization \\ D.2.4 Software, SOFTWARE
ENGINEERING, Program Verification, Correctness proofs",
treatment = "P Practical",
}
@Article{Rytter:1986:AMA,
author = "Wojciech Rytter",
title = "An Application of {Mehlhorn}'s Algorithm for Bracket
Languages to {$\log(N)$} Space Recognition of
Input-Driven Languages",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "81--84",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Warsaw Univ, Warsaw, Pol",
classification = "721; 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 = "algorithms; automata theory; bracket languages;
computer programming --- Algorithms; context-free
languages; deterministic log(n) space; Formal
Languages; idls; input-driven languages; languages;
log(n) space recognition; Mehlhorn algorithm;
Mehlhorn's algorithm; parse tree; pushdown store;
recursion elimination; space complexity; theory; trees
(mathematics)",
pubcountry = "Netherlands A05",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Classes defined by
grammars or automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Laski:1986:ADC,
author = "Janusz Laski",
title = "An Algorithm for the Derivation of Codefinitions in
Computer Programs",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "85--90",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Oakland Univ, Rochester, MI, USA",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Sch. of Eng. and Comput. Sci., Oakland Univ.,
Rochester, MI, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; codefinitions; computer programming ---
Algorithms; computer programs; computer software; data
flow testing; data-based program testing;
definition-use chain; full context; intraprocedural
iterative algorithm; iterative algorithms; liveness;
program testing; simple context; Testing; theory;
verification",
pubcountry = "Netherlands A06",
subject = "D.2.5 Software, SOFTWARE ENGINEERING, Testing and
Debugging \\ I.1.2 Computing Methodologies, ALGEBRAIC
MANIPULATION, Algorithms, Analysis of algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Annot:1986:CMS,
author = "J. K. Annot and M. D. Janssens and A. J. {Van De
Goor}",
title = "Comments on {Morris}'s starvation-free solution to the
mutual exclusion problem {[Inform. Process. Lett. {\bf
8}(2), 15 February 1979, pp. 76--80]}",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "91--97",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
note = "See \cite{Morris:1979:SSM}.",
acknowledgement = ack-nhfb,
affiliationaddress = "Delft Univ of Technology, Delft, Neth",
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Dept. of Electr. Eng., Delft Univ. of Technol.,
Netherlands",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "algorithms; binary semaphores; computer programming
--- Algorithms; computer systems, digital; correctness;
critical section; Distributed; Morris starvation-free
solution; multiprocessing programs; multiprocessor
system; mutual exclusion problem; starvation-free
solution; theory; verification",
pubcountry = "Netherlands A07",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms \\ D.2.4 Software,
SOFTWARE ENGINEERING, Program Verification, Correctness
proofs",
treatment = "P Practical",
}
@Article{Ntafos:1986:GWG,
author = "Simeon Ntafos",
title = "On gallery watchmen in grids",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "99--102",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Texas at Dallas, Richardson, TX, USA",
classification = "723; 921; C4190 (Other numerical methods); C4240
(Programming and algorithm theory)",
corpsource = "Texas Univ., Dallas, TX, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
journalabr = "Inf Process Lett",
keywords = "2D grids; 3D grids; Algorithms; algorithms;
computational complexity; computational geometry;
computer programming; corridors; gallery watchman
problem; mathematical techniques --- Geometry; polygon
decomposition; polynomial-time solution; theory;
verification",
pubcountry = "Netherlands A08",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Franco:1986:PPA,
author = "John Franco",
title = "On the probabilistic performance of algorithms for the
satisfiability problem",
journal = j-INFO-PROC-LETT,
volume = "23",
number = "2",
pages = "103--106",
day = "20",
month = aug,
year = "1986",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Indiana Univ, Bloomington, IN, USA",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
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; algorithms; average analysis; boolean
literals; clauses; computational complexity; computer
metatheory; computer programming; constant-density
models; Davis--Putnam procedure; disjunctions;
NP-complete; NP-complete problems; NP-completeness;
performance; probabilistic analysis; probabilistic
logic; probabilistic performance; random graphs; SAT;
satisfiability problem; theory; truth values",
pubcountry = "Netherlands A09",
subject = "G.3 Mathematics of Computing, PROBABILITY AND
STATISTICS, Probabilistic algorithms (including Monte
Carlo) \\ G.4 Mathematics of Computing, MATHEMATICAL
SOFTWARE, Algorithm analysis \\ I.1.2 Computing
Methodologies, ALGEBRAIC MANIPULATION, Algorithms,
Analysis of algorithm