%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.07",
%%% date = "26 November 2002",
%%% time = "16:14:28 MDT",
%%% filename = "infoproc1980.bib",
%%% address = "Center for Scientific Computing
%%% 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 = "10778 45478 199048 1897114",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at ieee.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography, BibTeX, Information Processing
%%% Letters",
%%% 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 a World-Wide Web site at
%%%
%%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/
%%%
%%% with tables of contents from 1994 (Volume
%%% 49) to date. All of the data at that site
%%% for volumes 49--68 has been merged into
%%% this file.
%%%
%%% Abstracts and full text of articles are
%%% available electronically to qualified
%%% subscribers, which includes members of
%%% organizations with institutional
%%% subscriptions; most large universities should
%%% fall in this group. For details, visit
%%%
%%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/?menu=cont&label=table
%%%
%%% At version 2.07, 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,
Center for Scientific Computing,
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@ieee.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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
note = "See note \cite{Gries:1987:NGC}.",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
MRclass = "68C05 (52-04)",
MRnumber = "80b:68041",
MRreviewer = "D. T. Lee",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C25",
MRnumber = "80b:68050",
MRreviewer = "Henry S. Warren, Jr.",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
note = "See also erratum \cite{Aspvall:1982:ELT}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
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",
MRclass = "68C25 (52-04)",
MRnumber = "81a:68047",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
note = "See \cite{Bui:1977:SMS,Day:1980:CSM}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68C25 (05B99)",
MRnumber = "81a:68045",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
MRclass = "68D15",
MRnumber = "81a:68061",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4230D (Sequential switching theory)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
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",
MRclass = "68E10",
MRnumber = "81a:68070",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C6120 (File
organisation)",
corpsource = "Interstedelijke Industriele Hogeschool
Antwerpen-Mechelen, Antwerpen, Belgium",
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",
MRclass = "68B15 (68C25)",
MRnumber = "80j:68015",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; 921; C6130B (Graphics techniques)",
corpsource = "School of Computing Studies and Accountancy, Univ. of
East Anglia, Norwich, UK",
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",
MRclass = "68B15 (68C25)",
MRnumber = "81a:68024",
bibdate = "Tue Nov 17 17:58:41 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Princeton Univ., Princeton, NJ, USA",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Memorial Univ. of
Newfoundland, St. Johns, Nfld., Canada",
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",
MRclass = "68H05",
MRnumber = "81a:68110",
bibdate = "Tue Nov 17 17:58:46 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Inst. of Math., Tech. Univ. of Warsaw, Warsaw,
Poland",
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",
MRclass = "68C25",
MRnumber = "81b:68044",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Queensland, St.
Lucia, Qld., Australia",
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",
MRclass = "68C15",
MRnumber = "81a:68042",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Tue Nov 17 17:58:57 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Sperry Res. Center, Sudbury, MA, USA",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68C25 (52A45)",
MRnumber = "81a:68052",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723",
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",
MRclass = "68H05",
MRnumber = "80f:68110b",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Dept. of Electrical Engng. Sci., Univ. of Essex,
Colchester, UK",
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",
MRclass = "68E05",
MRnumber = "81i:68091a",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
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",
MRclass = "68C05 (68C25)",
MRnumber = "81a:68039",
bibdate = "Tue Nov 17 17:59:08 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR",
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",
MRclass = "68F10 (03D10)",
MRnumber = "81h:68080",
bibdate = "Tue Nov 17 17:59:18 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Math., Acad. of Sci., Sofia, Bulgaria",
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",
MRclass = "68C25 (10A35)",
MRnumber = "81a:68053",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Univ. of Guelph, Guelph, Ont., Canada",
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",
MRclass = "68C25 (90B05)",
MRnumber = "81e:68048",
MRreviewer = "Andrew Yao",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
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",
MRclass = "68C05 (68C25)",
MRnumber = "82d:68022",
MRreviewer = "Kabekode V. S. Bhat",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
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",
MRclass = "68D35 (68C25 68F25)",
MRnumber = "81d:68071",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Math. Centrum, Amsterdam, Netherlands",
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",
MRclass = "68C25",
MRnumber = "81a:68051",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
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",
MRclass = "68B15",
MRnumber = "81a:68026",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
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",
MRclass = "68C25",
MRnumber = "81g:68062",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Div. of Computer Sci., Tel Aviv Univ., Ramat Aviv,
Israel",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6120 (File organisation)",
corpsource = "Amdahl Corp., Sunnyvale, CA, USA",
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",
bibdate = "Tue Nov 17 17:59:29 1998",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors)",
corpsource = "Computer Sci. Dept., Southern Illinois Univ.,
Carbondale, IL, USA",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Univ. of North Carolina,
Chapel Hill, NC, USA",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6140D (High level languages)",
corpsource = "School of Math., Univ. of Bath, Bath, UK",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6130 (Data handling
techniques)",
corpsource = "Dept. of Math., Technol. Univ., Eindhoven,
Netherlands",
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",
MRclass = "68C25 (68E99)",
MRnumber = "81e:68047",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68F05 (68G10)",
MRnumber = "81e:68097",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Oregon, Eugene, OR,
USA",
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",
MRclass = "68C25 (52-04 52A10 90C25)",
MRnumber = "83e:68034a",
MRreviewer = "Selim G. Akl",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
note = "See also comments \cite{Avis:1980:CLB}.",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6160B (Distributed databases); C6160D
(Relational databases)",
corpsource = "Dept. of Appl. Math., Univ. of Nancy I, Nancy,
France",
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",
MRclass = "68E10 (68D90)",
MRnumber = "81b:68077",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
MRclass = "68D05",
MRnumber = "84c:68037",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; 722; 723; C4220 (Automata theory)",
corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa,
Poland",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Philips Res. Labs., Eindhoven, Netherlands",
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",
bibdate = "Tue Nov 17 17:59:50 1998",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
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",
note = "See \cite{Andrew:1979:AEA}.",
bibdate = "Mon Nov 16 21:38:58 MST 1998",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Nov 17 18:00:22 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA",
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",
MRclass = "90B35 (68C15)",
MRnumber = "82b:90063",
MRreviewer = "J{\'o}zef Grabowski",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4290 (Other
computer theory)",
corpsource = "Ist. di Sci dell'Informazione, Univ. di Pisa, Pisa,
Italy",
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",
MRclass = "68C25 (03D15)",
MRnumber = "82a:68071",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C25 (68E10 90D42)",
MRnumber = "82c:68023",
MRreviewer = "R. E. Stearns",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
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",
MRclass = "90B10 (68C25)",
MRnumber = "81i:90072",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
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",
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",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "School of Computing Studies, Univ. of East Anglia,
Norwich, UK",
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",
MRclass = "68E10 (68C25)",
MRnumber = "82a:68129",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., North Carolina State Univ.,
Raleigh, NC, USA",
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",
MRclass = "68B20",
MRnumber = "82a:68042",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Amdahl Corp., Sunnyvale, CA, USA",
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",
MRclass = "68C25 (52-04)",
MRnumber = "82a:68080",
MRreviewer = "D. T. Lee",
bibdate = "Sun May 02 08:27:35 1999",
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",
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",
MRclass = "68E05",
MRnumber = "81h:68052",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68D20",
MRnumber = "81i:68082",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima,
Japan",
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",
MRclass = "68F05 (03D35)",
MRnumber = "81h:68066",
bibdate = "Tue Nov 17 18:00:27 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
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",
MRclass = "68B15 (68C25)",
MRnumber = "82a:68029",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C5210 (Logic design methods)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
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",
MRclass = "68C25 (05B15)",
MRnumber = "82a:68066",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Istituto Matematico `G. Castelnuovo', Univ. di Roma,
Roma, Italy",
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",
MRclass = "68B20",
MRnumber = "82e:68027",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C1160 (Combinatorial mathematics); C4290
(Other computer theory)",
corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa,
Poland",
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",
MRclass = "68E99",
MRnumber = "81g:68100",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
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",
MRclass = "68C05 (05A99)",
MRnumber = "81j:68043",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
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",
MRclass = "68D05 (03D05)",
MRnumber = "81h:68036",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
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",
MRclass = "68B05",
MRnumber = "81h:68006",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory)",
corpsource = "Burroughs, Nuenen, Netherlands",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
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",
MRclass = "68P10",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Virginia Polytech. Inst. and
State Univ., Blacksburg, VA, USA",
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",
MRclass = "68B10 (68F25)",
MRnumber = "81g:68021",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors)",
corpsource = "MERA-Inst. of Mathematical Machines, Warsaw, Poland",
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",
MRclass = "68C25 (68E10)",
MRnumber = "82a:68064",
MRreviewer = "M. C. Golumbic",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
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",
MRclass = "68D90",
MRnumber = "82c:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Sektion Math., Humboldt-Univ. Berlin, Berlin, East
Germany",
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",
MRclass = "68C25 (68E10 90D42)",
MRnumber = "82c:68024",
MRreviewer = "R. E. Stearns",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
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",
MRclass = "65L20",
MRnumber = "81k:65100",
MRreviewer = "F. Odeh",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0290P (Differential equations); C4170 (Differential
equations)",
corpsource = "Div. of Engng., Gippsland Inst. of Advanced Education,
Churchill, Vic., Australia",
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",
MRclass = "65L05",
MRnumber = "82h:65052",
MRreviewer = "Richard Brown",
bibdate = "Sun May 02 08:27:00 1999",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Birkbeck Coll., Univ. of
London, London, UK",
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",
MRclass = "90B05 (05B40 68B20)",
MRnumber = "82a:90044",
MRreviewer = "V. Yu. Me{\u{\i}}tus",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1290 (Applications of systems theory)",
corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
USA",
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",
MRclass = "68C25 (12-04 68B20)",
MRnumber = "81k:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Computer Sci. Dept., Edinburgh Univ., Edinburgh, UK",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C5210 (Logic design methods)",
corpsource = "Dept. of Computer Sci., Australian Nat. Univ.,
Canberra, ACT, Australia",
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",
MRclass = "68G10 (68C25 68D20)",
MRnumber = "82b:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Computer Sci. Center, Univ. of Maryland, College Park,
MD, USA",
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",
MRclass = "68C25 (52-04 52A20)",
MRnumber = "82a:68070",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
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",
MRclass = "68C15",
MRnumber = "82a:68062",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Lloyd:1980:LSB}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68E05",
MRnumber = "81i:68091b",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Lloyd:1980:LSB}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68C05 (68C25)",
MRnumber = "82c:68017",
MRreviewer = "O. D'Antona",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
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",
MRclass = "68C05 (10-04 10A35 10A40)",
MRnumber = "82g:68034a",
MRreviewer = "Yuri Breitbart",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C05 (10-04 10A35 10A40)",
MRnumber = "82g:68034b",
MRreviewer = "Yuri Breitbart",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0290M (Numerical integration and differentiation);
C4160 (Numerical integration and differentiation)",
corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA",
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",
MRclass = "68E10 (68C25)",
MRnumber = "81j:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Fachbereich Naturwissenschaften, Univ. Osnabruck,
Osnabruck, West Germany",
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",
MRclass = "68B15 (68C25)",
MRnumber = "82a:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "MITRE Corp., Bedford, MA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68H05 (68C25)",
MRnumber = "82a:68178",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B3120L (Magnetic bubble domain devices); C5320E
(Storage on stationary magnetic media)",
corpsource = "Wang Labs., Lowell, MA, USA",
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",
MRclass = "68H05",
MRnumber = "82a:68180",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
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",
MRclass = "68B10",
MRnumber = "81i:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "94C99 (68C25)",
MRnumber = "81i:94047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B1265B (Logic circuits); C5120 (Logic and switching
circuits)",
corpsource = "Dept. of Maths., Univ. of Illinois, Urbana, IL, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C25 (65F30)",
MRnumber = "82a:68069",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68B15 (03D15 68C25)",
MRnumber = "82m:68041",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "MIT, Cambridge, MA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C5220 (Computer architecture)",
corpsource = "Dept. de Electricidad y Electronica, Facultad de
Ciencias, Univ. Autonoma de Barcelona, Barcelona,
Spain",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6130 (Data handling
techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX,
USA",
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",
MRclass = "68C15",
MRnumber = "82d:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Northwestern Univ., Evanston, IL, USA",
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",
MRclass = "68C25 (68B15 90B05 90C10)",
MRnumber = "82b:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6150J (Operating systems)",
corpsource = "Dept. of Computer Sci., Australian Nat. Univ.,
Canberra, ACT, Australia",
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",
MRclass = "68C25 (52-04 52A10 90C25)",
MRnumber = "83e:68034b",
MRreviewer = "Selim G. Akl",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
note = "See \cite{vanEmdeBoas:1980:LBC}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "McGill Univ., Montreal, Que., Canada",
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",
MRclass = "68F05",
MRnumber = "82d:68047",
MRreviewer = "A. V. An\={\i}s\={\i}mov",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, Berkeley, CA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computing Sci., Univ. of Wollongong,
Wollongong, NSW, Australia",
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",
MRclass = "68C25 (90B10)",
MRnumber = "81k:68036",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
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",
MRclass = "68D05 (03D05 68F10)",
MRnumber = "82f:68055",
MRreviewer = "Michael Anshel",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computing Center, Latvian State Univ., Riga, Latvian
SSR, USSR",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Inst. f{\"u}r Informatik., Tech. Univ. Munchen,
Munchen, West Germany",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS)); C7100
(Business and administration)",
corpsource = "Dept. of Math., Univ. Instelling Antwerpen, Wilrijk,
Belgium",
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",
MRclass = "68C05 (52-04 52A45 60C05)",
MRnumber = "82i:68019",
MRreviewer = "R. Subramanian",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Pennsylvania State Univ.,
University Park, PA, USA",
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",
MRclass = "68C25",
MRnumber = "82d:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Math., Delft Univ. of Technol., Delft,
Netherlands",
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",
MRclass = "68C25",
MRnumber = "82a:68084",
MRreviewer = "Henry S. Warren, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown,
South Africa",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown,
South Africa",
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",
MRclass = "68B10",
MRnumber = "82m:68025",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "inst. f{\"u}r Informatik, Tech. Univ. Munchen,
Munchen, West Germany",
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",
MRclass = "68C25 (03G05 90C20 94C10)",
MRnumber = "82e:68044a",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
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",
MRclass = "68B10 (03B45 68B20)",
MRnumber = "82d:68009",
MRreviewer = "R{\"u}diger Valk",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Computation Center of Osaka Univ., Osaka, Japan",
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",
MRclass = "68H05",
MRnumber = "82g:68092",
MRreviewer = "H. P. Kriegel",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C7250L (Non-bibliographic
retrieval systems)",
corpsource = "Subdept. of Appl. Math., Technol. Univ. Twente,
Enschede, Netherlands",
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",
MRclass = "68B15",
MRnumber = "82e:68023",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Inst. f{\"u}r Informatik und Praktische Math.,
Christian-Albrechts-Univ.Kiel, Kiel, West Germany",
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",
MRclass = "10A25 (10-04)",
MRnumber = "82d:10015",
MRreviewer = "D. H. Lehmer",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68E10 (68C25)",
MRnumber = "82f:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "94B45",
MRnumber = "82j:94021",
MRreviewer = "Aldo De Luca",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E05",
MRnumber = "82a:68115",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
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",
MRclass = "90B35 (68B20 68C15)",
MRnumber = "82k:90064",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Computer Sci. Div., Univ. of California, Berkeley, CA,
USA",
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",
MRclass = "68F05",
MRnumber = "82a:68139",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "UER de Math., Univ. Paris VII, Paris, France",
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",
MRclass = "65F30",
MRnumber = "82i:65029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C15",
MRnumber = "82b:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1290
(Applications of systems theory)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
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",
MRclass = "94B99",
MRnumber = "82d:94046",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
note = "See also note \cite{Brouwer:1982:NMK}.",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes)",
corpsource = "Computer Sci. Dept., Purdue Univ., W. Lafayette, IN,
USA",
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",
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",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
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",
MRclass = "68E10 (05C40)",
MRnumber = "82a:68133",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics)",
corpsource = "Math. Dept., Dartmouth Coll., Hanover, NH, USA",
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",
MRclass = "05C70 (68C25 90C10)",
MRnumber = "83i:05059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Katholieke Univ. Leuven, Heverlee, Belgium",
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",
MRclass = "90B35 (68C25)",
MRnumber = "83k:90056",
MRreviewer = "M. M. Sys{\l}o",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1290 (Applications of systems theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160B (Distributed
databases)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
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",
MRclass = "68E05 (90B40)",
MRnumber = "82e:68063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "Unit of Appl. Math., Univ. of Athens, Athens, Greece",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6140D (High level
languages)",
corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, St.
Andrews, UK",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68E99 (10K10 28D15 54H20)",
MRnumber = "83d:68070",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Centre de Calcul de l'Esplanade, Strasbourg, France",
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",
MRclass = "68E05",
MRnumber = "82j:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Univ. of Toronto, Toronto, Ont., Canada",
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",
MRclass = "12-04 (68C25)",
MRnumber = "82g:12002",
MRreviewer = "Maurice Mignotte",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C30",
MRnumber = "83g:68072",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
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",
MRclass = "68B20",
MRnumber = "82d:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B1130 (General circuit analysis and synthesis
methods); B1265 (Digital electronics)",
corpsource = "Dept. of Appl. Math., Weizmann Inst., Rehovot,
Israel",
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",
MRclass = "05C70 (05C35)",
MRnumber = "82e:05109",
MRreviewer = "Charles H. C. Little",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "IBM Israel Sci. Center, Haifa, Israel",
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",
MRclass = "68E05",
MRnumber = "82d:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany",
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",
MRclass = "68E05",
MRnumber = "82d:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
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",
MRclass = "68C25 (03D05 68C40)",
MRnumber = "82d:68034",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Univ. of California, Berkeley, CA, USA",
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",
MRclass = "68C25 (03D15 68C40)",
MRnumber = "82d:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
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",
MRclass = "68C25 (03G05 90C20 94C10)",
MRnumber = "82e:68044b",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Petreschi:1980:SAS}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68D15 (68F10)",
MRnumber = "82i:68034",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "UER de Math. et d'Informatique, Univ. de Bordeaux I,
Talence, France",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory)",
corpsource = "Dept. of Computer Sci., Univ. of Rochester, Rochester,
NY, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5620 (Computer
networks and techniques)",
corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI,
USA",
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",
MRclass = "03D03 (03D40 68C25)",
MRnumber = "82h:03035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
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",
MRclass = "68C25 (03D15 68C30)",
MRnumber = "82f:68050",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Sektion Math., Friedrich-Schiller-Univ. Jena, Jena,
East Germany",
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",
MRclass = "68C25 (68C05)",
MRnumber = "83a:68060",
MRreviewer = "Henry S. Warren, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany",
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",
MRclass = "05C99 (05B40 52-04 52A45 68C25 68G10)",
MRnumber = "82e:05112",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "52-04 (52A99 68C25)",
MRnumber = "82j:52001",
MRreviewer = "Klaus Lommatzsch",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4290 (Other
computer theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
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",
MRclass = "68C25 (03D05 05A15)",
MRnumber = "82i:68026",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "921; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Istituto di Cibernetica, Univ. di Milano, Milano,
Italy",
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",
MRclass = "68C25 (03B35 03D15 68G15)",
MRnumber = "82f:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4220 (Automata
theory)",
corpsource = "Inst. f{\"u}r Angewandte Math., Univ. Heidelberg,
Heidelberg, West Germany",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "712; 723; B6210L (Computer communications); C5610
(Computer interfaces)",
corpsource = "Istituto per l'Elaborazione dell'Informazione, CNR,
Pisa, Italy",
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",
MRclass = "68C05 (51M20)",
MRnumber = "83d:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL,
USA",
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",
MRclass = "68B15 (05-04 05C05 68C25)",
MRnumber = "83a:68021",
MRreviewer = "Selim G. Akl",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. de Picardie, Amiens, France",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Angewandte Informatik und Formale
Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe,
West Germany",
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",
MRclass = "05A05 (68C05)",
MRnumber = "83e:05008",
MRreviewer = "E. Rodney Canfield",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "05A99 (20M05)",
MRnumber = "84i:05023",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "90C08 (05C35 05C45)",
MRnumber = "83a:90103",
MRreviewer = "Claude Benzaken",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C1290 (Applications of
systems theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
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",
MRclass = "68C25 (05C70 68C05 90C10)",
MRnumber = "83e:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Univ. of Wisconsin-Madison, Madison, WI, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Southern Illinois Univ.,
Carbondale, IL, USA",
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",
MRclass = "68C25 (15A63)",
MRnumber = "83d:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., New York Univ., New York, NY,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Dept. of Computational Sci., Univ. of St. Andrews,
UK",
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",
MRclass = "68C05 (15A54 90C20)",
MRnumber = "82m:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "03D03 (03D40 68C30)",
MRnumber = "83h:03054",
MRreviewer = "Michael Anshel",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; B0290H (Linear algebra); C4140 (Linear
algebra)",
corpsource = "Dept. of Computer Sci., Jilin Univ., Changchun,
China",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Inst. Podstaw Informatyki, PAN, Warszawa, Poland",
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",
MRclass = "68C05 (05A05)",
MRnumber = "83j:68035",
MRreviewer = "Eugene Levner",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. d'Informatique, Univ. de Haute-Normandie,
Mont-Saint-Aignan, France",
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",
MRclass = "03D35 (68H05)",
MRnumber = "84a:03047",
MRreviewer = "George Tourlakis",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C6160 (Database
management systems (DBMS))",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
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",
MRclass = "68C05 (05C20 68E10)",
MRnumber = "83e:68023",
MRreviewer = "M. C. Golumbic",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Univ. Osnabruck, Osnabruck, West Germany",
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",
MRclass = "68E10 (05C38 90B10 90C35)",
MRnumber = "83c:68084",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; 921",
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",
MRclass = "68E05 (68C25)",
MRnumber = "83c:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68E10 (05C05)",
MRnumber = "83d:68068",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4210 (Formal logic)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
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",
MRclass = "68E10 (05-04 05C70 68C25)",
MRnumber = "83c:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E05 (05C05 68C05)",
MRnumber = "83e:68080",
MRreviewer = "Eberhard L{\"u}dde",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "School of Business Administration, Temple Univ.,
Philadelphia, PA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
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",
MRclass = "68F05",
MRnumber = "83j:68090",
MRreviewer = "S. A. Greibach",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6140D (High level languages)",
corpsource = "Dept. of Computational Sci., Univ. of St.Andrews,
Fife, UK",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68D22",
MRnumber = "83a:68069",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq,
France",
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",
MRclass = "68C25 (65F30)",
MRnumber = "83h:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Biology of the South Seas, Sevastopol,
Ukrainian SSR, USSR",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
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",
MRclass = "68E05",
MRnumber = "83a:68077",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Electrical Engng., Johns Hopkins Univ.,
Baltimore, MD, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
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",
MRclass = "68E05",
MRnumber = "83a:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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)",
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",
MRclass = "68E05 (05C05 68B15)",
MRnumber = "83b:68074",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C25 (12-04 68C20)",
MRnumber = "83g:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Advanced Study, Princeton, NJ, USA",
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",
MRclass = "68F05 (03D03 03D05)",
MRnumber = "83d:68071",
MRreviewer = "Lutz Priese",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
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",
bibdate = "Mon Jan 22 17:13:14 1996",
}
@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",
MRclass = "68D35",
MRnumber = "83g:68084",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima,
Japan",
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",
MRclass = "68C25",
MRnumber = "83k:68036",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68F10 (03B25 03D05)",
MRnumber = "84j:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
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",
MRclass = "68D90",
MRnumber = "83g:68087",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Oh-Okayama, Meguroku, Tokyo, Japan",
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",
MRclass = "68D05 (03B25 03D05 68C30)",
MRnumber = "83h:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
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",
MRclass = "68E05 (68C05)",
MRnumber = "83h:68092",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Studies, Loughborough Univ. of
Technol., Loughborough, UK",
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",
MRclass = "90B10",
MRnumber = "83g:90053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68F05",
MRnumber = "83i:68105",
MRreviewer = "Matti Linna",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
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",
MRclass = "68E10 (05C38)",
MRnumber = "83f:68067",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1290
(Applications of systems theory)",
corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading,
UK",
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",
MRclass = "68B05 (05A05)",
MRnumber = "83f:68004",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Statistics, Carleton Univ., Ottawa,
Ont., Canada",
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",
MRclass = "68C25 (68B20)",
MRnumber = "83h:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Univ. of North Carolina, Chapel Hill, NC, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Math., Eindhoven Univ. of Technol.,
Eindhoven, Netherlands",
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",
MRclass = "68E10 (05C10 05C35)",
MRnumber = "83e:68090",
MRreviewer = "Peter Eades",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68F10",
MRnumber = "83b:68088",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68F10",
MRnumber = "83b:68089",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C25 (03D05 05C05 68E10)",
MRnumber = "83e:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "C4220 (Automata theory)",
corpsource = "Computing Center, Novosibirsk, USSR",
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",
MRclass = "05C45 (68C25 68E10)",
MRnumber = "83i:05054",
MRreviewer = "Narsingh Deo",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C25 (05C20 68E10)",
MRnumber = "84f:68031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "52-04 (68C25 90D26)",
MRnumber = "84a:52004",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
}
@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",
MRclass = "68F25 (03D05)",
MRnumber = "83b:68090",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E05 (68G10)",
MRnumber = "83c:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68F05",
MRnumber = "83e:68114",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68F25",
MRnumber = "83b:68092",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68F10",
MRnumber = "83b:68086",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
}
@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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C01 (68E05)",
MRnumber = "83c:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Fakultat f{\"u}r Informatik, Univ. Karlsruhe,
Karlsruhe, West Germany",
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",
MRclass = "12C05 (12-04 68C25)",
MRnumber = "83h:12028",
MRreviewer = "Thomas Beth",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Math., Hebrew Univ. of Jerusalem, Jerusalem,
Israel",
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",
MRclass = "68E10 (05C05)",
MRnumber = "83c:68080",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "94B99",
MRnumber = "83h:94019",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
note = "See \cite{Denning:1981:MKG}.",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Pure Math., Math. Centre, Amsterdam,
Netherlands",
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",
MRclass = "10-04 (10J05 68B10)",
MRnumber = "83d:10003",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "LRI Univ. de Paris-Sud, Orsay, France",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68E10 (05C05)",
MRnumber = "83c:68083",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E10",
MRnumber = "83c:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht,
Netherlands",
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",
MRclass = "68C25",
MRnumber = "83c:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E10 (05C05)",
MRnumber = "83c:68088",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Technion-Israel Inst. of
Technol., Haifa, Israel",
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",
MRclass = "03B35 (03B45)",
MRnumber = "83k:03019",
MRreviewer = "Steve Kuhn",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Univ. Toulouse Le Mirail, Toulouse, France",
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",
MRclass = "68C25 (03D15 68F05)",
MRnumber = "83h:68064",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "LOMI, Leningrad, USSR",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
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",
MRclass = "68B15",
MRnumber = "83h:68033",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1230 (Artificial intelligence); C6110 (Systems
analysis and programming)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
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",
MRclass = "68E05 (51-04)",
MRnumber = "83h:68093",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
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",
MRclass = "68B10",
MRnumber = "83g:68028",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
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",
MRclass = "68B20 (05C50 68C25)",
MRnumber = "83g:68038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
note = "See also erratum and addendum
\cite{Kucera:1983:EAP}.",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Charles Univ., Prague, Czechoslovakia",
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",
MRclass = "68F05",
MRnumber = "83g:68115",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68F25",
MRnumber = "83h:68140",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
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",
MRclass = "68C05 (18A23)",
MRnumber = "83g:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl f{\"u}r Informatik, Tech. Univ.
Braunschweig, Braunschweig, West Germany",
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",
MRclass = "68C25 (68E10)",
MRnumber = "83h:68058",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4140 (Linear
algebra)",
corpsource = "School of Information and Computer Sci., Georgia Inst.
of Technol., Atlanta, GA, USA",
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",
MRclass = "68B10 (03D20)",
MRnumber = "83f:68008",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept., of Computer Sci., Univ. of Melbourne,
Parkville, Melbourne, Vic., Australia",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4140 (Linear algebra)",
corpsource = "Dept. of Computer Studies, Loughborough Univ. of
Technol., Loughborough, UK",
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",
MRclass = "68E05",
MRnumber = "83g:68093",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informatik II, Univ. Karlsruhe,
Karlsruhe, West Germany",
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",
MRclass = "68E05 (52-04 68K05)",
MRnumber = "83f:68063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of
Graz, Graz, Austria",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Math. Sci. Dept., IBM TJ Watson Res. Center, Yorktown
Heights, NY, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Temple Univ., Philadelphia,
PA, USA",
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",
MRclass = "65F30 (68C05)",
MRnumber = "83h:65054",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Tsao:1981:NIB}.",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Univ. of Vaasa, Vaasa, Finland",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C7250L
(Non-bibliographic retrieval systems)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
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",
MRclass = "68D20 (03D05 03D15)",
MRnumber = "83h:68077",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Junior Coll. Div., Osaka Electro-Communication Univ.,
Neyagawa-shi, Japan",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "ETH, Zurich, Switzerland",
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",
MRclass = "94B45 (68E10)",
MRnumber = "84a:94019",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; B6120B (Codes)",
corpsource = "UER de Math. et Informatique, Univ. de Bordeaux I,
Talence, France",
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",
MRclass = "68H05",
MRnumber = "83h:68154",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "ONERA-CERT, Toulouse, France",
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",
MRclass = "68E05",
MRnumber = "83g:68091",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68B20",
MRnumber = "83g:68037",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C5600 (Data
communication equipment and techniques)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
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",
MRclass = "68C25 (68H05)",
MRnumber = "83h:68057",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6160D
(Relational databases)",
corpsource = "Univ. of Texas, Dallas, TX, USA",
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",
MRclass = "68G15 (03B35)",
MRnumber = "83i:68141",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Maryland, College
Park, MD, USA",
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",
MRclass = "68C25",
MRnumber = "83g:68058",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Aspvall:1979:LTA}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "94B45 (20M35 68E99)",
MRnumber = "84b:94025",
MRreviewer = "Jean-Eric Pin",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B6110 (Information theory); C1260 (Information
theory)",
corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli,
Italy",
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",
MRclass = "03B40 (68B10)",
MRnumber = "84b:03027",
MRreviewer = "M. Coppo",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "School of Computing Studies and Accountancy, Univ. of
East Anglia, Norwich, UK",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68F05",
MRnumber = "83k:68075",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Informatics, Nijmegen Univ., Nijmegen,
Netherlands",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6160B (Distributed databases)",
corpsource = "Computer Centre, Indian Inst. of Technol., Delhi, New
Delhi, India",
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",
MRclass = "65U05 (60K25)",
MRnumber = "84a:65111",
MRreviewer = "Lennart R\.ade",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C05",
MRnumber = "83m:68059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Modicon Div., Gould Inc., Andover, MA, USA",
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",
MRclass = "68C25 (05C20 05C70 68E10)",
MRnumber = "83m:68072",
MRreviewer = "T. R. S. Walsh",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C25 (05C20 68E10)",
MRnumber = "84m:68032",
MRreviewer = "P. Ramanan",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Israel Inst. of Technol., Haifa,
Israel",
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",
MRclass = "68E10 (05C35)",
MRnumber = "83m:68126",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., North Carolina State Univ.,
Raleigh, NC, USA",
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",
MRclass = "01A70",
MRnumber = "84h:01093",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
acknowledgement = ack-nhfb,
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",
MRclass = "94B45",
MRnumber = "83m:94021",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Mauceri:1981:FCC}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68E10 (05C70)",
MRnumber = "83m:68122",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. of Pisa,
Pisa, Italy",
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",
MRclass = "68D05 (03D05)",
MRnumber = "83m:68098",
MRreviewer = "Akira Nakamura",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
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",
MRclass = "05C30 (68E10 94C15)",
MRnumber = "84a:05038",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5620 (Computer
networks and techniques)",
corpsource = "Univ. de Paris-Sud, Orsay, France",
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",
MRclass = "68C25 (03D15 05C35)",
MRnumber = "84b:68049",
MRreviewer = "Bernard M. E. Moret",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6150J (Operating
systems)",
corpsource = "Dept. of Appl. Maths., Twente Univ. of Technol.,
Enschede, Netherlands",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading,
UK",
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",
MRclass = "68E10 (05C20 68C25)",
MRnumber = "83k:68066",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Computer Sci. Dept., Washington State Univ., Pullman,
WA, USA",
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",
MRclass = "68C05 (03D15)",
MRnumber = "84i:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
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",
MRclass = "68C30",
MRnumber = "84a:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Maths., Emory Univ., Atlanta, GA, USA",
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",
MRclass = "68E10 (05C05)",
MRnumber = "83k:68059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
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",
MRclass = "68E05 (68C05)",
MRnumber = "83k:68055",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Bell Labs., Whippany, NJ, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Statistics and Computer Sci., Univ. of
Illinois, Chicago, IL, USA",
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",
MRclass = "68E05 (05C05 68H05)",
MRnumber = "83k:68053",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68B10 (06A10)",
MRnumber = "83m:68019",
MRreviewer = "Henner Kr{\"o}ger",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Centre de Recherche en Informatique de Nancy, Nancy,
France",
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",
MRclass = "68C05",
MRnumber = "83j:68039",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., Univ. of Western Ontario,
London, Ont., Canada",
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",
MRclass = "68F05",
MRnumber = "83m:68139",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Washington State Univ.,
Pullman, WA, USA",
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",
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",
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",
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",
MRclass = "68F05",
MRnumber = "83k:68074",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C6140 (Programming
languages)",
corpsource = "Inst. of Computer Sci., Polish Acad. of Sci.,
Warszawa, Poland",
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",
MRclass = "03B50 (03D15 68C20)",
MRnumber = "84c:03049",
MRreviewer = "V. B. Alekseev",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt/Main, West
Germany",
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",
MRclass = "68C25 (03D05 03D15)",
MRnumber = "84d:68035",
MRreviewer = "Gh. Grigora{\cedla{s}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Facultat d'Informatica, Univ. Politecnica de
Barcelona, Barcelona, Spain",
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",
MRclass = "65F30",
MRnumber = "83k:65031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68B15",
MRnumber = "83m:68046",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Systems Engng. and Computing Sci., Carleton
Univ., Ottawa, Ont., Canada",
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",
MRclass = "68F05",
MRnumber = "83k:68076",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Informatics, Faculty of Sci., Nijmegen Univ.,
Nigmegen, Netherlands",
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",
MRclass = "68C05 (68D05 68F05)",
MRnumber = "83m:68062",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160B (Distributed databases)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
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",
MRclass = "68B20",
MRnumber = "83k:68016",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Zaklad Matematyki Wyzsza Szkola Pedagogiczna,
Czestochowa, Poland",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Computer Sci., Univ. of Ottawa, Ottawa, Ont.,
Canada",
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",
MRclass = "68E05",
MRnumber = "83k:68054",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Math. Sci. Program, Univ. of Texas, Dallas, TX, USA",
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",
MRclass = "68E10 (05C10 68C25)",
MRnumber = "83k:68060",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E05",
MRnumber = "83k:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Burroughs Corp., Nuenen, Netherlands",
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",
MRclass = "68E10 (05C40)",
MRnumber = "83k:68056",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Angewandte Math. und Informatik, Univ. des Saarlandes,
Saarbrucken, West Germany",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "School of Computer and Information Sci., Syracuse
Univ., Syracuse, NY, USA",
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",
MRclass = "68B10 (03B45)",
MRnumber = "84f:68008",
MRreviewer = "Stephen L. Bloom",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
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",
MRclass = "68Q50 (03B35 18C10)",
MRnumber = "85a:68102",
MRreviewer = "Bernard M. E. Moret",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; 723; C4210 (Formal logic)",
corpsource = "Software Systems Res. Center, Linkoping Univ.,
Linkoping, Sweden",
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",
MRclass = "68D05",
MRnumber = "83k:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Univ. of Gdansk, Gdynia, Poland",
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",
MRclass = "68C40",
MRnumber = "83k:68043",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
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",
MRclass = "68E05",
MRnumber = "83m:68111",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Faculty of Engng., Chiba Univ., Chiba, Japan",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6160B (Distributed databases)",
corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico
di Milano, Milano, Italy",
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",
MRclass = "68E10 (05C70)",
MRnumber = "84a:68057",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
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",
MRclass = "68C05 (68B15)",
MRnumber = "83k:68021",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "School of Math. Sci., Tel Aviv Univ., Tel Aviv,
Israel",
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",
MRclass = "68E10 (05C05 05C30)",
MRnumber = "84a:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Math. Dept., Univ. of Alabama, Huntsville, AL, USA",
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",
MRclass = "68E05",
MRnumber = "83m:68112",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Inst. for Appl. Math., Univ. of Turku, Turku,
Finland",
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",
MRclass = "52-04 (68C05)",
MRnumber = "84b:52002",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory)",
corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
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",
MRclass = "68D20",
MRnumber = "84e:68055",
MRreviewer = "I. Mezn{\'\i}k",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Math., Tech. Univ. of Gdansk, Gdansk,
Poland",
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",
MRclass = "68E05",
MRnumber = "84b:68082",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68B15",
MRnumber = "84b:68015",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68E05 (05A05 68C25)",
MRnumber = "84c:68049",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Information Sci., Ibaraki Univ., Hitachi,
Japan",
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",
MRclass = "68C25 (68E10)",
MRnumber = "83m:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Aiken Computation Lab., Harvard Univ., Cambridge, MA,
USA",
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",
MRclass = "68F05",
MRnumber = "83m:68143",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Wang Labs., Lowell, MA, USA",
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",
MRclass = "68B15",
MRnumber = "83m:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68D20 (68G10)",
MRnumber = "84a:68047",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4220 (Automata theory)",
corpsource = "Math. Sci., State Univ. of New York, Binghamton, NY,
USA",
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",
MRclass = "68E10 (05C20 05C35 68C25)",
MRnumber = "83m:68120",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68B20",
MRnumber = "84e:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6150J (Operating systems)",
corpsource = "Fachbereich Informatik, Johann Wolfgang Goethe-Univ.,
Frankfurt am Main, West Germany",
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",
MRclass = "68C15",
MRnumber = "84e:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C4290 (Other computer theory); C6150J
(Operating systems)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. di Pisa,
Pisa, Italy",
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",
MRclass = "68Q45",
MRnumber = "85d:68043",
MRreviewer = "I. Hal Sudborough",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68E10 (05C38)",
MRnumber = "84e:68073",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4290 (Other
computer theory)",
corpsource = "Dept. of Electrical Engng., Johns Hopkins Univ.,
Baltimore, MD, USA",
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",
MRclass = "68H05 (68B15)",
MRnumber = "84c:68086",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6120
(File organisation)",
corpsource = "Inst. for Math., Univ. of Jyvaskyla, Jyvaskyla,
Finland",
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",
MRclass = "68E10 (05C35)",
MRnumber = "84c:68052",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Stanford Univ., Stanford, CA,
USA",
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",
MRclass = "68F05",
MRnumber = "84f:68059",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. de Lille 1, Villeneuve d'Ascq, France",
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",
MRclass = "68C01",
MRnumber = "84c:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Univ. de Bordeaux I, Talence, France",
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",
MRclass = "52-04 (68C25)",
MRnumber = "84e:52002",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl Informatik VI, Univ. Dortmund, Dortmund,
West Germany",
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",
MRclass = "68C25 (94C10)",
MRnumber = "84c:68035",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Informatik, Johann Wolfgang Goethe-Univ.,
Frankfurt am Main, West Germany",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; 922; B0240C (Queueing theory); C1140C
(Queueing theory)",
corpsource = "Aeronautical Res. Labs., Melbourne, Vic., Australia",
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",
MRclass = "68F05",
MRnumber = "84g:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Math., Univ. of Gdansk, Gdansk, Poland",
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",
MRclass = "68Q15 (03D15)",
MRnumber = "85d:68029",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "52A15",
MRnumber = "84m:52004",
MRreviewer = "B. Sahoo",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "05C40",
MRnumber = "84e:05069",
MRreviewer = "R. E. Pippert",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
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",
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",
MRclass = "68C05",
MRnumber = "84g:68022",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Western Ontario,
London, Ont., Canada",
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",
MRclass = "68E10 (05C20)",
MRnumber = "84e:68071",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math. and Phys., Kyoto Univ., Kyoto,
Japan",
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",
MRclass = "68B20",
MRnumber = "84d:68031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68B10 (03F99)",
MRnumber = "84e:68009",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
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",
MRclass = "68R10",
MRnumber = "85a:68151",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C1230 (Artificial
intelligence)",
corpsource = "Dept. of Computer Sci., Southern Illinois Univ.,
Carbondale, IL, USA",
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",
MRclass = "52-04 (52A10)",
MRnumber = "84g:52001",
MRreviewer = "V. Medek",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
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",
MRclass = "68F10 (68C25)",
MRnumber = "84e:68098",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
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",
MRclass = "68E05",
MRnumber = "84e:68064",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Lab. of Information Processing Sci., Helsinki Univ. of
Technol., Espoo, Finland",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C5220 (Computer architecture)",
corpsource = "Electrotech. Lab., Ibaraki, Japan",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C25 (03D05 03D15)",
MRnumber = "84g:68031",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Cybernetics, Acad. of Sci., Kiev, Ukrainian
SSR, USSR",
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",
MRclass = "68F05 (03B10)",
MRnumber = "84e:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic); C6160D (Relational
databases)",
corpsource = "Pontificia Univ. Catolica do Rio de Janeiro, Rio de
Janeiro, Brazil",
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",
MRclass = "68F05",
MRnumber = "84i:68124",
MRreviewer = "S. A. Greibach",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "LITP Univ. de Paris 7, Paris, France",
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",
MRclass = "68P10",
MRnumber = "85a:68024",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68C15 (68C25 90B35)",
MRnumber = "84m:68030",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68N25",
MRnumber = "85a:68020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C6150J (Operating systems)",
corpsource = "Dept. of Computer Sci., Univ. of Pittsburgh,
Pittsburgh, PA, USA",
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",
MRclass = "68Q45",
MRnumber = "85a:68088",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "Lab. d'Informatique, Univ. de Haute Normandie,
Mont-Saint-Aignan, France",
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",
MRclass = "68R10 (05C35 90B10)",
MRnumber = "85b:68044",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68B15",
MRnumber = "84m:68015",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6130 (Data handling
techniques)",
corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan",
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",
MRclass = "65C10",
MRnumber = "85a:65011",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C7890 (Other special applications of computing)",
corpsource = "Faculty of Engng., Univ. of Tokyo, Tokyo, Japan",
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",
MRclass = "68U05 (52-04 90B05)",
MRnumber = "85m:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68D05 (68F10)",
MRnumber = "84m:68045",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic); C4220 (Automata theory);
C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland",
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",
MRclass = "68Q50",
MRnumber = "85a:68098",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "721; C4210 (Formal logic)",
corpsource = "Univ. di Padova, Padova, Italy",
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",
MRclass = "03D15 (68Q25)",
MRnumber = "85a:03054",
MRreviewer = "Gh. Grigora{\c{s}}",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Informatik, Univ. Stuttgart, Stuttgart,
West Germany",
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",
MRclass = "68C25 (03B05 03B35 03D15)",
MRnumber = "84d:68038b",
MRreviewer = "Gh. Grigora{\cedla{s}}",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
note = "See \cite{Goldberg:1982:ATA}.",
acknowledgement = ack-nhfb,
}
@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",
MRclass = "68B05 (68C05)",
MRnumber = "84m:68005",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; B6210L (Computer communications); C5620
(Computer networks and techniques); C6150J (Operating
systems)",
corpsource = "Burroughs, AL Nuenen, Netherlands",
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",
MRclass = "68B05",
MRnumber = "84m:68006",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6150G (Diagnostic, testing, debugging and
evaluating systems)",
corpsource = "Dept. of Complex Control Systems, Polish Acad. of
Sci., Gliwice, Poland",
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",
MRclass = "68F05 (20M05)",
MRnumber = "84m:68061",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli,
Italy",
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",
MRclass = "68C25 (62H30 68G10)",
MRnumber = "84j:68025",
MRreviewer = "Vijay V. Raghavan",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C7240 (Information analysis and indexing); C7250C
(Bibliographic retrieval systems)",
corpsource = "Information Sci. Center, Osaka Electro-Communication
Univ., Osaka, Japan",
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",
MRclass = "65F50 (65V05)",
MRnumber = "84m:65057",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Computer Sci. Program, Brandeis Univ., Waltham, MA,
USA",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6160 (Database management systems (DBMS))",
corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle,
WA, USA",
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",
MRclass = "68P10",
MRnumber = "85a:68026",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C7250 (Information
storage and retrieval)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
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",
MRclass = "68B15",
MRnumber = "84m:68013",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C7250 (Information
storage and retrieval)",
corpsource = "Lehrstuhl Informatik VI, Univ. Dortmund, Dortmund,
West Germany",
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",
MRclass = "68F05",
MRnumber = "84m:68065",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Math. Logik und Formale Spachen, Tech.
Univ. Wien, Wien, Austria",
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",
MRclass = "11Y55 (11B39 68Q25)",
MRnumber = "85b:11124",
MRreviewer = "Samuel S. Wagstaff, Jr.",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1110 (Algebra); C1160 (Combinatorial
mathematics)",
corpsource = "Dept. of Computing Sci., Univ. of Wollongong,
Wollongong, NSW, Australia",
journalabr = "Inf Process Lett",
keywords = "computer programming; Fibronacci 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",
MRclass = "94A60 (68P20)",
MRnumber = "85e:94020",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics); C1260
(Information theory)",
corpsource = "Istituto di Informatica e Sistemistica, Univ. of
Florence, Florence, Italy",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1140Z (Other topics in statistics); C1160
(Combinatorial mathematics); C1260 (Information
theory)",
corpsource = "IBM Corp., Houston, TX, USA",
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",
MRclass = "68Q60 (03B45 03B70)",
MRnumber = "85e:68063",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
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",
MRclass = "68F20 (68B10)",
MRnumber = "84m:68078",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C4210 (Formal logic)",
corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen,
Munchen, West Germany",
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",
MRclass = "68E10 (68C25)",
MRnumber = "84m:68056",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68B05",
MRnumber = "84m:68007",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C5620 (Computer networks and techniques);
C6150J (Operating systems)",
corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi,
India",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
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",
MRclass = "05C70 (68Q25)",
MRnumber = "85k:05083",
MRreviewer = "P. E. O'Neil",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Dept. of Math., Univ. of IASI, IASI, Romania",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation); C6150J (Operating
systems)",
corpsource = "Regional Computer Center, Tech. Univ. of Poznan,
Poznan, Poland",
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",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68P10",
MRnumber = "85f:68013",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; 921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Dept. of Computer Sci., Univ. of California, Santa
Barbara, CA, USA",
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",
MRclass = "68Q25 (15A15)",
MRnumber = "85g:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4140 (Linear algebra)",
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",
MRclass = "68Q25 (05C20 68R10)",
MRnumber = "85a:68081",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "723; C1160 (Combinatorial mathematics)",
corpsource = "Computer Sci. Dept., Univ. of California, Berkeley,
CA, USA",
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",
MRclass = "94A60",
MRnumber = "85e:94019",
MRreviewer = "Tai Yang Hwang",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database",
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",
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",
MRclass = "68P10",
MRnumber = "85a:68027",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibso